Stabilized edge-to-edge aggregate flow control

In this paper, we present a distributed flow control scheme which achieves weighted max-min fair bandwidth allocation among all source-destination pairs on a per-aggregate basis within its network. The motivation behind the scheme is the absence of per-aggregate flow control in the current Internet, resulting in inability to enforce a certain fairness on source-destination flows. In our scheme, the distributed algorithm to compute weighted max-min fair rates is based on PI control in feedback control theory. We mathematically prove the asymptotic stability of the algorithm in presence of aggregate flows with heterogeneous round-trip delays. Through simulations we demonstrate the effectiveness of the proposed scheme in controlling per-aggregate flows.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2004
Language
ENG
Citation

NETWORKING 2004: NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.3042, pp.574 - 587

ISSN
0302-9743
URI
http://hdl.handle.net/10203/1915
Appears in Collection
EE-Journal Papers(저널논문)
  • Hit : 427
  • Download : 5
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0