Routing algorithm for multirate circuit switching in quantized Clos network.

Abstract

by Wai-Hung Kwok.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Chapter 1 --- Introduction --- p.1Chapter 2 --- Preliminaries - Routing in Classical Circuit Switching Clos Net- work --- p.9Chapter 2.1 --- Formulation of route assignment as bipartite multigraph coloring problem --- p.10Chapter 2.1.1 --- Definitions --- p.10Chapter 2.1.2 --- Problem formulation --- p.11Chapter 2.2 --- Edge-coloring of bipartite graph --- p.12Chapter 2.3 --- Routing algorithm - Paull's matrix --- p.15Chapter 3 --- Principle of Routing Algorithm --- p.18Chapter 3.1 --- Definitions --- p.18Chapter 3.1.1 --- Bandwidth quantization --- p.18Chapter 3.1.2 --- Connection splitting --- p.20Chapter 3.2 --- Non-blocking conditions --- p.20Chapter 3.2.1 --- Rearrangeably non-blocking condition --- p.21Chapter 3.2.2 --- Strictly non-blocking condition --- p.22Chapter 3.3 --- Formulation of route assignment as weighted bipartite multigraph coloring problem --- p.23Chapter 3.4 --- Edge-coloring of weighted bipartite multigraph with edge splitting --- p.25Chapter 3.4.1 --- Procedures --- p.25Chapter 3.4.2 --- Example --- p.27Chapter 3.4.3 --- Validity of the color rearrangement procedure --- p.29Chapter 4 --- Routing Algorithm --- p.32Chapter 4.1 --- Capacity allocation matrix --- p.32Chapter 4.2 --- Connection setup --- p.34Chapter 4.2.1 --- Non-splitting stage --- p.35Chapter 4.2.2 --- Splitting stage --- p.36Chapter 4.2.3 --- Recursive rearrangement stage --- p.37Chapter 4.3 --- Connection release --- p.40Chapter 4.4 --- Realization of route assignment in packet level --- p.42Chapter 5 --- Performance Studies --- p.45Chapter 5.1 --- External blocking probability --- p.45Chapter 5.1.1 --- Reduced load approximation --- p.46Chapter 5.1.2 --- Comparison of external blocking probabilities --- p.48Chapter 5.2 --- Connection splitting probability --- p.50Chapter 5.3 --- Recursive rearrangement probability --- p.50Chapter 6 --- Conclusions --- p.5