Isochronets: A High-speed Network Switching Architecture

Traditional network architectures present two main limitations when applied to High- Speed Networks (HSNs): they do not scale with link speeds and they do not adequately support the Quality of Service (QoS) needs of high-performance applications. This thesis introduces the Isochronets architecture that overcomes both limitations. Isochronets view frame motions over links in analogy to motions on roads. In the latter, traffic lights can synchronize to create green waves of uninterrupted motion. Isochronets accomplish similar uninterrupted motion by periodically configuring network switches to create end-to-end routes in the network. Frames flow along these routes with no required header processing at intermediate switches. Isochronets offer several advantages. First, they are scaleable with respect to transmission speeds. Switches merely configure routes on a time scale that is significantly longer than and independent of the average frame transmission time. Isochronets do not require frame processing and thus avoid conversions from optical to electronic representations. They admit efficient optical transmissions under electronically controlled switches. Second, Isochronets ensure QoS for high-performance applications in terms of latency, jitter, loss, and other service qualities. Isochronet switches can give priority to frames arriving from selected links. At one extreme, they may give a source the right-of-way to the destination by assigning priority to all links in its path. Additionally, other sources may still transmit at lower priority. At the other extreme, they may give no priority to sources and frames en route to the same destination contend for intermediate links. In between, Isochronets can accomplish a myriad of priority allocations with diverse QoS. Third, Isochronets can support multiple protocols without adaptation between different frame structures. End nodes view the network as a media access layer that accepts frames of arbitrary structure. The main contributions of this thesis are: Design of the Isochronets architecture. Design and implementation of a gigabit per second Isochronet switch (Isoswitch). Definition of the Loosely-synchronous Transfer Mode (LTM) and the Synchronous Protocol Stack (SPS) that add synchronous and isochronous services to any existing protocol stack. Performance evaluation of Isochronets

Multicast communications in distributed systems

PhD ThesisOne of the numerous results of recent developments in communication networks and distributed systems has been an increased interest in the study of applications and protocolsfor communications between multiple, as opposed to single, entities such as processes and computers. For example, in replicated file storage, a process attempts to store a file on several file servers, rather than one. MUltiple entity communications, which allow one-to-many and many-to-one communications, are known as multicast communications. This thesis examines some of the ways in which the architectures of computer networks and distributed systems can affect the design and development of multicast communication applications and protocols.To assist in this examination, the thesis presents three contributions. First, a set of classification schemes are developed for use in the description and analysis of various multicast communication strategies. Second, a general set of multicast communication primitives are presented, unrelated to any specific network or distributed system, yet efficiently implementable on a variety of networks. Third, the primitives are used to obtain experimental results for a study ofintranetwork and internetwork multicast communications.Postgraduate Scholarship, The Natural Sciences and Engineering Research Council of Canada: Overseas Research Student Award: the Committee of Vice-Chancellors and Principals of the Universities of the Uni ted Kingdom

Performance evaluation of a prototyped wireless ground sensor networks

This thesis investigated the suitability of wireless, unattended ground sensor networks for military applications. The unattended aspect requires the network to self-organize and adapt to dynamic changes. A wireless, unattended ground sensor network was prototyped using commercial off-the-shelf technology and three to four networked nodes. Device and network performance were measured under indoor and outdoor scenarios. The measured communication range of a node varied between three and nineteen meters depending on the scenario. The sensors evaluated were an acoustic sensor, a magnetic sensor, and an acceleration sensor. The measured sensing range varied by the type of sensor. Node discovery durations observed were between forty seconds and over five minutes. Node density calculations indicated that the prototype was scalable to five hundred nodes. This thesis substantiated the feasibility of interconnecting, self-organizing sensor nodes in military applications. Tests and evaluations demonstrated that the network was capable of dynamic adaptation to failure and degradation.http://archive.org/details/performanceevalu109452263Approved for public release; distribution is unlimited

Distributed On-Line Schedule Adaptation for Balanced Slot Allocation in Bluetooth Scatternets and other Wireless Ad-Hoc Network Architectures

