NCP: Finishing Flows Even More Quickly

Fesehaye, Debessay; Xia, Pengye; Godfrey, P. Brighten; Nahrstedt, Klara; Lumetta, Steven S.

Permalink

https://hdl.handle.net/2142/30401 Copy

Description

Title

NCP: Finishing Flows Even More Quickly

Author(s)

• Fesehaye, Debessay
• Xia, Pengye
• Godfrey, P. Brighten
• Nahrstedt, Klara
• Lumetta, Steven S.

Issue Date

2012-03-24

Keyword(s)

Congestion control, protocol design, file download time

Abstract

The transmission control protocol (TCP) is the major trans- port layer protocol in the Internet today. TCP and its vari- ants have the drawback of not knowing the explicit rate share of flows at bottleneck links. The Rate Control Proto- col (RCP) is a major clean slate congestion control protocol which has been recently proposed to address these draw- backs. RCP tries to get explicit knowledge of flow shares at bottleneck links. However, RCP under or over estimates the number of active flows which it needs to obtain the flow fair rate share. This causes under or over utilization of bot- tleneck link capacity. This in turn can result in very high queue length and packet drops which translate into a high average file completion time (AFCT). In this paper we present the design and analysis of a Network congestion Control Protocol (NCP). NCP can give flows their fair share rates and hence resulting in the minimum AFCT. Unlike RCP, NCP can also use accurate formula to calculate the number of flows sharing a network link. This enables NCP to assign fair share rates to flows without over or under-utilization of bottleneck link capacities. Simula- tion results confirm the design goals of NCP in achieving minimum AFCT when compared with RCP.

Type of Resource

text

Language

en

Permalink

http://hdl.handle.net/2142/30401

Owning Collections