Dynamic buffer management scheme based on rate estimation in packet-switched networks

Cited 3 time in webofscience Cited 8 time in scopus
  • Hit : 309
  • Download : 0
While traffic volume of real-time applications is rapidly increasing, current routers do not guarantee minimum QoS values of fairness and drop packets in random fashion. If routers provide a minimum QoS, resulting less delays, more fairness, and smoother sending rates, TCP-friendly rate control (TFRC) can be adopted for real-time applications. We propose a dynamic buffer management scheme that meets the requirements described above, and can be applied to TCP flow and to data flow for transfer of real-time applications. The proposed scheme consists of a virtual threshold function, an accurate and stable per-flow rate estimation, a per-flow exponential drop probability, and a dropping strategy that guarantees fairness when there are many flows. Moreover, we introduce a practical definition of active flows to reduce the overhead coming from maintaining per-flow states. We discuss how proposed scheme motivates real-time applications to adopt TFRC. (C) 2002 Elsevier Science B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2002-08
Language
English
Article Type
Article
Citation

COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, v.39, no.6, pp.769 - 787

ISSN
1389-1286
DOI
10.1016/S1389-1286(02)00247-5
URI
http://hdl.handle.net/10203/85512
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0