In this paper we propose an algorithm for design and on the fly modification of the schedule of an ad-hoc wireless network in order to provide fair service guarantees under topological changes. The primary objective is to derive a distributed coordination method for schedule construction and modification in Bluetooth scatternets. The algorithm proposed here has wider applicability, to any wireless ad-hoc network that operates under a schedule where the transmissions at each slot are explicitly specified over a time period of length T. First we introduce a fluid model of the system where the conflict avoidance requirements of neighboring links are relaxed while the aspect of local channel sharing is captured. In that model we propose an algorithm where the nodes asynchronously re-adjust the rates allocated to their adjacent links based only on local information. We prove that from any initial condition the algorithm finds the max-min fair rate allocation in the fluid model. Hence if the iteration is performed constantly the rate allocation will track the optimal even in regimes of constant topology changes. Then we consider the slotted system and propose a modification method that applies directly on the slotted schedule, emulating the effect of the rate re-adjusment iteration of the fluid model. Through extensive experiments in networks with fixed and time varying topologies we show that the latter algorithm achieves balanced rate allocation in the actual slotted system that are very close to the max-min fair rates. The experiments show also that the algorithm is very robust on topology variations, with very good tracking properties of the max-min fair rate allocation

A theory of clock synchronization

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.Includes bibliographical references (p. 143-146) and index.by Boaz Patt.Ph.D

Atomic Transfer for Distributed Systems

Building applications and information systems increasingly means dealing with concurrency and faults stemming from distribution of system components. Atomic transactions are a well-known method for transferring the responsibility for handling concurrency and faults from developers to the software\u27s execution environment, but incur considerable execution overhead. This dissertation investigates methods that shift some of the burden of concurrency control into the network layer, to reduce response times and increase throughput. It anticipates future programmable network devices, enabling customized high-performance network protocols. We propose Atomic Transfer (AT), a distributed algorithm to prevent race conditions due to messages crossing on a path of network switches. Switches check request messages for conflicts with response messages traveling in the opposite direction. Conflicting requests are dropped, obviating the request\u27s receiving host from detecting and handling the conflict. AT is designed to perform well under high data contention, as concurrency control effort is balanced across a network instead of being handled by the contended endpoint hosts themselves. We use AT as the basis for a new optimistic transactional cache consistency algorithm, supporting execution of atomic applications caching shared data. We then present a scalable refinement, allowing hierarchical consistent caches with predictable performance despite high data update rates. We give detailed I/O Automata models of our algorithms along with correctness proofs. We begin with a simplified model, assuming static network paths and no message loss, and then refine it to support dynamic network paths and safe handling of message loss. We present a trie-based data structure for accelerating conflict-checking on switches, with benchmarks suggesting the feasibility of our approach from a performance stand-point

Test and evaluation of a prototyped sensor-camera network for persistent intelligence, surveillance, and reconnaissance in support of tactical coalition networking environments

This thesis investigated the feasibility of deploying an integrated sensor-camera network in military and law enforcement applications. The system was built using entirely commercial-off-the-shelf technologies. The prototype used the unattended ground sensors combined with digital video surveillance cameras to provide accurate real-time situational awareness, persistent intelligence and remote security. A robust testing and evaluation plan was created to measure the system's performance based on specific metrics. The tests focused primarily on the capabilities of the sensor aspect of the network. Tests were conducted to determine the maximum detection range, probabilities of detection, maximum communications range, and battery life. Mathematical models were created to assist network planners. Additionally, the prototyped system was tested through field exercises as part of the Naval Postgraduate School's Coalition Operating Area Surveillance and Targeting System field demonstrations in California and northern Thailand. Although the sensing capabilities exceeded the minimum metrics, the system was not suitable for use in military applications. However, the prototyped network would work well in less demanding law enforcement environments. Additionally, the feasibility and the need to develop an integrated sensor-camera network were demonstrated.http://archive.org/details/testndevaluation109452780US Navy (USN) author.Approved for public release; distribution is unlimited