메뉴 건너뛰기




Volumn 3, Issue , 2002, Pages 2350-2354

Effective bit selection methods for improving performance of packet classifications on IP routers

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DYNAMIC RANDOM ACCESS STORAGE; INTERNET; NETWORK PROTOCOLS; PACKET NETWORKS; TELECOMMUNICATION TRAFFIC;

EID: 0036970203     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (11)

References (9)
  • 1
    • 0034291991 scopus 로고    scopus 로고
    • Challenges for the next-generation internet and the role of IP over photonio networks
    • October
    • M. Murata, "Challenges for the Next-Generation Internet and the Role of IP over Photonio Networks," IEICE Transactions on Communications, vol. E83-B, pp. 2153-2165, October 2000.
    • (2000) IEICE Transactions on Communications , vol.E83-B , pp. 2153-2165
    • Murata, M.1
  • 2
    • 0035365809 scopus 로고    scopus 로고
    • Survey on fairness issues in TCP congestion control mechanisms
    • June
    • G. Hasegawa and M. Murata, "Survey on Fairness Issues in TCP Congestion Control Mechanisms," IEICE Transactions on Communications, vol. E84-B, pp. 1461-1472, June 2001.
    • (2001) IEICE Transactions on Communications , vol.E84-B , pp. 1461-1472
    • Hasegawa, G.1    Murata, M.2
  • 3
    • 38149018071 scopus 로고
    • PATRICIA- practical algorithm to retrieve information coded in alphanumeric
    • October
    • D. Morrison, "PATRICIA- Practical Algorithm To Retrieve Information Coded in Alphanumeric," Journel of the ACM, vol. 15, pp. 514-534, October 1968.
    • (1968) Journel of the ACM , vol.15 , pp. 514-534
    • Morrison, D.1
  • 4
    • 0002260103 scopus 로고    scopus 로고
    • Fast address lookups using controlled prefix expansion
    • V. Srinivasan and G. Varghese, "Fast Address Lookups using Controlled Prefix Expansion," ACM Transactions on Computer System, vol. 17, no. 1, pp. 1-40, 1999.
    • (1999) ACM Transactions on Computer System , vol.17 , Issue.1 , pp. 1-40
    • Srinivasan, V.1    Varghese, G.2
  • 5
    • 0033885345 scopus 로고    scopus 로고
    • Near-optimal routing lookups with bounded worst case performance
    • P. Gupta, B. Prabhakar, and S. Boyd, "Near-Optimal Routing Lookups with Bounded Worst Case Performance," in Proceedings of IEEE INFOCOM 2000, vol. 3, pp. 1184-1192, 2000.
    • (2000) Proceedings of IEEE INFOCOM 2000 , vol.3 , pp. 1184-1192
    • Gupta, P.1    Prabhakar, B.2    Boyd, S.3
  • 6
    • 0035278163 scopus 로고    scopus 로고
    • Algorithms for packet classification
    • March/April
    • P. Gupta and N. McKeown, "Algorithms for Packet Classification," IEEE Network, vol. 15, pp. 24-32, March/April 2001.
    • (2001) IEEE Network , vol.15 , pp. 24-32
    • Gupta, P.1    McKeown, N.2
  • 7
    • 0033902127 scopus 로고    scopus 로고
    • A modular approach to packet classification: Algorithms and results
    • March
    • T. Y. Woo, "A Modular Approach to Packet Classification: Algorithms and Results," in Proceedings of IEEE INFOCOM 2000, vol. 3, pp. 1203-1222, March 2000.
    • (2000) Proceedings of IEEE INFOCOM 2000 , vol.3 , pp. 1203-1222
    • Woo, T.Y.1
  • 9
    • 0012786718 scopus 로고    scopus 로고
    • IPMA project
    • IPMA Project, IPMA Statistics. http://nic.merit.edu/ipma.
    • IPMA Statistics


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