published_or_final_version / abstract / Computer Science / Doctoral / Doctor of Philosophy

published_or_final_version / abstract / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

published_or_final_version / abstract / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

Adaptive routing and flow control methods are necessary in computer networks due to the nonstationary conditions that exist in such networks. In this dissertation three distinct yet complementary approaches to modeling computer networks for performance evaluation and control under nonstationary conditions are presented namely: queueing theory, discrete event simulation, and state variable modeling. The application of these techniques to the design and performance evaluation of adaptive routing and flow control methods is demonstrated with the development of a new two-level hierarchical adaptive buffer management scheme and a dynamic virtual circuit routing policy.

A global schema is an integrated view of heterogeneous databases used to support data sharing among independent, existing databases. Global schema design complexities arise from the volume of details, design choices, potential conflicts, and interdependencies among design choices. The methodology described provides a framework for efficient management of these critical dimensions in generating and evaluating alternative designs. The methodology contains three major steps. First, differences due to the varying local data models are resolved by converting each local schema to an equivalent schema in a unifying data model. Second, the entity types of the local schemas in the unifying model are grouped into clusters called common areas. All the entity types in a common area can possibly be merged via generalization. For each common area, semantic information is defined that drives the merging process. Third, each common area is integrated into the global schema by applying a set of generalization operators. Mapping rules are then defined to resolve differences in the representations of equivalent attributes. Th integration of the local schemas is based on equivalence assertions. Four types of attribute equivalences are defined: two attributes may be locally or globally equivalent, and they can be key or non-key. Strategies for handling each of these cases are proposed and evaluated. The global schema design methodology includes several algorithms which may assist a designer. One algorithm analyzes a set of equivalence assertions for consistency and completeness including resolution of transitively implied assertions. A second algorithm performs an interactive merge of a common area by presenting the possible generalization actions to the designer. It supports the theme that many generalization structures can be possible, and the appropriate structure often depends on designer preferences and application requirements. The methodology is evaluated for several cases involving real databases. The cases demonstrate the utility of the methodology in managing the details, considering many alternatives, and resolving conflicts. In addition, these cases demonstrate the need for a set of computer-aided tools; for even a relatively small case, the number of details and design choices can overwhelm a designer.

The growing widespread use of data communication networks has led to increased reliance on the availability of network resources. The network itself is a critical resource which must be managed in a timely and effective manner. In order to manage the network effectively, the network manager must have powerful tools that present network information in a fast and logical way. The work presented here is the design and development of a network management tool for Sytek broadband networks. The Sytek Network Management Package (SNMP) incorporates a commercial database management system, Rbase System V, and menu oriented management functions for the University of Arizona Sytek broadband networks. The SNMP is written in C and executes on a PC connected to the Sytek network. The SNMP allows a network manager to manage both the Sytek LocalNet 20 and System 2000 networks.

With the unprecedented growth of the communication industry that the world is experiencing, the demand from rural inhabitants for high quality communications at an economically affordable cost is growing. However, rural areas are rather restricted from deploying communication services due to the rough natural environment, and the shortage of rudimentary communication facilities and technical personnel. Appropriate models for building rural wireless networks and a concomitant simulation environment are, therefore, expected to enable the construction of technologically-optimal and economically-efficient networks in specified rural areas.<br /> <br /> The research has set up two independent models, one for the economic need and the other for the technical need of building networks in rural areas. One model was the Impact of Telecommunications Model, which disclosed the importance of building a wireless network in specified rural areas by choosing an economic parameter to forecast the profitability of the network. The other was the Service Model, which collected primitive data from given rural areas and abstracted these data by flowing them through four technical layers to form the predicted technical wireless network. Both of the models had been applied to real-world cases to demonstrate how to use them.<br /> <br /> A simulation environment was finally designed and implemented to realize the above two models for the sake of instantiation. This environment could simulate the specified rural network by constructing a wireless network on the invented areas and evaluating its quality and economic efficiency. It was written in Scilab simulation language, which was an open source.

Lam Wan. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (p. 139-145). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

