Lexicographically optimal balanced networks

Author

Georgiadis, Leonidas ; Georgatsos, Panos ; Floros, Konstantinos ; Sartzetakis, Stelios

Author_Institution

Dept. of Electr. & Comput. Eng., Aristotle Univ. of Thessaloniki, Greece

Volume

10

Issue

6

fYear

2002

fDate

12/1/2002 12:00:00 AM

Firstpage

818

Lastpage

829

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: (1) identifying a cut in the network where the optimal load can be determined on all the links of the cut and (2) considering the same problem for each of the subnetworks to which the cut is dividing the original network.

Keywords

bandwidth allocation; minimax techniques; telecommunication congestion control; telecommunication network planning; telecommunication network routing; telecommunication traffic; backbone network; bandwidth allocation; lexicographic optimization; min-max optimization; network cut; optimal link load; subnetworks; Admission control; Bandwidth; Channel allocation; Context; Load management; Quality of service; Routing; Spine; Telecommunication traffic; Virtual private networks;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/TNET.2002.804825

Filename

1134305