TY - JOUR

T1 - Distributed rate allocation for inelastic flows

AU - Hande, Prashanth

AU - Zhang, Shengyu

AU - Chiang, Mung

N1 - Funding Information:
Manuscript received November 30, 2005; revised September 17, 2006; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor F. Paganini. This work was supported in part by National Science Foundation (NSF) Grants CCF-0440443, CNS-0417607, and CNS-0427677, in part by the Air Force Office of Scientific Research (AFOSR) Grant FA9550–06–1–0297, in part by the Defense Research Advanced Projects Agency (DARPA) Grant HR0011–06–1–0008, and in part by the CBMANET program. Part of this paper was presented at IEEE INFOCOM 2005.

PY - 2007/12

Y1 - 2007/12

N2 - A common assumption behind most of the recent research on network rate allocation is that traffic flows are elastic, which means that their utility functions are concave and continuous and that there is no hard limit on the rate allocated to each flow. These critical assumptions lead to the tractability of the analytic models for rate allocation based on network utility maximization, but also limit the applicability of the resulting rate allocation protocols. This paper focuses on inelastic flows and removes these restrictive and often invalid assumptions. First, we consider nonconcave utility functions, which turn utility maximization into difficult, nonconvex optimization problems. We present conditions under which the standard price-based distributed algorithm can still converge to the globally optimal rate allocation despite nonconcavity of utility functions. In particular, continuity of price-based rate allocation at all the optimal prices is a sufficient condition for global convergence of rate allocation by the standard algorithm, and continuity at at least one optimal price is a necessary condition.We then show how to provision link capacity to guarantee convergence of the standard distributed algorithm. Second, we model real-time flow utilities as discontinuous functions. We show how link capacity can be provisioned to allow admission of all real-time flows, then propose a price-based admission control heuristics when such link capacity provisioning is impossible, and finally develop an optimal distributed algorithm to allocate rates between elastic and real-time flows.

AB - A common assumption behind most of the recent research on network rate allocation is that traffic flows are elastic, which means that their utility functions are concave and continuous and that there is no hard limit on the rate allocated to each flow. These critical assumptions lead to the tractability of the analytic models for rate allocation based on network utility maximization, but also limit the applicability of the resulting rate allocation protocols. This paper focuses on inelastic flows and removes these restrictive and often invalid assumptions. First, we consider nonconcave utility functions, which turn utility maximization into difficult, nonconvex optimization problems. We present conditions under which the standard price-based distributed algorithm can still converge to the globally optimal rate allocation despite nonconcavity of utility functions. In particular, continuity of price-based rate allocation at all the optimal prices is a sufficient condition for global convergence of rate allocation by the standard algorithm, and continuity at at least one optimal price is a necessary condition.We then show how to provision link capacity to guarantee convergence of the standard distributed algorithm. Second, we model real-time flow utilities as discontinuous functions. We show how link capacity can be provisioned to allow admission of all real-time flows, then propose a price-based admission control heuristics when such link capacity provisioning is impossible, and finally develop an optimal distributed algorithm to allocate rates between elastic and real-time flows.

KW - Capacity provisioning

KW - Congestion control

KW - Inelastic flow

KW - Network control by pricing

KW - Network utility maximization

KW - Optimization

KW - Resource allocation

KW - Telecommunication congestion control

KW - Telecommunication network management

KW - Telecommunication traffic

UR - http://www.scopus.com/inward/record.url?scp=37549011355&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=37549011355&partnerID=8YFLogxK

U2 - 10.1109/TNET.2007.896507

DO - 10.1109/TNET.2007.896507

M3 - Article

AN - SCOPUS:37549011355

SN - 1063-6692

VL - 15

SP - 1240

EP - 1253

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

IS - 6

ER -