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 |
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'Flow control with processing constraint'. Together they form a unique fingerprint.
Cite this
Chong, S., Shin, M., Mo, J., & Lee, H. W. (2005). Flow control with processing constraint. IEEE Communications Letters, 9(10), 957-959. https://doi.org/10.1109/LCOMM.2005.10029