Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 255))

  • 965 Accesses

Abstract

TCP Vegas is regarded as balanced congestion control strategy, however, shortcomings such as low bandwidth utilization and not gain fairness when sharing link with TCP Reno. We reinvestigate these issues and propose a modification strategy called Dynamic Vegas, which changes initial TCP Vegas’ in slow start and congestion avoidance phase. It dynamically chooses slow start algorithm and adjust decrease/increase rate in congestion avoidance phase according to specific network environment. Experiments show that within a single link network, it performs as well as TCP Vegas. Additionally, in Multi-link environment, it achieves strong competitiveness against TCP Reno and gains fairness in throughput of all senders in the end of transmission.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Brakmo, L.S., Peterson, L.L.: TCP Vegas: End to end congestion avoidance on a global Internet. IEEE J. Sel. Areas Commun. 13(8), 1465–1480 (1995)

    Article  Google Scholar 

  2. Mo, J., La, R.J., Anantharam, V., Walrand, J: Analysis and comparison of TCP Reno and Vegas. IEEE proceedings of eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM’99, vol. 3 (1999)

    Google Scholar 

  3. Srijith, K.N., Lillykutty, J., Ananda, A.L.: TCP Vegas-A: solving the fairness and rerouting issues of TCP Vegas. Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference 2003

    Google Scholar 

  4. Zeng, Y., Wei-Jun, JZ: A rerouting issue with TCP Vegas and its solution. Comput. Sci. 8(2006), 009 (2006)

    Google Scholar 

Download references

Acknowledgments

This work is supported by Scientific Research Fund of Yunnan Provincial Department of Education under Grant No. 2012C108; Education Innovation Fund of Software School of Yunnan University under Grant No. 2010EI13 and No. 2010EI14.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Keren Zhou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Zhou, K., Yu, Q., Zhu, Z., Liu, W. (2014). Dynamic Vegas: A Competitive Congestion Control Strategy. In: Patnaik, S., Li, X. (eds) Proceedings of International Conference on Computer Science and Information Technology. Advances in Intelligent Systems and Computing, vol 255. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1759-6_40

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1759-6_40

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1758-9

  • Online ISBN: 978-81-322-1759-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics