Skip to main content
SpringerLink
Log in

Network Planning Problems in Telecommunications

  • Chapter
Book cover Handbook of Optimization in Telecommunications

Abstract

This chapter describes the main results of two decades of experience in studying and applying optimization models in the telecommunications sector. The Brazilian information technology policy has enabled during this time many fruitful contracts among some universities and companies of the sector, and the author with some colleagues have been engaged in this process with emphasis in the use of operations research (OR) methods. The author has also been benefited from the cooperation with French institutions that have similar engagements in that country, in such a way that the chapter is in part grounded in real case studies that have motivated research and development of different decision support systems. The chapter synthesize the framework that has been used to integrate models of local access and backbone networks, and then presents a past and future perspective on how is progressing the use of OR models to address the important questions of routing, planning and pricing services in telecommunication and computer networks. Most of the applications are related to the literature and have universal character, but we try to point out in this experience how different cultures, geography and politics impact and shape the way operations research is practiced around the world.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • Y.P. Aneja. An integer linear programming approach to Steiner problem in graphs. Networks, 10:167–178, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  • A. Balakrishnan, T.L. Magnanti, and P. Mirchandani. Modeling and heuristic worst-case performance analysis of two-level network design problem. Management Science, 40:846–867, 1994.

    Article  MATH  Google Scholar 

  • A. Balakrishnan, T.L. Magnanti, A. Shulman, and R.T. Wong. Models for planning capacity expansion in local access telecommunication networks. Annals of Operations Research, 33:239–284, 1991.

    Article  MATH  Google Scholar 

  • A. Balakrishnan, T.L. Magnanti, and R.T. Wong. A dual-ascent procedure for large-scale uncapacitated network design. Operations Research, 37:716–740, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  • J.E. Beasley. An algorithm for solving large capacitated warehouse location problems. Journal of the Operational Research Society, 33:314–325, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  • J.E. Beasley. An SST-based algorithm for the Steiner problem in graphs. Networks, 19:1–16, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  • D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, New Jersey, 1987.

    Google Scholar 

  • D. Bienstock and O. Günlük. Computational experience with a difficult mixed-integer multicommodity flow problem. Mathematical Programming, 68:213–237, 1995.

    MathSciNet  Google Scholar 

  • N. Curien and M. Gensollen. Economie des Télécommunications: Ouverture et Réglementation. Economica, Paris, 1992.

    Google Scholar 

  • C.W. Duin and A. Volgenant. Reduction tests for the Steiner problem in graphs. Networks, 19:549–567, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  • R.P.M. Ferreira and H.P.L. Luna. Discrete capacity and flow assignment algorithms with performance guarantee. Computer Communications, 26:1056–1069, 2003.

    Article  Google Scholar 

  • B. Gavish. Formulations and algorithms for the capacitated minimal directed tree. Journal of the ACM, 30:118–132, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  • B. Gavish. Topological design of telecommunication networks-Local access design methods. Annals of Operations Research, 33:17–71, 1991.

    Article  MATH  Google Scholar 

  • M. Gerla. The Design of Store-and-Forward (S/F) Networks for Computer Communications. PhD thesis, UCLA, Los Angeles, 1973.

    Google Scholar 

  • J.C. Geromel and H.P.L. Luna. Projection and duality techniques in economic equilibrium models. IEEE Trans. on Systems, Man and Cybernetics, 11:329–338, 1981.

    Article  MathSciNet  Google Scholar 

  • A. Girard and S. St-Georges. Performance evaluation and routing optimization of ISDN networks with nonhierarchical and alternate routing. In 1th International Conference on Telecommunication Systems Modeling and Analysis, pages 454–461, Nashville, USA, 1993. Vanderbilt University.

    Google Scholar 

  • M. Grötschel and C. L. Monma. Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM J. Disc. Math., 3(4):502–523, 1990.

    Article  MATH  Google Scholar 

  • S.L. Hakimi. Steiner’s problem in graphs and its implications. Networks, 1:113–133, 1971.

    Article  MATH  MathSciNet  Google Scholar 

  • D.S. Hochbaum and A. Segev. Analysis of a flow problem with fixed charges. Networks, 19:291–312, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  • C.G. Kang and H.H. Tan. Combined channel allocation and routing algorithms in packet switched networks. Computer Communications, 20:1175–1190, 1997.

    Article  Google Scholar 

  • J.M. Karlsson. Some aspects of charging in ATM networks. In 4th International Conference on Telecommunication Systems Modeling and Analysis, pages 567–573, Nashville, USA, 1996. Vanderbilt University.

    Google Scholar 

  • F.P. Kelly. Routing in circuit-switched networks: Optimization, shadow prices and decentralization. Adv. Appli. Prob., 20:112–144, 1988.

    Article  MATH  Google Scholar 

  • L. Kleinrock. On the modeling and analysis of computer networks. Proceedings of the IEEE, 81(8):1179–1191, 1993.

    Article  Google Scholar 

  • Y.A. Korilis, T.A. Varvarigou, and S.A. Ahuja. Optimal pricing strategies in noncooperative networks. In 5th International Conference on Telecommunication Systems Modeling and Analysis, pages 110–123, Nashville, USA, 1997. Vanderbilt University.

    Google Scholar 

  • J.B. Kruskal. On the shortest spanning tree of a graph and the traveling salesman problem. Proc. Amer. Math. Society, 7:48–50, 1956.

    Article  MathSciNet  Google Scholar 

  • P. Linhart, R. Radner, K.G. Ramakrishnan, and R. Steinberg. The allocation of value for jointly provided services. Telecommunication Systems, 4:151–175, 1995.

    Article  Google Scholar 

  • H. P. L. Luna. Note on price-unicity in economic equilibrium models. Socio-Economic Planning Sciences, 13(4):223–225, 1979.

    Article  Google Scholar 

  • H.P.L. Luna and P. Mahey. Bounds for global optimization of capacity expansion and flow assignment problems. Operations Research Letters, 26:211–216, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  • H.P.L. Luna, P. Mahey, A. Ouorou, and J. Chifflet. Multicommodity flows with price sensitive demands. In 5th International Conference on Telecommunication Systems Modeling and Analysis, pages 583–593, Nashville, USA, 1997. Vanderbilt University.

    Google Scholar 

  • H.P.L. Luna, N. Ziviani, and R.M.B. Cabral. The telephonic switching centre network problem: Formalization and computational experience. Discrete Applied Mathematics, 18:199–210, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  • N. Maculan. The Steiner problem in graphs. Annals of Discrete Mathematics, 31: 185–212, 1987.

    MathSciNet  Google Scholar 

  • T.L. Magnanti, P. Mirchandani, and R. Vachani. The convex hull of two core capacitated network design problems. Mathematical Programming, 60:233–250, 1993.

    Article  MathSciNet  Google Scholar 

  • G.R. Mateus, F.R.B. Cruz, and H.P.L. Luna. Algorithm for hierarchical network design. Location Science, 2:149–164, 1994.

    MATH  Google Scholar 

  • G.R. Mateus and H.P.L. Luna. Decentralized decision-making and capacitated facility location. The Annals of Regional Science, 26:361–377, 1992.

    Article  Google Scholar 

  • G.R. Mateus, H.P.L. Luna, and L.C.M. Lage. Optimal planning of telecommunication networks with logical and physical aspects. In SBT/IEEE Telecommunications Congress, pages 602–607, Rio de Janeiro, Brazil, 1990. SBT/IEEE.

    Google Scholar 

  • G.R. Mateus, H.P.L. Luna, and A.B. Sirihal. Heuristics for distribution network design in telecommunication. Journal of Heuristics, 6:131–148, 2000.

    Article  MATH  Google Scholar 

  • M. Minoux. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks, 19:313–360, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  • A. Mirzaian. Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds. Networks, 15:1–20, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  • A. Ouorou, P. Mahey, and J. Ph. Vial. A survey of algorithms for convex multicommodity flow problems. Management Science, 46:126–147, 2000.

    Article  Google Scholar 

  • M. Patriksson. The Traffic Assignment Problem: Models and Methods, Topics in Transportation, VSP, Utrecht, The Netherlands, 1994.

    Google Scholar 

  • C.D. Randazzo and H.P. Luna. A comparison of optimal methods for local access un-capacitated network design. Annals of Operations Research, 106:263–286, 2001a.

    Article  MATH  MathSciNet  Google Scholar 

  • C.D. Randazzo and H.P. Luna. Solving local access network design problems with two technologies. Investigación Operacional, 21:115–123, 2001b.

    Google Scholar 

  • G. Sa. Branch-and-bound and approximate solutions to the capacitated plant location problem. Operations Research, 17:1005–1016, 1969.

    Article  Google Scholar 

  • P.A. Samuelson. Spatial price equilibrium and linear programming. Amer. Econ. Rev., 42:284–303, 1952.

    Google Scholar 

  • D. Skorin-Kapov and H.F. Beltran. An efficient characterization of some allocation solutions associated with capacitated network design problems. Telecommunication Systems, 3:91–107, 1994.

    Article  Google Scholar 

  • R.T. Wong. A dual ascent algorithm for the steiner problem in directed graphs. Mathematical Programming, 28:271–287, 1984.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Tecnologia da Informação, Universidade Federal de Alagoas, 57072-970, Maceio AL, Brazil

    Henrique Pacca L. Luna

Authors
  1. Henrique Pacca L. Luna
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Labs Research, Florham Park, New Jersey

    Mauricio G. C. Resende

  2. University of Florida, Gainesville, Florida

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Luna, H.P.L. (2006). Network Planning Problems in Telecommunications. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_9

Download citation

Publish with us

Policies and ethics

Search

Navigation