메뉴 건너뛰기




Volumn 38, Issue 4, 2008, Pages 219-230

Packet caches on routers: The implications of universal redundant traffic elimination

Author keywords

Routing; Traffic engineering; Traffic redundancy

Indexed keywords

APPLICATION LAYERS; INTER DOMAINS; INTER-DOMAIN ROUTING; INTERNET ROUTERS; LINK LOADS; LINK USAGES; NETWORK ACCESS; NETWORK EFFICIENCIES; NETWORK LINKS; REDUNDANCY ELIMINATIONS; REDUNDANT CONTENTS; REDUNDANT TRAFFICS; ROUTING; SOFTWARE ROUTERS; TRAFFIC ENGINEERING; TRAFFIC REDUNDANCY;

EID: 65249097102     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/1402946.1402984     Document Type: Conference Paper
Times cited : (106)

References (25)
  • 4
    • 84885989372 scopus 로고    scopus 로고
    • Riverbed Networks. http://www.riverbed.com.
    • Networks
  • 5
    • 65249097102 scopus 로고    scopus 로고
    • A. Anand, A. Gupta, A. Akella, S. Seshan, and S. Shenker. Packet Caches on Routers: The Implications of Universal Redundant Traffic Elimination (Extended Version). Technical Report 1636, UW-Madison, June 2008.
    • A. Anand, A. Gupta, A. Akella, S. Seshan, and S. Shenker. Packet Caches on Routers: The Implications of Universal Redundant Traffic Elimination (Extended Version). Technical Report 1636, UW-Madison, June 2008.
  • 6
    • 0033873349 scopus 로고    scopus 로고
    • Internet Traffic Engineering by Optimizing OSPF Weights
    • B. Fortz and M. Thorup. Internet Traffic Engineering by Optimizing OSPF Weights. In Infocom, 2000.
    • (2000) Infocom
    • Fortz, B.1    Thorup, M.2
  • 10
    • 70350645867 scopus 로고    scopus 로고
    • A cool and practical alternative to traditional hash tables
    • U. Erlingsson, M. Manasse, and F. McSherry. A cool and practical alternative to traditional hash tables. In WDAS, 2006.
    • (2006) WDAS
    • Erlingsson, U.1    Manasse, M.2    McSherry, F.3
  • 11
    • 33845584959 scopus 로고    scopus 로고
    • Summary cache: A scalable wide-area Web cache sharing protocol
    • L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area Web cache sharing protocol. In ACM SIGCOMM, 1998.
    • (1998) ACM SIGCOMM
    • Fan, L.1    Cao, P.2    Almeida, J.3    Broder, A.Z.4
  • 12
    • 84888566398 scopus 로고    scopus 로고
    • Traffic engineering with traditional IP routing protocols
    • B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. In Infocom, 2002.
    • (2002) Infocom
    • Fortz, B.1    Rexford, J.2    Thorup, M.3
  • 14
    • 65249105937 scopus 로고    scopus 로고
    • Understanding and Exploiting Network Traffic Redundancy. Technical Report 1592, UW-Madison
    • April
    • A. Gupta, A. Akella, S. Seshan, S. Shenker, and J. Wang. Understanding and Exploiting Network Traffic Redundancy. Technical Report 1592, UW-Madison, April 2007.
    • (2007)
    • Gupta, A.1    Akella, A.2    Seshan, S.3    Shenker, S.4    Wang, J.5
  • 15
    • 34748858619 scopus 로고    scopus 로고
    • Walking the tightrope: Responsive yet stable traffic engineering
    • S. Kandula, D. Katabi, B. Davie, and A. Charny. Walking the tightrope: responsive yet stable traffic engineering. In ACM SIGCOMM, 2005.
    • (2005) ACM SIGCOMM
    • Kandula, S.1    Katabi, D.2    Davie, B.3    Charny, A.4
  • 20
    • 0003676885 scopus 로고
    • Fingerprinting by Random Polynomials
    • Technical report, Harvard University, Technical Report, TR-15-81
    • M. Rabin. Fingerprinting by Random Polynomials. Technical report, Harvard University, 1981. Technical Report, TR-15-81.
    • (1981)
    • Rabin, M.1
  • 21
    • 49749137793 scopus 로고    scopus 로고
    • Performance of estimated traffic matrices in traffic engineering
    • M. Roughan, M. Thorup, and Y. Zhang. Performance of estimated traffic matrices in traffic engineering. In ACM SIGMETRICS, 2003.
    • (2003) ACM SIGMETRICS
    • Roughan, M.1    Thorup, M.2    Zhang, Y.3
  • 24
    • 24344481726 scopus 로고    scopus 로고
    • A protocol-independent technique for eliminating redundant network traffic
    • N. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In ACM SIGCOMM, 2000.
    • (2000) ACM SIGCOMM
    • Spring, N.1    Wetherall, D.2


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