No description available.

Xiao Lurong. / Thesis submitted in: June 2005. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves [74]-76). / Abstracts in English and Chinese. / ABSTRACT --- p.I / 摘要 --- p.III / ACKNOWLEDGMENTS --- p.IV / CONTENT --- p.V / LIST OF FIGURES --- p.VII / LIST OF TABLES --- p.IX 1 / Chapter CHAPTER 1 --- INTRODUCTION / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Related Works --- p.3 / Chapter 1.3 --- Active Service Network --- p.12 / Chapter 1.4 --- Motivations and Contributions --- p.13 / Chapter 1.5 --- Outline --- p.14 / Chapter CHAPTER 2 --- ACTIVE SERVICE NETWORKS (ASN) ARCHITECTURE --- p.16 / Chapter 2.1 --- Internet Architecture --- p.16 / Chapter 2.2 --- ASN Enterprise Model --- p.19 / Chapter 2.3 --- ASN network Architecture --- p.20 / Chapter 2.4 --- ASN System Architecture --- p.24 / Chapter 2.5 --- Summary --- p.26 / Chapter CHAPTER 3 --- ASN VS. CLIENT SERVER APPROACH --- p.27 / Chapter 3.1 --- Application Scenario --- p.21 / Chapter 3.2 --- Application Models --- p.28 / Chapter 3.3 --- Analytical Models --- p.29 / Chapter 3.4 --- Performance Results --- p.34 / Chapter 3.5 --- Chapter Summary --- p.37 / Chapter CHAPTER 4 --- DESIGN PROBLEMS --- p.38 / Chapter 4.1 --- Problem Definitions --- p.38 / Chapter 4.2 --- Related works --- p.40 / Chapter 4.3 --- Problem Formulation --- p.43 / Chapter 4.4 --- Heuristic Algorithms --- p.49 / Chapter 4.5 --- Simulation Results --- p.51 / Chapter 4.6 --- Chapter Summary --- p.57 / Chapter CHAPTER 5 --- PERFORMANCE EVALUATION --- p.58 / Chapter 5.1 --- Simulation Model --- p.58 / Chapter 5.2 --- Blocking Performance --- p.60 / Chapter 5.3 --- Advanced Capabilities --- p.64 / Chapter 5.4 --- Chapter Summary --- p.69 / Chapter CHAPTER 6 --- CONCLUSION --- p.71 / Chapter 6.1 --- Contributions --- p.71 / Chapter 6.2 --- Future works --- p.72 / REFERENCES --- p.74

Jiang Wenjie. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 89-96). / Abstracts in English and Chinese. / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Challenges --- p.2 / Chapter 1.3 --- Our Contribution --- p.4 / Chapter 1.4 --- Structure of the thesis --- p.5 / Chapter 2 --- Background Study --- p.7 / Chapter 2.1 --- An Introduction to Overlay Networks --- p.8 / Chapter 2.1.1 --- What is an Overlay Network? --- p.8 / Chapter 2.1.2 --- Benefits of Overlay Networks --- p.13 / Chapter 2.2 --- Taxonomy of Overlay Networks --- p.16 / Chapter 2.2.1 --- Routing Overlay Networks --- p.16 / Chapter 2.2.2 --- Content Delivery Networks (CDNs) --- p.25 / Chapter 2.2.3 --- Security Overlay Networks --- p.28 / Chapter 3 --- Mathematical Models for Overlay Routing --- p.32 / Chapter 3.1 --- Formulation of Routing in Overlay Networks --- p.32 / Chapter 3.2 --- Optimal Overlay Routing Policy --- p.34 / Chapter 3.3 --- Illustration of Overlay Routing Policy --- p.37 / Chapter 4 --- Overlay Routing Game --- p.40 / Chapter 4.1 --- Strategic Nash Routing Game --- p.40 / Chapter 4.2 --- Stable Property of Overlay Optimal Routing --- p.43 / Chapter 4.3 --- Routing Game in Other Forms --- p.44 / Chapter 5 --- Comparison of Routing Strategies: A Spectrum of Efficiency --- p.46 / Chapter 5.1 --- Global Optimal Routing --- p.47 / Chapter 5.2 --- Selfish User Routing --- p.49 / Chapter 5.3 --- Optimal Overlay Routing --- p.51 / Chapter 5.4 --- Performance Comparison --- p.54 / Chapter 6 --- Simulations on Routing Game --- p.56 / Chapter 6.1 --- Fluid Level Simulation --- p.56 / Chapter 6.2 --- Packet Level Simulation --- p.59 / Chapter 7 --- Understanding Various Issues & Implications of Overlay Interaction --- p.65 / Chapter 7.1 --- Sub-optimality of Nash Equilibrium --- p.66 / Chapter 7.2 --- Slow convergence to Nash equilibrium --- p.67 / Chapter 7.3 --- Fairness Paradox --- p.68 / Chapter 8 --- Overlay Pricing --- p.71 / Chapter 8.1 --- Pricing mechanism to improve end-to-end delay --- p.71 / Chapter 8.1.1 --- Fluid-level Simulation --- p.74 / Chapter 8.1.2 --- Packet-level Simulation --- p.77 / Chapter 8.2 --- Pricing mechanism to improve fairness --- p.77 / Chapter 9 --- Related Work --- p.83 / Chapter 10 --- Conclusion --- p.86 / Chapter 10.1 --- Summary of the Contribution --- p.86 / Chapter 10.2 --- Future Directions --- p.87 / Bibliography --- p.89 / Chapter A --- Proof of Existence of Nash Equilibrium --- p.97

