Yuen Ka-nang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 133-135). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1. --- INTRODUCTION --- p.1 / Chapter 1.1. --- Background --- p.1 / Chapter 1.2. --- Objectives --- p.1 / Chapter 1.3. --- Overview of Thesis --- p.2 / Chapter 2. --- NETWORK ASPECT OF THE VOIP TECHNOLOGY --- p.3 / Chapter 2.1. --- VoIP Overview --- p.3 / Chapter 2.2. --- Elements in VoIP --- p.3 / Chapter 2.2.1. --- Call Setup --- p.3 / Chapter 2.2.2. --- Media Capture/Playback --- p.4 / Chapter 2.2.3. --- Media Encoding/Decoding --- p.4 / Chapter 2.2.4. --- Media Transportation --- p.5 / Chapter 2.3. --- Performance Factors Affecting VoIP --- p.6 / Chapter 2.3.1. --- Network Bandwidth --- p.6 / Chapter 2.3.2. --- Latency --- p.6 / Chapter 2.3.3. --- Packet Loss --- p.7 / Chapter 2.3.4. --- Voice Quality --- p.7 / Chapter 2.3.5. --- Quality of Service (QoS) --- p.7 / Chapter 2.4. --- Different Requirements of Intranet VoIP and Internet VoIP --- p.8 / Chapter 2.4.1. --- Packet Loss/Delay/Jitter --- p.8 / Chapter 2.4.2. --- Interoperability --- p.9 / Chapter 2.4.3. --- Available Bandwidth --- p.9 / Chapter 2.4.4. --- Security Requirement --- p.10 / Chapter 2.5. --- Some Feasibility Investigations --- p.10 / Chapter 2.5.1. --- Bandwidth Calculation --- p.10 / Chapter 2.5.2. --- Simulation --- p.12 / Chapter 2.5.3. --- Conclusion --- p.17 / Chapter 2.5.4. --- Simulation Restrictions --- p.17 / Chapter 3. --- SOFTWARE ASPECT OF THE VOIP TECHNOLOGY --- p.19 / Chapter 3.1. --- VoIP Client in JMF --- p.19 / Chapter 3.1.1. --- Architecture --- p.20 / Chapter 3.1.2. --- Incoming Voice Stream Handling --- p.23 / Chapter 3.1.3. --- Outgoing Voice Stream Handling --- p.23 / Chapter 3.1.4. --- Relation between Incoming/Outgoing Voice Stream Handling --- p.23 / Chapter 3.1.5. --- Areas for Further Improvement --- p.25 / Chapter 3.2. --- Capture/Playback Enhanced VoIP Client --- p.26 / Chapter 3.2.1. --- Architecture --- p.27 / Chapter 3.2.2. --- Native Voice Playback Mechanism --- p.29 / Chapter 3.2.3. --- Native Voice Capturing Mechanism --- p.31 / Chapter 3.3. --- Win32 C++ VoIP Client --- p.31 / Chapter 3.3.1. --- Objectives --- p.32 / Chapter 3.3.2. --- Architecture --- p.33 / Chapter 3.3.3. --- Problems and Solutions in Implementation --- p.37 / Chapter 3.4. --- Win32 DirectSound C++ VoIP Client --- p.38 / Chapter 3.4.1. --- Architecture --- p.39 / Chapter 3.4.2. --- DirectSound Voice Playback Mechanism --- p.40 / Chapter 3.4.3. --- DirectSound Voice Capturing Mechanism --- p.44 / Chapter 3.5. --- Testing VoIP Clients --- p.45 / Chapter 3.5.1. --- Setup of Experiment --- p.45 / Chapter 3.5.2. --- Experiment Results --- p.47 / Chapter 3.5.3. --- Experiment Conclusion --- p.48 / Chapter 3.6. --- Real-time Voice Stream Mixing Server --- p.48 / Chapter 3.6.1. --- Structure Overview --- p.48 / Chapter 3.6.2. --- Experiment --- p.53 / Chapter 3.6.3. --- Conclusion --- p.54 / Chapter 4. --- EXPERIMENTAL STUDIES --- p.55 / Chapter 4.1. --- Pure IP-side VoIP-based Call Center ´ؤ VoIP in Education --- p.55 / Chapter 4.1.1. --- Architecture --- p.55 / Chapter 4.1.2. --- Client Structure --- p.56 / Chapter 4.1.3. --- Client Applet User Interface --- p.58 / Chapter 4.1.4. --- Observations --- p.63 / Chapter 4.2. --- A Simple PBX Experiment --- p.63 / Chapter 4.2.1. --- Structural Overview --- p.63 / Chapter 4.2.2. --- PSTN Gateway Server Program --- p.64 / Chapter 4.2.3. --- Problems and Solutions in Implementation --- p.66 / Chapter 4.2.4. --- Experiment 1 --- p.66 / Chapter 4.2.5. --- Experiment 2 --- p.68 / Chapter 5. --- A COMPREHENSIVE VOIP PROJECT 一 GRADUATE SECOND PHONE (GSP) --- p.72 / Chapter 5.1. --- Overview --- p.72 / Chapter 5.1.1. --- Background --- p.72 / Chapter 5.1.2. --- Architecture --- p.76 / Chapter 5.1.3. --- Technologies Used --- p.78 / Chapter 5.1.4. --- Major Functions --- p.80 / Chapter 5.2. --- Client --- p.84 / Chapter 5.2.1. --- Structure Overview --- p.85 / Chapter 5.2.2. --- Connection Procedure --- p.89 / Chapter 5.2.3. --- User Interface --- p.91 / Chapter 5.2.4. --- Observations --- p.92 / Chapter 5.3. --- Gateway --- p.94 / Chapter 5.3.1. --- Structure Overview --- p.94 / Chapter 5.3.2. --- Connection Procedure --- p.97 / Chapter 5.3.3. --- Caller ID Simulator --- p.97 / Chapter 5.3.4. --- Observations --- p.98 / Chapter 5.4. --- Server --- p.101 / Chapter 5.4.1. --- Structure Overview --- p.101 / Chapter 5.5. --- Details of Major Functions --- p.103 / Chapter 5.5.1. --- Secure Local Voice Message Box --- p.104 / Chapter 5.5.2. --- Call Distribution --- p.106 / Chapter 5.5.3. --- Call Forward --- p.112 / Chapter 5.5.4. --- Call Transfer --- p.115 / Chapter 5.6. --- Experiments --- p.116 / Chapter 5.6.1. --- Secure Local Voice Message Box --- p.117 / Chapter 5.6.2. --- Call Distribution --- p.118 / Chapter 5.6.3. --- Call Forward --- p.121 / Chapter 5.6.4. --- Call Transfer --- p.122 / Chapter 5.6.5. --- Dial Out --- p.124 / Chapter 5.7. --- Observations --- p.125 / Chapter 5.8. --- Outlook --- p.126 / Chapter 5.9. --- Alternatives --- p.127 / Chapter 5.9.1. --- Netmeeting --- p.127 / Chapter 5.9.2. --- OpenH323 --- p.128 / Chapter 6. --- CONCLUSIONS --- p.129 / Bibliography --- p.133

