References for Classics of Data Networks

References for Classics of Data Networks

Data Link

  1. Ethernet [Metcalfe and Boggs, 1976]
  2. Rings [Saltzer et al., 1983]
  3. Datakit [Fraser, 1983] and cell switching retrospective [Fraser, 1993]

Routing

  1. Fault-tolerant broadcast of routing information [Perlman, 1983]
  2. ARPANET routing protocol [McQuillan et al., 1980][McQuillan et al., 1978]
  3. Avoiding deadlock in store-and-forward network [Merlin and Schweitzer, 1980] ? (Dally and Seitz)

Congestion Control

  1. The DECbit paper [Ramakrishnan and Jain, 1990] Congestion avoidance and control [Jacobson, 1988]
  2. Fair queueing [Demers et al., 1989]

Transport

  1. Problems with TCP [Sunshine and Dalal, 1978]
  2. Timers in transport protocols [Watson, 1981] (simpler version in [Birrell and Nelson, 1984])

Principles

  1. End-to-end argument [Saltzer et al., 1984].
  2. Big-endian vs. little-endian [Cohen, 1981]
  3. Coordinated attack problem (Yemini)
  4. Buddhist dating protocol (Danny Cohen)
  5. Ordering of events in a distributed system [Lamport, 1978]

Security

  1. Public key cryptography [Diffie and Hellman, 1976]
  2. Authentication protocols [Needham and Schroeder, 1978]

Models of Distributed Computation

  1. Remote procedure call [Birrell and Nelson, 1984]
  2. Distributed shared memory [Zhou et al., 1992]
  3. CACM Article on ISIS (should this be in programming environments instead?)

Performance

  1. Upcalls [Clark, 1985]
  2. Modularity and efficiency of protocol implementation [Clark, 1982]
  3. Application level framing and integrated layer processing [Clark and Tennenhouse, 1990]
  4. Design of Adaptor [Druschel et al., 1994]

Programming Environments

  1. X-kernel [Hutchinson and Peterson, 1991]
  2. PVM?

Performance Modelling (Mavericks)

  1. Self-similar nature of Ethernet traffic [Leland et al., 1993]
  2. Measured capcity of an Ethernet (Boggs and Mogul) SIGCOMM several years ago
  3. Queueing theory analysis of ethernets and rings [Bux, 1987]

References

Birrell and Nelson, 1984
Birrell, A. D. and Nelson, B. J. (1984). Implementing remote procedure calls. ACM Transactions on Computer Systems, 2(1):39-59.

Bux, 1987
Bux, W. (1987). Local-area subnetworks, a performance comparison. In Kummerle, K., Tobagi, F., and Limb, J. O., editors, Advances in Local Area Networks. IEEE Press, New York.

Clark, 1982
Clark, D. D. (1982). Modularity and efficiency in protocol implementation; RFC-817. Internet request for comments, 817.

Clark, 1985
Clark, D. D. (1985). Structuring of systems using upcalls. In Proceedings of the 10th ACM SOSP, pages 171-180.

Clark and Tennenhouse, 1990
Clark, D. D. and Tennenhouse, D. L. (1990). Architectural considerations for a new generation of protocols. In SIGCOMM '90, pages 200-208, Philadelphia. ACM.

Cohen, 1981
Cohen, D. (1981). On holy wars and a plea for peace. IEEE Computer Magazine, 14:48-54.

Demers et al., 1989
Demers, A., Keshav, S., and Shenker, S. (1989). Analysis and simulation of a fair queueing algorithm. Proceedings of the SIGOCMM '89 Symposium on Communications Architectures and Protocols, 19(4):1-12. part of ACM SIGCOMM Computer Communication Review.

Diffie and Hellman, 1976
Diffie, W. and Hellman, M. E. (1976). New directions in cryptography. IEEE Trans. on Information Theory, IT-22:644-654.

Druschel et al., 1994
Druschel, P., Peterson, L. L., and Davie, B. S. (1994). Adaptor: A software perspective. In SIGCOMM '94, London. ACM.

