Control of communication networks: welfare maximization and multipath transfers
Authors:
Open Access
- 13 June 2008
- journal article
- Published by The Royal Society in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Vol. 366 (1872) , 1-18
Abstract
We discuss control strategies for communication networks such as the Internet. We advocate the goal of welfare maximization as a paradigm for network resource allocation. We explore the application of this paradigm to the case of parallel network paths. We show that welfare maximization requires active balancing across paths by data sources, and potentially requires implementation of novel transport protocols. However, the only requirement from the underlying ‘network layer’ is to expose the marginal congestion cost of network paths to the ‘transport layer’. We further illustrate the versatility of the corresponding layered architecture by describing transport protocols with the following properties: they achieve welfare maximization when each communication may use an arbitrary collection of paths; available in an overlay; and are combined in series and parallel. We conclude by commenting on incentives, pricing and open problems.Keywords
This publication has 23 references indexed in Scilit:
- Structural properties of proportional fairness: Stability and insensitivityThe Annals of Applied Probability, 2007
- Network monitors and contracting systemsACM SIGCOMM Computer Communication Review, 2006
- Policing congestion response in an internetwork using re-feedbackACM SIGCOMM Computer Communication Review, 2005
- Stability of end-to-end algorithms for joint routing and rate controlACM SIGCOMM Computer Communication Review, 2005
- Models for a self–managed InternetPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2000
- Modeling TCP Reno performance: a simple model and its empirical validationIEEE/ACM Transactions on Networking, 2000
- Promoting the use of end-to-end congestion control in the InternetIEEE/ACM Transactions on Networking, 1999
- Rate control for communication networks: shadow prices, proportional fairness and stabilityJournal of the Operational Research Society, 1998
- The macroscopic behavior of the TCP congestion avoidance algorithmACM SIGCOMM Computer Communication Review, 1997
- Pricing congestible network resourcesIEEE Journal on Selected Areas in Communications, 1995