메뉴 건너뛰기




Volumn , Issue , 2010, Pages 291-302

R3: Resilient routing reconfiguration

Author keywords

network resiliency; routing; routing protection

Indexed keywords


EID: 78149334879     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1851182.1851218     Document Type: Conference Paper
Times cited : (81)

References (46)
  • 2
    • 36949032875 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, June 2004.
    • Proc. ACM SIGMETRICS, June 2004
    • Applegate, D.1    Breslau, L.2    Cohen, E.3
  • 3
    • 14944346958 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, Aug. 2003.
    • Proc. ACM SIGCOMM, Aug. 2003
    • Applegate, D.1    Cohen, E.2
  • 7
    • 78149288569 scopus 로고    scopus 로고
    • CAIDA. http://www.caida.org/tools/.
  • 10
    • 33846902581 scopus 로고    scopus 로고
    • A Path Computation Element (PCE)-based Architecture
    • Aug.
    • A. Farrel, J.-P. Vasseur, and J. Ash. A Path Computation Element (PCE)-based Architecture, RFC 4655, Aug. 2006.
    • (2006) RFC , vol.4655
    • Farrel, A.1    Vasseur, J.-P.2    Ash, J.3
  • 15
    • 33645762992 scopus 로고    scopus 로고
    • Achieving sub-second IGP convergence in large IP networks
    • P. Francois, C. Filsfils, J. Evans, and O. Bonaventure. Achieving sub-second IGP convergence in large IP networks. ACM CCR, 35(3), 2005.
    • (2005) ACM CCR , vol.35 , Issue.3
    • Francois, P.1    Filsfils, C.2    Evans, J.3    Bonaventure, O.4
  • 19
    • 84876279617 scopus 로고    scopus 로고
    • Dynamic load balancing without packet reordering
    • S. Kandula, D. Katabi, S. Sinha, and A. Berger. Dynamic load balancing without packet reordering. SIGCOMM CCR, 37(2), 2007.
    • (2007) SIGCOMM CCR , vol.37 , Issue.2
    • Kandula, S.1    Katabi, D.2    Sinha, S.3    Berger, A.4
  • 20
    • 0242270899 scopus 로고    scopus 로고
    • Routing restorable bandwidth guaranteed connections using maximum 2-route flows
    • K. Kar, M. S. Kodialam, and T. V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route flows. IEEE/ACM Transactions on Networking, 11(5):772-781, 2003.
    • (2003) IEEE/ACM Transactions on Networking , vol.11 , Issue.5 , pp. 772-781
    • Kar, K.1    Kodialam, M.S.2    Lakshman, T.V.3
  • 21
    • 0035024186 scopus 로고    scopus 로고
    • Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information
    • M. Kodialam and T. V. Lakshman. Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information. In Proc. IEEE INFOCOM, Apr. 2001.
    • Proc. IEEE INFOCOM, Apr. 2001
    • Kodialam, M.1    Lakshman, T.V.2
  • 23
    • 8344273520 scopus 로고    scopus 로고
    • A simple traffic independent scheme for enabling restoration oblivious routing of resilient connections
    • M. Kodialam, T. V. Lakshman, and S. Sengupta. A simple traffic independent scheme for enabling restoration oblivious routing of resilient connections. In Proc. IEEE INFOCOM, Apr. 2004.
    • Proc. IEEE INFOCOM, Apr. 2004
    • Kodialam, M.1    Lakshman, T.V.2    Sengupta, S.3
  • 24
    • 0038155496 scopus 로고    scopus 로고
    • Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information
    • M. S. Kodialam and T. V. Lakshman. Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information. IEEE/ACM Transactions on Networking, 11(3):399-410, 2003.
    • (2003) IEEE/ACM Transactions on Networking , vol.11 , Issue.3 , pp. 399-410
    • Kodialam, M.S.1    Lakshman, T.V.2
  • 32
    • 22144460045 scopus 로고    scopus 로고
    • (IETF Internet-Draft), draft-ietf-rtgwg-ipfrr-framework-06.txt
    • M. Shand and S. Bryant. IP fast reroute framework. (IETF Internet-Draft), draft-ietf-rtgwg-ipfrr-framework-06.txt, 2007.
    • (2007) IP Fast Reroute Framework
    • Shand, M.1    Bryant, S.2
  • 36
    • 78149313718 scopus 로고    scopus 로고
    • Telemark. Telemark survey. http://www.telemarkservices.com/, 2006.
    • (2006) Telemark Survey
  • 37
    • 0000415121 scopus 로고
    • A scheme for fast parallel communication
    • L. G. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11(7):350-361, 1982.
    • (1982) SIAM Journal on Computing , vol.11 , Issue.7 , pp. 350-361
    • Valiant, L.G.1
  • 42
    • 78149328605 scopus 로고    scopus 로고
    • Jan.
    • Wired News. The backhoe: A real cyberthreat, Jan. 2006. http://www.wired.com/news/technology/1,70040-0.html.
    • (2006) The Backhoe: A Real Cyberthreat
  • 43
    • 33750312581 scopus 로고    scopus 로고
    • Optimal routing with multiple traffic matrices: Tradeoff between average case and worst case performance
    • C. Zhang, Z. Ge, J. Kurose, Y. Liu, and D. Towsley. Optimal routing with multiple traffic matrices: Tradeoff between average case and worst case performance. In Proc. ICNP, Nov. 2005.
    • Proc. ICNP, Nov. 2005
    • Zhang, C.1    Ge, Z.2    Kurose, J.3    Liu, Y.4    Towsley, D.5


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