DPF: Fast, Flexible Message Demultiplexing using Dynamic Code Generation (1996)
Cached
Download Links
- [www.stanford.edu]
- [dcslab.snu.ac.kr]
- [http.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In ACM Communication Architectures, Protocols, and Applications (SIGCOMM |
| Citations: | 116 - 10 self |
BibTeX
@INPROCEEDINGS{Engler96dpf:fast,,
author = {Dawson Engler and M. Frans Kaashoek},
title = {DPF: Fast, Flexible Message Demultiplexing using Dynamic Code Generation},
booktitle = {In ACM Communication Architectures, Protocols, and Applications (SIGCOMM},
year = {1996},
pages = {53--59},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 handcoded 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 ...
