No description available.

Zhang Lin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 74-78). / Abstracts in English and Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Why use economic models? --- p.1 / Chapter 1.2 --- Why Overlay? --- p.2 / Chapter 1.3 --- Our Contribution --- p.3 / Chapter 1.4 --- Thesis Organization --- p.5 / Chapter Chapter 2 --- Related Works --- p.7 / Chapter 2.1 --- Overlay Multicast --- p.7 / Chapter 2.2 --- IP Multicast Congestion Control --- p.11 / Chapter 2.2.1 --- Architecture Elements of IP Multicast Congestion Control --- p.11 / Chapter 2.2.2 --- Evaluation of Multicast Video --- p.13 / Chapter 2.2.3 --- End-to-End Schemes --- p.14 / Chapter 2.2.4 --- Router-supported Schemes --- p.16 / Chapter 2.2.5 --- Conclusion --- p.19 / Chapter 2.3 --- Optimization-based Rate Control in IP unicast and multicast --- p.20 / Chapter 2.3.1 --- Optimization-based Rate Control for Unicast Sessions --- p.21 / Chapter 2.3.2 --- Optimization-based Rate Control for Multi-rate Multicast Sessions --- p.24 / Chapter Chapter 3 --- Overlay Multicast Rate Control Algorithms --- p.27 / Chapter 3.1 --- Motivations --- p.27 / Chapter 3.2 --- Problem Statement --- p.28 / Chapter 3.2.1 --- Network Model --- p.28 / Chapter 3.2.2 --- Problem Formulation --- p.29 / Chapter 3.2.3 --- Algorithm Requirement --- p.33 / Chapter 3.3 --- Primal-based Algorithm --- p.34 / Chapter 3.3.1 --- Notations --- p.34 / Chapter 3.3.2 --- An Iterative Algorithm --- p.36 / Chapter 3.3.3 --- Convergence Analysis --- p.37 / Chapter 3.3.3.1 --- Assumptions --- p.37 / Chapter 3.3.3.2 --- Convergence with various step-sizes --- p.39 / Chapter 3.3.3.3 --- Theorem Explanations --- p.39 / Chapter 3.4 --- Dual-based Algorithm --- p.40 / Chapter 3.4.1 --- The Dual Problem --- p.41 / Chapter 3.4.2 --- Subgradient Algorithm --- p.43 / Chapter 3.4.3 --- Interpretation of the Prices --- p.44 / Chapter 3.4.4 --- Convergence Analysis --- p.45 / Chapter Chapter 4 --- Protocol Description and Performance Evaluation --- p.47 / Chapter 4.1 --- Motivations --- p.47 / Chapter 4.2 --- Protocols --- p.47 / Chapter 4.2.1 --- Notations --- p.48 / Chapter 4.2.2 --- Protocol for primal-based algorithm --- p.48 / Chapter 4.2.3 --- Protocol for dual-based algorithm --- p.53 / Chapter 4.3 --- Performance Evaluation --- p.57 / Chapter 4.3.1 --- Simulation Setup --- p.57 / Chapter 4.3.2 --- Rate Convergence Properties --- p.59 / Chapter 4.3.3 --- Data Rate Constraint --- p.67 / Chapter 4.3.4 --- Link Measurement Overhead --- p.68 / Chapter 4.3.5 --- Communication Overhead --- p.70 / Chapter Chapter 5 --- Conclusion Remarks and Future Work --- p.73 / References --- p.74

Sun Tong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 77-81). / Abstracts in English and Chinese. / Chinese Abstract --- p.I / Abstract --- p.II / Acknowledgements --- p.III / List of Contents --- p.IV / List of Figures --- p.VII / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Multicast Routing Problem --- p.1 / Chapter 1.2 --- Constrained multicast routing problem and SSRA algorithm --- p.4 / Chapter 1.3 --- Thesis organization --- p.7 / Chapter Chapter 2 --- Constrained Multicast Routing Algorithms --- p.8 / Chapter 2.1 --- Steiner tree heuristic --- p.8 / Chapter 2.1.1 --- Shortest Paths Heuristic --- p.9 / Chapter 2.1.2 --- Distance Network Heuristic --- p.10 / Chapter 2.2 --- Review of existing constrained multicast routing algorithms --- p.10 / Chapter 2.2.1 --- Static group member --- p.10 / Chapter 2.2.2 --- Dynamic group member --- p.14 / Chapter 2.2.2.1 --- Non-rearrangeable --- p.15 / Chapter 2.2.2.2 --- Rearrangeable --- p.23 / Chapter Chapter 3 --- Small Scale Rearrangement Algorithm for Multicast Routing --- p.32 / Chapter 3.1 --- Problem formulation --- p.32 / Chapter 3.1.1 --- Network Model --- p.32 / Chapter 3.1.2 --- Problem Specification --- p.33 / Chapter 3.1.3 --- Definitions and Notations --- p.36 / Chapter 3.2 --- Local Checking Scheme (LCS) --- p.37 / Chapter 3.3 --- Small Scale Rearrangement Algorithm (SSRA) for Multicast Routing --- p.41 / Chapter 3.3.1 --- Static group membership --- p.42 / Chapter 3.3.2 --- Dynamic group membership --- p.43 / Chapter 3.3.2.1 --- Node addition --- p.44 / Chapter 3.3.2.2 --- Node removal --- p.44 / Chapter 3.3.2.3 --- General steps --- p.45 / Chapter 3.3.2.4 --- Example --- p.47 / Chapter Chapter 4 --- Analysis --- p.50 / Chapter Chapter 5 --- Simulations --- p.54 / Chapter 5.1 --- Simulation Model --- p.54 / Chapter 5.2 --- Simulation Parameters Parameter Default Value/Generating Method --- p.56 / Chapter 5.3 --- Performance Metrics --- p.58 / Chapter 5.4 --- Discussion of Results --- p.59 / Chapter 5.4.1 --- Group 1: static group membership --- p.59 / Chapter 5.4.2 --- Group 2: dynamic group membership --- p.63 / Chapter 5.4.3 --- Comparison --- p.69 / Chapter 5.5 --- Implementation Issue --- p.73 / Chapter Chapter 6 --- Conclusion --- p.75 / Reference --- p.77

