The movement towards a Network Centric environment is changing the requirements for network management. The ability to quickly adapt to changing conditions is crucial to the success of joint forces; Information Technology systems are critical enablers of that flexibility. The challenge facing managers today is to provide robust, integrated, secure, and interoperable information systems and networks; a challenge that has never been more demanding than it is today. As the components of the DoD continue their transformation efforts, it is important to look to successful organizations for management techniques to aid in providing effective and efficient IT services. This thesis will explore current management trends such as outsourcing, the Information Technology Infrastructure Library (ITIL), Real Options, Business Process Reengineering (BPR), and Knowledge Value Added (KVA) to determine their possible impact on the manner in which the DoD manages their IT services. / US Marine Corps (USMC) author.

University of Macau / Faculty of Science and Technology. / Department of Electrical and Computer Engineering

by Eddie Ting Pong Kong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 61-68). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Optical Network Architecture --- p.1 / Chapter 1.2 --- High-Speed All-Optical Tunable-Channel Multi-Access Networks --- p.3 / Chapter 1.3 --- Fault Surveillance of Optical Cross-Connects in Wavelength Routing Network --- p.3 / Chapter 1.4 --- Outline of the Thesis --- p.5 / Chapter 2 --- Optical Multi-Access Networks --- p.6 / Chapter 2.1 --- All-Optical Networks --- p.6 / Chapter 2.2 --- Optical Multi-Access Schemes --- p.8 / Chapter 2.2.1 --- Wavelength-Division Multi-Access (WDMA) --- p.9 / Chapter 2.2.2 --- Time-Division Multi-Access (TDMA) --- p.12 / Chapter 2.2.3 --- Subcarrier Multi-Access (SCMA) --- p.14 / Chapter 2.3 --- Design Considerations --- p.14 / Chapter 3 --- All-Optical Tunable-Channel Multi-Access Networks --- p.18 / Chapter 3.1 --- Tunable-Channel Multi-Access Networks --- p.19 / Chapter 3.2 --- Protocols for TCMA Networks --- p.20 / Chapter 3.3 --- Photonic Implementation of a Wavelength Division TCMA Network with Time- Slot Access --- p.23 / Chapter 3.3.1 --- Proposed Network Architecture --- p.25 / Chapter 3.3.2 --- Experimental Results --- p.30 / Chapter 3.3.3 --- Discussion --- p.34 / Chapter 3.3.4 --- Summary --- p.35 / Chapter 4 --- Fault Surveillance for Optical Cross-Connects in Wavelength Routing Networks --- p.36 / Chapter 4.1 --- Wavelength Routing Networks --- p.37 / Chapter 4.2 --- Options in Fault Surveillance --- p.39 / Chapter 4.3 --- Optical Path Surveillance of Optical Cross-Connects in Wavelength Routing Networks --- p.41 / Chapter 4.3.1 --- Scanning Amplified Spontaneous Emission Identification Surveillance Scheme --- p.43 / Chapter 4.3.2 --- Pilot-Tone Based Surveillance and Removal Scheme --- p.49 / Chapter 4.4 --- Summary --- p.55 / Chapter 5 --- Conclusion --- p.57 / Chapter 5.1 --- Summary of the Thesis --- p.57 / Chapter 5.2 --- Future Work --- p.60 / Bibliography --- p.61 / Publication List --- p.59

