Memory-efficient state lookups with fast updates

Computer Communication Review

Volumn 30, Issue 4, 2000, Pages 335-347

  Sikka, Sandeep ^a   Varghese, George ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); PACKET NETWORKS; PACKET SWITCHING; RANDOM ACCESS STORAGE; STORAGE ALLOCATION (COMPUTER); TABLE LOOKUP; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

INTERNET PROTOCOLS (IP);

ROUTERS;

EID: 0033645906     PISSN: 01464833     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/347057.347565     Document Type: Article

References (38)

1. Henry G. Baker. List processing in real time on a serial computer. Communications of the ACM, 21(4):280-294, April 1978.
2. T. Chiueh and P. Pradhan. High Performance IP Routing Table Lookup using CPU caching. Proc IEEE Infocom 99, April 1999.
3. R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin. Resource reservation protocol (RSVP) - version 1 functional specification. RFC 2205, September 1997.
4. DegerMark, A. Brodnik, S. Carlsson, and S. Pink. Small forwarding tables for fast routing lookups. Proceedings SIGCOMM 97, September 1997.
5. A. Demers, S. Keshav, and S. Shenker. Analysis and Simulation of a fair queuing algorithm. Proceedings of Sigcomm 89, (September), 1989.
6. W. Eatherton Hardware-Based Internet Protocol Prefix Lookups M.S. Thesis, Washington University, Department of Electical Engineering, May 1999.
7. Pankaj Gupta, Steven Lin, and Nick McKeown. Routing Lookups in Hardware at Memory Access Speeds. Proceedings of IEEE Infocom 98, April 1998.
8. Mark S. Johnstone. Non-Compacting Memory Allocation and Real-Time Garbage Collection. PhD thesis, The University of Texas at Austin, December 1997.
9. Juniper Networks M20 Product Web Page. http://www.juniper.net/products/m20-12.htm.
10. D. E. Knuth. The Art of Computer Programming, volume 1. Addison-Wesley Publishing Company, Stanford University, 2nd edition, 1973.
11. H. Lieberman and C. Hewitt. A real-time garbage collector based on the lifetimes of objects. Communications of the ACM, 26(6):419-429, June 1983.
12. C. Labovitz, G. Malan, and F. Jahanian. Internet Routing Instability. Proceedings of SIGCOMM 97, October 1997.
13. T. V. Lakshman and D. Stiliadis. High-speed policy-based packet forwarding using efficient multi-dimensional range matching. In Proceedings of SIGCOMM 98, October 1998.
14. B. Lampson, V. Srinivasan, and G. Yarghese. IP lookups using multi-way and multicolumn search. In Proceedings of IEEE Infocom 98, April 1998.
15. Merit. Routing table snapshot at the Mae-East NAP. http://www.merit.edu/ipma/routing-table/.
16. Merit. Route Tracker Tool http://www.merit.edu/ipma/tools/.
17. N. McKeown, M. Izzard, A. Mekkittikul, B. Ellersick, and M. Horowitz. The Tiny Tera: a packet switch core. IEEE Micro, January 1997.
18. Music Semiconductors. What Is a CAM (Content Addressable Memory)? Application Brief AB-N6. http://www.music-ic.com.
19. S. Nilsson and G. Karlsson. Fast Address Look-Up for Internet Routers. Proceedings of IEEE Broadband Communications 98, (April), 1998.
20. C. Partridge. Locality and route caches. In NSF Workshop on Internet Statistics Measurements and Analysis, February 1996.
21. R. Perlman. Interconnections, Bridges and Routers. Second Edition, Addison-Wesley, 1999.
22. Y. Rechter and T. Li. A Border Gateway Protocol 4 (BGP-4) RFC 1771. 1995.
23. J. M. Robson. An estimate of the store size necessary for dynamic storage allocation. Journal of the Association for Computing Machinery, 18(3):416-423, July 1971.
24. J. M. Robson. Bounds for some functions concering dynamic storage allocation. Journal of the Association for Computing Machinery, 21(3):491-499, July 1974.
25. J. M. Robson. Worst case fragmentation of first fit and best fit storage allocation strategies. The Computer Journal, 20(3):242-244, August 1977.
26. IBM. 64Mb Direct Rambus SDRAM Advance Datasheet. December 1997.
27. IBM. Double Data Rate SDRAM, IBM0664404ET3A, 128k x 8 x 4 banks. IBM, August 1998.
28. A. Silberschatz, and P. B. Galvin. Operating Systems Concepts. Addison-Wesley Publishing Company, 5th edition, November 1997.
29. V. Srinivasan and G. Varghese. Fast address lookups using controlled prefix expansion. ACM Transactions on Computer Systems, November 1998.
30. V. Srinivasan, G. Varghese, S. Suri, and M. Waldgovel. Fast and scalable layer four switching. In Proceedings of SIGCOMM, October 1998.
31. J. Turner, T. Chaney, A. Fingerhut, and M. Flucke. Design of a Gigabit ATM switch. In Proceedings of Infocom 97, March 1997.
32. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990.
33. K. Thomson, G. J. Miller, and R. Wilder. Wide-area traffic patterns and characteristics. IEEE Network, December 1997.
34. Torrent. Torrent Systems, Inc. http://www.torrent.com, 1998.
35. Paul R. Wilson. Uniprocessor garbage collection techniques. In Springer-Verlag Lecture Notes in Computer Science, number 637, pages 1-42. Springer-Verlag, September 1992.
36. P. R. Wilson, M. S. Johnstone, M. Neely, and D. Boles. Dynamic storage allocation: A survey and critical review. In Springer-Verlag Lecture Notes in Computer Science, number 986, pages 1-116. Springer-Verlag, September 1995.
37. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable high speed IP routing lookups. In Proceedings of SIGCOMM 97, October 1997.
38. C. D. Waitzman, Partridge, and S.E. Deering. Distance vector multicast routing protocol. RFC 1075, November 1988.