No description available.

A comprehensive framework has been developed for designing a GSN. The focus of this thesis is the capacity planning problem which finds the edge capacities for a given physical topology with specifications of the I/O constraints at the nodes. Two kinds of GSN are studied: (1) For the design of a Wide-Sense Non-Blocking GSN (WSNB-GSN), a rigorous mathematical framework is presented. Duality transformation technique that transforms the initial, infinite and infeasible mathematical formulation into a finite feasible formulation is shown. A procedure for finding the realizable lower bound of the cost of a WSNB-GSN is presented and two different solution approaches are proposed. (2) For the design of a Rearrangeably Non-Blocking GSN (RNB-GSN), a straightforward mathematical formulation is presented first. A procedure using the cut condition to find the lower bound of the cost of a RNB-GSN with a general topology is shown then. The optimal solution in the design of a RNB-GSN with an unlimited-size ring topology is demonstrated with a theorem. / Dynamic bandwidth provisioning and full survivability against link failures are two of the most important requirements for future optical networks. Since previous methodologies could not deal with these two issues simultaneously, a new survivable network concept called the "Generalized Survivable Network" (GSN) is proposed. Generalized Survivable Network incorporates the non-blocking network concept into the survivable network design. Here, "generalized" means the generalization of a network from satisfying a single demand matrix to satisfying the set of all allowable demand matrices under the Input and Output (I/O) access capacity constraints at the network nodes. / Numerical experiments have been carried out to verify the performance of GSN. It is demonstrated that the deploying cost of a WSNB-GSN is within a factor of 2 compared with that of a random sample of a single-period survivable network. The cost of building a RNB-GSN with a ring topology is shown to be about 14% to 45% less than that of building a WSNB-GSN. The framework for planning a GSN is applicable to network planning for future optical networks and survivable IP networks. / Ho Kwok-shing. / "September 2006." / Adviser: Cheung Kwok Wai. / Source: Dissertation Abstracts International, Volume: 68-03, Section: B, page: 1823. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (p. 118-124). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

Cover title, 1975/76- : Data network reliability; annual report. Principal investigator, 1975/76- : J.M. Wozencraft. Report year ends June 30. Vols. for 1975/76- report on research supported by Information Processing Technology Office, Defense Advanced Research Projects Agency, U.S. Dept. of Defense, ARPA order no. 3045.5-7-75, program code no. 5T10, ONR/N00014-75-C-1183, ONR contract no. 049-383.

Graduation date: 1994

