Asymptotic Stability Analysis of E-speed Start Congestion Control Protocol for TCP

Full Text (PDF, 192KB), PP.56-62

Views: 0 Downloads: 0

Author(s)

Oyeyinka I.K. 1,* Akinwale A.T. 2 Folorunso O. 2 Olowofela J.A. 3 Oluwatope A. 4

1. Centre for Information Technology and Management, Yaba College of Technology, Yaba, Lagos-Nigera

2. Computer Science Department, University of Agriculture, Abeokuta, Nigeria

3. Department of Physics, University of Agriculture, Abeokuta, Nigeria

4. Department of Computer Science and Engineering, Obafemi Awolowo University, Ile-Ife, Nigeria

* Corresponding author.

DOI: https://doi.org/10.5815/ijcnis.2012.04.07

Received: 17 Aug. 2011 / Revised: 20 Nov. 2011 / Accepted: 11 Jan. 2012 / Published: 8 May 2012

Index Terms

Internet, Congestion Control, Available Bandwidth, Slow-Start, TCP, Stability

Abstract

All the proposed window based congestion control protocols use a single slow start algorithm. It has been shown in literature that slow start inefficiently utilizes bandwidth in a network with high bandwidth delay product (BDP). A multiple startup algorithm (E-speed start) was proposed in this work. E-speed start specifies a multiple selectable startup for Transmission Control Protocol (TCP). It is proposed that startup speed for TCP be selectable from n-arry startup algorithms. In E-speed start, a binary start was implemented based on a calculated value β which depends on the available bandwidth and other network conditions. A model for E-speed start was derived using utility maximization theory and the principle of decentralised solution. The model derived was shown to be stable by linear approximation, Laplace transform and by using the concept of Nyquist Stability criterion.

Cite This Paper

Oyeyinka I.K., Akinwale A.T., Folorunso O., Olowofela J.A., Oluwatope A., "Asymptotic Stability Analysis of E-speed Start Congestion Control Protocol for TCP", International Journal of Computer Network and Information Security(IJCNIS), vol.4, no.4, pp.56-62, 2012. DOI:10.5815/ijcnis.2012.04.07

Reference

[1]Brakmo, L, Omalley S and Peterson L (1994). TCP Vegas: New techniques for congestion detection and avoidance. In proceedings of ACM SIGCOMM 24-35.
[2]Floyd S (2003). High-speed TCP for large congestion windows RFC 3649, December 2003.
[3]Kelly, T. (2003). Scalable TCP improving performance in high speed wide area networks. Computer communications Review 32(2).
[4]Floyd S. (2004), “Limited Slow Start for TCP with Large Congestion Window. RFC 3742.
[5]Rhee, I., and Xu, L. (2005). CUBIC: A new TCP-friendly high-speed TCP variant. In Proceedings of the third PFLDNet Workshop (France, February 2005).
[6]King R., Baraniuk R., and Riedi R. (2005). TCP – Africa; an adaptive and fair rapid increase rule for scalable TCP. In proceedings of IEEE INFOCOM, Vol 3, PP 1838 – 1848.
[7]Wei, D. X., Jin C., Low, S. H. and Hedges, S. (2006). Fast TCP: motivation, architecture, algorithms, performance IEEE-ACM Transaction on networking 14(6): 1246 – 1259.
[8]Tang A., Jacobsson K., Andrew L., Low S. (2006). Linear Stability Analysis of FAST TCP using a new Accurate Link Model. 44th Annual Allerton Conference. Illinois. USA.
[9]Liu, S., Basar, T., and Srikant, R.TCP-Illinois(2006): A loss and delay-based congestion control algorithm for high-speed networks. In Proceedings of VALUETOOLS (Pisa, Italy, October 2006).
[10]Mascolo S., Casetti C., Gerla M., Sanadidi M, and Wang R (2001), “TCP Westwood: Bandwidth Estimation for Enhanced Transport over Wireless Links” ACM Mobicom 2001.
[11]Katabi, D., Handley M. and Rohrs C. (2002). Congestion control for high bandwidth-delay product networks. In proceedings on ACM Sigcomm.
[12]Seshan S., Stemm M., Katz R. (1997), Shared Passive Network Performance Discovery. (SPAND). Proceedings of USITS’97, Monterey, CA.
[13]Patridge C., Rockwell D., Allman M., Krishman R., Slerbenz J (2002), A Swifter Start for TCP. In Technical Report TR8339 BBN Technologies.
[14]Chen J., Zhang M. and Meng Q., (2003) “A Network Congestion Control Algorithm Based History Connections and its Performance Analysis,” Journal of Computer Research and development, Vol. 40, No. 10, 2003, pp. 1470-1475.
[15]Allcock W., Hegde S., Kettimuthu R. (2005).Restricted Slow-Start for TCP, Cluster Computing - CLUSTER IEEE International, Burlington, MA, pp. 1-2, 2005
[16]Floyd S., Allman M.., Jain A., Sarolahti P. (2007). Quick-Start for TCP and IP. RFC 4782.
[17]Chen Z., Deng X., Zhang L. and Zeng B. (2005). A new Parameter-Config Based Slow Start Mechanism, Journal of Communication and Computer, Vol 2, No 5, USA.
[18]Cavendish D., Kumazoe K., Tsuru M., Oie Y. (2009). Capstart: An Adaptive TCP Slow Start for High speed Networks. Department of Computer Institute of Technology, Japan.
[19]Kelly F. (1997). Changing and rate control for elastic traffic “European Transactions on Telecommunications Vol 8.
[20]Kelly, F. P. Maulloo A. K. and Tan Dik. H.(1998) Rate control in communication networks: Shadow prices, proportional fairness and stability Journal of Operational Research Society.
[21]Jacobson V. (1988). Congestion avoidance and Control in proceedings of ACM Sigcomm 314-329, Scanford, CA.
[22]Moller Neils (2008). Window Based Congestion Control, Modeling Analysis and Design, Doctoral Thesis, KTH, Stockholns, Sweden.
[23]Boyd S. and Vandenberghe L. Convex Optimization. Cambridge university press, New York, 2004, Seventh printing with corrections 2009 ISBN 0 521 83378 7
[24]Jacobsson K. (2008). Dynamic Modeling of Internet Congestion Control, Ph.D. Thesis. University of Stockholm, Sweden.
[25]Wang, Jiantao (2005). The Oretial Study of Internet Congestion Control: Equilibrium and Dynamics, PhD Thesis, California Institute of Technology, California.
[26]Dorf R and Bishop R. (2011). Modern Control Systems, Pearson Eduction, Inc.,Published by Prentice Hall, New Jersey, USA.
[27]Srikant R.(2004) The Mathematics of Internet Congestion Control, Birkauser Boston Inc, c/o Springer Verlag, New York.