메뉴 건너뛰기




Volumn , Issue , 2003, Pages 305-309

Efficient construction of virtual p-cycles protecting all cycle-protectible working links

Author keywords

p cycles; Protection and restoration; single link node failure

Indexed keywords

ALGORITHMS;

EID: 57249117078     PISSN: 23255595     EISSN: 23255609     Source Type: Conference Proceeding    
DOI: 10.1109/HPSR.2003.1226723     Document Type: Conference Paper
Times cited : (7)

References (27)
  • 1
    • 85116406627 scopus 로고    scopus 로고
    • Dynamic establishment of protection paths in WDM networks, Part i
    • V. Anand and C. Qiao, Dynamic establishment of protection paths in WDM networks, Part I, IEEE IC3N'2000, pp. 198-204.
    • (2000) IEEE IC3N , pp. 198-204
    • Anand, V.1    Qiao, C.2
  • 2
    • 0034291291 scopus 로고    scopus 로고
    • Protection cycles in mesh WDM networks
    • G. Ellinas, G. Halemariam, and T. Stern, Protection cycles in mesh WDM networks, IEEE JSAC, Vol. 18 (2000), pp. 1924-1937.
    • (2000) IEEE JSAC , vol.18 , pp. 1924-1937
    • Ellinas, G.1    Halemariam, G.2    Stern, T.3
  • 4
    • 0031628329 scopus 로고    scopus 로고
    • Cycle-oriented distributed preconfigu-ration: Ring-like speed with mesh-like capacity for self-planning network restoration
    • W.D. Grover and D. Stamatelakis, Cycle-oriented distributed preconfigu-ration: ring-like speed with mesh-like capacity for self-planning network restoration, ICC1998, pp. 537-543.
    • (1998) ICC , pp. 537-543
    • Grover, W.D.1    Stamatelakis, D.2
  • 5
    • 0034292038 scopus 로고    scopus 로고
    • P layer restoration and network planning based on virtual protection cycles
    • W.D. Grover and D. Stamatelakis, P layer restoration and network planning based on virtual protection cycles, IEEE JS AC, Vol. 18(2000), pp. 1938-1949.
    • (2000) IEEE JS AC , vol.18 , pp. 1938-1949
    • Grover, W.D.1    Stamatelakis, D.2
  • 6
    • 0036472886 scopus 로고    scopus 로고
    • A framework of service guaranteed shared protection for optical networks
    • P.H. Ho and H.T. Mouftah, A framework of service guaranteed shared protection for optical networks, IEEE Communications Magazine, Vol. 40, No. 2(2002), pp. 97-103.
    • (2002) IEEE Communications Magazine , vol.40 , Issue.2 , pp. 97-103
    • Ho, P.H.1    Mouftah, H.T.2
  • 7
    • 0036872570 scopus 로고    scopus 로고
    • A novel distributed control protocol in dynamic wavelength-routed optical networks
    • 15
    • P.H. Ho and H.T. Mouftah, A novel distributed control protocol in dynamic wavelength-routed optical networks, IEEE Communications Magazine, Vol. 40, No. 11(2002), pp. 38, 15.
    • (2002) IEEE Communications Magazine , vol.40 , Issue.11 , pp. 38
    • Ho, P.H.1    Mouftah, H.T.2
  • 8
    • 0035785168 scopus 로고    scopus 로고
    • Hamiltonian cycle protection: A novel approach to mesh WDM optical network protection
    • H. Huang and J.A. Copeland, Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection, IEEE HPSR'2001, pp. 31-35.
    • (2001) IEEE HPSR , pp. 31-35
    • Huang, H.1    Copeland, J.A.2
  • 9
    • 0036872634 scopus 로고    scopus 로고
    • A series of Hamiltonian cycle-based solutions to provide simple and scalable mesh optical network resilience
    • H. Huang and J.A. Copeland, A series of Hamiltonian cycle-based solutions to provide simple and scalable mesh optical network resilience, IEEE Communications Magazine, Vol. 40, No. 11(2002), pp. 46-51.
    • (2002) IEEE Communications Magazine , vol.40 , Issue.11 , pp. 46-51
    • Huang, H.1    Copeland, J.A.2
  • 10
    • 0002041775 scopus 로고
    • The multi-tree approach to reliability in distributed networks
    • A. Itai and M. Rodeh, The multi-tree approach to reliability in distributed networks, Information and Computation, Vol. 79(1988), pp. 43-59.
    • (1988) Information and Computation , vol.79 , pp. 43-59
    • Itai, A.1    Rodeh, M.2
  • 12
    • 26444462927 scopus 로고    scopus 로고
    • Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
    • M. Medard, S.G. Finn, R.A. Barry and R.G. Gallager, Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs, IEEE Trans, on Networking, Vol. 7(1999), pp. 641-652.
    • (1999) IEEE Trans, on Networking , vol.7 , pp. 641-652
    • Medard, M.1    Finn, S.G.2    Barry, R.A.3    Gallager, R.G.4
  • 13
    • 0035021462 scopus 로고    scopus 로고
    • Survivable routing of logical topologies in WDM networks
    • E. Modiano and A. N. Tarn, Survivable routing of logical topologies in WDM networks, IEEE INFOCOM'2001, pp. xxx-yyy.
    • (2001) IEEE INFOCOM
    • Modiano, E.1    Tarn, A.N.2
  • 15
    • 0034291416 scopus 로고    scopus 로고
    • WDM optical networks: Progress and challenges
    • B. Mukherjee, WDM optical networks: progress and challenges, IEEE JSAC, Vol. 18(2000), pp. 1810-1824.
    • (2000) IEEE JSAC , vol.18 , pp. 1810-1824
    • Mukherjee, B.1
  • 16
    • 0036346350 scopus 로고    scopus 로고
    • Distributed partial information management (DPIM) schemes for survivable networks-Part i
    • C. Qiao and D. Xu, Distributed partial information management (DPIM) schemes for survivable networks-Part I, IEEE INFOCOM2002, pp. 302-311.
    • (2002) IEEE INFOCOM , pp. 302-311
    • Qiao, C.1    Xu, D.2
  • 17
    • 0032674431 scopus 로고    scopus 로고
    • Survivable WDM mesh networks. Part I-Protection
    • I
    • S. Ramamurthy and B. Mukherjee, Survivable WDM mesh networks. Part I-Protection IEEE INFOCOM1999, pp. 744-751. I
    • (1999) IEEE INFOCOM , pp. 744-751
    • Ramamurthy, S.1    Mukherjee, B.2
  • 19
    • 0036173154 scopus 로고    scopus 로고
    • Fault management in IP-over-WDM networks: WDM protection versus IP restoration
    • L. Sahasrabuddhe, S. Ramamurthy and B. Mukherjee, Fault management in IP-over-WDM networks: WDM protection versus IP restoration, IEEE JSAC, Vol. 20(2002), pp. 21-33.
    • (2002) IEEE JSAC , vol.20 , pp. 21-33
    • Sahasrabuddhe, L.1    Ramamurthy, S.2    Mukherjee, B.3
  • 20
    • 0021441708 scopus 로고
    • A quick method for finding shortest pairs of disjoint paths
    • J.W. Suurballe and R.E. Tarjan, A quick method for finding shortest pairs of disjoint paths, Networks, Vol. 14(1984), pp. 325-336.
    • (1984) Networks , vol.14 , pp. 325-336
    • Suurballe, J.W.1    Tarjan, R.E.2
  • 21
    • 0001790593 scopus 로고
    • Depth first search and linear graph algorithms
    • R.E. Tarjan, Depth first search and linear graph algorithms, SIAM Journal on Computing, Vol. 1(1972), pp. 146-160.
    • (1972) SIAM Journal on Computing , vol.1 , pp. 146-160
    • Tarjan, R.E.1
  • 22
    • 0026923144 scopus 로고
    • A novel passive protected SONET bidirectional self-healing ring architecture
    • T.H. Wu and W.I. Way, A novel passive protected SONET bidirectional self-healing ring architecture, Journal of Lightwave Technology, Vol. 10(1992), pp. 1314-1322
    • (1992) Journal of Lightwave Technology , vol.10 , pp. 1314-1322
    • Wu, T.H.1    Way, W.I.2
  • 23
    • 0036283422 scopus 로고    scopus 로고
    • QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs
    • G. Xue, L. Chen and K. Thulasiraman, QoS issues in redundant trees for protection in vertex-redundant or edge-redundant graphs, ICC '2002, pp. 2766-2770.
    • (2002) ICC , pp. 2766-2770
    • Xue, G.1    Chen, L.2    Thulasiraman, K.3
  • 24
    • 0036967586 scopus 로고    scopus 로고
    • Delay reduction in redundant trees for pre-planned protection against single link/node failure in 2-connected graphs
    • G. Xue, L. Chen and K. Thulasiraman, Delay reduction in redundant trees for pre-planned protection against single link/node failure in 2-connected graphs, GLOBECOM'2002, pp. 2691-2695.
    • (2002) GLOBECOM , pp. 2691-2695
    • Xue, G.1    Chen, L.2    Thulasiraman, K.3


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