Tung, Tak Fu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 66-68). / Abstracts in English and Chinese. / Chapter 1 --- Introduction to Multi-path Streaming and Dynamic End-point Adaptation --- p.1 / Chapter 1.1 --- Multi-path Streaming --- p.2 / Chapter 1.2 --- Dynamic End-point Adaptation --- p.4 / Chapter 2 --- Related Work --- p.6 / Chapter 3 --- Path Loss Model --- p.10 / Chapter 3.1 --- Bursty Loss --- p.10 / Chapter 3.2 --- Gilbert Model --- p.11 / Chapter 3.2.1 --- Discrete-time Gilbert Model --- p.11 / Chapter 3.2.2 --- Continuous-time Gilbert Model --- p.12 / Chapter 4 --- Loss Recovery / Chapter 4.1 --- Automatic Repeat Request (ARQ) --- p.17 / Chapter 4.2 --- Forward Error Correction (FEC) --- p.18 / Chapter 5 --- Connection Adaptation --- p.23 / Chapter 5.1 --- Path Quality --- p.23 / Chapter 5.2 --- Effect of Shared Congestion Point --- p.24 / Chapter 5.2.1 --- Point-of-Congestion Detection --- p.25 / Chapter 5.3 --- Load Distribution --- p.27 / Chapter 6 --- Analytical Evaluation --- p.28 / Chapter 6.1 --- Performance Analysis of SP vs. Multi-path Streaming (without FEC) --- p.29 / Chapter 6.2 --- Performance Analysis of SP vs. Multi-path Streaming (with FEC) --- p.36 / Chapter 7 --- Experiments and Simulations --- p.42 / Chapter 7.1 --- Effect of Correlated Bursty Losses on Video Quality --- p.42 / Chapter 7.2 --- Analytical Model Based Evaluation --- p.44 / Chapter 7.2.1 --- Data Loss Rate --- p.44 / Chapter 7.2.2 --- Data Loss Rate as a function of FEC parameters --- p.46 / Chapter 7.2.3 --- Conditional Error Burst Length --- p.48 / Chapter 7.2.4 --- Lag-1 Autocorrelation --- p.49 / Chapter 7.2.5 --- Effects of Load Distribution Among Senders --- p.50 / Chapter 7.2.6 --- Sensitivity Analysis --- p.51 / Chapter 7.2.7 --- Effects of Shared Points of Congestion on Various Perfor- mance Metrics --- p.53 / Chapter 7.3 --- Simulation Model Based Evaluation --- p.55 / Chapter 7.3.1 --- Simulation Setup --- p.55 / Chapter 7.3.2 --- Data Loss Rate --- p.57 / Chapter 7.3.3 --- Data Loss Rate as a function of FEC parameters --- p.58 / Chapter 7.3.4 --- Conditional Error Burst Length --- p.59 / Chapter 7.3.5 --- Lag-1 Autocorrelation --- p.60 / Chapter 7.3.6 --- Effects of Load Distribution among Senders --- p.61 / Chapter 7.3.7 --- Sensitivity Analysis --- p.62 / Chapter 7.3.8 --- Effects of Shared Points of Congestion on Various Perfor- mance Metrics --- p.63 / Chapter 8 --- Conclusion --- p.65

Finally, to obtain a long network lifetime without sacrificing crucial aspects of quality of service (area coverage, sensing reliability, and network connectivity) in wireless sensor networks, we present sensibility-based sleeping configuration protocols (SSCPs) with two sensing models: Boolean sensing model (BSM) and collaborative sensing model (CSM). (Abstract shortened by UMI.) / Furthermore, we extend the traditional reliability analysis. Wireless networks inherit the unique handoff characteristic which leads to different communication structures of various types with a number of components and links. Therefore, the traditional definition of two-terminal reliability is not applicable anymore. We propose a new term, end-to-end mobile reliability, to integrate those different communication structures into one metric, which includes not only failure parameters but also service parameters. Nevertheless, it is still a monotonically decreasing function of time. With the proposed end-to-end mobile reliability, we could identify the reliability importance of imperfect components in wireless networks. / The emerging mobile wireless environment poses exciting challenges for distributed fault-tolerant (FT) computing. This thesis develops a message logging and recovery protocol on the top of Wireless CORBA to complement FT-CORBA specified for wired networks. It employs the storage available at access bridge (AB) as the stable storage for logging messages and saving checkpoints on behalf of mobile hosts (MHs). Our approach engages both the quasi-sender-based and the receiver-based message logging techniques and conducts seamless handoff in the presence of failures. / Then we extend the analysis of the program execution time without and with checkpointing in the presence of MH failures from wired to wireless networks. Due to the underlying message-passing communication mechanism, we employ the number of received computational messages instead of time to indicate the completion of program execution at an MH. Handoff is another distinct factor that should be taken into consideration in mobile wireless environments. Three checkpointing strategies, deterministic, random, and time-based checkpointing, are investigated. In our approach, failures may occur during checkpointing and recovery periods. / Chen Xinyu. / "June 2005." / Adviser: Michael R. Lyu. / Source: Dissertation Abstracts International, Volume: 67-07, Section: B, page: 3889. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (p. 180-198). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract in English and Chinese. / School code: 1307.

