메뉴 건너뛰기




Volumn 17, Issue 1, 1999, Pages 1-40

Fast address lookups using controlled prefix expansion

Author keywords

Binary Search on Levels; C.2.3 Computer Communication Networks : Network Operations network monitoring; Controlled prefix expansion; Expanded tries; Internet address lookup; Longest prefix match; Multibit tries; Performance; Router performance

Indexed keywords


EID: 0002260103     PISSN: 07342071     EISSN: None     Source Type: Journal    
DOI: 10.1145/296502.296503     Document Type: Article
Times cited : (329)

References (32)
  • 2
    • 0030126494 scopus 로고    scopus 로고
    • Trading packet headers for packet processing
    • Apr.
    • CHANDRANMENON, G. AND VARGHESE, G. 1996. Trading packet headers for packet processing. IEEE/ACM Trans. Netw. 4, 2 (Apr.), 141-152.
    • (1996) IEEE/ACM Trans. Netw. , vol.4 , Issue.2 , pp. 141-152
    • Chandranmenon, G.1    Varghese, G.2
  • 8
    • 0040622424 scopus 로고    scopus 로고
    • GRAY, M. 1996. Internet growth summary. Available via http://www.mit.edu/people/mkgray/ net/in ternet-growth-summary.html.
    • (1996) Internet Growth Summary
    • Gray, M.1
  • 11
    • 0039437107 scopus 로고    scopus 로고
    • Big fast routers: Multi-megapacket forwarding engines for Internet II
    • INTERNET-II. 1997. Big fast routers: Multi-megapacket forwarding engines for Internet II. In Proceedings of Networld (Interop '97).
    • (1997) Proceedings of Networld (Interop '97)
  • 14
  • 15
    • 0038844410 scopus 로고
    • Fast multilevel heirarchical routing table using content-addressable memory. U.S. Patent serial number 034444. United States Patent Office, Washington, D.C.
    • MCAULEY, A., TSUCHIYA, P., AND WILSON, D. 1995. Fast multilevel heirarchical routing table using content-addressable memory. U.S. Patent serial number 034444. United States Patent Office, Washington, D.C.
    • (1995)
    • McAuley, A.1    Tsuchiya, P.2    Wilson, D.3
  • 17
    • 0039437104 scopus 로고    scopus 로고
    • Merit Network, Inc., Ann Arbor, MI
    • MERIT NETWORK. 1997. Ipma statistics. Merit Network, Inc., Ann Arbor, MI. Available via http://nic.merit.edu/ipma. (Snapshot on 12 September 97).
    • (1997) Ipma Statistics
  • 21
    • 0003973079 scopus 로고
    • Addison-Wesley Professional Computing Series. Addison-Wesley Publishing Co., Inc., Redwood City, CA
    • PERLMAN, R. 1992. Interconnections: Bridges and Routers. Addison-Wesley Professional Computing Series. Addison-Wesley Publishing Co., Inc., Redwood City, CA.
    • (1992) Interconnections: Bridges and Routers
    • Perlman, R.1
  • 25
    • 0030171894 scopus 로고    scopus 로고
    • Efficient fair queuing using deficit round robin
    • June
    • SHREEDHAR, M. AND VARGHESE, G. 1996. Efficient fair queuing using deficit round robin. IEEE/ACM Trans. Netw. 4, 3 (June), 376-385.
    • (1996) IEEE/ACM Trans. Netw. , vol.4 , Issue.3 , pp. 376-385
    • Shreedhar, M.1    Varghese, G.2
  • 32
    • 0038844411 scopus 로고    scopus 로고
    • Compressed prefix matching database searching. United States Patent Office, Washington, D.C. U.S. Patent 5781772
    • WILKINSON, H., VARGHESE, G., AND POOLE, N. 1998. Compressed prefix matching database searching. United States Patent Office, Washington, D.C. U.S. Patent 5781772.
    • (1998)
    • Wilkinson, H.1    Varghese, G.2    Poole, N.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.