ACM Home Page
Please provide us with feedback. Feedback
DPF: fast, flexible message demultiplexing using dynamic code generation
Full text PdfPdf (97 KB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications table of contents
Palo Alto, California, United States
Pages: 53 - 59  
Year of Publication: 1996
ISBN:0-89791-790-1
Also published in ...
Authors
Dawson R. Engler  M.I.T. Laboratory for Computer Science, Cambridge, MA
M. Frans Kaashoek  M.I.T. Laboratory for Computer Science, Cambridge, MA
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 36,   Citation Count: 44
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/248156.248162
What is a DOI?

ABSTRACT

Fast and flexible message demultiplexing are well-established goals in the networking community [1, 18, 22]. Currently, however, network architects have had to sacrifice one for the other. We present a new packet-filter system, DPF (Dynamic Packet Filters), that provides both the traditional flexibility of packet filters [18] and the speed of hand-crafted demultiplexing routines [3]. DPF filters run 10-50 times faster than the fastest packet filters reported in the literature [1, 17, 18, 27]. DPF's performance is either equivalent to or, when it can exploit runtime information, superior to hand-coded demultiplexors. DPF achieves high performance by using a carefully-designed declarative packet-filter language that is aggressively optimized using dynamic code generation. The contributions of this work are: (1) a detailed description of the DPF design, (2) discussion of the use of dynamic code generation and quantitative results on its performance impact, (3) quantitative results on how DPF is used in the Aegis kernel to export network devices safely and securely to user space so that UDP and TCP can be implemented efficiently as user-level libraries, and (4) the unrestricted release of DPF into the public domain.


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.

 
1
M. L. Bailey, B. Gopal, M. A. Pagels, L. L. Peterson, and P. Sarkar. PATHFINDER: A pattern-based packet classifier. In Proceedings of the First Symposium on Operating Systems Design and Implementation, pages 115-123, November 1994.
2
 
3
D. D. Clark, V. Jacobson, J. Romkey, and H. Salwen. An analysis of TCP processing overhead. IEEE Communications Magazine, 27(6):23-29, June 1989.
4
5
6
7
8
 
9
D. R. Engler, W. C. Hsieh, and M. F. Kaashoek. 'C: A language for high-level, efficient, and machine-independent dynamic code generation. In Proceedings of the 22th Annual Symposium on Principles of Programming Languages, 1995.
10
11
 
12
 
13
D. B. Johnson and W. Zwaenepoel. The Peregrine highperformance RPC system. Technical Report TR91-151, Rice University, March 1991.
 
14
M. Leone and P. Lee. Lightweight run-time code generation. In Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 97-106, Copenhagen, Denmark, June 1994.
15
 
16
 
17
S. McCanne and V. Jacobson. The BSD packet filter: A new architecture for user-level packet capture. In USENIX Technical Conference Proceedings, pages 259-269, San Diego, CA, Winter 1993. USENIX.
18
19
 
20
N. Ramsey and M. F. Fernandez. The New Jersey machinecode toolkit. In 1995 Winter USENIX, December 1995.
21
22
23
 
24
C.A. Thekkath, H.M. Levy, and E.D. Lazowska. Efficient support for multicomputing on ATM networks. Technical Report TR93-04-03, University of Washington, April 1993.
25
 
26
 
27
M. Yahara, B. Bershad, C. Maeda, and E. Moss. Efficient packet demultiplexing for multiple endpoints and large messages. InProceedings of the Winter 1994 USENIX Conference, 1994.

CITED BY  44
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Dawson R. Engler: colleagues
M. Frans Kaashoek: colleagues

Peer to Peer - Readers of this Article have also read: