Please use this identifier to cite or link to this item:
Title: Minimizing queueing delays in computer networks
Keywords: Differentiated Services, Quality of Service, Delay Differentiation, Fair Bandwidth Allocation, Control-theoretic Approach
Issue Date: 28-May-2004
Citation: NGIN HOON TONG (2004-05-28). Minimizing queueing delays in computer networks. ScholarBank@NUS Repository.
Abstract: The current Internet provides a best-effort packet service using the Internet Protocol. It offers no guarantees on actual packet deliveries and users need not make reservations before transmitting packets through it. This architecture has been tremendously successful in supporting data applications as demonstrated by the remarkable growth of the Internet usage over the last decade. However, as the Internet evolves to become a global communication infrastructure, two key weakness have become increasingly obvious. Firstly, it is unable to provide service differentiation so that the network can utilize resources more efficiently to support the many new real-time applications that have started to proliferate over the Internet. Secondly, there is a lack of flow isolation within aggregated traffic which allows congestion unresponsive flows, such as User Datagram Protocol (UDP) flows, to squeeze out the congestion responsive ones, such as Transmission Control Protocol (TCP) flows. In this thesis, an original service differentiation framework, called the Delay-Rate Differentiated Services, is proposed. This framework is able to efficiently provide delay-based service differentiation and flow isolation within the best-effort traffic aggregates, thus resolving the key deficiencies of the best-effort paradigm.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Thesis_Abstract.pdf19.04 kBAdobe PDF


Thesis_Final.pdf727.08 kBAdobe PDF



Page view(s)

checked on Feb 3, 2019


checked on Feb 3, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.