Wan, Yujie. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 52-56). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Nonblocking Conditions of Three-stage Clos Networks --- p.2 / Chapter 1.2 --- Previous Works on Unicast Nonblocking Conditions --- p.4 / Chapter 1.3 --- Previous Works on Multicast Nonblocking Conditions --- p.7 / Chapter 1.4 --- Thesis Organization and Contributions --- p.9 / Chapter 2 --- Unified Coloring Framework --- p.11 / Chapter 2.1 --- Conflict Graph of Multicast Calls --- p.11 / Chapter 2.2 --- Check of Unicast Nonblocking Conditions --- p.17 / Chapter 2.3 --- Call Splitting and Hardware Models --- p.20 / Chapter 3 --- SNB Conditions --- p.24 / Chapter 3.1 --- Model 1 --- p.25 / Chapter 3.2 --- "Model 0, 2, and 3" --- p.26 / Chapter 3.2.1 --- Worst-Case Call Splitting --- p.26 / Chapter 3.2.2 --- Proof of Nonblocking Conditions --- p.27 / Chapter 3.3 --- Comparison and Discussion --- p.31 / Chapter 4 --- WSNB and RNB Conditions --- p.33 / Chapter 4.1 --- Review of Results for Model 1 --- p.33 / Chapter 4.2 --- Review of Results for Model 2 --- p.35 / Chapter 4.3 --- New Results for Model 3 --- p.36 / Chapter 4.3.1 --- Proof of Nonblocking Conditions --- p.36 / Chapter 4.3.2 --- WSNB Routing Algorithm --- p.39 / Chapter 4.3.3 --- Comparison and Discussion --- p.40 / Chapter 4.4 --- New Results for Model 0 --- p.41 / Chapter 4.4.1 --- Equivalence between RNB Condition and K-partite Vertex Coloring --- p.41 / Chapter 4.4.2 --- Proof of Nonblocking Conditions --- p.43 / Chapter 4.4.3 --- Comparison and Discussion --- p.47 / Chapter 5 --- Conclusion and Future Work --- p.49 / Bibliography --- p.52

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

Not available / text

Modern networks are a reliable and effective medium for moving large volumes of data, however when considering the exponential growth of content, bandwidth and server availability is a finite resource. In many cases, the same content is being sent to multiple users, each consuming resources. Multicast offers scaling, that allows groups of users to receive common content at little extra network cost. While multicast deployment has been slow in terrestrial networks, the multicast service is ideally suited to IP-based broadband satellite networks. Despite this, many current broadband satellite systems do not provide any or limited support for IP multicast services. This thesis seeks to change this and identifies the protocols required to introduce support for IP multicast in broadband satellite systems. It examines the protocols required, with a focus on IP multicast routing using the Protocol Independent Multicast – Sparse Mode (PIM-SM) routing protocol. The robustness and overhead of the protocol are analyzed. This thesis proposes a set of architectures for the efficient delivery of IP multicast over an interactive satellite network. This thesis considers the key functions required to realize end-to-end IP multicast using the emergent 2nd Generation Digital Video Broadcast Return Link via Satellite (DVB-RCS2) specification. It also considers the differences between DVB-RCS2 and a mobile broadband satellite system and proposes appropriate methods for both use-cases. This facilitates merging satellite access networks with a multicast-enabled Internet backbone, enabling delivery of native IP multicast services to networks connected to a satellite terminal. The return link in a two-way broadband satellite network is often considered an expensive resource, which motivates the efficient use of this resource. This thesis therefore examines the applicability of header compression for a satellite system and proposes the use of Robust Header Compression (ROHC) to improve link efficiency.

No description available.

Thesis (Ph.D.)--University of Nebraska-Lincoln, 2007. / Title from title screen (site viewed Nov. 9, 2007). PDF text: 191 p. : ill. ; 10 Mb. UMI publication number: AAT 3266780. Includes bibliographical references. Also available in microfilm and microfiche formats.

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