메뉴 건너뛰기




Volumn 18, Issue 6, 2010, Pages 1988-1999

Fast recovery from dual-link or single-node failures in IP networks using tunneling

Author keywords

Failure recovery; independent trees; IP fast reroute; multiple link failure; network protection; node failure

Indexed keywords

FAILURE RECOVERY; INDEPENDENT TREES; IP FAST REROUTE; MULTIPLE LINKS; NETWORK PROTECTION; NODE FAILURE;

EID: 84866024412     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2010.2055887     Document Type: Article
Times cited : (38)

References (32)
  • 4
    • 8344288174 scopus 로고    scopus 로고
    • Proactive vs. reactive approaches to failure resilient routing
    • Mar.
    • S. Lee, Y. Yu, S. Nelakuditi, Z.-L. Zhang, and C.-N. Chuah, "Proactive vs. reactive approaches to failure resilient routing, " in Proc. IEEE INFOCOM, Mar. 2004, vol. 1, pp. 176-186.
    • (2004) Proc. IEEE INFOCOM , vol.1 , pp. 176-186
    • Lee, S.1    Yu, Y.2    Nelakuditi, S.3    Zhang, Z.-L.4    Chuah, C.-N.5
  • 5
    • 34247578542 scopus 로고    scopus 로고
    • Linear time distributed construction of colored trees for disjoint multipath routing
    • Jul
    • S. Ramasubramanian, M. Harkara, and M. Krunz, "Linear time distributed construction of colored trees for disjoint multipath routing, " Comput. Netw. J., vol. 51, no. 10, pp. 2854-2866, Jul. 2007.
    • (2007) Comput. Netw. J. , vol.51 , Issue.10 , pp. 2854-2866
    • Ramasubramanian, S.1    Harkara, M.2    Krunz, M.3
  • 10
    • 0003205663 scopus 로고    scopus 로고
    • IP encapsulation within IP
    • Oct
    • C. Perkins, "IP encapsulation within IP, " RFC 2003, Oct. 1996.
    • (1996) RFC 2003
    • Perkins, C.1
  • 13
    • 70449613172 scopus 로고    scopus 로고
    • Basic specification for IP fast reroute: Loopfree alternates
    • Sep
    • A. Atlas and A. Zinin, "Basic specification for IP fast reroute: Loopfree alternates, " RFC5286, Sep. 2008.
    • (2008) RFC5286
    • Atlas, A.1    Zinin, A.2
  • 14
    • 2942560520 scopus 로고    scopus 로고
    • Resilient routing using MPLS and ECMP
    • Phoenix, AZ, Apr.
    • A. Iselt, A. Kirstadter, A. Pardigon, and T. Schwabe, "Resilient routing using MPLS and ECMP, " in Proc. HPSR, Phoenix, AZ, Apr. 2004, pp. 345-349.
    • (2004) Proc. HPSR , pp. 345-349
    • Iselt, A.1    Kirstadter, A.2    Pardigon, A.3    Schwabe, T.4
  • 15
    • 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 Proc. ISCOM, 1999.
    • (1999) Proc. ISCOM
    • Narvaez, P.1    Siu, K.Y.2
  • 16
    • 0034845258 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 Proc. IEEE ICC, Helsinki, Finland, Jun. 2001, vol. 5, pp. 1566-1570.
    • (2001) Proc. IEEE ICC , vol.5 , pp. 1566-1570
    • Rabbat, R.1    Siu, K.-Y.2
  • 17
    • 27544482794 scopus 로고    scopus 로고
    • Two routing algorithms for failure protection in IP networks
    • Jun.
    • C. Reichert, Y. Glickmann, and T. Magedanz, "Two routing algorithms for failure protection in IP networks, " in Proc. 10th IEEE ISCC, Jun. 2005, pp. 97-102.
    • (2005) Proc. 10th IEEE ISCC , pp. 97-102
    • Reichert, C.1    Glickmann, Y.2    Magedanz, T.3
  • 18
    • 77953256045 scopus 로고    scopus 로고
    • IP fast reroute framework
    • Jan
    • M. Shand and S. Bryant, "IP fast reroute framework, " RFC 5714, Jan. 2010.
    • (2010) RFC 5714
    • Shand, M.1    Bryant, S.2
  • 19
    • 35248817409 scopus 로고    scopus 로고
    • Failure insensitive routing for ensuring service availability
    • Jun., Lecture Notes in Computer Science 2707
    • S. Nelakuditi et al., "Failure insensitive routing for ensuring service availability, " in Proc. IWQoS, Jun. 2003, Lecture Notes in Computer Science 2707, pp. 287-304.
    • (2003) Proc. IWQoS , pp. 287-304
    • Nelakuditi, S.1
  • 20
    • 38549113375 scopus 로고    scopus 로고
    • Fast proactive recovery from concurrent failures
    • Jun.
    • A. F. Hansen, O. Lysne, T. ? Ci?cic, and S. Gjessing, "Fast proactive recovery from concurrent failures, " in Proc. IEEE ICC, Jun. 2007, pp. 115-122.
    • (2007) Proc. IEEE ICC , pp. 115-122
    • Hansen, A.F.1    Lysne, O.2    Cicic, T.3    Gjessing, S.4
  • 22
    • 84877929969 scopus 로고    scopus 로고
    • Layer 2 tunnelling protocol-Version 3 (L2TPv3)
    • Mar
    • J. Lau, M. Townsley, and I. Goyret, "Layer 2 tunnelling protocol-Version 3 (L2TPv3), " RFC 3931, Mar. 2005.
    • (2005) RFC 3931
    • Lau, J.1    Townsley, M.2    Goyret, I.3
  • 23
    • 56749159237 scopus 로고    scopus 로고
    • On improving the efficiency and manageability of NotVia
    • A. Li, P. Francois, and X.Yang, "On improving the efficiency and manageability of NotVia, " in Proc. ACM CoNEXT, 2007, Article no. 26.
    • (2007) Proc. ACM CoNEXT , pp. 26
    • Li, A.1    Francois, P.2    Yang, X.3
  • 25
    • 33745900758 scopus 로고    scopus 로고
    • Distributed linear time construction of colored trees for disjoint multipath routing
    • Coimbra, Portugal, May
    • S. Ramasubramanian, M. Harkara, and M. Krunz, "Distributed linear time construction of colored trees for disjoint multipath routing, " in Proc. IFIP Netw., Coimbra, Portugal, May 2006, pp. 1026-1038.
    • (2006) Proc. IFIP Netw. , pp. 1026-1038
    • Ramasubramanian, S.1    Harkara, M.2    Krunz, M.3
  • 26
    • 61449186473 scopus 로고    scopus 로고
    • Maintaining colored trees for disjoint multipath routing under node failures
    • Feb
    • G. Jayavelu, S. Ramasubramanian, and O. Younis, "Maintaining colored trees for disjoint multipath routing under node failures, " IEEE/ACM Trans. Netw., vol. 17, no. 1, pp. 346-359, Feb. 2009.
    • (2009) IEEE/ACM Trans. Netw. , vol.17 , Issue.1 , pp. 346-359
    • Jayavelu, G.1    Ramasubramanian, S.2    Younis, O.3
  • 27
    • 0001243769 scopus 로고
    • Dividing a graph into triconnected components
    • J. Hopcroft and R. E. Tarjan, "Dividing a graph into triconnected components, " SIAM J. Comput., vol. 2, no. 3, pp. 135-158, 1973.
    • (1973) SIAM J. Comput. , vol.2 , Issue.3 , pp. 135-158
    • Hopcroft, J.1    Tarjan, R.E.2
  • 28
    • 0039903078 scopus 로고
    • A structural characterization of planar combinatorial graphs
    • S. M. Lane, "A structural characterization of planar combinatorial graphs, " Duke Math J., vol. 3, no. 3, pp. 460-472, 1937.
    • (1937) Duke Math J. , vol.3 , Issue.3 , pp. 460-472
    • Lane, S.M.1
  • 29
    • 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 J. Comput., vol. 22, no. 1, pp. 11-28, 1993.
    • (1993) SIAM J. Comput. , vol.22 , Issue.1 , pp. 11-28
    • Galil, Z.1    Italiano, G.F.2
  • 30
    • 0141917670 scopus 로고    scopus 로고
    • Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundanttrees
    • Oct
    • G. Xue, L. Chen, and K. Thulasiraman, "Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundanttrees, " IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1332-1345, Oct. 2003.
    • (2003) IEEE J. Sel. Areas Commun. , vol.21 , Issue.8 , pp. 1332-1345
    • Xue, G.1    Chen, L.2    Thulasiraman, K.3
  • 31


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