Approved for public release; distribution is unlimited / Network Address Translation (NAT) for IPv4 was developed primarily to curb overcrowding of the Internet due to dwindling global IP addresses; however, NAT provides several other benefits. NAT can be used to mask the internal IP addresses of an Intranet. IPv6, the emerging standard for Internet addressing, provides three times the number of bits for IP addressing. While IPv6 does not need NAT for connectivity, other NAT features such as address hiding are valuable. There is currently no NAT implementation for IPv6. The focus of this research was the design and development of a NAT implementation for IPv6. This implementation will be used within a multilevel testbed. In addition, the NAT implementation developed here can facilitate the Department of Defense (DoD) transition to IPv6 planned for 2008 by providing services currently not available for IPv6. A working implementation of NAT for IPv6 within the Linux kernel has been produced. The NAT development created here has been tested for support of the protocols of TCP, UDP and ICMP for IPv6. / Ensign, United States Navy

Approved for public release; distribution is unlimited / The United States Government and private industry are facing challenges in attempting to secure their computer network infrastructure. The purpose of this research was to capture current lessons learned from Government and Industry with respect to solving particular problems associated with the secure management of large networks. Nine thesis questions were generated to look at common security problems faced by enterprises in large networks. Research was predominantly gathered through personal interviews with professionals in the computer security area from both the public and private sector. The data was then analyzed to compile a set of lessons learned by both the public and private sector regarding several leading computer security issues. Some of the problems were challenges such as maintaining and improving security during operating systems upgrades, analyzing lessons learned in configurations management, employee education with regards to following policy and several other challenging issues. The results of this thesis were lessons learned in the areas of employee education, Government involvement in the computer security area and other key security areas. An additional result was the development of case studies based upon the lessons learned. / Naval Postgraduate School author (civilian).

The Server and Agent-based Active Network Management (SAAM) architecture was initially designed to work with the next generation Internet where increasingly sophisticated applications will require QoS guarantees. Although such QoS traffic is growing in volume, Best Effort traffic, which does not require QoS guarantees, needs to be supported for foreseeable future. Thus, SAAM must handle Best Effort traffic as well as QoS traffic. A Best Effort traffic management algorithm was developed for SAAM recently to take advantage of the abilities of the SAAM server. However, this algorithm has not been evaluated quantitatively. This thesis conducts experiments to compare the performance of the Best Effort traffic management scheme of the SAAM architecture against the well known MPLS Adaptive Traffic Engineering (MATE) Algorithm. A couple of realistic network topologies were used. The results show while SAAM may not perform as well as MATE with a fixed set of paths, using SAAM's dynamic path deployment functionality allows the load to be distributed across more parts of the network, thus achieving better performance than MATE. Much of the effort was spent on implementing the MATE algorithm in SAAM. Some modifications were also made to the SAAM code based on the experimental results to increase the performance of SAAM's Best Effort solution. / Turkish Navy author.

by Tat-keung Chan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 60-[62]). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Video Conferencing Systems --- p.1 / Chapter 1.3 --- Thesis Organization --- p.5 / Chapter 2 --- Conferencing Network Model --- p.8 / Chapter 2.1 --- Conferee Distribution --- p.9 / Chapter 2.2 --- Conference Node Set --- p.11 / Chapter 2.3 --- Route Configuration --- p.11 / Chapter 2.4 --- Mode of Operation --- p.14 / Chapter 3 --- Conferencing Network Management --- p.17 / Chapter 3.1 --- Call Admission --- p.17 / Chapter 3.2 --- Route Configuration Assignment --- p.19 / Chapter 3.2.1 --- Basic Route Configuration Assignment --- p.19 / Chapter 3.2.2 --- Reroutable Route Configuration Assignment --- p.19 / Chapter 4 --- Conferencing Network Capacity --- p.22 / Chapter 4.1 --- Basic Capacity Derivation --- p.22 / Chapter 4.1.1 --- Limiting Probability Distribution --- p.23 / Chapter 4.1.2 --- Video Freeze Probability --- p.24 / Chapter 4.1.3 --- Basic Capacity Space --- p.26 / Chapter 4.1.4 --- Representation of Ω --- p.27 / Chapter 4.1.5 --- Example --- p.31 / Chapter 4.2 --- Extended Capacity Derivation --- p.39 / Chapter 4.2.1 --- Reroutable Assignment --- p.39 / Chapter 4.2.2 --- Limiting Probability Distribution --- p.41 / Chapter 4.2.3 --- Video Freeze Probability --- p.44 / Chapter 4.2.4 --- Extended Capacity Space --- p.44 / Chapter 4.2.5 --- Example --- p.45 / Chapter 4.2.6 --- State Space Size --- p.46 / Chapter 5 --- Call Blocking Probability --- p.49 / Chapter 5.1 --- Call Blocking Probability for Basic Assignment --- p.51 / Chapter 5.1.1 --- Example --- p.52 / Chapter 5.2 --- Call Blocking Probability for Reroutable Assignment --- p.55 / Chapter 6 --- Conclusion --- p.57 / Chapter 6.1 --- Summary of Results --- p.57 / Chapter 6.2 --- Issues for future investigations --- p.58 / Bibliography --- p.60

