|
Candidate:
Konstantinos N. Kokkinos
Degree of:
Doctor of Philosophy
Department: Computer Science
Title:
Load Balancing and Congestion Avoidance Routing
Committee:
Dr. Dionysios Kountanis, Chair
Dr. Gary Chartrand
Dr. Ajay Gupta
Dr. Karlis Kaugars
Date:
October 1, 2002 5:00 p.m. - 7:00 p.m. 3301 Friedmann
Hall
Abstract:
Todays high speed backbone networks are expected to support a wide range
of communication-intensive applications. One of the most important issues
in Quality of Service (QoS) is efficient routing. Many QoS routing solutions
have been published lately for different criteria of WoS requirements
and resource constraints.
In this dissertation we focus on the design of regular network topologies
and suggest efficient routing schemes to minimize the probability of
hot spot creation in the network. Furthermore, we provide with a detection
of congestion mechanism that reroutes traffic to maintain balancing
with small communication cost.
Several theoretical results relatively to network traffic balancing
have been derived. Moreover, heuritic algorithms for the case of static
rerouting without bandwidth guarantees and the case of QoS link state
routing with bandwidth guarantees have been suggested.
A network simulator has been developed for the project experiments.
The experimental results verify our theoretical model.
|
