Network Friendly Congestion Control: Framework, Protocol Design and Evaluation

Arumaithurai, Mayutan

dc.contributor.advisor	Fu, Xiaoming Prof. Dr.	de
dc.contributor.author	Arumaithurai, Mayutan	de
dc.date.accessioned	2010-11-26T12:11:36Z	de
dc.date.accessioned	2013-01-18T13:24:31Z	de
dc.date.available	2013-01-30T23:51:03Z	de
dc.date.issued	2010-11-26	de
dc.identifier.uri	http://hdl.handle.net/11858/00-1735-0000-0006-B69D-5	de
dc.identifier.uri	http://dx.doi.org/10.53846/goediss-2574
dc.format.mimetype	application/pdf	de
dc.language.iso	eng	de
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/	de
dc.title	Network Friendly Congestion Control: Framework, Protocol Design and Evaluation	de
dc.type	doctoralThesis	de
dc.title.translated	Network Friendly Congestion Control: Framework, Protocol Design and Evaluation	de
dc.contributor.referee	Fu, Xiaoming Prof. Dr.	de
dc.date.examination	2010-11-22	de
dc.description.abstracteng	The increase in bandwidth, the number of internet users and the variety of internet applications, all point towards the need for adaptive and flexible internet protocols. Alternatively, they also emphasize on the necessity for specialized protocols that cater to application requirements. Current Transport protocols such as TCP and UDP are not flexible enough to be used by applications which differ in their performance expectations. UDP, for example, is inelastic in nature and therefore can cause exacerbation of congestion in an already congested network. TCP on the other hand was designed to provide proportional fairness, such that a ``flow'' is the unit which is allocated resources. This not only results in all flows having an equal share at the bandwidth irrespective of the application requirements, but also give way to a new trend of applications that are able to take advantage of the ``flow-oriented'' fairness. Delay-insensitive applications, such as P2P file sharing, generate substantial amounts of traffic and compete with other applications on an equal footing while using TCP. Further, to optimize throughput, such applications open multiple connections. This results in an unfair and potentially poor service for applications having stringent performance objectives. The main part of this thesis proposes NF-TCP, a TCP variant for P2P and similar background delay-insensitive applications. NF-TCP aims to be submissive to delay-sensitive applications under congestion. It is designed to be network friendly based on a fluid flow model for intermediate queues and uses explicit congestion notification (ECN) for early detection of congestion. Moreover, it exploits the measure of the available bandwidth to be able to aggressively utilize spare capacity. It can be observed that the traditional congestion control protocols comprise of tightly coupled mechanisms, and are designed to address a specific problem or scenario. They either lack the flexibility in meeting varying requirements or utilizing different types of available network support. This thesis proposes a congestion control framework that consists of pluggable components and utilizes it to guide the NF-TCP design. It identifies congestion-detection, flow-control and bandwidth-estimation as the main components of the congestion control protocol, which can be loosely or strictly decoupled from each other under a modular framework. This thesis implemented NF-TCP on Linux and ns-2. The evaluations of the NF-TCP Linux implementation on ns-2 show that NF-TCP outperforms other network friendly approaches (e.g., LEDBAT, TCP-LP and RAPID). NF-TCP achieves high utilization, fair bandwidth allocation among NF-TCP flows and maintains a small average queue. The evaluations further demonstrate that with NF-TCP, the available bandwidth can be efficiently utilized for supporting both delay-sensitive and insensitive traffic in a wide range of scenarios.	de
dc.contributor.coReferee	Ramakrishnan, K. K. Dr.	de
dc.contributor.thirdReferee	Hogrefe, Dieter Prof. Dr.	de
dc.subject.ger	Network Friendly TCP	de
dc.subject.ger	submissive	de
dc.subject.ger	background	de
dc.subject.ger	low priority	de
dc.subject.ger	P2P transport	de
dc.subject.ger	delay-insensitive	de
dc.subject.ger	bandwidth estimation	de
dc.subject.ger	congestion control framework	de
dc.subject.ger	early marking	de
dc.subject.eng	Network Friendly TCP	de
dc.subject.eng	submissive	de
dc.subject.eng	background	de
dc.subject.eng	low priority	de
dc.subject.eng	P2P transport	de
dc.subject.eng	delay-insensitive	de
dc.subject.eng	bandwidth estimation	de
dc.subject.eng	congestion control framework	de
dc.subject.eng	early marking	de
dc.identifier.urn	urn:nbn:de:gbv:7-webdoc-2720-3	de
dc.identifier.purl	webdoc-2720	de
dc.affiliation.institute	Fakultät für Mathematik und Informatik	de
dc.identifier.ppn	66155323X	de

Dateien

Name:arumaithurai.pdf

Größe:7.324Mb

Format:PDF

Beschreibung:Dissertation

Öffnen

Name:: arumaithurai.pdf
Größe:: 7.324Mb
Format:: PDF
Beschreibung:: Dissertation

Öffnen

Das Dokument erscheint in:

Fakultät für Mathematik und Informatik (inkl. GAUSS) [519]

Zur Kurzanzeige