On a fair congestion control scheme for TCP vegas

Cited 12 time in webofscience Cited 0 time in scopus
  • Hit : 600
  • Download : 745
TCP Vegas is the congestion avoidance algorithm and utilizes the bandwidth more efficiently than TCP Reno. However, it does not guarantee the fair sharing of the bandwidth among the active connections with different round-trip times. In this paper, we proposed a new TCP Vegas to provide the fairness among connections and stabilize the queue length at the desired value irrespective of the number of active connections.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2005-02
Language
English
Article Type
Article
Keywords

STABILITY

Citation

IEEE COMMUNICATIONS LETTERS, v.9, pp.190 - 192

ISSN
1089-7798
URI
http://hdl.handle.net/10203/519
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 12 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0