Luk, Chun Pong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 122-125). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction / Motivation --- p.1 / Chapter 1.1 --- Background and Motivation --- p.1 / Chapter 1.2 --- Performance Analysis of Opportunistic Routing in Multi-hop Wireless Network --- p.3 / Chapter 1.3 --- Opportunistic Routing Protocol Design --- p.5 / Chapter 1.4 --- Chapter Summary --- p.6 / Chapter 2 --- Literature Review --- p.8 / Chapter 2.1 --- Introduction --- p.8 / Chapter 2.2 --- Opportunistic Routing Protocols --- p.9 / Chapter 2.2.1 --- Challenges of the Opportunistic Routing Protocol Design --- p.9 / Chapter 2.2.2 --- Overview of Existing Opportunistic Routing Protocols --- p.11 / Chapter 2.2.3 --- Forwarding Set Selection Algorithms --- p.12 / Chapter 2.2.4 --- Actual Forwarder Determination --- p.13 / Chapter 2.2.5 --- Duplicate Suppression Strategies --- p.14 / Chapter 2.2.6 --- Variations of Opportunistic Routing Protocols --- p.16 / Chapter 2.3 --- Performance Evaluation and Analysis of Opportunistic Routing --- p.16 / Chapter 2.4 --- Routing in Networks with Directional Antennas --- p.19 / Chapter 2.4.1 --- Performance Analysis of the use of Directional Antenna in Routing --- p.20 / Chapter 2.4.2 --- Existing Routing and MAC protocols for Networks with Directional Antennas --- p.21 / Chapter 2.5 --- Chapter Summary --- p.22 / Chapter 3 --- Performance Analysis of Opportunistic Routing in Multi-hop Wireless Network --- p.24 / Chapter 3.1 --- Introduction --- p.24 / Chapter 3.2 --- Analytical Derivation of the Expected Progress per Transmission of Opportunistic Routing --- p.25 / Chapter 3.2.1 --- Problem Formulations and Assumptions --- p.26 / Chapter 3.2.2 --- Reception Probability of a Node in a Given Region --- p.28 / Chapter 3.2.3 --- Radio Channel Models --- p.30 / Chapter 3.2.4 --- Average Progress per Transmission --- p.32 / Chapter 3.3 --- Validation and Analytical Results --- p.34 / Chapter 3.3.1 --- Results Validation --- p.34 / Chapter 3.3.2 --- Baseline Models --- p.35 / Chapter 3.3.3 --- Results and Analysis --- p.36 / Chapter 3.4 --- Further Extension of the Model --- p.40 / Chapter 3.5 --- Chapter Summary --- p.42 / Chapter 4 --- Opportunistic Routing in Multi-hop Wireless Networks with Directional Antennas --- p.44 / Chapter 4.1 --- Introduction --- p.44 / Chapter 4.2 --- Performance Analysis of Opportunistic Routing in Networks with Directional Antennas --- p.46 / Chapter 4.2.1 --- Network Model --- p.46 / Chapter 4.2.2 --- Radio Channel Models --- p.47 / Chapter 4.2.3 --- Antenna Models --- p.49 / Chapter 4.2.4 --- Expected Progress per Transmission with Directional Antenna --- p.51 / Chapter 4.2.5 --- Simulation Setup --- p.52 / Chapter 4.2.6 --- Results and Analysis --- p.54 / Chapter 4.3 --- Maximizing the Gain of Opportunistic Routing by Adjusting Antenna Beamwidth and Direction --- p.60 / Chapter 4.3.1 --- Introduction and Motivation --- p.60 / Chapter 4.3.2 --- Network Models --- p.61 / Chapter 4.3.3 --- Algorithms --- p.61 / Chapter 4.3.4 --- Results and Discussions --- p.66 / Chapter 4.3.5 --- Section Summary --- p.71 / Chapter 4.4 --- Chapter Summary --- p.72 / Chapter 5 --- Impact of Interference on Opportunistic Routing --- p.74 / Chapter 5.1 --- Introduction --- p.74 / Chapter 5.2 --- Interference Model --- p.75 / Chapter 5.3 --- MAC Protocols --- p.76 / Chapter 5.4 --- Simulation Results and Discussions --- p.78 / Chapter 5.4.1 --- Simulation Setup --- p.78 / Chapter 5.4.2 --- Baseline Models --- p.78 / Chapter 5.4.3 --- Results and Analysis --- p.79 / Chapter 5.5 --- Chapter Summary --- p.84 / Chapter 6 --- Threshold-based Opportunistic Routing Protocol --- p.86 / Chapter 6.1 --- Introduction --- p.86 / Chapter 6.2 --- Limitations of Existing Opportunistic Routing Protocols --- p.87 / Chapter 6.3 --- System Model --- p.89 / Chapter 6.4 --- Operating Principles of TORP --- p.91 / Chapter 6.5 --- Protocol Details --- p.93 / Chapter 6.5.1 --- Forwarding Set Computation --- p.93 / Chapter 6.5.2 --- Update of Forwarding Set and Remaining Transmission Counts --- p.97 / Chapter 6.5.3 --- Forwarding Threshold Computation and Details of the Packet Forwarding Process --- p.100 / Chapter 6.5.4 --- Node State --- p.101 / Chapter 6.5.5 --- Packet Format --- p.101 / Chapter 6.5.6 --- Batched Acknowledgement --- p.102 / Chapter 6.6 --- Advantages of TORP --- p.102 / Chapter 6.6.1 --- Distributed Forwarding Set Computation --- p.102 / Chapter 6.6.2 --- Threshold-based Forwarding --- p.103 / Chapter 6.6.3 --- MAC-Independence --- p.104 / Chapter 6.7 --- Protocol Extensions --- p.104 / Chapter 6.7.1 --- Implicit ACK --- p.104 / Chapter 6.7.2 --- Progress Recovery --- p.105 / Chapter 6.7.3 --- Modification of TORP for Large Networks --- p.106 / Chapter 6.8 --- Results and Discussions --- p.106 / Chapter 6.8.1 --- Simulation Setup --- p.106 / Chapter 6.8.2 --- Baseline Models --- p.107 / Chapter 6.8.3 --- Performance Evaluations and Analysis --- p.108 / Chapter 6.9 --- Chapter Summary --- p.116 / Chapter 7 --- Conclusion and Future Works --- p.118 / Chapter 7.1 --- Conclusion --- p.118 / Chapter 7.2 --- Future Work --- p.120 / Bibliography --- p.122

