Abstract
In this letter we re-examine flow control issues for a network environment where transmission links and CPUs on a data path can be jointly bottlenecked. We show that flow control without consideration of CPU congestion can significantly lose both fairness and efficiency in this environment. As a solution to this problem, we establish the notion of dual-resource proportional fairness, propose a distributed algorithm to achieve this objective and demonstrate its performance through simulations.
| Original language | English |
|---|---|
| Pages (from-to) | 957-959 |
| Number of pages | 3 |
| Journal | IEEE Communications Letters |
| Volume | 9 |
| Issue number | 10 |
| DOIs | |
| Publication status | Published - 2005 Oct 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
Cite this
}
Flow control with processing constraint. / Chong, Song; Shin, Minsu; Mo, Jeonghoon; Lee, Hyang Won.
In: IEEE Communications Letters, Vol. 9, No. 10, 01.10.2005, p. 957-959.Research output: Contribution to journal › Article
TY - JOUR
T1 - Flow control with processing constraint
AU - Chong, Song
AU - Shin, Minsu
AU - Mo, Jeonghoon
AU - Lee, Hyang Won
PY - 2005/10/1
Y1 - 2005/10/1
N2 - In this letter we re-examine flow control issues for a network environment where transmission links and CPUs on a data path can be jointly bottlenecked. We show that flow control without consideration of CPU congestion can significantly lose both fairness and efficiency in this environment. As a solution to this problem, we establish the notion of dual-resource proportional fairness, propose a distributed algorithm to achieve this objective and demonstrate its performance through simulations.
AB - In this letter we re-examine flow control issues for a network environment where transmission links and CPUs on a data path can be jointly bottlenecked. We show that flow control without consideration of CPU congestion can significantly lose both fairness and efficiency in this environment. As a solution to this problem, we establish the notion of dual-resource proportional fairness, propose a distributed algorithm to achieve this objective and demonstrate its performance through simulations.
UR - http://www.scopus.com/inward/record.url?scp=27644440320&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27644440320&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2005.10029
DO - 10.1109/LCOMM.2005.10029
M3 - Article
VL - 9
SP - 957
EP - 959
JO - IEEE Communications Letters
JF - IEEE Communications Letters
SN - 1089-7798
IS - 10
ER -