Flow control with processing constraint

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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2005-10
Language
ENG
Citation

IEEE COMMUNICATIONS LETTERS, v.9, no.10, pp.957 - 959

ISSN
1089-7798
DOI
10.1109/LCOMM.2005.10029
URI
http://hdl.handle.net/10203/391
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
Flow Control with Processing Constraint.pdf(414.88 kB)Download
  • Hit : 401
  • Download : 185
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 2 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0