Routing on longest-matching prefixes

IEEE/ACM Transactions on Networking

Volumn 4, Issue 1, 1996, Pages 86-97

  Doeringer, Willibald ^a,b   Karjoth, Günter ^c   Nassehi, Mehdi ^a,c  

^a IEEE

^b FH Worms ^*  (Germany)

^c IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; COMPUTER OPERATING SYSTEMS; DATA STRUCTURES; DATABASE SYSTEMS;

ALGORITHMIC COMPLEXITY; DELETE OPERATION; INSERT OPERATION;

COMPUTER NETWORKS;

EID: 0030085398     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.503764     Document Type: Article

References (28)

1. A. Anderson, "On the balance property of Patricia tries: external path length viewpoint," Theoretical Comput. Science, vol. 106, no. 2, pp. 391-393, Dec. 1992.
2. J. Aoe, K. Morimoto, and T. Sato, "An efficient implementation of trie structures," Software Practice & Experience, vol. 22, no. 9, pp. 695-721, Sept. 1992.
3. ATM Forum, PNNI Draft Specification, 1995. Version 94-0471R10.
4. S. Bradner and A. Mankin, The recommendation for the IP next generation protocol, RFC 1752, NIC, 1995.
5. D. Comer, Internetworking with TCP/IP. Principles, Protocols and Architecture. Englewood Cliffs, NJ: Prentice-Hall, 1989.
6. W. Doeringer et al., "Multiprotocol transport networking: a software declaration of application independence," IBM Systems J., vol. 34, no. 3, Sept. 1995.
7. W. Doeringer, D. Dykeman, M. Peters, H. Sandick, and K. Vu, "Efficient, real-time address resolution in networks of arbitrary topology," in Proc. 1st LAN Conf., 1993, pp. 183-191.
8. W. Doeringer and M. Nassehi, "A new standard for address resolution," submitted to IEEE Commun. Mag. Special Issue Enterprise Networking, 1995.
9. J. A. Dundas III, "Implementing dynamic minimal-prefix tries," Software Practice & Experience, vol. 21, no. 10, pp. 1027-1040, Oct. 1991.
10. G. H. Gonnet and R. Baeza-Yates, Handbook of Algorithms and Data Structures. Reading. MA: Addison-Wesley, 1991.
11. ISO/IEC, Intermediate System to Intermediate System Inter-Domain Routeing Exchange Protocol, 1992, DIS 10747.
12. ISO/OSI, Network Service Definition, Addendum 2: Network Layer Addressing, 1988, DIS 8348, Add.2.
13. _, OSI Routeing Framework, 1989, DIS 9575.
14. _, Intermediate System to Intermediate System Intra-domain Routeing Protocol for Use in Conjunction with the Protocol for Providing Connectionless-mode Network Service (ISO 8473), 1990, DIS 10589.
15. P. Kirschenhofer, H. Prodinger, and W. Szpankowski, "Do we really need to balance Patricia tries?" in Proc. ICALP, Lecture Notes Comput. Science 317, 1988, pp. 302-316.
16. _. "On the balance property of Patricia tries: external path length viewpoint," Theoretical Computer Science, vol. 68, no. 1, pp. 1-18, Oct. 1989.
17. D. E. Knuth, "Optimum binary search trees," Acta Information, vol. 1, pp. 14-25, 1971.
18. _, The Art of Computer Programming, vol. 3. Sorting and Searching. Reading, MA: Addison-Wesley, 1991.
19. K. Lougheed and Y. Rekhter, Border gateway protocol (BGP), RFC 1163, NIC, 1990.
20. T. X. Merrett and B. Fayerman, "Dynamic Patricia," in Proc. Int. Conf. Foundations Data Org., Kyoto, Japan, 1985, pp. 13-20.
21. D. R. Morrison, "Patricia - practical algorithm to retrieve information coded in alphanumeric," J. ACM, vol. 15, no. 4, pp. 515-534, Oct. 1968.
22. P. Robinson, Suggestion for a new class of IP addresses, RFC 1375, NIC, 1992.
23. T.-B. Pei and C. Zukowski, "Putting routing tables in silicon," IEEE Network Mag., pp. 42-50, Jan. 1992.
24. R. Perlman, Interconnections: Bridges and Routers. Reading, MA: Addison-Wesley, 1992.
25. W. Pugh. "Skip lists: a probabilistic alternative to balanced tries," Commun. ACM, vol. 33, no. 6, pp. 668-676, June 1990.
26. Y. Rekhter, "Forwarding database overhead for inter-domain routing," ACM Comput. Commun. Rev., vol. 23, no. 1, pp. 66-81, Jan. 1993.
27. D. D. Sleator and R. E. Tarjan, "Self-adjusting binary tries," J. ACM, vol. 32, no. 2, pp. 652-686, July 1985.
28. W. Szpankowski, "How much on the average is the Patricia trie better?" in Proc. Allerton Conf., 1986, pp. 314-323.