End-To-End Arguments In System Design (1984)
Cached
Download Links
- [www.cc.gatech.edu]
- [www.cs.wisc.edu]
- [www.cs.princeton.edu]
- [www.caip.rutgers.edu]
- [www.cse.nd.edu]
- [www.cs.cmu.edu]
- [www.cs.binghamton.edu]
- [www.soe.ucsc.edu]
- [www.eecs.berkeley.edu]
- [www.cs.princeton.edu:80]
- [www.cs.wisc.edu]
- [www.nd.edu]
- [www.cs.berkeley.edu]
- [www.cct.lsu.edu]
- [www.cs.wisc.edu]
- [people.cs.vt.edu]
- [www.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 741 - 9 self |
BibTeX
@MISC{Saltzer84end-to-endarguments,
author = {Jerome H. Saltzer and David P. Reed and David D. Clark},
title = {End-To-End Arguments In System Design},
year = {1984}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the end-to-end argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost of providing them at that low level. Examples discussed in the paper include bit error recovery, security using encryption, duplicate message suppression, recovery from system crashes, and delivery acknowledgement. Low level mechanisms to support these functions are justified only as performance enhancements. Introduction
Citations
No citations identified.
