Skip to main content
SpringerLink
Log in
Book cover

Pacific-Rim Conference on Multimedia

PCM 2002: Advances in Multimedia Information Processing — PCM 2002 pp 888–895Cite as

TCP-Friendly Congestion Control Algorithm on Self-Similar Traffic Network

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2532))

Abstract

This paper proposes a new unicast TCP-Friendly protocol called RAAR-MT, which on-line predicts the tendency of traffic level in the near future and use this predicted information to exert multiple time scale traffic control at receivers. Simulation shows that this protocol can improve the performance in loss rate on self-similar traffic network. Even in traditional short-range dependent environment, the performance will not degrade severely. Compared with TFRC, RAAR-MT has better performance in TCP-Friendliness, intraprotocol fairness and smoothness. RAAR-MT is also a promising avenue of development for congestion control of multicast multimedia traffic since it is not a per-packet acknowledgement and is mainly implemented at receivers.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. R. Yang, Min S. Kim, and Simon S. Lam. “Transient Behaviors of TCP-Friendly Congestion Control Protocols,” Networking Research Laboratory, Department of Computer Sciences, The University of Texas at Austin, Technical ReportTR-2000-14July2000.

    Google Scholar 

  2. S. Floyd, K. Fall. “Promoting the Use of End-to-End Congestion Control,” IEEE/ACM Transactions on Networking, August 1999.

    Google Scholar 

  3. I. Rhee, V. Ozdemir, Y. Yi, “TEAR: TCP Emulation at Receivers-Flow Control for Multimedia Streaming,” Technical report, North Carolina State University, April 2000.

    Google Scholar 

  4. R. Rejaie, M. Handley, and D. Estrin, “RAP: An End-to-end Rate-based Congestion Control Mechanism for Realtime Streams in the Internet.” Technical Report 98-686, CS-USC, November 1998.

    Google Scholar 

  5. Y. Hu, “Study of Multimedia Traffic Transport Congestion Control Protocol in the Internet,” Ph.D. Thesis, SUN YAT-SEN University, PR.China, October 2001.

    Google Scholar 

  6. S. Floyd, M. Handley, J. Padhye, and J. Widmer, “Equation-Based Congestion Control for Unicast Applications,” Proceedings of SIGCOMM 2000, August 2000

    Google Scholar 

  7. K. Park, W. Willinger. “Self-similar Network Traffic: An Overview” Self-Similar Network Traffic and Performance Evaluation (ed.), Wiley-Interscience, 2000.

    Google Scholar 

  8. K. Park and T. Tuan, “Performance Evaluation of Multiple Time Scale TCP under Selfsimilar Traffic Conditions”, ACM Transactions on Modeling and Computer Simulation, 2000

    Google Scholar 

  9. T. Tuan and K. Park, “Multiple time scale congestion control for self-similar network traffic”, Performance Evaluation, 1999, 36,359–386.

    Article  Google Scholar 

  10. Y. R. Yang and S. S. Lam, “General AIMD Congestion Control,” In Proceedings ICNP 2000, Osaka, Japan, November 2000.

    Google Scholar 

  11. UC Berkeley, LBL, USC/ISI, and Xerox PARC, The ns Manual (formerly ns Notes and Documentation), March 2001.

    Google Scholar 

  12. W. Willinger, V. Paxson and M. S. Taqqu. “Self-Similary and Heavy Tails: Structural Modeling of Network Traffic,”, appears on pages 27–53 in the book: “A Practical Guide To Heavy Tails: Statistical Techniques and Applications.”, Birkhauser, Boston, 1998

    Google Scholar 

  13. M. Handley, J. Pahdye, S. Floyd, and J. Widmer, “TCP Friendly Rate Control (TFRC): Protocol Specification,” Internet draft draft-ietf-tsvwg-tfrc-04.txt, April 2002.

    Google Scholar 

  14. J. Widmer. “Equation-Based Congestion Control,” Diploma Thesis, February 2000.

    Google Scholar 

  15. J. Padhye. “Towards A Comprehensive Congestion Control Framework for Continuous Media Flows in Best Effort Networks,” Ph.D. Thesis, University of Massachusetts Amherst, March 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electronics & Communication Engineering, SUN YAT-SEN University, PR, China

    Yuheng Liu, Yan Hu & Guangzhao Zhang

Authors
  1. Yuheng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yan Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guangzhao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan

    Yung-Chang Chen

  2. Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan

    Long-Wen Chang  & Chiou-Ting Hsu  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Hu, Y., Zhang, G. (2002). TCP-Friendly Congestion Control Algorithm on Self-Similar Traffic Network. In: Chen, YC., Chang, LW., Hsu, CT. (eds) Advances in Multimedia Information Processing — PCM 2002. PCM 2002. Lecture Notes in Computer Science, vol 2532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36228-2_110

Download citation

  • DOI: https://doi.org/10.1007/3-540-36228-2_110

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00262-8

  • Online ISBN: 978-3-540-36228-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation