Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Stability and performance analysis of networks supporting elastic services
IEEE/ACM Transactions on Networking (TON)
Combining fairness with throughout: online routing with multiple objectives
Journal of Computer and System Sciences - Special issue on Internet algorithms
Evaluation of the ER Algorithm ERAQLES in Different ABR Environments
Proceedings of the IFIP TC6 WG6.3/WG6.4 Fifth International Workshop on Performance Modelling and Evaluation of ATM Networks: Performance Analysis of ATM Networks
Fairness in Routing and Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Designing multiprotocol label switching networks
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Internet2 QBone: building a testbed for differentiated services
IEEE Network: The Magazine of Global Internetworking
A framework for resource dimensioning in GPON access networks
International Journal of Network Management
| Hi-index | 0.00 |
We consider the problem of link capacity dimensioning and bandwidth allocation in networks that support elastic flows and maintain proportional fairness among these flows. We assume that a certain allocated bandwidth to a user demand generates revenue for the network operator. On the other hand, the operator is incurred a capacity dependent cost for each link in the network. The operator's profit is the difference between the revenue and the total link cost. Under this assumption the problem is to determine the bandwidth of the flows and the link capacities such that the profit is maximized. We first show that under fairly general assumptions, the optimum allocation of flows leads to selecting the lowest cost paths between O-D pairs. We also derive explicit formulae for the bandwidth allocated to these flows. We distinguish the case when the operator's capacity budget is fixed ("equality budget constraint", in which case the profit is maximized when the revenue is maximized) and the case when the budget is upper-bounded ("inequality budget constraint", in which case the profit can - in general - be maximized by using some portion of the capacity budget). Finally, we show numerical examples to highlight some of the trade-offs between profit maximization, revenue maximization and fairness.