Skip to main content
SpringerLink
Log in

Incremental survivable network design with topology augmentation in SDH/SONET mesh networks

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

An incremental capacity allocation with topology augmentation problem is investigated in this article to maximize the service restorability in SDH/SONET mesh networks. To tackle the optimal design problem, two schemes are proposed, i.e., minimal backup path provisioning with topology augmentation (MBPP-TA), and global path pair provisioning with topology augmentation (GPPP-TA). Both schemes are formulated as integer linear programming (ILP) models, and are implemented using the proposed two-step linear programming (LP) approaches. Numerical results show that the two-step LP approaches achieve better solutions with significantly less execution time than the direct ILP approach. Moreover, results show that GPPP-TA provides better solutions than MBPP-TA at the cost of longer computation time.

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. Hwang, D., Chiu, A., Li, G.: Dynamic incremental design for telecom networks. In: Proceedings of IEEE/OSA OFC/NFOEC, NTuD2, February 2008

  2. Medhi D.: A unified approach to network survivability for teletraffic networks: models, algorithms and analysis. IEEE Trans. Commun. 42, 534–548 (1994)

    Article  Google Scholar 

  3. Grover W.D.: Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking. Prentice-Hall PTR, Upper Saddle River, NJ (2004)

    Google Scholar 

  4. Pióro M., Medhi D.: Routing,Flow,and Capacity Design in Communication and Computer Networks. Elsevier/Morgen Kaufann, Amsterdam, NL (2004)

    MATH  Google Scholar 

  5. Yu, J., Yamashita, I., Seikai, S., Kitayama, K.: Capacity planning of survivable wavelength-routed networks for increase of traffic loads. In: Proceedings of IEEE/OSA OFC/NFOEC, OThS3, March 2005

  6. Shen, G., Tucker, R.S.: Capacity allocation in optical networks under dynamic lightpath demands. In: Proceedings of IEEE/OSA OFC/NFOEC, OWA7, February 2008

  7. Yen J.Y.: Finding the K shortest loopless paths in a network. INFORMS Manag. Sci. 17, 712–716 (1971)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory on Integrated Optoelectronics, Tsinghua University, Beijing, 100084, P. R. China

    Qingshan Li, Wenda Ni, Yanhe Li, Xiaoping Zheng & Hanyi Zhang

  2. Tsinghua National Laboratory for Information Science and Technology, Tsinghua University, Beijing, 100084, People’s Republic of China

    Qingshan Li, Wenda Ni, Yanhe Li, Xiaoping Zheng & Hanyi Zhang

  3. Department of Electronic Engineering, Tsinghua University, Beijing, 100084, People’s Republic of China

    Qingshan Li, Wenda Ni, Yanhe Li, Xiaoping Zheng & Hanyi Zhang

Authors
  1. Qingshan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenda Ni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yanhe Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaoping Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hanyi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qingshan Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, Q., Ni, W., Li, Y. et al. Incremental survivable network design with topology augmentation in SDH/SONET mesh networks. Photon Netw Commun 18, 400–408 (2009). https://doi.org/10.1007/s11107-009-0202-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-009-0202-1

Keywords

Search

Navigation