메뉴 건너뛰기




Volumn 27, Issue 4, 1997, Pages 3-14

Small forwarding tables for fast routing lookups

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; COMPUTER HARDWARE; COMPUTER SOFTWARE; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; PACKET NETWORKS; PACKET SWITCHING; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER); TABLE LOOKUP; WIDE AREA NETWORKS; NETWORK PROTOCOLS;

EID: 0030609294     PISSN: 01464833     EISSN: None     Source Type: Journal    
DOI: 10.1145/263109.263133     Document Type: Article
Times cited : (368)

References (23)
  • 4
    • 0003215937 scopus 로고    scopus 로고
    • Internet Protocol, Version 6 (IPv6) Specification
    • Internet Engineering Task Force, January
    • S. Deering and R. Hinden. Internet Protocol, Version 6 (IPv6) Specification. Request for Comments (Proposed Standard) RFC 1883, Internet Engineering Task Force, January 1996.
    • (1996) Request for Comments (Proposed Standard) RFC , vol.1883
    • Deering, S.1    Hinden, R.2
  • 6
    • 85033189209 scopus 로고    scopus 로고
    • Stanford University Workshop on Fast Routing and Switching, December 1996
    • Stanford University Workshop on Fast Routing and Switching, December 1996. http://tiny-tera.stanford.edu/Workshop_Dec96/ .
  • 11
    • 85084160699 scopus 로고    scopus 로고
    • Imbench: Portable tools for performance analysis
    • January
    • Larry McVoy and Carl Staelin. Imbench: Portable tools for performance analysis. In USENIX Winter Conference, January 1996. Available at http://reality.sgi.com/lm/lmbench/ lmbench-usenix.ps .
    • (1996) USENIX Winter Conference
    • McVoy, L.1    Staelin, C.2
  • 12
    • 0024143457 scopus 로고
    • A lower bound on the complexity of the union-split-find problem
    • December
    • K. Mehlhorn, S. Näher, and H. Alt. A lower bound on the complexity of the union-split-find problem. SIAM Journal on Computing, 17(1):1093-1102, December 1988.
    • (1988) SIAM Journal on Computing , vol.17 , Issue.1 , pp. 1093-1102
    • Mehlhorn, K.1    Näher, S.2    Alt, H.3
  • 13
    • 38149018071 scopus 로고
    • PATRICIA - Practical Algo-rithm to Retreive Information Coded in Alfanumeric
    • October
    • Donald R. Morrison. PATRICIA - Practical Algo-rithm to Retreive Information Coded In Alfanumeric. Journal of the ACM, 15(4):514-534, October 1968.
    • (1968) Journal of the ACM , vol.15 , Issue.4 , pp. 514-534
    • Morrison, D.R.1
  • 16
    • 0003532491 scopus 로고    scopus 로고
    • PhD thesis, Department of Computer Science, Lund University
    • S. Nilsson. Radix Sorting & Searching. PhD thesis, Department of Computer Science, Lund University, 1996.
    • (1996) Radix Sorting & Searching.
    • Nilsson, S.1
  • 18
    • 0004245925 scopus 로고
    • Addison-Wesley, Reading, Massachusetts
    • Craig Partridge. Gigabit networking. Addison-Wesley, Reading, Massachusetts, 1993.
    • (1993) Gigabit Networking
    • Partridge, C.1
  • 19
    • 85133879379 scopus 로고
    • IP/ATM: A strategy for integrating IP with ATM
    • October Proceedings ACM SIGCOMM '95 Conference
    • Guru Parulkar, Douglas C. Schmidt, and Jonathan Turner. IP/ATM: A strategy for integrating IP with ATM. Computer Communication Review, 25(4):49-58, October 1995. Proceedings ACM SIGCOMM '95 Conference.
    • (1995) Computer Communication Review , vol.25 , Issue.4 , pp. 49-58
    • Parulkar, G.1    Schmidt, D.C.2    Turner, J.3
  • 23
    • 85033166987 scopus 로고    scopus 로고
    • Washington University Workshop on Integration of IP and ATM, November 1996. Proceedings from session 5
    • Washington University Workshop on Integration of IP and ATM, November 1996. Proceedings from session 5. Available at http://www.ar1.wust1.edu/arl/workshops/atmip/ .


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