by Kin-Yu Cheung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 64-[68]). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Multistage Interconnection Architectures --- p.2 / Chapter 1.2 --- Interconnection Topologies --- p.4 / Chapter 1.3 --- Design of Switch Module-An Example of Multichannel Switch --- p.7 / Chapter 1.4 --- Organization --- p.8 / Chapter 1.5 --- Publication --- p.9 / Chapter 2 --- BMSN and SpiderNet: Two Large Scale ATM Switches --- p.13 / Chapter 2.1 --- Introduction --- p.13 / Chapter 2.2 --- Architecture --- p.14 / Chapter 2.2.1 --- Topology --- p.14 / Chapter 2.2.2 --- Switch Modules --- p.15 / Chapter 2.3 --- Routing --- p.17 / Chapter 2.3.1 --- VP/VC Routing --- p.18 / Chapter 2.3.2 --- VP/VC Routing Control --- p.22 / Chapter 2.3.3 --- Cell Routing --- p.23 / Chapter 2.3.4 --- Alternate Path Routing for Fault Tolerance --- p.24 / Chapter 2.4 --- SpiderNet --- p.25 / Chapter 2.5 --- Performance and Discussion --- p.26 / Chapter 2.5.1 --- BMSN vs SpiderNet --- p.26 / Chapter 2.5.2 --- Network Capacity --- p.29 / Chapter 2.6 --- Concluding Remarks --- p.30 / Chapter 3 --- Multichannel ATM Switching --- p.39 / Chapter 3.1 --- Introduction --- p.39 / Chapter 3.2 --- Switch Design --- p.40 / Chapter 3.3 --- Channel Allocation Algorithms --- p.41 / Chapter 3.3.1 --- VC-Based String Round Robin (VCB-SRR) Algorithm --- p.41 / Chapter 3.3.2 --- Implementation of the VCB-SRR Algorithm --- p.43 / Chapter 3.3.3 --- Channel Group Based Round Robin (CGB-RR) Algorithm --- p.50 / Chapter 3.3.4 --- Implementation of the CGB-RR Algorithm --- p.51 / Chapter 3.4 --- Performance and Discussion --- p.53 / Chapter 3.5 --- Concluding Remarks --- p.57 / Chapter 4 --- Conclusion --- p.62 / Bibliography --- p.64

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

Thesis (M.S.)--Brigham Young University. Dept. of Electrical and Computer Engineering, 2006. / Includes bibliographical references (p. 53-54).

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 72-82). Available also in a digital version from Dissertation Abstracts.

Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references. Available also from UMI Company.

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 148-159). Available also in a digital version from Dissertation Abstracts.

Includes bibliographical references (p. 124-131).

Thesis (Ph. D.)--University of Washington, 2002. / Vita. Includes bibliographical references (p. 91-100).

Thesis (Pd. D.)--Worcester Polytechnic Institute. / Keywords: channel measurement; location finding; indoor geolocation; TOA; super-resolution. Includes bibliographical references (p. 165-171).

Not available / text