by Tam Scott Kin Lun. / Thesis submitted in: October 2005. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 58-64). / Abstracts in English and Chinese. / Chapter 1. --- Introduction --- p.1 / Chapter 1.1. --- Optical Networks --- p.1 / Chapter 1.1.1. --- IP over Optical Networks --- p.1 / Chapter 1.1.2. --- Challenges in Optical Networks --- p.4 / Chapter 1.2. --- Virtual Private Networks (VPN) --- p.5 / Chapter 1.2.1. --- CE Based VPN --- p.6 / Chapter 1.2.2. --- Network Based VPN --- p.7 / Chapter 1.2.2.1. --- MPLS Layer 2 VPN --- p.8 / Chapter 1.2.2.2. --- MPLS Layer 3 VPN --- p.9 / Chapter 1.2.3. --- Optical VPN --- p.9 / Chapter 1.2.4. --- Challenges in VPN Technologies --- p.11 / Chapter 1.3. --- Objective of this Thesis --- p.11 / Chapter 1.4. --- Outline of this Thesis --- p.12 / Chapter 2. --- Architecture of an All-Optical VPN --- p.13 / Chapter 2.1. --- Introduction --- p.13 / Chapter 2.2. --- Networking Vendor Activities --- p.13 / Chapter 2.3. --- Service Provider Activities --- p.15 / Chapter 2.4. --- Standard Bodies Activities --- p.16 / Chapter 2.5. --- Requirements for All-Optical VPN --- p.17 / Chapter 2.6. --- Reconfigurability of an All-Optical VPN --- p.19 / Chapter 2.7. --- Switching Methods in All-Optical VPN --- p.20 / Chapter 2.8. --- Survivability of an All-Optical VPN --- p.23 / Chapter 3. --- Maximizing the Utilization Of A Survivable Multi-Ring WDM Network --- p.25 / Chapter 3.1. --- Introduction --- p.25 / Chapter 3.2. --- Background --- p.25 / Chapter 3.3. --- Method --- p.26 / Chapter 3.3.1. --- Effect on packet based services --- p.28 / Chapter 3.3.2. --- Effect on optical circuit based services --- p.28 / Chapter 3.4. --- Simulation results --- p.29 / Chapter 3.5. --- Chapter Summary --- p.36 / Chapter 4. --- Design of an All-Optical VPN Processing Engine --- p.37 / Chapter 4.1. --- Introduction --- p.37 / Chapter 4.2. --- Concepts of Optical Processors --- p.38 / Chapter 4.3. --- Design Principles of the All-Optical VPN Processing Engine --- p.40 / Chapter 4.3.1. --- Systolic System --- p.41 / Chapter 4.3.2. --- Design Considerations of an Optical Processing Cell --- p.42 / Chapter 4.3.2.1. --- Mach-Zehnder Structures --- p.43 / Chapter 4.3.2.2. --- Vertical Cavity Semiconductor Optical Amplifier --- p.43 / Chapter 4.3.2.3. --- The Optical Processing Cell --- p.44 / Chapter 4.3.3. --- All-Optical VPN Processing Engine --- p.47 / Chapter 4.4. --- Design Evaluation --- p.49 / Chapter 4.5. --- Application Example --- p.50 / Chapter 4.6. --- Chapter Summary --- p.54 / Chapter 5. --- Conclusion --- p.55 / Chapter 5.1. --- Summary of the Thesis --- p.55 / Chapter 5.2. --- Future Works --- p.56 / Chapter 6. --- References --- p.58

