Title page for ETD etd-0513102-135155

Document Type thesis

Author Name Kannan, Hariharan

Email Address harik at cs.wpi.edu

URN etd-0513102-135155

Title TCP-Carson: A loss-event based Adaptive AIMD algorithm for Long-lived Flows

Degree MS

Department Computer Science

Advisors
Prof. Mark L. Claypool, Advisor
Prof. Robert Kinicki, Co-Advisor
Prof. David Finkel, Reader
Prof. Micha Hofri, Department Head

Keywords
Loss
TFRC
AIMD
TCP

Date of Presentation/Defense 2003-04-29

Availability unrestricted

Abstract
The diversity of network applications over the Internet has propelled researchers to rethink
the strategies in the transport layer protocols. Current applications either use UDP
without end-to-end congestion control mechanisms or, more commonly, use TCP. TCP
continuously probes for bandwidth even at network steady state and thereby causes variation
in the transmission rate and losses. This thesis proposes TCP Carson, a modification
of the window-scaling approach of TCP Reno to suit long-lived flows using loss-events as
indicators of congestion. We analyzed and evaluated TCP Carson using NS-2 over a wide
range of test conditions. We show that TCP Carson reduces loss, improves throughput
and reduces window-size variance. We believe that this adaptive approach will improve
both network and application performance.

Files
hammel.pdf

Browse by Author | Browse by Department | Search all available ETDs

Questions? Email etd-questions@wpi.edu
Maintained by webmaster@wpi.edu

Document Type	thesis
Author Name	Kannan, Hariharan
Email Address	harik at cs.wpi.edu
URN	etd-0513102-135155
Title	TCP-Carson: A loss-event based Adaptive AIMD algorithm for Long-lived Flows
Degree	MS
Department	Computer Science
Advisors	Prof. Mark L. Claypool, Advisor Prof. Robert Kinicki, Co-Advisor Prof. David Finkel, Reader Prof. Micha Hofri, Department Head
Keywords	Loss TFRC AIMD TCP
Date of Presentation/Defense	2003-04-29
Availability	unrestricted
Abstract The diversity of network applications over the Internet has propelled researchers to rethink the strategies in the transport layer protocols. Current applications either use UDP without end-to-end congestion control mechanisms or, more commonly, use TCP. TCP continuously probes for bandwidth even at network steady state and thereby causes variation in the transmission rate and losses. This thesis proposes TCP Carson, a modification of the window-scaling approach of TCP Reno to suit long-lived flows using loss-events as indicators of congestion. We analyzed and evaluated TCP Carson using NS-2 over a wide range of test conditions. We show that TCP Carson reduces loss, improves throughput and reduces window-size variance. We believe that this adaptive approach will improve both network and application performance.
Files	hammel.pdf