University of Illinois Urbana-Champaign

Integrated Switching Networks: A Performance Study

Kim, Chong Kwon

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/69582

Description

Title
Integrated Switching Networks: A Performance Study
Author(s)
Kim, Chong Kwon
Issue Date
1987
Doctoral Committee Chair(s)
Reed, Daniel
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)
Computer Science
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.
Graduation Semester
1987
Type of Resource
text
Permalink
http://hdl.handle.net/2142/69582

Owning Collections

Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at Illinois
Dissertations and Theses - Computer Science
Dissertations and Theses from the Dept. of Computer Science