Lexicographically optimal balanced networks
- 1 December 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 10 (6) , 818-829
- https://doi.org/10.1109/tnet.2002.804825
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
This publication has 13 references indexed in Scilit:
- Dynamic wavelength routing using congestion and neighborhood informationIEEE/ACM Transactions on Networking, 1999
- Requirements for Traffic Engineering Over MPLSPublished by RFC Editor ,1999
- Multicommodity flow models, failure propagation, and reliable loss network designIEEE/ACM Transactions on Networking, 1998
- Network dimensioning and performance of multiservice, multirate loss networks with dynamic routingIEEE/ACM Transactions on Networking, 1997
- Computational techniques for accurate performance evaluation of multirate, multihop communication networksIEEE/ACM Transactions on Networking, 1997
- Loss NetworksThe Annals of Applied Probability, 1991
- Effective bandwidths for the multi-type UAS channelQueueing Systems, 1991
- Effective bandwidths at multi-class queuesQueueing Systems, 1991
- Equivalent capacity and its application to bandwidth allocation in high-speed networksIEEE Journal on Selected Areas in Communications, 1991
- Design and Optimization of Networks With Dynamic RoutingBell System Technical Journal, 1981