메뉴 건너뛰기




Volumn , Issue , 2005, Pages 554-560

Fast recovery from link failures using resilient routing layers

Author keywords

[No Author keywords available]

Indexed keywords

FAST RECOVERY; NETWORK TOPOLOGY; RESILIENT ROUTING LAYERS (RRL);

EID: 27544434363     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2005.70     Document Type: Conference Paper
Times cited : (27)

References (22)
  • 1
    • 0034864198 scopus 로고    scopus 로고
    • A heuristic approach to service restoration in MPLS networks
    • June
    • R. Bartos and M. Raman. A heuristic approach to service restoration in MPLS networks. In Proc. ICC, pages 117-121, June 2001.
    • (2001) Proc. ICC , pp. 117-121
    • Bartos, R.1    Raman, M.2
  • 2
    • 0034781799 scopus 로고    scopus 로고
    • Stability issues in ospf routing
    • San Diego, California, USA, August
    • A. Basu and J. G. Riecke. Stability issues in ospf routing. In Proceedings of SIGCOMM 2001, pages 225-236, San Diego, California, USA, August 2001.
    • (2001) Proceedings of SIGCOMM 2001 , pp. 225-236
    • Basu, A.1    Riecke, J.G.2
  • 3
    • 0036349136 scopus 로고    scopus 로고
    • On distinguishing between internet power law topology generators
    • New York, June
    • T. Bu and D. Towsley. On distinguishing between internet power law topology generators. In IEEE INFOCOM, pages 638-647, New York, June 2002.
    • (2002) IEEE INFOCOM , pp. 638-647
    • Bu, T.1    Towsley, D.2
  • 7
    • 14944386210 scopus 로고    scopus 로고
    • A first-principles approach to understanding the internet's router-level topology
    • Portland, OR, Aug.
    • L. Li et al. A first-principles approach to understanding the internet's router-level topology, In ACM SIGCOMM, Portland, OR, Aug. 2004.
    • (2004) ACM SIGCOMM
    • Li, L.1
  • 8
    • 17444417124 scopus 로고    scopus 로고
    • A fast rerouting scheme for OSPF/IS-IS networks
    • Chicago, Illinois, USA, Oct.
    • Y. Liu and N. Reddy. A fast rerouting scheme for OSPF/IS-IS networks. In Proceedings of ICCCN 2004, pages 47-52, Chicago, Illinois, USA, Oct. 2004.
    • (2004) Proceedings of ICCCN 2004 , pp. 47-52
    • Liu, Y.1    Reddy, N.2
  • 9
    • 26444462927 scopus 로고    scopus 로고
    • Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
    • Oct.
    • M. Medard, S. G. Finn, and R. A. Barry. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Networking, 7(5):641-652, Oct. 1999.
    • (1999) IEEE/ACM Transactions on Networking , vol.7 , Issue.5 , pp. 641-652
    • Medard, M.1    Finn, S.G.2    Barry, R.A.3
  • 10
    • 0034836055 scopus 로고    scopus 로고
    • BRITE: An approach to universal topology generation
    • Aug.
    • A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: An approach to universal topology generation. In IEEE MASCOTS, pages 346-353, Aug. 2001.
    • (2001) IEEE MASCOTS , pp. 346-353
    • Medina, A.1    Lakhina, A.2    Matta, I.3    Byers, J.4
  • 11
    • 0035699585 scopus 로고    scopus 로고
    • New dynamic SPT algorithm based on a ball-and-string model
    • P. Narvaez et al. New dynamic SPT algorithm based on a ball-and-string model. IEEE/ACM Trans. Netw., 9(6):706-718, 2001.
    • (2001) IEEE/ACM Trans. Netw. , vol.9 , Issue.6 , pp. 706-718
    • Narvaez, P.1
  • 13
    • 0037983821 scopus 로고    scopus 로고
    • Fast reroute extensions to RSVP-TE for LSP tunnels
    • Aug. draft-ietf-mpls-rsvp-lsp-fastreroute-07.txt
    • P. Pan, G. Swallow, and A. Atlas. Fast reroute extensions to RSVP-TE for LSP tunnels. Internet Draft, Aug. 2004. draft-ietf-mpls-rsvp-lsp-fastreroute-07. txt.
    • (2004) Internet Draft
    • Pan, P.1    Swallow, G.2    Atlas, A.3
  • 14
    • 0034845258 scopus 로고    scopus 로고
    • Restoration methods for traffic engineered networks for loop-free routing guarantees
    • Helsinki, Finland, June
    • R. Rabbat and K.-Y. Siu. Restoration methods for traffic engineered networks for loop-free routing guarantees. In International Conference on Communications ICC 2001, Helsinki, Finland, June 2001.
    • (2001) International Conference on Communications ICC 2001
    • Rabbat, R.1    Siu, K.-Y.2
  • 15
    • 27544456123 scopus 로고    scopus 로고
    • See http://www.cs.washington.edu.
  • 19
    • 36049033090 scopus 로고
    • Algorithms for finding an optimal set of short disjoint paths in a communication network
    • Nov.
    • D. Torrieri. Algorithms for finding an optimal set of short disjoint paths in a communication network. IEEE Transactions on Communications, 40:1698-1702, Nov. 1992.
    • (1992) IEEE Transactions on Communications , vol.40 , pp. 1698-1702
    • Torrieri, D.1
  • 22
    • 0036967586 scopus 로고    scopus 로고
    • Delay reduction in redundant trees for pre-planned protection against single link/node failure in 2-connected graphs
    • G. Xue et al. Delay reduction in redundant trees for pre-planned protection against single link/node failure in 2-connected graphs. In IEEE GLOBECOM2002: (Optical Networking Symposium), pages 2691-2695, 2002.
    • (2002) IEEE GLOBECOM2002: (Optical Networking Symposium) , pp. 2691-2695
    • Xue, G.1


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