Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Allocating network resources by weight between TCP traffics

  • Notes
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

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 windowW 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 ω for traffics under the similar communication environments, which can efficiently lead to guaranteed relative quality of services and improve network performances.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Allman M, Paxson V, Stevens W. TCP congestion control. RFC2581, April 1999.

  2. Jacoboson V. Congestion avoidance and control.Computer Communication Review, August, 1988, 18(4): 314–329.

    Article  Google Scholar 

  3. Chiu D M, Jain R. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks.Computer Networks and ISDN Systems, June, 1989, 17(1): 1–14.

    Article  MATH  Google Scholar 

  4. Widmer J. Equation-based congestion control [Thesis]. Feb., 2000. URL http://www.aciri.org/tfrc/.

  5. Floyd S. Connections with multiple congested gateways in packet-switched networks, part 1: One-way traffic.ACM Computer Communication Review, Oct., 1991, 21(5): 30–47.

    Article  Google Scholar 

  6. Floyd S, Handley M, Padhye J, Widmer J. Equation-based congestion control for unicast applications: The extended version. March, 2000, ICSI Technical Report, TR-00-03, URL http://www.aciri.org./tfrc/.

  7. Floyd S, Fall K. Promoting the use of end-to-end congestion control in the Internet.IEEE/ACM Trans. Networking, August, 1999, 7(4): 458–472.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Special Research Center for Optical Internet and Wireless Information Networks (COIWIN), Chongqing University of Posts and Telecommunications, 400065, Chongqing, P.R. China

    ChangBiao Xu & KePing Long

  2. College of Communication Engineering, Chongqing University, 400044, Chongqing, P.R. China

    Shizhong Yang

Authors
  1. ChangBiao Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. KePing Long
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shizhong Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to ChangBiao Xu.

Additional information

This work is supported by the CQUPT Science and Technology Foundation Program (Grant No.A2001-10).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, C., Long, K. & Yang, S. Allocating network resources by weight between TCP traffics. J. Comput. Sci. & Technol. 18, 247–251 (2003). https://doi.org/10.1007/BF02948892

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948892

Keywords

Search

Navigation