Title :
Lexicographically optimal balanced networks
Author :
Georgiadis, Leonidas ; Georgatsos, Panos ; Floros, Kostas ; Sartzetakis, Stelios
Author_Institution :
Dept. of Electr. & Comput. Eng., Aristotelian Univ. of Thessaloniki, Greece
Abstract :
We consider the problem of allocating bandwidth between two endpoints of a backbone network so that no parts of the network are unnecessarily loaded. We formulate the problem as lexicographic optimization, and develop algorithms for its solution. The solution consists of (a) identifying a cut in the network where the optimal load can be determined on all the links of the cut, and (b) considering the same problem in each of the subnetworks to which the cut is dividing the original network
Keywords :
bandwidth allocation; computational complexity; optimisation; telecommunication networks; algorithms; backbone network; bandwidth allocation; computationally efficient algorithm; lexicographically optimal balanced networks; network cut identification; optimal load; subnetworks; Admission control; Bandwidth; Capacity planning; Channel allocation; Context; Cost function; Electronic mail; Routing; Spine; Virtual private networks;
Conference_Titel :
INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Conference_Location :
Anchorage, AK
Print_ISBN :
0-7803-7016-3
DOI :
10.1109/INFCOM.2001.916257