Typescript, etc. / Digitized by Kansas Correctional Industries

Liu Yunkai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 43-45). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Background --- p.4 / Chapter 2.1 --- Notations --- p.4 / Chapter 2.2 --- Service Overlay Network Architecture --- p.5 / Chapter 2.3 --- The SON Cost Model --- p.5 / Chapter 2.4 --- Bandwidth Provisioning Problem --- p.7 / Chapter 2.5 --- Traffic Variation and QoS Violation Penalty --- p.8 / Chapter 3 --- Service Replication Model --- p.12 / Chapter 3.1 --- One-to-One Service Model --- p.13 / Chapter 3.2 --- Service Delivery Tree Model --- p.16 / Chapter 3.2.1 --- Problem Formulation --- p.17 / Chapter 3.2.2 --- Distributed Evaluation of SDT --- p.20 / Chapter 3.2.3 --- Approximation --- p.22 / Chapter 4 --- Service Replication Algorithms --- p.24 / Chapter 4.1 --- Centralized Service Replication Algorithm --- p.24 / Chapter 4.1.1 --- Preprocessing Phase --- p.24 / Chapter 4.1.2 --- Searching Phase --- p.26 / Chapter 4.2 --- Distributed Service Replication Algorithm --- p.27 / Chapter 4.3 --- Improved Distributed Algorithm --- p.28 / Chapter 5 --- Performance Evaluations --- p.32 / Chapter 5.1 --- Experiment 1: Algorithm Illustration --- p.32 / Chapter 5.2 --- Experiment 2: Performance Comparison --- p.34 / Chapter 5.3 --- Experiment 3: Scalability Analysis --- p.36 / Chapter 5.3.1 --- Experiment 3A --- p.36 / Chapter 5.3.2 --- Experiment 3B --- p.37 / Chapter 5.3.3 --- Experiment 3C --- p.38 / Chapter 5.4 --- Experiment 4: Multiple replications --- p.39 / Chapter 6 --- Related Work --- p.41 / Chapter 7 --- Conclusion --- p.42 / Bibliography --- p.45

Thesis (M.S.)--University of Missouri--Rolla, 2007. / Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed November 30, 2007) Includes bibliographical references (p. 55-57).

Thesis (M.Eng.)--University of Louisville, 2007. / Title and description from thesis home page (viewed December 14, 2007). Department of Computer Engineering and Computer Science. Vita. "May 2007." Includes bibliographical references (p. 163-170).

Graduation date: 1996

This thesis work exhibits the survival of IPv4 addressing architecture and also about the distribution and allocation of IPv4 addresses. The fast growth of the Internet demands huge address space and it is the prominent cause for IPv4 exhaustion. The information regarding the existence of IPv4 addressing architecture in spite of its huge demand for the address space is also discussed. The temporary solutions like private IP addresses, CIDR, NAT makes the life of V4 still alive. But the permanent solution is to shift towards the new addressing scheme, IPv6. The merits and demerits of using both the addressing scheme are also discussed. Deploying IPv6 leads to the co-existence of V4 and V6 during the transition phase. Hence appropriate tunneling and transition techniques have to be deployed to make communication possible across both the addressing scheme. After the transition period the whole internet will be operating with V6 address. During that phase packet travelling across LAN will be carrying huge header to payload ratio. Hence finally this paper also brings out a suggestion on reducing this ratio across the local traffic in the V6 environment.

No description available.