CaltechAUTHORS
  A Caltech Library Service

prasanthDistributed Rate Allocation for Inelastic Flows

Hande, Prashanth and Zhang, Shengyu and Chiang, Mung (2007) prasanthDistributed Rate Allocation for Inelastic Flows. IEEE/ACM Transactions on Networking, 15 (6). pp. 1240-1253. ISSN 1063-6692. https://resolver.caltech.edu/CaltechAUTHORS:HANieeeacmtn07

[img]
Preview
PDF
See Usage Policy.

1759Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:HANieeeacmtn07

Abstract

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.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/TNET.2007.896507DOIUNSPECIFIED
Additional Information:© Copyright 2007 IEEE. Reprinted with permission. Manuscript received November 30, 2005; revised September 17, 2006; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor F. Paganini. [Posted online: 2007-12-26] 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. The authors would like to acknowledge very helpful discussions with J.W. Lee at Yonsei University, W.Y. at the University of Toronto, N. Shroff at Purdue University, V. Anantharam at UC Berkeley, D. Ming Chiu at the Chinese University of Hong Kong, S. Low, J. Doyle, and K. Tang at Caltech, and several reviewers.
Subject Keywords:Capacity provisioning, congestion control, inelastic flow, network control by pricing, network utility maximization, optimization, resource allocation
Issue or Number:6
Record Number:CaltechAUTHORS:HANieeeacmtn07
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:HANieeeacmtn07
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:9585
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:11 Feb 2008
Last Modified:03 Oct 2019 00:01

Repository Staff Only: item control page