메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1368-1376

Fast recovery from dual link failures in IP networks

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED GRAPH; DUAL-LINK FAILURES; FAILED LINKS; FAST RECOVERY; IP NETWORKS; LINK FAILURES; NETWORK TOPOLOGY; NEXT-HOP; PROTECTION GRAPH; ROUTING APPROACH; TWO-LINK;

EID: 70349656264     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062052     Document Type: Conference Paper
Times cited : (42)

References (21)
  • 8
    • 77949935853 scopus 로고    scopus 로고
    • Efficient algorithms for multi-path link state routing
    • P. Narvaez and K. Y. Siu, "Efficient algorithms for multi-path link state routing," in Proceedings of ISCOM, 1999.
    • (1999) Proceedings of ISCOM
    • Narvaez, P.1    Siu, K.Y.2
  • 9
    • 70349722643 scopus 로고    scopus 로고
    • Restoration methods for traffic engineered networks for loop-free routing guarantees
    • Helsinki, Finland, Jun
    • R. Rabbat and K.-Y. Siu, "Restoration methods for traffic engineered networks for loop-free routing guarantees," in Proceedings of ICC, Helsinki, Finland, Jun. 2001.
    • (2001) Proceedings of ICC
    • Rabbat, R.1    Siu, K.-Y.2
  • 11
    • 22144460045 scopus 로고    scopus 로고
    • IETF Internet Draft, Feb, draft-ietf-rtgwg-ipfrr-framework-08.txt
    • M. Shand and S. Bryant, "IP Fast Reroute Framework," IETF Internet Draft, Feb. 2008, draft-ietf-rtgwg-ipfrr-framework-08.txt.
    • (2008) IP Fast Reroute Framework
    • Shand, M.1    Bryant, S.2
  • 12
    • 35248817409 scopus 로고    scopus 로고
    • Failure insensitive routing for ensuring service availability
    • IWQoS'03, Jun
    • S. Nelakuditi et al., "Failure insensitive routing for ensuring service availability," in IWQoS'03 Lecture Notes in Computer Science 2707, Jun. 2003.
    • (2003) Lecture Notes in Computer Science , vol.2707
    • Nelakuditi, S.1
  • 15
  • 16
    • 34547267603 scopus 로고    scopus 로고
    • Distributed linear time construction of colored trees for disjoint multlipath routing
    • May
    • S. Ramasubramanian, M. Harkara, and M. Krunz, "Distributed linear time construction of colored trees for disjoint multlipath routing," in Proceedings of IFIP Networking, May 2006.
    • (2006) Proceedings of IFIP Networking
    • Ramasubramanian, S.1    Harkara, M.2    Krunz, M.3
  • 18
    • 0001243769 scopus 로고
    • Dividing a graph into triconnected components
    • J. Hopcroft and R. E. Tarjan, "Dividing a graph into triconnected components," in SIAM Journal of Computing, vol. 2, no. 3, 1973, pp. 135-158.
    • (1973) SIAM Journal of Computing , vol.2 , Issue.3 , pp. 135-158
    • Hopcroft, J.1    Tarjan, R.E.2
  • 19
    • 0039903078 scopus 로고
    • A structural characterization of planar combinatorial graphs
    • S. M. Lane, "A structural characterization of planar combinatorial graphs," Duke Math Journal, vol. 3, no. 3, pp. 460-472, 1937.
    • (1937) Duke Math Journal , vol.3 , Issue.3 , pp. 460-472
    • Lane, S.M.1
  • 20
    • 0027544810 scopus 로고
    • Maintaining the 3-edge-connected components of a graph on-line
    • Z. Galil and G. F. Italiano, "Maintaining the 3-edge-connected components of a graph on-line," SIAM Journal of Computing, vol. 22, no. 1, pp. 11-28, 1993.
    • (1993) SIAM Journal of Computing , vol.22 , Issue.1 , pp. 11-28
    • Galil, Z.1    Italiano, G.F.2


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