Flow control with processing constraint

Song Chong; Minsu Shin; Jeonghoon Mo; Hyang Won Lee

doi:10.1109/LCOMM.2005.10029

Flow control with processing constraint

Song Chong, Minsu Shin, Jeonghoon Mo, Hyang Won Lee

Department of Industrial Engineering

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

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	https://doi.org/10.1109/LCOMM.2005.10029
Publication status	Published - 2005 Oct

Bibliographical note

Funding Information:
Manuscript received April 28, 2005. The associate editor coordinating the review of this letter and approving it for publication was Dr. Nikos Nikolaou. This research was supported by the Ministry of Information and Communication, Korea, under the grant for BrOMA-ITRC program supervised by IITA.

All Science Journal Classification (ASJC) codes

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2005.10029

Fingerprint Dive into the research topics of 'Flow control with processing constraint'. Together they form a unique fingerprint.

Cite this

@article{602adda4ac9041ea99b090123674bc46,

title = "Flow control with processing constraint",

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.",

author = "Song Chong and Minsu Shin and Jeonghoon Mo and Lee, {Hyang Won}",

note = "Funding Information: Manuscript received April 28, 2005. The associate editor coordinating the review of this letter and approving it for publication was Dr. Nikos Nikolaou. This research was supported by the Ministry of Information and Communication, Korea, under the grant for BrOMA-ITRC program supervised by IITA.",

year = "2005",

month = oct,

doi = "10.1109/LCOMM.2005.10029",

language = "English",

volume = "9",

pages = "957--959",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - Flow control with processing constraint

AU - Chong, Song

AU - Shin, Minsu

AU - Mo, Jeonghoon

AU - Lee, Hyang Won

N1 - Funding Information: Manuscript received April 28, 2005. The associate editor coordinating the review of this letter and approving it for publication was Dr. Nikos Nikolaou. This research was supported by the Ministry of Information and Communication, Korea, under the grant for BrOMA-ITRC program supervised by IITA.

PY - 2005/10

Y1 - 2005/10

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

AN - SCOPUS:27644440320

VL - 9

SP - 957

EP - 959

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 10

ER -