메뉴 건너뛰기




Volumn 16, Issue , 2004, Pages 103-111

Parallelism versus memory allocation in pipelined router forwarding engines

Author keywords

Approximation algorithm; Memory allocation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PACKET SWITCHING; POLYNOMIALS; PROBLEM SOLVING; ROUTERS; STORAGE ALLOCATION (COMPUTER);

EID: 8344275860     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007928     Document Type: Conference Paper
Times cited : (7)

References (13)
  • 1
    • 0042475248 scopus 로고    scopus 로고
    • Fast incremental updates for pipeline forwarding engines
    • A. Basu and G. Narlikar, Fast Incremental Updates for Pipeline Forwarding Engines, InfoCom 2003.
    • InfoCom 2003
    • Basu, A.1    Narlikar, G.2
  • 7
    • 0001627504 scopus 로고
    • Complexity results for multiprocessor scheduling under resource constraints
    • M. R. Garey and D. S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM J. Comput., (1975), 397-411.
    • (1975) SIAM J. Comput. , pp. 397-411
    • Garey, M.R.1    Johnson, D.S.2
  • 10
    • 0002436227 scopus 로고    scopus 로고
    • High speed policy-based packet forwarding using efficient multi-dimensional range matching
    • T.V. Lakshman and D. Staliadis, High Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching, Proc. ACM SIGCOMM '98, 1998.
    • (1998) Proc. ACM SIGCOMM '98
    • Lakshman, T.V.1    Staliadis, D.2
  • 11
    • 0035278505 scopus 로고    scopus 로고
    • Survey and taxonomy of IP address lookup algorithms
    • March/April
    • M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, Survey and Taxonomy of IP Address Lookup Algorithms, IEEE Network, March/April 2001.
    • (2001) IEEE Network
    • Ruiz-Sanchez, M.1    Biersack, E.2    Dabbous, W.3
  • 12
    • 0003325342 scopus 로고    scopus 로고
    • Memory efficient state lookups with fast updates
    • August
    • S. Sikka and G. Varghese, Memory Efficient State Lookups with Fast Updates, in Proceedings of SIGCOMM 2000, August 2000.
    • (2000) Proceedings of SIGCOMM 2000
    • Sikka, S.1    Varghese, G.2
  • 13
    • 0025467711 scopus 로고
    • A bridging model for parallel computation
    • L. Valiant, A bridging model for parallel computation. Communications of the ACM, 33(8), 1990.
    • (1990) Communications of the ACM , vol.33 , Issue.8
    • Valiant, L.1


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