Wormhole Routing on Multichannel Ring Networks
نویسندگان
چکیده
Distributed computing systems which rely on message passing for communication between computers, require low latency in the communications network in order to be eeective. The multichannel ring network was previously proposed as a local area network topol-ogy for use in such distributed systems. In this paper we describe how wormhole routing can be used in the multichannel ring to decrease the communication la-tency of the network. Wormhole routing is rst discussed in detail, and then the implementation of this technique is described.
منابع مشابه
A Secure Routing Algorithm for Underwater Wireless Sensor Networks
Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...
متن کاملA two-phase wormhole attack detection scheme in MANETs
Mobile ad-hoc networks (MANETs) have no fixed infrastructure, so all network operations such as routing and packet forwarding are done by the nodes themselves. However, almost all common existing routing protocols basically focus on performance measures regardless of security issues. Since these protocols consider all nodes to be trustworthy, they are prone to serious security threats. Wormhole...
متن کاملSelf-Stabilizing Wormhole Routing on Ring Networks
Wormhole routing is most commonly used in parallel architectures in which messages are sent in small fragments, called flits. It is a lightweight and efficient method of routing messages between parallel processors. Self-stabilization is a technique that guarantees tolerance to transient faults (e.g., memory corruption or communication hazards) for a given protocol. Self-stabilization guarantee...
متن کاملThe Red Rover Algorithm for Deadlock-Free Routing on Bidirectional Rings
An algorithm for deadlock-free routing in bidirectional ring structures in multicomputer networks is presented. This algorithm provides greater throughput and lower message latencies than those of previously presented ring routing algorithms. Insight into these results is given by a message traÆc analysis, and increased performance for wormhole-routed networks is quanti ed through simulation ex...
متن کاملPeriodically Regular Chordal Rings
ÐChordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are nodesymmetric, i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In ...
متن کامل