by Yeung Chung Toa. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1994. / Includes bibliographical references (leaves 63-[65]). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Bandwidth required by multimedia applications --- p.1 / Chapter 1.2 --- Real-time requirement --- p.2 / Chapter 1.3 --- Multicasting --- p.2 / Chapter 1.4 --- Other networks --- p.3 / Chapter 1.5 --- Overview of CUM LAUDE NET --- p.5 / Chapter 1.5.1 --- Protocols --- p.7 / Chapter 1.5.2 --- Network Services --- p.8 / Chapter 1.6 --- Scope of the Thesis --- p.9 / Chapter 2 --- Network Architecture --- p.11 / Chapter 2.1 --- CUM LAUDE NET Architectural Overview --- p.11 / Chapter 2.2 --- Level One Network Architecture --- p.12 / Chapter 2.3 --- Level-One Router --- p.14 / Chapter 2.3.1 --- packet forwarding --- p.14 / Chapter 2.3.2 --- packet insertion --- p.15 / Chapter 2.3.3 --- packet removal --- p.15 / Chapter 2.3.4 --- fault protection --- p.15 / Chapter 2.4 --- Hub --- p.16 / Chapter 2.5 --- Host & Network Interface Card --- p.17 / Chapter 3 --- Protocol --- p.19 / Chapter 3.1 --- Design Overview --- p.19 / Chapter 3.2 --- Layering --- p.20 / Chapter 3.3 --- "Segment, Datagram, and Packet Format" --- p.21 / Chapter 3.3.1 --- IP/VCI field --- p.23 / Chapter 3.4 --- Data Link --- p.23 / Chapter 3.4.1 --- byte format and data link synchronization --- p.23 / Chapter 3.4.2 --- access control byte --- p.24 / Chapter 3.4.3 --- packet/frame boundary --- p.26 / Chapter 3.5 --- Fast Packet Routing Protocol --- p.26 / Chapter 3.5.1 --- Level-2/Level-l Bridge/Router --- p.27 / Chapter 3.5.2 --- Level-1 Hub --- p.29 / Chapter 3.5.3 --- Local Host NIC --- p.29 / Chapter 3.6 --- Media Access Control Protocol I : ACTA --- p.30 / Chapter 3.7 --- Media Access Control Protocol II: Hub Polling --- p.34 / Chapter 3.8 --- Protocol Implementation on CUM LAUDE NET --- p.36 / Chapter 4 --- Hardware Implementation & Performance of Routers and NIC --- p.40 / Chapter 4.1 --- Functionality of Router --- p.40 / Chapter 4.2 --- Important Components Used in the Router Design --- p.43 / Chapter 4.2.1 --- TAXI Transmitter and Receiver --- p.43 / Chapter 4.2.2 --- First-In-First-Out Memory (FIFO) --- p.44 / Chapter 4.3 --- Design of Router --- p.45 / Chapter 4.3.1 --- Version 1 --- p.45 / Chapter 4.3.2 --- Version 2 --- p.47 / Chapter 4.3.3 --- Version 3 --- p.50 / Chapter 4.4 --- Lessons Learned from the High Speed Router Design --- p.57 / Chapter 5 --- Conclusion --- p.61 / Bibliography --- p.63

