Optimization in Telecommunication Networks
AbstractNetwork design and network synthesis have been the classical optimization problems intelecommunication for a long time. In the recent past, there have been many technologicaldevelopments such as digitization of information, optical networks, internet, and wirelessnetworks. These developments have led to a series of new optimization problems. Thismanuscript gives an overview of the developments in solving both classical and moderntelecom optimization problems.We start with a short historical overview of the technological developments. Then,the classical (still actual) network design and synthesis problems are described with anemphasis on the latest developments on modelling and solving them. Classical results suchas Menger’s disjoint paths theorem, and Ford-Fulkerson’s max-flow-min-cut theorem, butalso Gomory-Hu trees and the Okamura-Seymour cut-condition, will be related to themodels described. Finally, we describe recent optimization problems such as routing andwavelength assignment, and grooming in optical networks.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization in its series Research Memoranda with number 046.
Date of creation: 2004
Date of revision:
Contact details of provider:
Web page: http://www.maastrichtuniversity.nl/web/UMPublications.htm
operations research and management science;
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Leensel, Robert Laurentius Maria Johannes van de, 1999. "Models and algorithms for telecommunication network design," Open Access publications from Maastricht University urn:nbn:nl:ui:27-10983, Maastricht University.
- Hoesel , Stan van & Müller, Rudolf, 2005. "Optimization issues in combinatorial auctions," Open Access publications from Maastricht University urn:nbn:nl:ui:27-21408, Maastricht University.
- Manuel Laguna, 1994. "Clustering for the Design of SONET Rings in Interoffice Telecommunications," Management Science, INFORMS, vol. 40(11), pages 1533-1541, November.
- Hoesel, Stan P.M. van & Koster, Arie M.C.A. & Leensel, Robert L.M.J. van de & Savelsbergh, Martin W.P., 2002. "Polyhedral results for the edge capacity polytope," Open Access publications from Maastricht University urn:nbn:nl:ui:27-3984, Maastricht University.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Charles Bollen).
If references are entirely missing, you can add them using this form.