Published December 2007
| public
Journal Article
Open
prasanthDistributed Rate Allocation for Inelastic Flows
- Creators
- Hande, Prashanth
- Zhang, Shengyu
- Chiang, Mung
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.
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.Files
HANieeeacmtn07.pdf
Files
(1.8 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:aedf77657fa26fefab3984b83ec9c9fc
|
1.8 MB | Preview Download |
Additional details
- Eprint ID
- 9585
- Resolver ID
- CaltechAUTHORS:HANieeeacmtn07
- Created
-
2008-02-11Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field