Wong Kar Yiu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 109-111). / Abstracts in English and Chinese. / Abstract --- p.ii / Acknowledgement --- p.iv / Table of Contents --- p.v / List of Figure --- p.vii / Chapter Chapter 1. --- Introduction --- p.9 / Chapter 1.1 --- Introduction --- p.9 / Chapter 1.2 --- Background --- p.11 / Chapter 1.3 --- Ant Colony Optimization (ACO) --- p.15 / Chapter 1.4 --- Main contribution --- p.16 / Chapter 1.5 --- Thesis organization --- p.18 / Chapter Chapter 2. --- Related Work --- p.19 / Chapter 2.1 --- Multicast routing in general --- p.19 / Chapter 2.2 --- Multicast routing techniques --- p.22 / Chapter 2.3 --- Best-effort multicast routing --- p.25 / Chapter 2.4 --- Quality-of-Service (QoS) multicast routing --- p.30 / Chapter 2.5 --- Adaptive multicast routing --- p.34 / Chapter Chapter 3. --- Load-Sensitive Multicast Routing Protocol (LSMRP) --- p.37 / Chapter 3.1 --- Overview --- p.37 / Chapter 3.2 --- Problem Formulation --- p.37 / Chapter 3.3 --- Types of ant in LSMRP --- p.39 / Chapter 3.3.1 --- Forward Ants --- p.39 / Chapter 3.3.2 --- Random Ants --- p.41 / Chapter 3.3.3 --- Backward Ants --- p.42 / Chapter 3.3.4 --- Multicast Ants --- p.44 / Chapter 3.3.5 --- Multicast Backward Ants --- p.44 / Chapter 3.4 --- Global Algorithm --- p.47 / Chapter 3.4.1 --- Pheromone trails stage --- p.50 / Chapter 3.4.2 --- Multicast tree stage --- p.53 / Chapter 3.4.3 --- Routing table --- p.56 / Chapter 3.4.4 --- Messages Exchange and Mechanisms --- p.57 / Chapter 3.4.5 --- mapping --- p.58 / Chapter 3.4.6 --- Members join --- p.59 / Chapter 3.4.7 --- Members update --- p.59 / Chapter 3.4.8 --- Members leave --- p.61 / Chapter Chapter 4. --- Analysis of LSMRP --- p.63 / Chapter 4.1 --- Analysis of pheromone trail values --- p.63 / Chapter Chapter 5. --- Evaluation and Experimental Results --- p.80 / Chapter 5.1 --- System model --- p.80 / Chapter 5.2 --- Result --- p.84 / Chapter 5.2.1 --- Packets received --- p.84 / Chapter 5.2.2 --- Throughput --- p.86 / Chapter 5.2.3 --- Packet Loss --- p.98 / Chapter Chapter 6. --- Conclusion --- p.107 / Chapter 6.1 --- Future work/ open question --- p.107 / References --- p.109

Deng Ning. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 62-65). / Abstracts in English and Chinese. / ABSTRACT --- p.iii / 摘要 --- p.v / Chapter 1 --- BACKGROUND AND INTRODUCTION --- p.1 / Chapter 1.1 --- Optical Frequency-Shift Keying (FSK) --- p.1 / Chapter 1.1.1 --- Basic concepts and research hotspots of optical FSK --- p.1 / Chapter 1.1.2 --- Optical FSK Transmitter and Receiver --- p.3 / Chapter 1.2 --- Wavelength Division Multiplexing Optical Passive Networks --- p.8 / Chapter 1.3 --- Optical Label Switching (OLS) Networks --- p.10 / Chapter 1.4 --- Thesis Contribution and Organization --- p.11 / Chapter 2 --- DATA RE-MODULATION ON DOWNSTREAM OPTICAL FSK SIGNALS IN WDM-PONS --- p.12 / Chapter 2.1 --- overview of related works --- p.12 / Chapter 2.2 --- PON ARCHITIiCTURE USING DOWNSTREAM OPTICAL FSK SIGNALS --- p.13 / Chapter 2.3 --- CLS PON DEMONSTRATION USING THREE DIFFERENT OPTICAL FSK TRANSMITTERS --- p.14 / Chapter 2.3.1 --- With an optical FSK transmitter based on direct modulation in a DFB laser --- p.14 / Chapter 2.3.2 --- With an optical FSK transmitter based on complementary intensity modulation --- p.17 / Chapter 2.3.3 --- With our proposed optical FSK transmitter based on phase modulation --- p.21 / Chapter 2.4 --- System Performance by Using Phase Modulation Based FSK Transmitter…… --- p.26 / Chapter 2.4.1 --- Wavelength detune of light sources --- p.27 / Chapter 2.4.2 --- Detune of the DI frequency response --- p.29 / Chapter 2.4.3 --- Dispersion tolerance --- p.30 / Chapter 2.5 --- Summary --- p.32 / Chapter 3 --- INTENSITY-MODULATED LABELLING ON OPTICAL FSK OR DPSK PAYLOADS IN OLS NETWORKS --- p.34 / Chapter 3.1 --- Existing Labelling Schemes and Their Features --- p.34 / Chapter 3.1.1 --- Bit serial labelling --- p.35 / Chapter 3.1.2 --- Subcarrier multiplexed (SCM) labelling --- p.36 / Chapter 3.1.3 --- Orthogonally modulated labelling --- p.37 / Chapter 3.2 --- The Proposed 00K Labelling Scheme and OLS System Architecture --- p.38 / Chapter 3.3 --- All-Optical Label Swapping and Other Critical Issues --- p.39 / Chapter 3.4 --- System demonstration --- p.40 / Chapter 3.5 --- Summary --- p.45 / Chapter 4 --- PERFORMANCE CHARACTERIZATION OF THE ASK/FSK AND ASK/DPSK ORTHOGONAL SIGNALS --- p.46 / Chapter 4.1 --- Introduction and Formulation --- p.46 / Chapter 4.2 --- Theoretical Analysis --- p.48 / Chapter 4.2.1 --- Optical ASK performance in orthogonal signals --- p.48 / Chapter 4.2.2 --- Optical FSK performance in ASK/FSK signals --- p.49 / Chapter 4.2.3 --- Optical DPSK performance in ASK/DPSK signals --- p.51 / Chapter 4.3 --- Analytical and Experimental Results --- p.55 / Chapter 4.4 --- Conclusion --- p.57 / Chapter 5 --- SUMMARY --- p.58 / Chapter 5.1 --- Thesis Summary --- p.58 / Chapter 5.2 --- Future Work --- p.59 / LIST OF PUBLICATIONS --- p.61 / REFERENCES --- p.62