Zhang, Zhenyi. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 55-[58]). / Abstracts in Chinese and English. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Problem Formulation --- p.4 / Chapter 3 --- Examples --- p.7 / Chapter 3.1 --- Examples of Undirected Graph --- p.7 / Chapter 3.1.1 --- Example 1: SPF Routing --- p.7 / Chapter 3.1.2 --- Example 2: rings --- p.7 / Chapter 3.1.3 --- Example 3: grid --- p.8 / Chapter 3.1.4 --- Example 4: cube --- p.9 / Chapter 3.1.5 --- Example 5: random graph X --- p.10 / Chapter 3.1.6 --- Example 6: random graph Y --- p.10 / Chapter 3.2 --- An Example for Directive Graph --- p.11 / Chapter 4 --- The Framework --- p.13 / Chapter 4.1 --- The distributed algorithm --- p.13 / Chapter 4.2 --- The modules --- p.14 / Chapter 4.3 --- Path control --- p.15 / Chapter 4.4 --- The forwarding module --- p.18 / Chapter 4.5 --- The routing module --- p.19 / Chapter 4.5.1 --- Non-weighted Routing (NWR) --- p.19 / Chapter 4.5.2 --- Weighted Routing (WR) --- p.20 / Chapter 4.6 --- Packet Aggregation (PKA) --- p.21 / Chapter 5 --- Experiments of Path Aggregation --- p.23 / Chapter 5.1 --- System Setup --- p.24 / Chapter 5.2 --- Experiment Results --- p.25 / Chapter 6 --- Convergence --- p.28 / Chapter 6.1 --- Simulation study --- p.34 / Chapter 6.2 --- Optimality --- p.34 / Chapter 6.3 --- Speed of Convergence --- p.37 / Chapter 7 --- The adaptive property --- p.41 / Chapter 7.1 --- Adapting to new links --- p.42 / Chapter 7.2 --- Adapting to topology changing --- p.43 / Chapter 7.3 --- Adapting to interference and congestion --- p.45 / Chapter 7.4 --- Adapting to traffic flows --- p.45 / Chapter 7.5 --- Adapting to capacity --- p.46 / Chapter 8 --- Related works --- p.48 / Chapter 8.1 --- Spanning Tree --- p.48 / Chapter 8.2 --- Minimum Equivalent Directed Graph Problem --- p.49 / Chapter 8.3 --- Topology Control --- p.50 / Chapter 8.4 --- The Relationship with our problem --- p.53 / Chapter 9 --- Conclusion --- p.54

