메뉴 건너뛰기




Volumn 43, Issue 4, 2013, Pages 3-14

B4: Experience with a globally-deployed software defined WAN

Author keywords

centralized traffic engineering; openflow; routing; software defined networking; wide area networks

Indexed keywords

BANDWIDTH REQUIREMENT; CENTRALIZED TRAFFIC; ELASTIC TRAFFIC; MULTIPLE-PATH; OPENFLOW; RATE LIMITING; ROUTING; SOFTWARE-DEFINED NETWORKINGS;

EID: 84891618095     PISSN: 01464833     EISSN: 19435819     Source Type: Conference Proceeding    
DOI: 10.1145/2534169.2486019     Document Type: Conference Paper
Times cited : (1310)

References (40)
  • 2
    • 54549100157 scopus 로고    scopus 로고
    • Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation
    • ALLALOUF, M., AND SHAVITT, Y. Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation. IEEE/ACM Trans. Networking 16, 5 (2008), 1015-1024.
    • (2008) IEEE/ACM Trans. Networking , vol.16 , Issue.5 , pp. 1015-1024
    • Allalouf, M.1    Shavitt, Y.2
  • 13
    • 84861639913 scopus 로고    scopus 로고
    • A Practical Algorithm for Balancing the Max-min Fairness and Throughput Objectives in Traffic Engineering
    • DANNA, E., MANDAL, S., AND SINGH, A. A Practical Algorithm for Balancing the Max-min Fairness and Throughput Objectives in Traffic Engineering. In Proc. INFOCOM (March 2012), pp. 846-854.
    • Proc. INFOCOM (March 2012) , pp. 846-854
    • Danna, E.1    Mandal, S.2    Singh, A.3
  • 16
    • 0036806665 scopus 로고    scopus 로고
    • Traffic Engineering with Traditional IP Routing Protocols
    • FORTZ, B., REXFORD, J., AND THORUP, M. Traffic Engineering with Traditional IP Routing Protocols. IEEE Communications Magazine 40 (2002), 118-124.
    • (2002) IEEE Communications Magazine , vol.40 , pp. 118-124
    • Fortz, B.1    Rexford, J.2    Thorup, M.3
  • 17
    • 4444278382 scopus 로고    scopus 로고
    • Increasing Internet Capacity Using Local Search
    • October
    • FORTZ, B., AND THORUP, M. Increasing Internet Capacity Using Local Search. Comput. Optim. Appl. 29,1 (October 2004), 13-48.
    • (2004) Comput. Optim. Appl. , vol.29 , Issue.1 , pp. 13-48
    • Fortz, B.1    Thorup, M.2
  • 22
    • 41949111722 scopus 로고    scopus 로고
    • Toward Internet-wide Multipath Routing
    • March
    • HE, J., AND REXFORD, J. Toward Internet-wide Multipath Routing. IEEE Network Magazine 22, 2 (March 2008), 16-21.
    • (2008) IEEE Network Magazine , vol.22 , Issue.2 , pp. 16-21
    • He, J.1    Rexford, J.2
  • 33
    • 19544362547 scopus 로고    scopus 로고
    • Traffic Engineering with Estimated Traffic Matrices
    • ROUGHAN, M., THORUP, M., AND ZHANG, Y. Traffic Engineering with Estimated Traffic Matrices. In Proc. IMC (2003), pp. 248-258.
    • Proc. IMC (2003) , pp. 248-258
    • Roughan, M.1    Thorup, M.2    Zhang, Y.3
  • 34
    • 7244221852 scopus 로고    scopus 로고
    • TEAM: A Traffic Engineering Automated Manager for DiffServ-based MPLS Networks
    • October
    • SCOGLIO, C, ANJALI, T., DE OLIVEIRA, J. C, AKYILDIZ, I. E, AND UHI, G. TEAM: A Traffic Engineering Automated Manager for DiffServ-based MPLS Networks. Comm. Mag. 42,10 (October 2004),134-145.
    • (2004) Comm. Mag. , vol.42 , Issue.10 , pp. 134-145
    • Scoglio, C.1    Anjali, T.2    De Oliveira, J.C.3    Akyildiz, I.E.4    Uhi, G.5
  • 39
    • 84655169959 scopus 로고    scopus 로고
    • Link-state Routing withHop-by-hop Forwarding Can Achieve Optimal Traffic Engineering
    • December
    • XU, D., CHIANG, M., AND REXFORD, J. Link-state Routing withHop-by-hop Forwarding Can Achieve Optimal Traffic Engineering. IEEE/ACM Trans. Netw. 19, 6 (December 2011), 1717-1730.
    • (2011) IEEE/ACM Trans. Netw. , vol.19 , Issue.6 , pp. 1717-1730
    • Xu, D.1    Chiang, M.2    Rexford, J.3


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