Files in this item
|(no description provided)|
|Title:||Integrated Switching Networks: A Performance Study|
|Author(s):||Kim, Chong Kwon|
|Doctoral Committee Chair(s):||Reed, Daniel|
|Department / Program:||Computer Science|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|Abstract:||Voice, data, and video traffic share the same transmission and switching facilities in integrated switching networks. Because resources are dynamically shared, integrated switching can support heterogeneous traffic cost effectively. In addition, integrated switching is flexible and access transparent. However, integrated networks have more dynamic traffic fluctuations than packet or circuit switching networks. Hence, it is necessary to use efficient routing algorithms to fully achieve the potential advantage of integrated switching.
Five existing packet routing algorithms were selected for our performance study: NRCC, random, shortest queue, delta, and priority queue routing. In addition, a new hybrid technique called hybrid weighted routing was developed and included in this study. In hybrid weighted routing, local nodes adjust the credit (weight) given to global and local information.
Results from packet switching network simulation and integrated network simulation indicated the superiority of hybrid weighted routing. Especially, in a movable boundary integrated network, hybrid weighted routing supported a larger fraction of traffic, while still maintaining smaller packet delay. A further study indicated the feasibility of using a unified routing algorithm for both packet and circuit traffic. A circuit routing algorithm based on hybrid weighted routing reduced call blocking probability significantly without degrading the performance of packet traffic. Finally, the above observations were confirmed by simulation on a hypercube, a message passing parallel processing machine.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.
|Date Available in IDEALS:||2014-12-15|