Ip, Yin Ki. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 96-102). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Background Study --- p.6 / Chapter 2.1 --- DTN Reference Implementation Model --- p.7 / Chapter 2.2 --- DTN Applications --- p.9 / Chapter 2.3 --- Multiple-copy Routing Strategies --- p.11 / Chapter 2.4 --- Buffer Management Strategies --- p.12 / Chapter 2.5 --- Performance Modeling of Multiple-copy Routing --- p.14 / Chapter 2.6 --- Conclusion on Background Study --- p.18 / Chapter 3 --- DTN with Resource Constraints --- p.20 / Chapter 3.1 --- Introduction --- p.20 / Chapter 3.2 --- Related Work --- p.21 / Chapter 3.3 --- "System Model, Replication, Forwarding and Buffer Management Strategies" --- p.22 / Chapter 3.4 --- Performance Evaluation --- p.29 / Chapter 3.4.1 --- Analysis on single-message-delivery with unlimited network resource --- p.29 / Chapter 3.4.2 --- Simulation study on multi-message-delivery with limited resource constraint --- p.34 / Chapter 3.5 --- Conclusion on DTN with Resource Constraints --- p.39 / Chapter 4 --- Multiple-copy Routing in DTN with Heteroge- neous Node Types --- p.41 / Chapter 4.1 --- Introduction --- p.41 / Chapter 4.2 --- Related Work --- p.44 / Chapter 4.3 --- System Model --- p.44 / Chapter 4.4 --- Performance Modeling --- p.46 / Chapter 4.4.1 --- Continuous Time Markov Chain (CTMC) Model --- p.46 / Chapter 4.4.2 --- Fluid Flow Approximation (FFA) --- p.53 / Chapter 4.5 --- Conclusion on DTN with Node Heterogeneity --- p.73 / Chapter 5 --- Conclusion and Future Work --- p.75 / Chapter A --- Random Direction Mobility Model --- p.78 / Chapter A.1 --- Mean Inter-encounter Interval --- p.79 / Chapter A.2 --- Inter-encounter Interval Distribution --- p.86 / Chapter A.3 --- Concluding Remarks --- p.88 / Chapter B --- Additional Results by Fluid Flow Approximation and Moment Closure Methods --- p.92 / Bibliography --- p.96

Xu, Ceng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (p. 68-71). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.3 / Chapter 1.2 --- Contributions --- p.5 / Chapter 1.3 --- Thesis Scope --- p.5 / Chapter 2 --- Background Study --- p.6 / Chapter 2.1 --- Wireless Mesh Networks --- p.6 / Chapter 2.1.1 --- Overview of Wireless Mesh Networks --- p.6 / Chapter 2.1.2 --- Challenges of Wireless Mesh Networks --- p.9 / Chapter 2.1.3 --- Capacity Analysis of Wireless Mesh Net- works --- p.11 / Chapter 2.2 --- Network Coding --- p.13 / Chapter 2.2.1 --- Overview of Network Coding --- p.13 / Chapter 2.2.2 --- Network Coding in Wireless Networks --- p.17 / Chapter 3 --- Throughput Analysis --- p.19 / Chapter 3.1 --- Introduction --- p.19 / Chapter 3.2 --- Preliminaries --- p.20 / Chapter 3.3 --- Proof of Theorem 3.2.1 when n = m --- p.23 / Chapter 3.4 --- Proof of Theorem 3.2.1 when n≠ m --- p.36 / Chapter 3.4.1 --- Proof of Theorem 3.2.1 when m <n --- p.36 / Chapter 3.4.2 --- Proof of Theorem 3.2.1 when m > n --- p.37 / Chapter 3.5 --- Applying network coding into multi-radio multichannel networks --- p.37 / Chapter 3.6 --- Some simulation results --- p.40 / Chapter 3.6.1 --- String Topology --- p.40 / Chapter 3.6.2 --- Grid Topology --- p.41 / Chapter 3.6.3 --- Random Topology --- p.42 / Chapter 4 --- Interface Reduction in Wireless Mesh Networks --- p.43 / Chapter 4.1 --- Introduction --- p.43 / Chapter 4.2 --- Preliminaries --- p.44 / Chapter 4.2.1 --- Assumptions and Objectives of the Algorithm --- p.44 / Chapter 4.2.2 --- Definitions --- p.45 / Chapter 4.3 --- Steps of the Algorithm and an Example --- p.49 / Chapter 4.4 --- Simulation Results and Discussions --- p.53 / Chapter 4.5 --- Generalization --- p.54 / Chapter 5 --- Conclusion --- p.66 / Bibliography --- p.68

