Path Restoration Versus Link Restoration in Survivable ATM Networks

  • Conference paper
  • First Online:
International Conference on Wireless, Intelligent, and Distributed Environment for Communication (WIDECOM 2018)

Abstract

Network survivability is a critical issue in telecommunication networks due to the increasing dependence of the society on communication systems. Fast restoration from a network failure is an important challenge that deserves attention. This paper addresses an optimal link capacity and flow assignment design problem for survivable asynchronous transfer mode (ATM) networks based on two restoration strategies: a path restoration and a link restoration. Given the projected traffic demands and the network topology, the capacity and flow assignment are jointly optimized to yield the optimal capacity placement and flow allocation. The problem is formulated as a large-scale nonconvex nonlinear multi-commodity flow problem and is solved by a special augmented Lagrangian method (called separable augmented Lagrangian algorithm (SALA)). Several networks with diverse topological characteristics are used in the experiments to compare the two restoration strategies. Numerical results demonstrate that the link restoration strategy requires more capacity than the path restoration strategy when using both symmetric and asymmetric traffic. This strategy also increases the routing cost, the capacity installation cost, and the total network cost.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 117.69
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 160.49
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
EUR 160.49
Price includes VAT (Germany)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Y. **ong, L.G. Masson, Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE/ACM Trans. Networking 7(1), 98–110 (1999)

    Article  Google Scholar 

  2. Y. Liu, D. Tipper, P. Siripongwutikorn, Approximating optimal spare capacity allocation by successive survivable routing. IEEE/ACM Trans. Networking 13(1), 198–211 (2005)

    Article  Google Scholar 

  3. K. Murakami, S. Hyong, Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration. IEEE/ACM Trans. Networking 6(2), 207–221 (1998)

    Article  Google Scholar 

  4. R.P.M. Ferreira, H.P.L. Luna, Discrete capacity and flow assignment algorithms with performance guarantee. Comput. Commun. 26(10), 1056–1069 (2003)

    Article  Google Scholar 

  5. P. Mahey, M.C. De Souza, Local optimality conditions for multicommodity flow problems with separable piecewise convex costs. Oper. Res. Lett. 35(2), 221–226 (2007)

    Article  MathSciNet  Google Scholar 

  6. I. Woungang, M. Guangyan, M.K. Denko, S. Misra, H.-C. Chao, M.S. Obaidat, Survivable ATM mesh networks: Techniques and performance evaluation. J. Syst. Softw. 83(3), 457–466 (2010)

    Article  Google Scholar 

  7. D. Bertsekas, Nonlinear Programming (Athena Scientific, Belmont, 1995)

    MATH  Google Scholar 

  8. A. Hamdi, P. Mahey, J.-P. Dussault, A new decomposition method in non-convex programming, in Recent Advances in Optimization, Lecture Notes in Economics and Mathematical Systems, ed. by P. Gritzmann, R. Horst, E. Sachs, R. Tichatschke (Eds), vol. 452, (1997), pp. 90–104

    Google Scholar 

  9. F. Khandaker, Optimal capacity and flow assignment for self-healing ATM networks based on path restoration: A non-linear model, MSc Thesis, Department of Computer Science, Ryerson University, 29 Aug 2012

    Google Scholar 

  10. A.B.M. Bodrul, Optimal capacity and flow assignment in self-healing ATM networks based on link restoration: A non-linear model, MSc Thesis, Department. Of Computer Science, Ryerson University, 29 Aug 2012

    Google Scholar 

  11. S. Misra, S. Goswami, Network Routing: Fundamentals, Applications, and Emerging Technologies Wiley, UK (2017). ISBN-10: 04-70750065

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Isaac Woungang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gueye, O.M., Woungang, I., Dhurandher, S.K., Khandaker, F., Bodrul Alam, A.B.M. (2018). Path Restoration Versus Link Restoration in Survivable ATM Networks. In: Woungang, I., Dhurandher, S. (eds) International Conference on Wireless, Intelligent, and Distributed Environment for Communication. WIDECOM 2018. Lecture Notes on Data Engineering and Communications Technologies, vol 18. Springer, Cham. https://doi.org/10.1007/978-3-319-75626-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75626-4_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75625-7

  • Online ISBN: 978-3-319-75626-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Navigation