| Trading packet headers for packet processing |
| Full text |
Pdf
(1.21 MB)
|
| Source
|
Applications, Technologies, Architectures, and Protocols for Computer Communication
archive
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
table of contents
Cambridge, Massachusetts, United States
Pages: 162 - 173
Year of Publication: 1995
ISBN:0-89791-711-1
Also published in ...
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 18, Citation Count: 2
|
|
|
ABSTRACT
In high speed networks, packet processing is relatively expensive while bandwidth is cheap. Thus it pays to add information to packet headers to make packet processing easier. While this is an old idea, we describe several specific new mechanisms based on this principle. We describe a new technique, source hashing, which can provide O(1) lookup costs at the Data Link, Routing, and Transport layers. Source hashing is especially powerful when combined with the old idea of a flow ID; the flow identifier allows packet processing information to be cached, and source hashing allows efficient cache lookups. Unlike Virtual Circuit Identifiers (VCIs), source hashing does not require a round trip delay for set up. In an experiment with the BSD Packet Filter implementation, we found that adding a flow ID and a source hash improved packet processing costs by a factor of 7. We also found a 45% improvement when we conducted a similar experiment with IP packet forwarding. We also describe two other new techniques: threaded indices, which allows fast VCI-like lookups for datagram protocols like IP; and a Data Manipulation Layer, which compiles out all the information needed for Integrated Layer Processing into an easily accessible portion of each packet.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
AP93
|
|
 |
BN84
|
|
| |
BP93
|
D. Banks and M. Prudence. A highperformance network architecture for a PA- RISC workstation. IEEE Journal on Selected Areas in Communications, February 1993.
|
| |
CJRS89
|
D.D. Clark, V. Jacobson, J. Romkey, and H. Salwen. An analysis of TOP processing overhead. IEEE Commun,cations, 27(6):23-29, June 1989.
|
| |
CLR90
|
|
 |
CT90
|
|
 |
Fel93
|
|
| |
Hin94
|
R. Hinden. Editor, Internet Protocol, version 6 (IPv6) specification. Draft, October 1994.
|
| |
Jai92
|
Raj Jain. A comparison of hashing schemes for address lookups in computer networks. IEEE Transactions on Communications, COM- 40(10):1570-1573, October 1992.
|
 |
KLS86
|
|
| |
MJ93
|
S. McCanne and V. Jacobson. The BSD Packet Filter: A New Architecture for Userlevel Packet Capture. In USENIX Technzcal Conference Procee&ngs, pages 259-269, Winter 1993.
|
| |
Par93
|
|
| |
Per92
|
|
| |
SP90
|
J.P.G. Sterbernz and G. M. Parulkar. Axon: A high speed communication architecture for distributed applications. In Proceedings of IEEE INFOCOMM '90, San F~ansisco, CA, pages 415-425, June 1990.
|
 |
SRC84
|
|
| |
Tan81
|
|
 |
vECGS92
|
Thorsten von Eicken , David E. Culler , Seth Copen Goldstein , Klaus Erik Schauser, Active messages: a mechanism for integrated communication and computation, Proceedings of the 19th annual international symposium on Computer architecture, p.256-266, May 19-21, 1992, Queensland, Australia
|
|