Tam Sai-Wah. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves [103]-104) and index. / Abstracts in English and Chinese. / Abstract --- p.x / 摘要 --- p.xi / Abbreviations --- p.xii / Symbols --- p.xiv / Chapter Part I --- Background / Chapter 1 --- Background on coexistence --- p.2 / Chapter 1.1 --- Data network --- p.2 / Chapter 1.1.1 --- Telephone network vs. data network --- p.2 / Chapter 1.1.2 --- Bandwidth in networks --- p.3 / Chapter 1.2 --- Taxonomy of flows --- p.4 / Chapter 1.3 --- Effect of heterogeneity and proposed solution --- p.4 / Chapter 1.3.1 --- Cause and effect of heterogeneity --- p.4 / Chapter 1.3.2 --- TCP-friendly congestion control as a solution --- p.5 / Chapter 1.3.3 --- Distributed admission control as a solution --- p.6 / Chapter 1.3.4 --- Evaluation methodology and organisation of this thesis --- p.6 / Chapter 2 --- Model of Heterogeneous Flows --- p.8 / Chapter 2.1 --- The network --- p.8 / Chapter 2.2 --- Elastic flows --- p.8 / Chapter 2.3 --- Inelastic flows --- p.10 / Chapter 2.4 --- Stochastic Flows --- p.11 / Chapter 2.5 --- Controls --- p.12 / Chapter 2.5.1 --- Congestion control for elastic flows --- p.12 / Chapter 2.5.2 --- No control for inelastic flows --- p.13 / Chapter 2.5.3 --- Congestion control for inelastic flows --- p.14 / Chapter 2.5.4 --- Admission control for inelastic flows --- p.15 / Chapter 2.5.5 --- Admission control for inelastic flows with continuous assurance --- p.16 / Chapter 2.6 --- Markov chain model of control schemes --- p.17 / Chapter 2.6.1 --- Normalisation --- p.17 / Chapter 2.6.2 --- Control schemes and Markov chains --- p.18 / Chapter Part II --- Evaluation / Chapter 3 --- Stability of network under different controls --- p.29 / Chapter 3.1 --- Stability of queues --- p.29 / Chapter 3.2 --- Stability of the Markov chain models --- p.30 / Chapter 3.2.1 --- Observation of stability from simulation --- p.30 / Chapter 3.3 --- Informal discussion of stability --- p.33 / Chapter 4 --- Bandwidth allocation --- p.35 / Chapter 4.1 --- Aggregated bandwidth --- p.35 / Chapter 4.2 --- Bandwidth per flow --- p.37 / Chapter 5 --- Evaluation based on utility functions --- p.40 / Chapter 5.1 --- Properties of utility function --- p.40 / Chapter 5.1.1 --- Utility for elastic flows --- p.40 / Chapter 5.1.2 --- Utility for inelastic flows --- p.41 / Chapter 5.1.3 --- Utility throughput --- p.41 / Chapter 5.1.4 --- Choice of utility function --- p.43 / Chapter 5.2 --- Degree of elasticity --- p.45 / Chapter 5.3 --- Homogeneous environment --- p.46 / Chapter 5.4 --- Heterogeneous environment --- p.49 / Chapter 5.4.1 --- Comparison for different offered load --- p.50 / Chapter 5.4.2 --- Effect of scaling --- p.52 / Chapter 5.4.3 --- Sensitivity to α and ε --- p.57 / Chapter 6 --- Blocking probability --- p.62 / Chapter 6.1 --- Formulating admission behaviour into PCDSDE --- p.62 / Chapter 6.2 --- Evaluation of the blocking probability --- p.64 / Chapter 6.3 --- Verification by simulation --- p.66 / Chapter 6.3.1 --- Comparison for different offered load --- p.66 / Chapter 6.3.2 --- Effect of scaling --- p.68 / Chapter 6.3.3 --- Sensitivity to α and ε --- p.68 / Chapter 7 --- Population --- p.74 / Chapter 7.1 --- Mean number of inelastic flows --- p.74 / Chapter 7.2 --- Mean number of elastic flows --- p.75 / Chapter 7.2.1 --- Elastic population after scaling --- p.79 / Chapter 7.2.2 --- Effect of aggressiveness --- p.79 / Chapter 7.2.3 --- Effect of α --- p.82 / Chapter Part III --- Conclusion / Chapter 8 --- Conclusion --- p.85 / Chapter 8.1 --- Summary --- p.85 / Chapter 8.2 --- Implication --- p.87 / Chapter 8.3 --- Future Work --- p.88 / Appendices / Chapter A --- Glossary --- p.91 / Chapter B --- Introduction to Poisson counter driven stochastic differential equations --- p.97 / Chapter C --- Simulation --- p.101 / References --- p.103 / Index --- p.105

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.

Digitized by Kansas Correctional Industries

