Network 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 Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper provided by Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization in its series Research Memoranda with number
046.