Skip to main content
SpringerLink
Log in

A Parallel Optimization Approach to ATM Network Survivability

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper describes a new model for routing in survivable ATM networks and a new parallel projection algorithm for solving the corresponding optimization problem. The proposed algorithm has application in general linear programming (LP). Numerical results for medium size networks are presented and discussed.

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. D. Alevras, M. Grötschel and R. Wessäly, Capacity and survivability models for telecommunication networks, Preprint SC 97-24. Konrad-Zuse-Zentrum für Informationstechnik (1997).

  2. A. Amiri and H. Pirkul, Primary and secondary route selection in backbone communication networks, European Journal on Operational Research 93(1) (1996) 98-109.

    Google Scholar 

  3. J. Anderson, B.T. Doshi, S. Dravida and P. Harshavardhana, Fast restoration of ATM networks, IEEE Journal on Selected Areas in Communications 12 (1994) 128-138.

    Google Scholar 

  4. J.P. Boyle and R.L. Dykstra, A method for finding projections onto the intersections of convex sets in Hilbert spaces, in: Lecture Notes in Statistics, Vol. 37 (1986) pp. 28-47.

    Google Scholar 

  5. C. Byrne and Y. Censor, Proximity function minimization for separable, jointly convex bregman distances, with applications, Technical report, University of Haifa (February 1998).

  6. R. Cotter, D. Medhi and D. Tipper, Traffic backlog and impact on network dimensioning for survivability for wide-area VP-based ATM networks, in: ITC 15 (Elsevier Science, Amsterdam, 1997) pp. 691-700.

    Google Scholar 

  7. G.B. Dantzig and P. Wolfe, Decomposition principle for linear programs, Operations Research 8 (1960) 101-111.

    Google Scholar 

  8. M.A.H. Dempster, E.A. Medova and R.T. Thompson, A stochastic programming approach to network planning, in: ITC 15 (Elsevier Science, Amsterdam, 1997) pp. 329-339.

    Google Scholar 

  9. D.A. Dunn, W.D. Grover and M.H. MacGregor, Comparison of k-shortest paths and maximum flow routing for network facility restoration, IEEE Journal on Selected Areas in Communications 12 (1994) 88-99.

    Google Scholar 

  10. A. Faragó, S. Blaabjerg, L. Ast, G. Gordos and T. Henk, A new degree of freedom in ATM network dimensioning: Optimizing the logical configuration, IEEE Journal on Selected Areas in Communications (1995) 1199-1206.

  11. H. Fujii and N. Yoshikai, Restoration message transfer mechanism and restoration characteristics of double-search self-healing ATM network, IEEE Journal on Selected Areas in Communications 12 (1994) 149-158.

    Google Scholar 

  12. U.M. García-Palomares, Parallel projected aggregation methods for solving the convex feasibility problem, SIAM Journal on Optimization 3(4) (1993) 882-900.

    Google Scholar 

  13. U.M. García-Palomares, Preconditioning projection methods for solving algebraic linear systems, Numerical Algorithms 21 (1999) 157-164.

    Google Scholar 

  14. U.M. García-Palomares and F.J. González-Castaño, Incomplete projections algorithms for solving the convex feasibility problem, Numerical Algorithms 18 (1998) 177-193.

    Google Scholar 

  15. H.I. Gassman, MSLiP User's Guide, Working paper WP-90-4, School of Business Administration, University of Dalhousie (1990).

  16. M. Gerla, J.A.S. Monteiro and R. Pazos, Topology design and bandwidth allocation in ATM nets, IEEE Journal on Selected Areas in Communications 7 (1989) 1253-1262.

    Google Scholar 

  17. O. Gerstel, I. Cidon and S. Zaks, The layout of virtual paths in ATM networks, IEEE/ACM Transactions on Networking 4 (1996) 873-884.

    Google Scholar 

  18. F.J. González-Castaño, Contribución al encaminamiento óptimo en redes de circuitos virtuales con supervivencia, mediante arquitecturas de memoria distribuida, Ph.D. thesis, Universidad de Vigo (1998).

  19. S. Gupta, On Routing in ATM Networks, in: Routing in Communication Networks (Prentice-Hall, Englewood Cliffs, NJ, 1993).

    Google Scholar 

  20. S.P. Han, A successive projections method, Mathematical Programming 40 (1988) 1-14.

    Google Scholar 

  21. C. Hildreth, A quadratic programming procedure, Naval Research Registers Quarterly 4 (1957) 79-85.

    Google Scholar 

  22. R.R. Iraschko, M.H. McGregor and W.D. Grover, Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks, IEEE/ACMTransactions on Networking 6 (1998) 325-336.

    Google Scholar 

  23. A.N. Iusem and A.R. de Pierro, On the convergence properties of Hildreth's quadratic programming algorithm, Mathematical Programming 47 (1990) 37-51.

    Google Scholar 

  24. A.N. Iusem and B.F. Svaiter, A row-action method for convex programming, Mathematical Programming 64 (1994) 150-171.

    Google Scholar 

  25. P. Kall and S.W. Wallace, Stochastic Programming (Wiley, New York, 1995).

    Google Scholar 

  26. R. Kawamura, K. Sato and I. Tokizawa, Self-healing ATM networks based on virtual path concept, IEEE Journal on Selected Areas in Communications 12 (1994) 120-127.

    Google Scholar 

  27. M.-J. Lee and J.R. Yee, Optimal minimax routing in ATM networks, in: Proc. of IEEE GLOBECOM 90, pp. 501.5.1-505.5.5.

  28. R. de Leone, R. Manlio Gaudioso and M. Flavia Monaco, Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems, Technical report 1080, Computer Sciences Department, University of Wisconsin-Madison (1992).

  29. R. de Leone, R.R. Meyer and S. Kontogiorgis, Alternating direction splittings for block-angular parallel optimization, Technical report CS-TR-94-1217, Computer Science Department, University of Wisconsin-Madison (1994).

  30. O.L. Mangasarian and R.R. Meyer, Nonlinear perturbation of linear programs, SIAM Journal on Control and Optimization 17 (1979) 745-752.

    Google Scholar 

  31. D. Medhi,Models for network design, servicing and monitoring of ATM networks based on the virtual path concept, Computer Networks and ISDN Systems 29 (1997) 373-386.

    Google Scholar 

  32. J.M. Mulvey and A. Ruszczy´nski, A new scenario decomposition method for large-scale stochastic optimization, Operations Research 43 (1995) 477-490.

    Google Scholar 

  33. K. Murakami and H.S. Kim, Virtual path routing for survivable ATM networks, IEEE/ACM Transactions on Networking 4 (1996) 22-39.

    Google Scholar 

  34. K. Murakami and H.S. Kim, Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration, IEEE/ACM Transactions on Networking 6 (1998) 207-221.

    Google Scholar 

  35. M.C. Pinar and S.A. Zenios, A data-level linear-quadratic algorithm for multicommodity network flows, ACM Transactions on Mathematical Software 20 (1994) 531-553.

    Google Scholar 

  36. M. de Prycker, Asynchronous Transfer Mode (Ellis-Horwood, Chichester, UK, 1993).

    Google Scholar 

  37. A. Ruszczyński, Decomposition methods in stochastic programming, Mathematical Programming 79 (1997) 333-353.

    Google Scholar 

  38. G.L. Schultz and R.R. Meyer, A structured interior point method for block angular optimization, SIAM Journal on Optimization 1 (1991) 583-602.

    Google Scholar 

  39. A. Vakhutinsky and M.O. Ball, Fault-tolerant virtual path layout in ATM networks, in: ITC 15 (Elsevier Science, Amsterdam, 1997), pp. 1031-1041.

    Google Scholar 

  40. T.-H. Wu, Fiber Network Service Survivability (Artech House, 1992).

  41. Y. Xiong and L.G. Mason, Restoration strategies and spare capacity requirements in self-healing ATM networks, IEEE/ACM Transactions on Networking 7 (1999) 98-110.

    Google Scholar 

  42. A. Zakarian, Nonlinear Jacobi and ε-relaxation methods for parallel network optimization, Ph.D. thesis, Computer Sciences Department, University of Wisconsin-Madison (1995).

  43. S. Zhang, G.L. Bilbro and S.E. Elmaghraby, ATM network topological design: Heuristic and lower bound, Technical report TR 95/15, Center for Advanced Computing and Communication (1995).

Download references

Author information

Authors and Affiliations

  1. Universidad de Vigo, Departamento de Tecnologías de las Comunicaciones, ETSI Telecomunicación, Campus, 36200, Vigo, Spain

    Francisco J. González-Castaño & Ubaldo M. García-Palomares

Authors
  1. Francisco J. González-Castaño
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ubaldo M. García-Palomares
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

González-Castaño, F.J., García-Palomares, U.M. A Parallel Optimization Approach to ATM Network Survivability. Telecommunication Systems 17, 435–454 (2001). https://doi.org/10.1023/A:1016727300010

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016727300010

Search

Navigation