Leung, Yiu-Wing. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1992. / Includes bibliographical references (leaves 150-157). / Acknowledgments / Abstract / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Broadband Video Services --- p.1 / Chapter 1.3 --- Videoconference Services --- p.7 / Chapter 1.4 --- Videoconference Systems --- p.8 / Chapter 1.5 --- Chapter Summary and Thesis Organization --- p.18 / Chapter Chapter 2 --- Efficient Algorithms for Multiple Destinations Routing --- p.20 / Chapter 2.1 --- Background --- p.20 / Chapter 2.2 --- Integer Programming Formulation of the MDR Problem --- p.26 / Chapter 2.3 --- Heuristics for Multiple Destinations Routing --- p.27 / Chapter 2.4 --- Performance Comparisons --- p.40 / Chapter 2.5 --- Chapter Summary --- p.50 / Chapter Chapter 3 --- Connection Optimization for Two Types of Videoconferences --- p.51 / Chapter 3.1 --- Background --- p.51 / Chapter 3.2 --- The Videoconference Services --- p.52 / Chapter 3.3 --- Connection Optimization --- p.54 / Chapter 3.4 --- Performance Analysis --- p.62 / Chapter 3.5 --- Chapter Summary --- p.80 / Chapter Chapter 4 --- A TDM-based Multibus Packet Switch --- p.81 / Chapter 4.1 --- Background --- p.81 / Chapter 4.2 --- Architecture of the Multibus Switch --- p.89 / Chapter 4.3 --- Operation of the Multibus Switch --- p.93 / Chapter 4.4 --- Performance Analysis --- p.95 / Chapter 4.5 --- Numerical Results --- p.106 / Chapter 4.6 --- Discussions --- p.109 / Chapter 4.7 --- Chapter Summary --- p.113 / Chapter Chapter 5 --- A Modular Shared Media Video Switch --- p.114 / Chapter 5.1 --- System Architecture and Operation --- p.114 / Chapter 5.2 --- Slot Assignment for Point-to-Point Transmissions --- p.129 / Chapter 5.3 --- Slot Assignment for Point-to-Multipoint Transmissions --- p.132 / Chapter 5.4 --- Network Design Example --- p.136 / Chapter 5.5 --- Chapter Summary --- p.143 / Appendix --- p.144 / Chapter Chapter 6 --- Conclusions --- p.147 / References --- p.150

by Cheng Sze Wan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 72-[76]). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Traffic Scheduling in Input-buffered Switches .。 --- p.3 / Chapter 1.3 --- Organization of Thesis --- p.7 / Chapter 2 --- Principle of Enchanced PIM Algorithm --- p.8 / Chapter 2.1 --- Introduction --- p.8 / Chapter 2.1.1 --- Switch Model --- p.9 / Chapter 2.2 --- Enhanced Parallel Iterative Matching Algorithm (EPIM) --- p.10 / Chapter 2.2.1 --- Motivation --- p.10 / Chapter 2.2.2 --- Algorithm --- p.12 / Chapter 2.3 --- Performance Evaluation --- p.16 / Chapter 2.3.1 --- Simulation --- p.16 / Chapter 2.3.2 --- Delay Analysis --- p.18 / Chapter 3 --- Providing Bandwidth Guarantee in Input-Buffered Switches --- p.25 / Chapter 3.1 --- Introduction --- p.25 / Chapter 3.2 --- Bandwidth Reservation in Static Scheduling Algorithm --- p.26 / Chapter 3.3 --- Incorporation of Dynamic and Static Scheduling Algorithms .。 --- p.32 / Chapter 3.4 --- Simulation --- p.34 / Chapter 3.4.1 --- Switch Model --- p.35 / Chapter 3.4.2 --- Simulation Results --- p.36 / Chapter 3.5 --- Comparison with Existing Schemes --- p.42 / Chapter 3.5.1 --- Statistical Matching --- p.42 / Chapter 3.5.2 --- Weighted Probabilistic Iterative Matching --- p.45 / Chapter 4 --- EPIM and Cross-Path Switch --- p.50 / Chapter 4.1 --- Introduction --- p.50 / Chapter 4.2 --- Concept of Cross-Path Switching --- p.51 / Chapter 4.2.1 --- Principle --- p.51 / Chapter 4.2.2 --- Supporting Performance Guarantee in Cross-Path Switch --- p.52 / Chapter 4.3 --- Implication of EPIM on Cross-Path switch --- p.55 / Chapter 4.3.1 --- Problem Re-definition --- p.55 / Chapter 4.3.2 --- Scheduling in Input Modules with EPIM --- p.58 / Chapter 4.4 --- Simulation --- p.63 / Chapter 5 --- Conclusion --- p.70 / Bibliography --- p.72