by Yee Ka Chi. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 101-[106]). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.1.1 --- Large Scale Switch Interconnections --- p.2 / Chapter 1.1.2 --- Multichannel Switching and Resequencing --- p.6 / Chapter 1.1.3 --- Scheduling --- p.7 / Chapter 2 --- Hierarchical Banyan Switch Interconnection --- p.12 / Chapter 2.1 --- Introduction --- p.12 / Chapter 2.2 --- Switch Architecture --- p.13 / Chapter 2.3 --- Switch Operation --- p.19 / Chapter 2.3.1 --- Call Setup --- p.19 / Chapter 2.3.2 --- Cell Routing --- p.21 / Chapter 2.3.3 --- Fault Tolerance --- p.27 / Chapter 2.4 --- Call Blocking Analysis --- p.28 / Chapter 2.4.1 --- Dilated Banyan --- p.29 / Chapter 2.4.2 --- Dilated Benes Network --- p.30 / Chapter 2.4.3 --- HBSI --- p.30 / Chapter 2.5 --- Results and Discussions --- p.31 / Chapter 2.6 --- Summary --- p.37 / Chapter 3 --- Multichannel Switching and Resequencing --- p.40 / Chapter 3.1 --- Introduction --- p.40 / Chapter 3.2 --- Channel Assignment --- p.41 / Chapter 3.2.1 --- VC-Based Channel Allocation Mechanism --- p.41 / Chapter 3.2.2 --- Port-Based Channel Allocation Mechanism --- p.45 / Chapter 3.2.3 --- Trunk-Based Channel Allocation Mechanism --- p.46 / Chapter 3.3 --- Resequencer --- p.50 / Chapter 3.3.1 --- Resequencing Algorithm --- p.50 / Chapter 3.4 --- Results and Discussion --- p.55 / Chapter 3.5 --- Summary --- p.60 / Chapter 4 --- Scheduling --- p.62 / Chapter 4.1 --- Introduction --- p.62 / Chapter 4.2 --- Virtual Clock Scheduling (VCS) --- p.62 / Chapter 4.3 --- Gated Virtual Clock Scheduling (GVCS) --- p.70 / Chapter 4.4 --- Time-Priority Model --- p.75 / Chapter 4.5 --- Programmable Rate-based Scheduler (PRS) --- p.80 / Chapter 4.6 --- Integration with Resequencer --- p.83 / Chapter 4.7 --- Results and Discussions --- p.86 / Chapter 4.8 --- Summary --- p.96 / Chapter 5 --- Conclusion --- p.99 / Bibliography --- p.101

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: fair active queue management; RED; CSFQ; DRR; round trip time. Includes bibliographical references (p. 53-55).

Thesis (Ph. D.)--University of Washington, 2001. / Vita. Includes bibliographical references (leaves 132-139).

Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Includes vita. Includes bibliographical references.

Thesis (Ph. D.)--University of Hong Kong, 2002. / Includes bibliographical references (leaves 98-103).

Not available / text

published_or_final_version / Computer Science / Master / Master of Philosophy

This thesis has to do with certain fundamental queues that are well established as models for delay in simple packet-switching concentrators and networks. We first revisit the single server queue with Poisson arrivals and general independent service times. We then work out a complete delay analysis for a traffic concentrating tandem network of queues with deterministic service and batch Poisson sources connected to every node; this is the most comprehensive analysis available for a network which is not of Jackson type. We also show how to (partially) extend the analysis to a concentrating tree network, and to an arrival process somewhat more general that batch Poisson. / The two parts of the thesis have a close methodological relationship. Our contribution in both cases is to rederive certain known results, and to produce a variety of new ones, using techniques that are essentially qualitative. Our particular view of the stochastic processes in question is guided by a very special queue discipline, namely Last Come First Served preemptive resume; by identifying certain structural features of the sample paths, one can read, almost without calculation, a host of statistics of common interest. The LCFS preemptive resume discipline also enables us: (i) to strengthen the connection between the single server queue with general independent service times and interarrival times, and the fluctuation theory of random walks; (ii) to strengthen the connection between the queue with Poisson arrivals and branching processes.