메뉴 건너뛰기




Volumn 12, Issue 6, 2004, Pages 1105-1118

Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels

Author keywords

Integer linear programming (ILP); Segment shared protection (SSP); Shared risk link group (SRLG); Survivable routing; Working and protection paths

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; PROBABILITY;

EID: 11844258235     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2004.838592     Document Type: Article
Times cited : (95)

References (21)
  • 1
    • 0003011630 scopus 로고    scopus 로고
    • "Survivability in optical networks"
    • Nov./Dec
    • D. Zhou and S. Subramaniam, "Survivability in optical networks," IEEE Network, vol. 14, pp. 16-23, Nov./Dec. 2000.
    • (2000) IEEE Network , vol.14 , pp. 16-23
    • Zhou, D.1    Subramaniam, S.2
  • 2
    • 0036472886 scopus 로고    scopus 로고
    • "A framework of service guaranteed shared protection for optical networks"
    • Feb
    • P.-H. Ho and H. T. Mouftah, "A framework of service guaranteed shared protection for optical networks," IEEE Commun. Mag., vol. 40, pp. 97-103, Feb. 2002.
    • (2002) IEEE Commun. Mag. , vol.40 , pp. 97-103
    • Ho, P.-H.1    Mouftah, H.T.2
  • 3
    • 0036417769 scopus 로고    scopus 로고
    • "Dynamic establishment of segmented protection paths in single and multi-fiber WDM mesh networks"
    • Boston, MA, Aug
    • C. V. Saradhi and C. S. R. Murthy, "Dynamic establishment of segmented protection paths in single and multi-fiber WDM mesh networks," in Proc. SPIE OPTICOMM, Boston, MA, Aug. 2002, pp. 211-222.
    • (2002) Proc. SPIE OPTICOMM , pp. 211-222
    • Saradhi, C.V.1    Murthy, C.S.R.2
  • 4
    • 0035024186 scopus 로고    scopus 로고
    • "Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information"
    • Anchorage, AK
    • M. Kodialam and T. V. Lakeshman, "Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information," in Proc. IEEE INFOCOM, Anchorage, AK, pp. 376-385.
    • Proc. IEEE INFOCOM , pp. 376-385
    • Kodialam, M.1    Lakeshman, T.V.2
  • 5
    • 0034845259 scopus 로고    scopus 로고
    • "An on-line distributed protection algorithm in WDM networks"
    • C.-F. Su and X. Su, "An on-line distributed protection algorithm in WDM networks," in Proc. Int. Conf. Communications 2001, pp. 1571-1575.
    • (2001) Proc. Int. Conf. Communications , pp. 1571-1575
    • Su, C.-F.1    Su, X.2
  • 6
    • 0043016255 scopus 로고    scopus 로고
    • "Algorithms for computing QoS paths with restoration"
    • San Francisco, CA, Apr
    • Y. Bejerano, Y. Breitbart, A. Orda, R. Rastogi, and A. Srintson, "Algorithms for computing QoS paths with restoration," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 2003, pp. 1435-1445.
    • (2003) Proc. IEEE INFOCOM , pp. 1435-1445
    • Bejerano, Y.1    Breitbart, Y.2    Orda, A.3    Rastogi, R.4    Srintson, A.5
  • 8
    • 84904913062 scopus 로고    scopus 로고
    • "Routing bandwidth guaranteed paths with local restoration in label switched networks"
    • Paris, France, Nov
    • L. Li, M. Buddhikot, C. Chekuri, and K. Guo, "Routing bandwidth guaranteed paths with local restoration in label switched networks," in Proc. 10th IEEE Int. Conf. Network Protocols (ICNP), Paris, France, Nov. 2002, pp. 110-120.
    • (2002) Proc. 10th IEEE Int. Conf. Network Protocols (ICNP) , pp. 110-120
    • Li, L.1    Buddhikot, M.2    Chekuri, C.3    Guo, K.4
  • 10
    • 84904883614 scopus 로고    scopus 로고
    • "An ultra-fast shared path protection scheme - Distributed partial information management, part II"
    • Paris, France, Nov
    • D. Xu, C. Chunming, and Y. Xiong, "An ultra-fast shared path protection scheme - distributed partial information management, part II," in Proc. 10th IEEE Int. Conf. Network Protocols (ICNP), Paris, France, Nov. 2002, pp. 344-353.
    • (2002) Proc. 10th IEEE Int. Conf. Network Protocols (ICNP) , pp. 344-353
    • Xu, D.1    Chunming, C.2    Xiong, Y.3
  • 11
    • 0037904671 scopus 로고    scopus 로고
    • "Achieving fast and bandwidth efficient shared-path protection"
    • Feb
    • Y. Xiong, D. Xu, and C. Qiao, "Achieving fast and bandwidth efficient shared-path protection," J. Lightwave Technol., vol. 21, pp. 365-371, Feb. 2003.
    • (2003) J. Lightwave Technol. , vol.21 , pp. 365-371
    • Xiong, Y.1    Xu, D.2    Qiao, C.3
  • 12
    • 3142783581 scopus 로고    scopus 로고
    • "On optimal diverse routing for shared protection in mesh WDM networks"
    • June
    • P.-H. Ho and H. T. Mouftah, "On optimal diverse routing for shared protection in mesh WDM networks," IEEE Trans. Reliability, vol. 53, pp. 216-225, June 2004.
    • (2004) IEEE Trans. Reliability , vol.53 , pp. 216-225
    • Ho, P.-H.1    Mouftah, H.T.2
  • 13
    • 1642453175 scopus 로고    scopus 로고
    • "On-line routing algorithm with shared protection in WDM networks"
    • Budapest, Hungary, Feb
    • J. Tapolcai and T. Cinkler, "On-line routing algorithm with shared protection in WDM networks," in Proc. ONDM, Budapest, Hungary, Feb. 2003, pp. 351-364.
    • (2003) Proc. ONDM , pp. 351-364
    • Tapolcai, J.1    Cinkler, T.2
  • 14
    • 0242302643 scopus 로고    scopus 로고
    • "Efficient distributed path selection for shared restoration connections"
    • Oct
    • G. Li, D. Wang, C. Kalmanek, and R. Doverspike, "Efficient distributed path selection for shared restoration connections," IEEE Trans. Networking, vol. 11, pp. 761-771, Oct. 2003.
    • (2003) IEEE Trans. Networking , vol.11 , pp. 761-771
    • Li, G.1    Wang, D.2    Kalmanek, C.3    Doverspike, R.4
  • 15
    • 0035000852 scopus 로고    scopus 로고
    • "Approximating optimal spare capacity allocation by successive survivable routing"
    • Apr
    • Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proc. IEEE INFOCOM, vol. 2, Apr. 2001, pp. 699-708.
    • (2001) Proc. IEEE INFOCOM , vol.2 , pp. 699-708
    • Liu, Y.1    Tipper, D.2    Siripongwutikorn, P.3
  • 16
    • 11844282497 scopus 로고    scopus 로고
    • "Comparison of centralized and distributed provisioning of lightpaths in mesh optical networks"
    • Anaheim, CA, Mar
    • R. Ramamurthy, S. Sengupta, and S. Chaudhuri, "Comparison of centralized and distributed provisioning of lightpaths in mesh optical networks," in Proc. OFC, Anaheim, CA, Mar. 2001, pp. MH4-1-MH4-3.
    • (2001) Proc. OFC
    • Ramamurthy, R.1    Sengupta, S.2    Chaudhuri, S.3
  • 17
    • 0036343704 scopus 로고    scopus 로고
    • "Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures"
    • New York, June
    • E. Bouillet, J.-F. Labourdette, G. Ellina, R. Ramamurthy, and S. Chaudhuri, "Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures," in Proc. IEEE INFOCOM New York, June 2002, pp. 801-807.
    • (2002) Proc. IEEE INFOCOM , pp. 801-807
    • Bouillet, E.1    Labourdette, J.-F.2    Ellina, G.3    Ramamurthy, R.4    Chaudhuri, S.5
  • 18
    • 0036346350 scopus 로고    scopus 로고
    • "Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I"
    • New York, June
    • C. Qiao and D. Xu, "Distributed Partial Information Management (DPIM) schemes for survivable networks - part I," in Proc. IEEE INFOCOM, New York, June 2002, pp. 302-311.
    • (2002) Proc. IEEE INFOCOM , pp. 302-311
    • Qiao, C.1    Xu, D.2
  • 19
    • 0021441708 scopus 로고
    • "A quick method for finding shortest pairs of disjoint paths"
    • J. W. Surrballe and R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, no. 2, pp. 325-336, 1984.
    • (1984) Networks , vol.14 , Issue.2 , pp. 325-336
    • Surrballe, J.W.1    Tarjan, R.E.2
  • 21
    • 0035171790 scopus 로고    scopus 로고
    • "A heuristic routing algorithm for shared protection in connection-oriented networks"
    • Denver, Co, Aug
    • S. Yuan and J. P. Jue, "A heuristic routing algorithm for shared protection in connection-oriented networks," in Proc. SPIE OPTCOMM vol. 4599, Denver, Co, Aug. 2001, pp. 142-152.
    • (2001) Proc. SPIE OPTCOMM , vol.4599 , pp. 142-152
    • Yuan, S.1    Jue, J.P.2


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