BPF+: Exploiting global data-flow optimization in a generalized packet filter architecture

Computer Communication Review

Volumn 29, Issue 4, 1999, Pages 123-134

  Begel, Andrew ^a   McCanne, Steven ^a   Graham, Susan L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); DATA COMMUNICATION SYSTEMS; DATA FLOW ANALYSIS; HIGH LEVEL LANGUAGES; OPTIMIZATION; PROGRAM COMPILERS; SIGNAL FILTERING AND PREDICTION;

PACKET FILTERS;

PACKET SWITCHING;

EID: 0033204392     PISSN: 01464833     EISSN: None     Source Type: Journal    
DOI: 10.1145/316194.316214     Document Type: Article

References (24)

1. Alfred Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading,' MA, 1986.
2. Mary L. Bailey, Buna Gopal, Michael A. Pagels, and Larry L. Peterson. PATHFINDER: A pattern-based packet classifier. In Proceedings of the First USENIX Symposium on Operating Systems Design and Implementation, pages 115-123, Monterey, CA, November 1994.
3. G. J. Chaitin. Register allocation and spilling via graph coloring. In Proceedings of the ACM SIGPLAN '82 Symposium on Compiler Construction, pages 98-105,1982.
4. J. Cocke and J. Schwartz. Programming Languages and Their Compilers. NYU, Courant Inst., TR., Second Revised Version, Aprill 970.
5. J. R. B. Cockett and J. A. Herrera. Decision tree reduction. Journal of the ACM, 37(4):815-842, October 1990.
6. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark K. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In 16th Annual ACM Symposium on Principles of Programming Languages, pages 25-35, 1989.
7. Dawson R. Engler and M. Frans Kaashoek. DPF: Fast, flexible message demultiplexing using dynamic code generation. In Proceedings ofACMSlGCOMM '96, pages 53-59, Stanford, CA, August 1996.
8. Susan L. Graham and Mark Wegman. A fast and usually linear algorithm for global flow analysis. Journal of the ACM, 23(1):172-202, January 1976.
9. Norman C. Hutchinson and Larry L. Peterson. The jr-Kemel: An architecture for implementing network protocols. IEEE Transactions on Software Engineering, 17(l):64-76, January 1991.
10. L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, May 1976.
11. Van Jacobson, Craig Leres, and Steven McCanne. pcap(3). Available via ftp from ftp. ee. Ibl. gov, June 1989.
12. Van Jacobson, Craig Leres, and Steven McCanne. topdump(J). Available via ftp from ftp. ee. Ibl. gov, June 1989.
13. Mahesh Jayaram and Ron K. Cytron. Efficient demultiplexing of network packets by automatic parsing. In Proceedings of the Workshop on Compiler Support for System Software (WCSSS). Tucson, AZ, February 1996.
14. T.V. Lakshman and D. Stiliadis. High speed policy-based packet forwarding using efficient multi-dimensional range matching. In Proceedings of SIGCOMM '98, September 1998.
15. Steven McCanne and Van Jacobson. The BSD packet filter: A new architecture for user-level packet capture. In Proceedings of the 1993 Winter USENIX Technical Conference, pages 259-269, San Diego, CA, January 1993.
16. Jeffrey C. Mogul, Richard F. Rashid, and Michael J. Accetta. The packet filter: An efficient mechanism for user-level network code. In Proceedings of llth ACM Symposium on Operating Systems Principles, pages 39-51, Austin, TX, November 1987.
17. Frank Mueller and David B. Whalley. Avoiding unconditional jumps by code replication. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 322-330, June 1992.
18. [ 18] George C. Necula and Peter Lee. Safe kernel extensions without run-time checking. In Proceedings of the Second Symposium on Operating System Design and Implementation, Seattle, Wa., October 1996.
19. Vern Paxson. Bro: A system for detecting network intruders in real-time. In Proceedings of the Seventh USENIX Security Symposium, San Antonio, TX, January 1998.
20. V. Srinivasan, George Varghese, Subash Suri, and Marcel Waldvogel. Fast scalable algorithms for level four switching. In Proceedings of SIGCOMM '98, September 1998.
21. G.R. Uh and D. B. Whalley. Coalescing conditional branches into efficient indirect jumps. In Proceedings of the International Static Analysis Symposium, pages 315-329, September 1997.
22. Mark N. Wegman and Kenneth Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2):181-210, April 1991.
23. Minghui Yang, Gang-Ryung Uh, and David B. Whalley. Improving performance by branch reordering. In Proceedings of the ACM SIGPLAN'98 Conference on Programming Language Design and Implementation (PLDI), pages 130-141, Montreal, Canada, June 1998.
24. Masanobu Yuhara, Brian Bershad, Chris Maeda, and J. Eliot B. Moss. Efficient packet demultiplexing for multiple endpoints and large messages. In Proceedings of the 1994 Winter USENIX Teclmical Conference, pages 153-165, San Francisco, CA, January 1994.