Show simple item record

Improving Internet congestion control and queue management algorithms.

dc.contributor.authorFeng, Wu-chang
dc.contributor.advisorShin, Kang G.
dc.date.accessioned2016-08-30T17:49:51Z
dc.date.available2016-08-30T17:49:51Z
dc.date.issued1999
dc.identifier.urihttp://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9929820
dc.identifier.urihttps://hdl.handle.net/2027.42/131643
dc.description.abstractWith the rapid proliferation of the WWW, the Internet has seen enormous growth in both the demand for access from its users and in the demand for new services from its applications. This dissertation focuses on these two important challenges to today's Internet: supporting an explosion in the number of users and supporting a myriad of new applications which require more out of the network than the best-effort service that the Internet currently provides. The first half of this dissertation focuses on the problem of maximizing network efficiency in times of extremely heavy congestion. Over the last decade, TCP congestion control has been instrumental in allowing the network to deliver service in times of high demand. Through analysis, simulation, and experimentation, this dissertation uncovers a number of significant weaknesses in TCP's congestion control algorithm and in current active queue management mechanisms such as RED. With additional growth in demand, these weaknesses are shown to severely degrade network efficiency by driving up packet loss rates in the network. To address these shortcomings, several new queue management (Adaptive RED, BLUE) and congestion control algorithms (SUBTCP) are proposed and evaluated. These algorithms are shown to eliminate packet loss and maximize link utilization much more effectively than TCP and current active queue management algorithms can. In addition to packet loss, another problem with today's congestion control and queue management algorithms is that they only deliver applications a single service, best-effort. As the need for new services has grown, the inability to provide service differentiation across flows beyond best-effort service has become problematic. The second half addresses the problem of supporting additional services across the Internet. In particular, these chapters focus on building scalable, deployable mechanisms for supporting bandwidth guarantees across the Internet based on simple priority mechanisms as outlined by the Differentiated Services working group of the IETF. Using minor extensions to the queue management (Enhanced RED) and congestion control algorithms in place today, these mechanisms provide applications more predictable behavior out of the network and enable the deployment of a large number of bandwidth-sensitive applications.
dc.format.extent132 p.
dc.languageEnglish
dc.language.isoEN
dc.subjectAlgorithms
dc.subjectCongestion Control
dc.subjectDifferentiated Services
dc.subjectImproving
dc.subjectInternet
dc.subjectQueue Management
dc.titleImproving Internet congestion control and queue management algorithms.
dc.typeThesis
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineApplied Sciences
dc.description.thesisdegreedisciplineComputer science
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studies
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/131643/2/9929820.pdf
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.