Yam, Shing Chung Jonathan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 75-79). / Abstracts in English and Chinese. / Abstract / Acknowledgement / Contents / List of Figures / List of Tables / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.2 / Chapter 1.2 --- Thesis Organization --- p.5 / Chapter 2 --- Literature Review --- p.7 / Chapter 2.1 --- Data Sharing and Dissemination --- p.7 / Chapter 2.2 --- Data Aggregation --- p.12 / Chapter 2.3 --- Sensor Network Database Systems --- p.13 / Chapter 2.4 --- Data Routing and Networking --- p.23 / Chapter 2.5 --- Other Applications --- p.24 / Chapter 3 --- Preliminaries --- p.25 / Chapter 3.1 --- Probability Distribution and Gossipee-selection Schemes --- p.25 / Chapter 3.2 --- The Network Models --- p.28 / Chapter 3.3 --- Objective and Problem Statement --- p.30 / Chapter 3.4 --- Two-tier Gossip Mechanism --- p.31 / Chapter 3.5 --- Semantic-dependent Gossip Mechanism --- p.32 / Chapter 4 --- Results for Two-tier Gossip Mechanisms --- p.34 / Chapter 4.1 --- Background --- p.34 / Chapter 4.2 --- A Time Bound for Solving the Clustered Destination Problem with T-Theorem 1 --- p.39 / Chapter 4.3 --- Further Results´ؤTheorem 2 --- p.49 / Chapter 4.4 --- Experimental Results for Two-tier and N-tier Gossip Mechanisms --- p.51 / Chapter 4.4.1 --- Performance Evaluation of Two-tier Gossip Mechanisms --- p.52 / Chapter 4.4.2 --- Performance Evaluation of N-tier Gossip Mechanisms --- p.56 / Chapter 4.5 --- Discussion --- p.60 / Chapter 5 --- Results for Semantic-dependent Gossip Mechanisms --- p.62 / Chapter 5.1 --- Background --- p.62 / Chapter 5.2 --- Theory --- p.65 / Chapter 5.3 --- "Detection of Single Moving Heat Source with S max(2c1l,c1h ))" --- p.66 / Chapter 5.4 --- Detection of Multiple Static Heat Sources with Two-tier Gossip mechanism --- p.69 / Chapter 5.5 --- Discussion --- p.72 / Chapter 6 --- Conclusion --- p.73 / Chapter 7 --- References --- p.75 / Appendix Prove of Result 4.3 --- p.80

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 December 6, 2007) Includes bibliographical references (p. 60-63).

