No description available.

No description available.

No description available.

No description available.

Dynamic hierarchical networks represent an architectural strategy for employing adaptive behavior in applications sensitive to highly variable external demands or uncertain internal conditions. The characteristics of such architectures are described, and the significance of adaptive capability is discussed. The necessity for assessing cost/benefit tradeoffs leads to the use of queueing network models. The general model, a network of M/M/1 queues in a random environment, is introduced and then is simplified so that the links may be treated as isolated M/M/1 queues in a random environment. This treatment yields a formula for approximate mean network delay by combining matrix-geometric results (mean queue length and mean delay) for the individual links. Conditions under which the analytic model is considered valid are identified through comparison with a discrete event simulation model. Last, performance of the dynamic hierarchy is compared with that of the static hierarchy. This comparison establishes conditions for which the dynamic architecture enables performance equal or nearly equal to performance of the static architecture. / Ph. D. / incomplete_metadata

Thesis (MAcc (Accountancy))--University of Stellenbosch, 2007. / The purpose of this assignment is to ascertain whether the COBIT framework is an adequate framework to assist in the governance of virtual private networks. The assignment focuses on whether the framework can ensure the identification of virtual private network-related risks and address IT compliance with policies and statutory regulations. A brief summary of the risks and issues pertaining to the pre-implementation, implementation and post-implementation phases of virtual private networks is included in the assignment. These risks and issues are then individually mapped onto a relevant COBIT control objective. The scope of the assignment does not include the intricacies of how these networks operate, the different types of network topologies or the different technologies used in virtual private networks. It was found that the COBIT framework can be implemented to manage and/or mitigate virtual private network risks.

Approved for public release; distribution is unlimited. / The purpose of this thesis is to discuss the new features and enhancements of Windows Server 2003. Windows NT and Windows 2000 were known to have numerous security vulnerabilities; hence Microsoft focused on improving security by making Windows Server 2003 "secure by design, secure by default, secure in deployment." This thesis examines the differences between the five unique editions of the Windows Server 2003 family. Some of the pros and cons of migrating to Windows Server 2003 are highlighted. The author hopes this study will assist information technology professionals with their decision on whether or not to upgrade to this latest version of Microsoft's flagship network operating system. / Lieutenant Commander, United States Navy

A dissertation submitted to the Faculty of Engineering and the Built Environment, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the degree of Master of Science in Engineering, 2016 / The design and implementation of network coding into a location based ad- dressing algorithm for VANET has been investigated. Theoretical analysis of the network coding algorithm has been done by using a simplified topology called the ladder topology. The theoretical models were shown to describe the way that network coding and standard location based addressing works over the VANET network. All tests were performed over simulation. Network coding was shown to improve performance by a factor of 1.5 to 2 times in both simulation and theoretical models. The theoretical models demonstrate a fundamental limit to how much network coding can improve performance by, and these were confirmed by the simulations. Network coding does have a susceptibility to interference, but the other benefits of the techniques are substantial despite this. Network coding demonstrates strong possibilities for future development for VANET protocols. The ladder topology is an important tool for future analysis. / GS

Acoustic networks of autonomous underwater vehicles (AUVs) show great promise, but a lack of simulation tools and reliance on protocols originally developed for terrestrial radio networks has hindered progress. This work addresses both issues. A new simulator of underwater communication among AUVs provides accurate communication modeling and flexible vehicle behavior, while a new routing protocol, location-aware source routing (LASR) provides superior network performance. The new simulator was used to evaluate communication without networking, and then with networking using the coding or dynamic source routing (DSR) protocols. The results confirmed that a network was essential to ensure effective fleet-wide communication. The flooding protocol provided extremely reliable communication but with low message volumes. The DSR protocol, a popular routing protocol due to its effectiveness in terrestrial radio networks, proved to be a bad choice in an acoustic environment: in most cases, it suffered from both poor reliability and low message volumes. Due to the high acoustic latency, even moderate vehicle speeds caused the network topology to change faster than DSR could adapt. DSR's reliance on shortest-path routing also proved to be a significant disadvantage. Several DSR optimizations were also tested; most proved to be unhelpful or actually harmful in an underwater acoustic network. LASR was developed to address the problems noted in flooding and DSR. LASR was loosely derived from DSR, most significantly retaining source routes and the reply/request route discovery technique. However, LASR added features which proved, in simulation, to be significant advantages -- two of the most effective were a link/route metric and a node tracking system. To replace shortest-path routing, LASR used the expected transmission count (ETX) metric. / This allowed LASR to make more informed routing decisions which greatly increased performance compared to DSR. The node tracking system was the most novel addition: using only implicit communication coupled with the use of time-division multiple access (TDMA), the tracking system provided predicted node locations. These predictions made it possible for LASR to proactively respond to topology changes. In most cases, LASR outperformed flooding and DSR in message delivery reliability and message delivery volume. / by Edward A. Carlson. / Thesis (Ph.D.)--Florida Atlantic University, 2009. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2009. Mode of access: World Wide Web.

Controlling the cooperative behaviors of a fleet of autonomous underwater vehicles in a stochastic, complex environment is a formidable challenge in artificial intelligence. The complexity arises from the challenges of limited navigation and communication capabilities of underwater environment. A time critical cooperative operation by acoustic networks of Multiple Cooperative Vehicles (MCVs) necessitates a robust task allocation mechanism and an efficient path planning model. In this work, we present solutions to investigate two aspects of the cooperative schema for multiple underwater vehicles under realistic underwater acoustic communications: a Location-aided Task Allocation Framework (LAAF) algorithm for multi-target task assignment and a mathematical programming model, the Grid-based Multi-Objective Optimal Programming (GMOOP), for finding an optimal vehicle command decision given a set of objectives and constraints. We demonstrate that, the location-aided auction strategies perform significantly better than the generic auction algorithm in terms of effective task allocation time and information bandwidth requirements. In a typical task assignment scenario, the time needed in the LAAF algorithm is only a fraction compared to the generic auction algorithm. On the other hand; the GMOOP path planning technique provides a unique means for multi-objective tasks by cooperative agents with limited communication capabilities. Under different environmental settings, the GMOOP path planning technique is proved to provide a method with balance of sufficient expressive power and flexibility, and its solution algorithms tractable in terms of mission completion time, with a limited increase of overhead in acoustic communication. Prior to this work, existing multi-objective action selection methods were limited to robust networks where constant communication available. / The dynamic task allocation, together with the GMOOP path planning controller, provides a comprehensive solution to the search-classify tasks for cooperative AUVs. / by Yueyue Deng. / Thesis (Ph.D.)--Florida Atlantic University, 2010. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2010. Mode of access: World Wide Web.