Design Models for Robust Multi-Layer Next Generation Internet Core Networks Carrying Elastic Traffic
Journal of Network and Systems Management
Computing optimal max-min fair resource allocation for elastic flows
IEEE/ACM Transactions on Networking (TON)
Max-min fairness in multi-commodity flows
Computers and Operations Research
Max-Min fair distribution of modular network flows on fixed paths
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Fair sampling across network flow measurements
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
| Hi-index | 0.00 |
In the paper we consider the problem of routing andbandwidth allocation in networks that support elastic traffic.We assume that the bandwidth demand between eachsource-destination (S-D) pair is specified in terms of a minimumand maximum value, and a set of flows between eachS-D pair is allowed to realize these demands. (We say thata set of flows realizes the demand associated with an S-Dpair, if the sum of the bandwidths allocated to these flows isgreater than the minimum value assumed for the demandof that S-D pair.) In this setting, we show that routingand bandwidth allocation can be formulated as an optimizationproblem, where network utilization is to be maximizedunder capacity and the widely used maxmin fairnessconstraints. We describe three different algorithms tosolve variants of this problem. The most important one, anefficient, original algorithm assuming multipath routing isstudied in detail and illustrated with a numerical example.