Routing algorithm for multirate circuit switching in quantized Clos network.

by Wai-Hung Kwok. === Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. === Chapter 1 --- Introduction --- p.1 === Chapter 2 --- Preliminaries - Routing in Classical Circuit Switching Clos Net- work --- p.9 === Chapter 2.1 --- Formulation of route assignment as bipartite multigraph coloring...

Full description

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