Wong, Chi Hang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 78-80). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Overview on traffic classification algorithms --- p.2 / Chapter 1.1.1 --- Port based approach --- p.2 / Chapter 1.1.2 --- Payload based approach --- p.2 / Chapter 1.1.3 --- Transport layer information based approach --- p.3 / Chapter 1.2 --- Operating model of traffic classification algorithms --- p.3 / Chapter 1.3 --- Previous related works --- p.4 / Chapter 2 --- Background --- p.5 / Chapter 2.1 --- Network topology and traffic capturing model --- p.5 / Chapter 2.2 --- Proposed Scheme --- p.6 / Chapter 2.3 --- Analysis on different categories --- p.9 / Chapter 3 --- Objectives --- p.11 / Chapter 3.1 --- Computing Power and Memory --- p.11 / Chapter 3.1.1 --- A rough analysis on the complexity --- p.12 / Chapter 3.2 --- Experiments on the complexity --- p.13 / Chapter 3.2.1 --- Operating Model : batch processing --- p.16 / Chapter 4 --- Computing Power and Memory : parallel processing --- p.22 / Chapter 4.1 --- Goals --- p.22 / Chapter 4.2 --- Parallel processing --- p.23 / Chapter 4.3 --- System Architecture --- p.24 / Chapter 4.4 --- Advantage --- p.26 / Chapter 4.5 --- Practical adjustment --- p.29 / Chapter 4.6 --- The alternative System Architecture --- p.30 / Chapter 5 --- Operating Model : from batch processing to online --- p.34 / Chapter 5.1 --- Goals --- p.34 / Chapter 5.2 --- Proposed model --- p.35 / Chapter 5.3 --- Delay comparasion --- p.35 / Chapter 5.4 --- Performance and accuracy issue --- p.38 / Chapter 5.5 --- Trade off between delay and accuracy --- p.43 / Chapter 6 --- Evaluation --- p.46 / Chapter 6.1 --- Final Prototype --- p.46 / Chapter 6.2 --- Online processing --- p.48 / Chapter 7 --- Others --- p.55 / Chapter 7.1 --- Special cases for network topology --- p.55 / Chapter 7.2 --- Further optimizations for BLINC --- p.56 / Chapter 7.3 --- Study on port-based approach --- p.66 / Chapter 7.4 --- Study on the information used in different algorithms --- p.70 / Chapter 7.5 --- Future works --- p.76 / Chapter 8 --- Conclusion --- p.77 / Bibliography --- p.78

Cheung, Kwok Sum. / Thesis submitted in: October 2007. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 71-74). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.ii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Infrastructure of Wireless Mesh Networks --- p.1 / Chapter 1.2 --- Characteristics and Advantages of WMNs --- p.4 / Chapter 1.3 --- Challenges --- p.7 / Chapter 2 --- Background Study --- p.10 / Chapter 2.1 --- Maximum Concurrent Flow Problem --- p.10 / Chapter 2.2 --- Channel Assignment --- p.12 / Chapter 2.3 --- Congestion Control --- p.13 / Chapter 3 --- Problem Formulation --- p.16 / Chapter 3.1 --- Physical Model --- p.16 / Chapter 3.2 --- MCFP of Multiple Channels --- p.19 / Chapter 3.2.1 --- MCFP Channel Assignment Pattern --- p.19 / Chapter 3.2.2 --- Min-max Spectral Radius Optimization --- p.22 / Chapter 3.2.3 --- Min-max Channel Assignment Problem --- p.24 / Chapter 4 --- Min-max Pattern in Chain Network --- p.26 / Chapter 4.1 --- Chain Network --- p.26 / Chapter 4.2 --- Min-max Channel Assignment Pattern --- p.28 / Chapter 5 --- Bottleneck Assignment Heuristic Algorithm --- p.35 / Chapter 5.1 --- Algorithm Description --- p.35 / Chapter 5.1.1 --- Introduction --- p.35 / Chapter 5.1.2 --- First Part of the BAHA --- p.38 / Chapter 5.1.3 --- Second Part of the BAHA --- p.43 / Chapter 5.2 --- Optimality --- p.47 / Chapter 5.3 --- Simulation of the BAHA --- p.53 / Chapter 5.3.1 --- Performance evaluation --- p.55 / Chapter 6 --- Sequential Assignment Heuristic Algorithm --- p.59 / Chapter 6.1 --- Algorithm Description --- p.59 / Chapter 6.1.1 --- Introduction --- p.59 / Chapter 6.1.2 --- Lower bound of spectral radius --- p.60 / Chapter 6.1.3 --- Procedures of SAHA --- p.62 / Chapter 6.2 --- Simulation Result --- p.64 / Chapter 6.3 --- Performance evaluation --- p.64 / Chapter 7 --- Conclusion --- p.69 / Bibliography --- p.71

Typescript (photocopy). / Digitized by Kansas Correctional Industries