%0 Journal Article
%T Allocating Network Resources by Weight Between TCP Traffics
%A ChangBiao Xu
%A KePing Long
%A Shizhong Yang
%A <br>徐昌彪
%A 隆克平
%A 杨士中
%J 计算机科学技术学报
%D 2003
%I 
%X 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 w(l - 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 w for traffics under the similar communication environments, which can efficiently lead to guaranteed relative quality of services and improve network performances.
%K transmission control protocol (TCP)
%K congestion control
%K additive-increase multiplicative-decrease (AIMD)
%K weighted resource allocation<br>传输控制协议
%K TCP／IP
%K 拥塞控制
%K 网络
%K AIMD
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=C2AB2993A4C29E706ACCA6CDFBAF288A&yid=D43C4A19B2EE3C0A&vid=13553B2D12F347E8&iid=0B39A22176CE99FB&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=1&reference_num=7