期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：2
出版社：S.S. Mishra
摘要：In this paper we proposed to improve channels transmission rate but different time-invariant error rates. By assuming the Gilbert¨CElliott model (GEM) for each channel and TCP for high speed. The additive increase/multiplicative-decrease (AIMD) algorithm is a feedback control algorithm best known for its use in TCP Congestion Avoidance. AIMD combines linear growth of the congestion window with an exponential reduction when congestion takes place. Multiple flows using AIMD congestion control will eventually converge to use equal amounts of a contended link. The related schemes of multiplicative-increase/multiplicative-decrease (MIMD) and additive-increase/additive-decrease (AIAD) do not converge. We extend our analysis to time-varying channels. We compute the probability mass functions of the sequencing buffer occupancy and the sequencing delay for time-invariant channels. Our approach is based on the logarithm of the window size evolution has the same behaviour as the workload process in a standard G/G/1 queue. The Laplace-Stieltjes transform of the equivalent queue is then shown to directly provide the throughput of the congestion control algorithm (CCA) and the higher moments of the window size
