Spelling suggestions: "subject:"anda computer betworks."" "subject:"anda computer conetworks.""
31 |
Optimization-based rate control in overlay multicast.January 2004 (has links)
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
|
32 |
A constrained steiner tree approach for reconstructions of multicast trees.January 2004 (has links)
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
|
33 |
Nonblocking multicast Clos networks. / 無阻塞組播Clos網絡 / Wu zu sai zu bo Clos wang luoJanuary 2011 (has links)
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
|
34 |
Low communication cost parallel system using PCs.January 1996 (has links)
by Yiu Sau Yan Vincent. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 86-88). / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Related Works --- p.3 / Chapter 2.1 --- Tightly-coupled Parallel Systems --- p.5 / Chapter 2.2 --- Loosely-coupled Parallel Systems --- p.6 / Chapter 3 --- Communication Protocol --- p.11 / Chapter 3.1 --- Terminology --- p.12 / Chapter 3.2 --- CUP Model --- p.14 / Chapter 3.3 --- Message Format --- p.15 / Chapter 3.4 --- Message Header --- p.16 / Chapter 3.5 --- Message Content - Control Message --- p.17 / Chapter 3.6 --- Message Transfer Functions --- p.18 / Chapter 3.7 --- Application Development --- p.22 / Chapter 4 --- Multiple Computer Infrastructure --- p.28 / Chapter 4.1 --- Application Supper --- p.32 / Chapter 4.1.1 --- Send and Receive --- p.34 / Chapter 4.1.2 --- Multicast --- p.35 / Chapter 4.1.3 --- Barrier Synchronization --- p.36 / Chapter 4.1.4 --- Start and Delete Process --- p.37 / Chapter 4.2 --- Local Message Routing --- p.39 / Chapter 4.2.1 --- Berkeley Socket --- p.40 / Chapter 4.2.2 --- System V Message Queue --- p.45 / Chapter 4.2.3 --- Shared Memory Queue SMQ --- p.47 / Chapter 4.3 --- Network Message Routing --- p.49 / Chapter 4.3.1 --- Ethernet & TCP Socket --- p.51 / Chapter 4.3.2 --- SCSI Link --- p.52 / Chapter 5 --- System Supporting Facilities --- p.54 / Chapter 5.1 --- Kernel Message Support --- p.54 / Chapter 5.2 --- SCSI Hardware & Device Driver --- p.60 / Chapter 5.2.1 --- SCSI Bus Operations --- p.61 / Chapter 5.2.2 --- Device Driver Internals --- p.65 / Chapter 6 --- Performance --- p.73 / Chapter 7 --- Conclusion --- p.83 / Chapter 7.1 --- Summary of Our Research --- p.83 / Chapter 7.2 --- Future Researches --- p.84
|
35 |
A microprocessor based communications controller for small computer networks /Valiveti, Radhakrishna. January 1981 (has links)
No description available.
|
36 |
A higher order collective classifierMenon, Vikas. January 2009 (has links)
Thesis (M.S.)--Rutgers University, 2009. / "Graduate Program in Computer Science." Includes bibliographical references (p. 60-63).
|
37 |
Measurement-based traffic management for QoS guarantee in multi-service networksSang, Aimin. January 2001 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2001. / Vita. Includes bibliographical references. Available also from UMI Company.
|
38 |
Network interdiction by Lagrangian relaxation and branch-and-bound /Uygun, Adnan. January 2002 (has links) (PDF)
Thesis (M.S.)--Naval Postgraduate School, 2002. / Thesis advisor(s): R. Kevin Wood, Kelly J. Cormican. Includes bibliographical references (p. 45-46). Also available online.
|
39 |
A computational model and multi-agent simulation for information assurance /VanPutte, Michael A. January 2002 (has links) (PDF)
Thesis (Ph. D.)--Naval Postgraduate School, 2002. / Dissertation supervisor: Cynthia Irvine. Includes bibliographical references (p. 155-164). Also available online.
|
40 |
Robust congestion control for IP multicastGorinsky, Sergey, January 2003 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2003. / Vita. Includes bibliographical references. Available also from UMI Company.
|
Page generated in 0.0597 seconds