.png){kind=icon}
.png){kind=icon}
Return
Trading packet headers for packet processing
.png){kind=icon}
PRE
AI
DOI：10.1109/90.490742.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 identifier (flow ID); the pow ID allows packet processing information to be cached and source hashing allows efficient cache lookups. Unlike virtual circuit identifiers (VCI's), 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 seven, 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 (DML), which compiles out all the information needed for integrated layer processing (ILP) and scheduling into an easily accessible portion of each packet.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.6
Papers:
4.4K
Citations:
9.5K
Organization
No organization information available