Delay tolerant networks (DTNs) are occasionally-connected networks that may suffer from frequent partitions. DTNs provide service despite long end to end delays or infrequent connectivity. One fundamental problem in DTNs is routing messages from their source to their destination. DTNs differ from the Internet in that disconnections are the norm instead of the exception. Representative DTNs include sensor-based networks using scheduled intermittent connectivity, terrestrial wireless networks that cannot ordinarily maintain end-to-end connectivity, satellite networks with moderate delays and periodic connectivity, underwater acoustic networks with moderate delays and frequent interruptions due to environmental factors, and vehicular networks with cyclic but nondeterministic connectivity. The focus of this dissertation is on routing protocols that send messages in DTNs. When no connected path exists between the source and the destination of the message, other nodes may relay the message to the destination. This dissertation covers routing protocols in DTNs with both deterministic and non-deterministic mobility respectively. In DTNs with deterministic and cyclic mobility, we proposed the first routing protocol that is both scalable and delivery guaranteed. In DTNs with non-deterministic mobility, numerous heuristic protocols are proposed to improve the routing performance. However, none of those can provide a theoretical optimization on a particular performance measurement. In this dissertation, two routing protocols for non-deterministic DTNs are proposed, which minimizes delay and maximizes delivery rate on different scenarios respectively. First, in DTNs with non-deterministic and cyclic mobility, an optimal single-copy forwarding protocol which minimizes delay is proposed. / In DTNs with non-deterministic mobility, an optimal multi-copy forwarding protocol is proposed. which maximizes delivery rate under the constraint that the number of copies per message is fixed . Simulation evaluations using both real and synthetic trace are conducted to compare the proposed protocols with the existing ones. / by Cong Liu. / Vita. / Thesis (Ph.D.)--Florida Atlantic University, 2009. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2009. Mode of access: World Wide Web.

Disruption-Tolerant Networks (DTNs) are the networks comprised of a set of wireless nodes, and they experience unstable connectivity and frequent connection disruption because of the limitations of radio range, power, network density, device failure, and noise. DTNs are characterized by their lack of infrastructure, device limitation, and intermittent connectivity. Such characteristics make conventional wireless network routing protocols fail, as they are designed with the assumption the network stays connected. Thus, routing in DTNs becomes a challenging problem, due to the temporal scheduling element in a dynamic topology. One of the solutions is prediction-based, where nodes mobility is estimated with a history of observations. Then, the decision of forwarding messages during data delivery can be made with that predicted information. Current prediction-based routing protocols can be divided into two sub-categories in terms of that whether they are probability related: probabilistic and non-probabilistic. This dissertation focuses on the probabilistic prediction-based (PPB) routing schemes in DTNs. We find that most of these protocols are designed for a specified topology or scenario. So almost every protocol has some drawbacks when applied to a different scenario. Because every scenario has its own particular features, there could hardly exist a universal protocol which can suit all of the DTN scenarios. Based on the above motivation, we investigate and divide the current DTNs scenarios into three categories: Voronoi-based, landmark-based, and random moving DTNs. For each category, we design and implement a corresponding PPB routing protocol for either basic routing or a specified application with considering its unique features. / Specifically, we introduce a Predict and Relay routing protocol for Voronoi-based DTNs, present a single-copy and a multi-copy PPB routing protocol for landmark-based DTNs, and propose DRIP, a dynamic Voronoi region-based publish/subscribe protocol, to adapt publish/subscribe systems to random moving DTNs. New concepts, approaches, and algorithms are introduced during our work. / by Quan Yuan. / Vita. / Thesis (Ph.D.)--Florida Atlantic University, 2009. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2009. Mode of access: World Wide Web.