Trading packet headers for packet processing

被引:22
作者
Chandranmenon, GP
Varghese, G
机构
[1] Department of Computer Science, Washington University, St. Louis
基金
美国国家科学基金会;
关键词
Manuscript revised February 21; 1996; approved by IEEE/ACM TRANSACTIOONNS N ETWORKrNCEditor J. Crowcroft. This work was supported by the National Science Foundation under grant NCR-940997. The authors are with the Department of Computer Science; Washington University; St; Louis; MO 63130 USA. Publisher Item Identifier S 1063-6692(96)02721-5;
D O I
10.1109/90.490742
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:141 / 152
页数:12
相关论文
共 11 条
[1]  
CHANDRANMENON GP, 1995, P ACM SIGCOMM 95 S O, P162
[2]   AN ANALYSIS OF TCP PROCESSING OVERHEAD [J].
CLARK, DD ;
JACOBSON, V ;
ROMKEY, J ;
SALWEN, H .
IEEE COMMUNICATIONS MAGAZINE, 1989, 27 (06) :23-29
[3]  
CLARK DD, 1990, SEP SIGCOMM S COMM A, P200
[4]  
Feldmeier D. C., 1993, Computer Communication Review, V23, P170, DOI 10.1145/167954.166254
[5]  
Francis P., 1993, IEEE Network, V7, P30, DOI 10.1109/65.224021
[6]   A COMPARISON OF HASHING SCHEMES FOR ADDRESS LOOKUP IN COMPUTER-NETWORKS [J].
JAIN, R .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1992, 40 (10) :1570-1573
[7]  
McCanne S., 1993, USENIX Association. Proceedings of the Winter 1993 USENIX Conference, P259
[8]  
Sterbenz J. P. G., 1990, Proceedings IEEE INFOCOM '90. The Conference on Computer Communications. Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration (Cat. No.90CH2826-5), P415, DOI 10.1109/INFCOM.1990.91277
[9]  
[No title captured]
[10]  
[No title captured]