Fraser, 1983
Fraser, A. G. (1983). Towards a universal data transport system. IEEE Journal on Selected Areas in Communications, SAC-1(5):803-816.

Fraser, 1993
Fraser, A. G. (1993). Early experiments with asynchronous time division networks. IEEE Network Magazine, 7(1):12-27.

Hutchinson and Peterson, 1991
Hutchinson, N. C. and Peterson, L. L. (1991). The X-kernel: An architecture for implementing network protocols. IEEE Transactions on Software Engineering, 17(1):64-76.

Jacobson, 1988
Jacobson, V. (1988). Congestion avoidance and control. Proceedings of the ACM Sigcomm '88 Symposium on Communications Architectures and Protocols, 18(4):314-329. part of ACM SIGCOMM Computer Communication Review.

Lamport, 1978
Lamport, L. (1978). Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565.

Leland et al., 1993
Leland, W. E., Taqqu, M. S., Willinger, W., and Wilson, D. V. (1993). On the self-similar nature of ethernet traffic. In SIGCOMM '93, pages 183-193, San Francisco. ACM.

McQuillan et al., 1978
McQuillan, J. M., Falk, G., and Richer, I. (1978). A review of the development and performance of the ARPANET routing algorithm. IEEE Transactions on Communications, COM-26(12):1802-1811.

McQuillan et al., 1980
McQuillan, J. M., Richer, I., and Rosen, E. C. (1980). The new routing algorithm for the ARPANET. IEEE Transactions on Communications, COM-28(5):711-719.

Merlin and Schweitzer, 1980
Merlin, P. M. and Schweitzer, P. J. (1980). Deadlock avoidance - store-and-forward deadlock. IEEE Transactions on Communications, COM-28:345-354.

Metcalfe and Boggs, 1976
Metcalfe, R. M. and Boggs, D. R. (1976). Ethernet: Distributed packet switching for local computer networks. Communications of the ACM, 19(7):395-404.

Needham and Schroeder, 1978
Needham, R. M. and Schroeder, M. D. (1978). Using encryption for authentication in large networks of computers. Communications of the ACM, 21:993-999.

Perlman, 1983
Perlman, R. (1983). Fault-tolerant broadcast of routing information. Computer Networks, 7:395-405.

Ramakrishnan and Jain, 1990
Ramakrishnan, K. K. and Jain, R. (1990). A binary feedback scheme for congestion avoidance in computer networks. ACM Transactions on Computer Systems, 8(2).

Saltzer et al., 1983
Saltzer, J. H., Pogran, K. T., and Clark, D. D. (1983). Why a ring? Computer Networks, 7:223-230.

Saltzer et al., 1984
Saltzer, J. H., Reed, D. P., and Clark, D. D. (1984). End-to-end arguments in system design. ACM Transactions on Computer Systems, 2(4).

Sunshine and Dalal, 1978
Sunshine, C. A. and Dalal, Y. K. (1978). Connection management in transport protocols. Computer Networks, 2:454-473.

Watson, 1981
Watson, R. W. (1981). Timer-based mechanisms in reliable transport protocol connection management. Computer Networks, 5:47-56.

Zhou et al., 1992
Zhou, S., Stumm, M., Li, K., and Wortman, D. (1992). Heterogeneous distributed shared memory. IEEE Transactions on Parallel and Distributed Systems, 3(5):540-554.

About this document ...

References for Classics of Data Networks

This document was generated using the LaTeX2HTML translator Version 0.6.4 (Tues Aug 30 1994) Copyright © 1993, 1994, Nikos Drakos, Computer Based Learning Unit, University of Leeds.

The command line arguments were:
latex2html -split 0 -address jaf@arl.wustl.edu cs675.tex.

The translation was initiated by Andy Fingerhut on Sat Oct 15 11:00:52 CDT 1994


andy_fingerhut at-the-machine alum SPOT wustl SPOT edu