University of Illinois Urbana-Champaign

Sharing Network Resources Efficiently

Fesehaye, Debessay

Content Files
qcp.pdf

Permalink

https://hdl.handle.net/2142/31847

Description

Title
Sharing Network Resources Efficiently
Author(s)
Fesehaye, Debessay
Issue Date
2012-06-08
Keyword(s)
Congestion, fairness, efficient sharing, fast download
Date of Ingest
2012-06-13T07:44:20Z
Abstract
The transmission control protocol (TCP) is the major trans- port protocol in the Internet. TCP and its variants have the drawback of not accurately knowing rate share of flows at bottleneck links. Other protocols proposed to address these drawbacks either are not fair to short flows, which are the majority of the Internet traffic, or result in high queue length and packet drops which translate into a high average flow completion time (AFCT). In this paper we present the design and analysis of a Quick congestion Control Protocol (QCP). QCP can quickly give flows their fair share rates hence allow them to quickly fin- ish. Unlike existing schemes, QCP uses an accurate for- mula to calculate the number of flows sharing a network link. This enables QCP to get fair share rates to flows with- out over or under-utilization of bottleneck link capacities. We also present an efficient sharing mechanism which QCP uses to assign capacity which is not used by some flows bot- tlenecked elsewhere to other flows which need the capacity. We show how QCP can be implemented by extending the emerging OpenFlow architecture. Simulation results con- firm the design goals of QCP in achieving reduced AFCT.
Type of Resource
text
Genre of Resource
Technical Report
Permalink
http://hdl.handle.net/2142/31847

Owning Collections

Research and Tech Reports - Computer Science PRIMARY