Optimization in telecommunication networks

Abstract

Network design and network synthesis have been the classical optimization problems in telecommunication for a long time. In the recent past, there have been many technological developments such as digitization of information, optical networks, Internet, and wireless networks. These developments have led to a series of new optimization problems. This manuscript gives an overview of the developments in solving both classical and modern telecom optimization problems. The classical (still actual) network design and synthesis problems are described with an emphasis on the latest developments on modelling and solving them. Mathematical theorems will be related to the models described. This includes Menger's disjoint paths theorem, the Ford-Fulkerson max-flow-min-cut theorem, and also Gomory-Hu trees and the Okamura-Seymour cutcondition Finally, we describe recent optimization problems such as routing, wavelength assignment, and grooming in optical networks.

Two-Phase Modeling of QoS Routing in Communication Networks

“…5 are in increasing order of (w 1 − w 2 ). From left to right, these weights are assigned as (w 1 , w 2 , w 3 Figure 5 shows enlarging the difference between classes 1 and 3 will increase the total satisfaction. However, the increase is mainly contributed by class 1 since w 1 , the weight assigned to class 1, is larger than the others.…”

“…A single shared physical network supporting multiple heterogeneous applications with different traffic characteristics and QoS requirements is widely regarded as the way to meet the telecommunication challenges of the future [2]. QoS has always been the major issue for telecom providers [3], [4]. The Universal Mobile Telecommunications System (UMTS) [5] has specified four different traffic classes according to their QoS requirements for different applications.…”

Fiber optical network design problems: A case for Turkey

“…Every society communicates with each other. Long distance communication was first tried in ancient Greek society [3]. Due to the lack of technical knowledge about electricity and light, they used human force.…”

Efficient communication using multiple cycles and multiple channels

“…Consider the topology shown in Figure 5.3 which has a number of node pairs each with multiple shortest paths between them. The edge 2 − 7 has the potential to be heavily loaded since it is in one of the possible shortest paths between node pairs: (1,8), (3,6), (1,5), (3,9), (7,10), (4,7), (2,5), (2,9). Each of these node pairs also has a shortest path available that does not use the link 2 − 7.…”

“…Network with much freedom in shortest path selection While there is potential for edge 2 − 7 to be heavily loaded, what determines if it actually is? Simply saying we use shortest path routing is not enough for us to know if any of the pairs from the list(1,8),(3,6),(1,5),(3,9), (7,10), (4,7), (2,5), (2,9) will use the edge or not. If we are more specific and say we use Bellman-Ford as our shortest path algorithm, it still does not tell us.…”