This dissertation investigates the use of a hardware mechanism called Eager Data Transfer (EDT) for achieving the reduction of communication latency for user-level network protocol. To reach the goal, the dissertation addresses the following research issues. First, the development of a communication system performance evaluation tool called Linux/SimOS is presented. Linux/SimOS provides a full system profiling capability to allow measurement at various level including hardware, operating system, and application. Second, the performance analysis of network protocols is presented. For the assessment of overhead related to network protocol operation, Linux/SimOS was used to perform the detailed latency measurements for TCP/IP, UDP/IP, and M-VIA network protocols. Finally, EDT is proposed for reducing communication latency. Since the data transfer time constitutes a significant portion of overall communication latency, the reduction of data transfer time leads to low communication latency. EDT is based on cache coherence interface hardware for reducing data transfer overhead during network protocol operation. Our simulation result shows that EDT is very effective in attaining low communication latency compared to the DMA-based approaches. / Graduation date: 2005

Instant Messaging (IM) has grown rapidly among network users. It has even become a very important tool for the industry around the world. It is used in scheduling meetings, exchanging business information and clients information, and so on. Instant Messaging has been developed by private sectors or providers such as America Online Instant Messenger (AIM), MSN, and Yahoo; however, in 1998 a new protocol has seen the light as an open source Instant Messaging protocol and had the name of Jabber and thanks to Jeremie Miller the founder of the Jabber protocol. The project gathered wide public attention when it was discussed on the popular developer discussion website Slashdot in January 1999. In May 2000, the core Jabber protocols were released as open source reference server and it have not been changed to this day. Jabber uses client-server architecture, not a direct peer-to-peer architecture as some other messaging systems do. It is actually an Extensible Markup Language (XML) messaging protocol. It relies on XML document format in every aspect of the communication. [1] Jabber Protocol have gone a long way to be one of the most attractive protocol because of its open source and extensibility. Anyone can build or extend the jabber protocol functionality without actually modifying the core protocol and still maintain interoperability with other IM clients such as Yahoo and MSN. Moreover, as the usage of Jabber Instant Messaging technology increases, the need for information protection in the Jabber messaging medium also increases. This thesis will explore the Jabber protocol and the ability to secure a Jabber based communication over the network using third party cryptographic libraries. / Graduation date: 2003

An important objective of tactical ad hoc networks is to deliver threat information from sensors to shooters efficiently and quickly. The information sent to a particular shooter should contain warnings about threats that are within some distance and/or within some time of the shooter's current location. In this thesis we develop a novel multicast model that distributes this form of threat information in a message efficient manner. In addition, information about allied force can also be distributed in a similar way. We present results from extensive simulations that demonstrate the efficiency of our protocol and discuss the scalability of this model to larger networks. / Graduation date: 2001

M.S. / Computer Science and Engineering / Before artificial neural network applications become common there must be inexpensive hardware that will allow large networks to be run in real time. It is uncertain how large networks will do when constrained to implementations on architectures of current technology. Some tradeoffs must be made when the network models are implemented efficiently. Three popular artificial neural network models are analyzed. This paper discusses the effects on performance when the models are modified for efficient hardware implementation.

Thesis (M.S.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains xiii, 90 p.; also contains graphics. Vita. Includes bibliographical references (p. 85-89).