메뉴 건너뛰기




Volumn 14, Issue 6, 2006, Pages 1193-1206

Making routing robust to changing traffic demands: Algorithms and evaluation

Author keywords

Oblivious routing; Routing; Traffic engineering

Indexed keywords

ALGORITHMS; INTERNET PROTOCOLS; ROBUSTNESS (CONTROL SYSTEMS); ROUTING PROTOCOLS; TELECOMMUNICATION TRAFFIC;

EID: 33947266912     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2006.886296     Document Type: Article
Times cited : (76)

References (23)
  • 1
    • 1242332544 scopus 로고    scopus 로고
    • Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs
    • D. Applegate and E. Cohen, "Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs," in Proc. ACM SIGCOMM, 2003, pp. 313-324.
    • (2003) Proc. ACM SIGCOMM , pp. 313-324
    • Applegate, D.1    Cohen, E.2
  • 2
    • 8344239779 scopus 로고    scopus 로고
    • Coping with network failures: Routing strategies for optimal demand oblivious restoration
    • D. Applegate, L. Breslau, and E. Cohen, "Coping with network failures: Routing strategies for optimal demand oblivious restoration," in Proc. ACM SIGMETRICS, 2004, pp. 270-281.
    • (2004) Proc. ACM SIGMETRICS , pp. 270-281
    • Applegate, D.1    Breslau, L.2    Cohen, E.3
  • 5
    • 0038446975 scopus 로고    scopus 로고
    • Optimal oblivious routing in polynomial time
    • , "Optimal oblivious routing in polynomial time," in Proc. 35th ACM Symp. Theory of Computing, 2003, pp. 383-388.
    • (2003) Proc. 35th ACM Symp. Theory of Computing , pp. 383-388
  • 6
    • 0042877265 scopus 로고    scopus 로고
    • Geographical and temporal characteristics of inter-POP flows: View from a single POP
    • Feb
    • S. Bhattacharya, C. Diot, J. Jetcheva, and N. Taft, "Geographical and temporal characteristics of inter-POP flows: view from a single POP," Eur. Trans. Telecommun., vol. 13, no. 1, pp. 5-22, Feb. 2002.
    • (2002) Eur. Trans. Telecommun , vol.13 , Issue.1 , pp. 5-22
    • Bhattacharya, S.1    Diot, C.2    Jetcheva, J.3    Taft, N.4
  • 7
    • 0442309490 scopus 로고    scopus 로고
    • Time-varying network tomography: Router link data
    • J. Cao, D. Davis, S. V. Wiel, and B. Yu, "Time-varying network tomography: router link data," J. Amer. Statist. Assoc., vol. 95, pp. 1063-1075, 2000.
    • (2000) J. Amer. Statist. Assoc , vol.95 , pp. 1063-1075
    • Cao, J.1    Davis, D.2    Wiel, S.V.3    Yu, B.4
  • 8
    • 33947221764 scopus 로고    scopus 로고
    • 1997 [Online, Available
    • Configuring OSPF Cisco, 1997 [Online]. Available: http://www.cisco. com/uni-verc/cc/td/doc/product/software/ios113ed/113ed_cr/np1_c/ 1cospf.htm
    • Configuring OSPF Cisco
  • 9
    • 33947271153 scopus 로고    scopus 로고
    • CPLEX Large-Scale Mathematical Programming Software, Online, Available
    • CPLEX Large-Scale Mathematical Programming Software 2003 [Online]. Available: http://www.cplex.com
    • (2003)
  • 10
    • 0035360861 scopus 로고    scopus 로고
    • Trajectory sampling for direct traffic observation
    • Jun
    • N. G. Duffield and M. Grossglauser, "Trajectory sampling for direct traffic observation," IEEE/ACM Trans. Netw., vol. 9, no. 3, pp. 280-292, Jun. 2001.
    • (2001) IEEE/ACM Trans. Netw , vol.9 , Issue.3 , pp. 280-292
    • Duffield, N.G.1    Grossglauser, M.2
  • 11
    • 0035360814 scopus 로고    scopus 로고
    • Deriving traffic demands for operational IP networks: Methodology and experience
    • Jun
    • A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True, "Deriving traffic demands for operational IP networks: methodology and experience," IEEE/ACM Trans. Netw., vol. 9, no. 3, pp. 265-279, Jun. 2001.
    • (2001) IEEE/ACM Trans. Netw , vol.9 , Issue.3 , pp. 265-279
    • Feldmann, A.1    Greenberg, A.2    Lund, C.3    Reingold, N.4    Rexford, J.5    True, F.6
  • 12
    • 0033873349 scopus 로고    scopus 로고
    • Internet traffic engineering by optimizing OSPF weights
    • B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. IEEE INFOCOM, 2000, pp. 519-528.
    • (2000) Proc. IEEE INFOCOM , pp. 519-528
    • Fortz, B.1    Thorup, M.2
  • 13
    • 0036578023 scopus 로고    scopus 로고
    • Optimizing OSPF/IS-IS weights in a changing world
    • May
    • _, "Optimizing OSPF/IS-IS weights in a changing world," IEEE J. Sel. Areas Commun., vol. 20, no. 4, pp. 756-767, May 2002.
    • (2002) IEEE J. Sel. Areas Commun , vol.20 , Issue.4 , pp. 756-767
    • Fortz, B.1    Thorup, M.2
  • 15
    • 51249181779 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica, vol. 4, pp. 373-395, 1984.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.1
  • 18
    • 0033293537 scopus 로고    scopus 로고
    • A case study of multiservice, multipriority traffic engineering design for data networks
    • D. Mitra and K. G. Ramakrishna, "A case study of multiservice, multipriority traffic engineering design for data networks," in Proc. IEEE GLOBECOM, 1999, pp. 1077-1083.
    • (1999) Proc. IEEE GLOBECOM , pp. 1077-1083
    • Mitra, D.1    Ramakrishna, K.G.2
  • 23
    • 33947263408 scopus 로고    scopus 로고
    • Internet Traffic Engineering Working Group, Online, Available
    • Internet Traffic Engineering Working Group, 2003 [Online]. Available: http://www.ietf.org/html.charters/OLD/tewg-charter.html
    • (2003)


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