Allocating Network Resources by Weight Between TCP Traffics

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 cann be easily implemented with less additional overhead and can easily perform network resource allocation by weighted parameter ω for traffics under the similar communication environments,whic can efficiently lead to guaranteed relative quqlity of scrviccs and improve network performances.

Allocating network resources by weight between TCP traffics

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.