Masking the overhead of protocol layering

ABSTRACT

Protocol layering has been advocated as a way of dealing with the complexity of computer communication. It has also been criticized for its performance overhead. In this paper, we present some insights in the design of protocols, and how these insights can be used to mask the overhead of layering, in a way similar to client caching in a file system. With our techniques, we achieve an order of magnitude improvement in end-to-end message latency in the Horus communication framework. Over an ATM network, we are able to do a round-trip message exchange, of varying levels of semantics, in about 170 µseconds, using a protocol stack of four layers that were written in ML, a high-level functional language.

REFERENCES

• 1: T. von Eicken , A. Basu , V. Buch , W. Vogels, U-Net: a user-level network interface for parallel and distributed computing (includes URL), Proceedings of the fifteenth ACM symposium on Operating systems principles, p.40-53, December 03-06, 1995, Copper Mountain, Colorado, United States
• 2: Edoardo Biagioni, A structured TCP in standard ML., Proceedings of the conference on Communications architectures, protocols and applications, p.36-45, August 31-September 02, 1994, London, United Kingdom
• 3: D. D. Clark , D. L. Tennenhouse, Architectural considerations for a new generation of protocols, Proceedings of the ACM symposium on Communications architectures & protocols, p.200-208, September 26-28, 1990, Philadelphia, Pennsylvania, United States
• 4: D. R. Engler , M. F. Kaashoek , J. O'Toole, Jr., Exokernel: an operating system architecture for application-level resource management, Proceedings of the fifteenth ACM symposium on Operating systems principles, p.251-266, December 03-06, 1995, Copper Mountain, Colorado, United States
• 5: Roy Friedman , Robbert van Renesse, Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols, Cornell University, Ithaca, NY, 1995
• 6: Van Jacobson. Compressing TCP/IP headers for lowspeed serial links. RFC 1144, Network Working Group, February 1990.
• 7: Jonathan Simon Kay, Path IDS: a mechanism for reducing network software latency, University of California at San Diego, La Jolla, CA, 1995
• 8: Xavier Leroy. The Carol Special Light system release 1.10. INRIA, France, November 1995.
• 9: Robin Milner , Mads Tofte , Robert Harper, The definition of Standard ML, MIT Press, Cambridge, MA, 1990
• 10: J. Mogul , R. Rashid , M. Accetta, The packer filter: an efficient mechanism for user-level network code, Proceedings of the eleventh ACM Symposium on Operating systems principles, p.39-51, November 08-11, 1987, Austin, Texas, United States
• 11: Scott Nettles , James O'Toole, Real-time replication garbage collection, ACM SIGPLAN Notices, v.28 n.6, p.217-226, June 1993
• 12: Robbert van Renesse , Kenneth P. Birman , Roy Friedman , Mark Hayden , David A. Karr, A framework for protocol composition in Horus, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, p.80-89, August 20-23, 1995, Ottowa, Ontario, Canada [doi>10.1145/224964.224974]
• 13: Robbert van Renesse , Kenneth P. Birman , Silvano Maffeis, Horus: a flexible group communication system, Communications of the ACM, v.39 n.4, p.76-83, April 1996 [doi>10.1145/227210.227229]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Asynchronous Transfer Mode (ATM)

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Network communications

General Terms:
Algorithms, Design, Languages, Performance