Title
Allocating network resources by weight between TCP traffics
Abstract
Under the current TCP/IP architecture, all TCP traffics compete for network resources completely fairly, which makes it difficult to satisfy applications' versatile communication requirements. This paper presents an improved TCP congestion control mechanism where the congestion window becomes ω(1 - b)W rather than (1 - b)W for every window W containing a packet loss. Theoretical analysis and simulation results show that it can be easily implemented with less additional overhead and can easily perform network resource allocation by weighted parameter ω for traffics under the similar communication environments, which can efficiently lead to guaranteed relative quality of services and improve network performances.
Year
DOI
Venue
2003
10.1007/BF02948892
J. Comput. Sci. Technol.
Keywords
Field
DocType
tcp traffic,window w,additive-increase multip- licative-decrease aimd,versatile communication requirement,allocating network resource,transmission control protocol tcp,improved tcp congestion control,congestion control,network resource,weighted resource allocation,current tcp,similar communication environment,network performance,congestion window,network resource allocation,packet loss,resource allocation,tcp congestion control,transmission control protocol,satisfiability,quality of service
Compound TCP,TCP Westwood plus,CUBIC TCP,Computer science,Computer network,Real-time computing,TCP acceleration,Network congestion,TCP tuning,TCP global synchronization,TCP Friendly Rate Control,Distributed computing
Journal
Volume
Issue
ISSN
18
2
1860-4749
Citations 
PageRank 
References 
0
0.34
5
Authors
6
Name
Order
Citations
PageRank
ChangBiao Xu100.34
K. Long21695138.11
Shizhong Yang3738.40
徐昌彪400.34
隆克平5101.01
杨士中600.34