Skip to main content
SpringerLink
Log in

Insights for segment protection in survivable WDM mesh networks with SRLG constraints

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

Segment protection has been recognized as an efficient way to avoid “traps” in survivable WDM mesh network. In this article, we present some insights on this kind of protection. We first prove the correctness of segment protection used for avoiding traps. We then investigate the effect of the number of segments on the blocking performance in several typical real networks (includes middle and large networks). We find that, in most cases, it is sufficient to use two backup segments to protect a given active path. Based on this observation, we then propose a novel and efficient segment protection algorithm, called two-segment (TS), which has a lower-computational complexity and comparative performance than existing algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Mukherjee B. (1997). Optical Communication Networks. Mc-Graw-Hill, New York

    Google Scholar 

  2. Strand J. and Chiu A.L. (2001). Issues for routing in the optical layer. IEEE Commun. Mag. 39: 81–87

    Article  Google Scholar 

  3. Papadimitriou, D., et al.: Inference of shared risk link groups, in Internet draft, work in progress, November 2001

  4. Hu J. (2003). Diverse routing in optical mesh networks. IEEE Trans. Commun. 51(3): 489–494

    Article  Google Scholar 

  5. Xu D., Xiong Y., Qiao C. and Li G. (2003). Trap avoidance and protection schemes in networks with shared risk link groups. IEEE J. Lightwave Technol. 21(11): 2683–2693

    Article  Google Scholar 

  6. Xu D., Xiong Y. and Qiao C. (2003). Novel algorithms for shared segment protection. IEEE J. Selected Areas Commun. 21(8): 1320–1331

    Article  Google Scholar 

  7. Oki E., Matsuura N., Shiomoto K. and Yamanaka N. (2002). A disjoint path selection scheme with shared risk link groups in GMPLS networks. IEEE Commun. Lett. 6(9): 406–408

    Article  Google Scholar 

  8. Xu, D., Xiong, Y., Qiao, C.: A new PROMISE algorithm in networks with shared risk link groups. In: Proceedings. IEEE GLOBECOM 03, (2003) vol. 5, pp. 2536–2540

  9. Shen L., Yang X. and Ramamurthy B. (2004). Shared risk link group (SRLG) – diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks. IEEE/ACM Trans. Network 13(4): 918–931

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Communications and Information Engineering, University of Electronic Science and Technology of China, Chengdu, 610054, China

    Hongbin Luo, Lemin Li & Hongfang Yu

  2. School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, 610 054, China

    Hongbin Luo

Authors
  1. Hongbin Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lemin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hongfang Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongbin Luo.

Additional information

An earlier version of this manuscript was presented at the symposium Advanced Technologies and Protocols for Optical Networks (ATPON) of IEEE GLOBECOM06.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Luo, H., Li, L. & Yu, H. Insights for segment protection in survivable WDM mesh networks with SRLG constraints. Photon Netw Commun 14, 361–368 (2007). https://doi.org/10.1007/s11107-007-0078-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-007-0078-x

Keywords

Search

Navigation