by Philip Pak-tung To. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1994. / Includes bibliographical references (leaves 57-60). / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Modular Expansion of ShuffleNet --- p.8 / Chapter 2.1 --- Multi-Star Implementation of ShuffleNet --- p.10 / Chapter 2.2 --- Modular Expansion of ShuffleNet --- p.21 / Chapter 2.2.1 --- Expansion Phase 1 --- p.21 / Chapter 2.2.2 --- Subsequent Expansion Phases --- p.24 / Chapter 2.3 --- Discussions --- p.26 / Chapter 3 --- Reconfigurability of ShuffleNet in Multi-Star Implementation --- p.33 / Chapter 3.1 --- Reconfigurability of ShuffleNet --- p.34 / Chapter 3.1.1 --- Definitions --- p.34 / Chapter 3.1.2 --- Rearrangable Conditions --- p.35 / Chapter 3.1.3 --- Formal Representation --- p.38 / Chapter 3.2 --- Maximizing Network Reconfigurability --- p.40 / Chapter 3.2.1 --- Rules to maximize Tsc and Rsc --- p.41 / Chapter 3.2.2 --- Rules to Maximize Z --- p.42 / Chapter 3.3 --- Channels Assignment Algorithms --- p.43 / Chapter 3.3.1 --- Channels Assignment Algorithm for w = p --- p.45 / Chapter 3.3.2 --- Channels Assignment Algorithm for w = p. k --- p.46 / Chapter 3.3.3 --- Channels Assignment Algorithm for w=Mpk --- p.49 / Chapter 3.4 --- Discussions --- p.51 / Chapter 4 --- Conclusions --- p.55

by Siu Man Tsang. / Thesis (M.Ph.)--Chinese University of Hong Kong, 1987. / Bibliography: leaves 120-121.

Kwok Pui Wing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 66-67). / Abstracts in English and Chinese. / Abstract --- p.i / Abstract (Chinese Version) --- p.ii / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Linear Network Coding --- p.7 / Chapter 2.1 --- Single Source Network Coding --- p.8 / Chapter 2.2 --- Descriptions of Linear Network Codes --- p.9 / Chapter 2.3 --- Desirable Properties of Linear Network Codes --- p.12 / Chapter 2.4 --- Linear Network Codes Constructions --- p.14 / Chapter 3 --- Node-based Characterization --- p.16 / Chapter 3.1 --- Channel-based characterization --- p.16 / Chapter 3.2 --- A Necessary Condition for the Existence of Linear Network Codes --- p.17 / Chapter 3.3 --- Insufficiency of the condition --- p.22 / Chapter 4 --- Relation between Linear Network Codes --- p.25 / Chapter 4.1 --- Relation between Multicast and Broadcast --- p.26 / Chapter 4.1.1 --- Auxiliary Graph --- p.26 / Chapter 4.2 --- Relation between Broadcast and Dispersion --- p.29 / Chapter 4.2.1 --- Expanded Graph --- p.29 / Chapter 4.3 --- Relation between Dispersion and Generic Net- work Code --- p.31 / Chapter 4.3.1 --- Edge Disjoint Path --- p.31 / Chapter 4.3.2 --- Path Rearrangement --- p.34 / Chapter 4.3.3 --- Extended Graph --- p.50 / Chapter 5 --- Upper Bound on the Size of the Base Field --- p.57 / Chapter 5.1 --- Base Field Size Requirement --- p.58 / Chapter 5.1.1 --- Linear Multicast --- p.58 / Chapter 5.1.2 --- Linear Broadcast --- p.58 / Chapter 5.1.3 --- Linear Dispersion --- p.59 / Chapter 5.1.4 --- Generic Network Code --- p.60 / Chapter 5.2 --- Upper Bounds Comparison for Generic Network Code --- p.61 / Chapter 6 --- Future Work --- p.62 / Bibliography --- p.66

Typescript, etc. / Digitized by Kansas Correctional Industries

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