Routing Support for Providing Guaranteed End-to-End Quality-of-Service
Chen, Shigang
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81942
Description
Title
Routing Support for Providing Guaranteed End-to-End Quality-of-Service
Author(s)
Chen, Shigang
Issue Date
1999
Doctoral Committee Chair(s)
Nahrstedt, Klara
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Language
eng
Abstract
The up-coiming Gbps high-speed networds are expected to support a wide range of real-time, communication-intensive applications. The quality-of-service (QoS) requirements for the timely delivery of multimedia information rase new challenges for the development of integrated-service broadband networks. One of the key issues is QoS routing, which allows slecting network routes with sufficient resources for requested QoS parameters. The goal of QoS routing is two-folded: satisfyign the QoS requirements for every admitted connection and achieving global efficiency in resources utilization. Many unicast/multicast QoS routing algorighms were published recently. However, there still exist a lot of unsolved problems in this area. A few examples are listed as follows. (1) There lacks a simple solution with predictable performance and adjustable overhead for the NP-complete multi-constraint routing problem. (2) All existing algorigms are tailored towards specific problems, and there lacks a simple general routing framework which can be easily extended to handle new problems. (3) Most routing alorithms assume the availability of preceise state information about the network, which however is impractical in the real world. We address the above problems, and the goal of this dissertation is to provide simple, general and extensible solutions for QoS routing. We study different routing strategies, compare them and outline the challenges. We propose various algorithms based on different network state models, evaluate these algorithms by analysis and simulation, discuss their strengths and weaknesses of different routing strategies, and compare them with the existing algorithms. The major achievement of this dissertation is outlined in the following. (1) A heuristic approach is proposed to solve the multi-constraint routing problem. It allows the dynamic tradeoff between performance and overhead. (2) A distributed routing framework is proposed to integrate a family of routing algorithms which support applications with QoS requirements on bandwidth, delay, delay jitter, cost, path length, and their combination. (3) Source and distributed routing algorithms axe proposed to work with state information which has a high degree of imprecision. (4) Distributed QoS routing algorithms are proposed for mobile ad-hoc networks whose topologies change as nodes move, join, or leave the networks. (5) An integrated framework is proposed to support routing and scheduling of co-existing QoS and best-effort flows.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
