The OTIS-hypercube is an interesting class of the optoelectronic OTIS architecture for interconnection networks. In the OTIS architecture, optical connections are used to connect distant processors while closer processors are connected electronically. In this paper, we propose an adaptive routing algorithm for the wormhole switched OTIS-hypercube. We then present an empirical performance evalua...

Any opinions, ndings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reeect the view of the NSF. Abstract In this study, we examine the eeects that traac patterns and virtual channels have on the performance of wormhole routing algorithms. In particular we look at two algorithms, dimension-ordered routing and an adaptive algorithm base...

An important part of a distributed system design is the workload sharing among the processors. This includes partitioning the arriving jobs into tasks that can be executed in parallel, assigning the tasks to processors and scheduling the task execution on each processor. In many system contexts jobs must depart in the order of their arrival, hence the resequence problem is involved. In this pap...

Adaptive routing is used in networks in order to achieve fault tolerance and optimize performance for all traffic patterns. Most adaptive routing schemes route each packet independently, requiring addressing and sequencing information to be transmitted and processed for each packet. Connection-based message transport, such as virtual circuits, reduces the overhead for routing packets through th...

A novel routing scheme is proposed for virtual cutthrough routing that attempts to combine the low routing delay of deterministic routing with the exibility and low queuing delays of adaptive routing. This hybrid routing mechanism relies on a pipelined implementation where di erent paths and stages of the router are used for di erent routing modes. A simulation based experimental evaluation of ...

Two major routing policies were proposed to develop adaptive multicast routing (MST routing in 8]) algorithms in B-ISDN networks. One was to choose the route with the least number of links, and the other was to employ maximum free circuit routing. These methods suuer two major drawbacks: excessive amount of virtual path (VP) status messages to be transferred and performance degradation in asymm...

This paper presents an analytical evaluation of the performance of wormhole switching with adaptive routing in a two-dimensional torus. Our analysis focuses on minimal and fully adaptive routing that allows a message to use any shortest path between source and destination .

Wireless networks have long suffered from congestion. It occurs when source node transmits the data at a rate greater than that of a network device can accommodate. It causes the buffer on such devices to fill up and possibly overflow. It results in loss of packets. Most of the Routing protocols which are currently in use are not congestion Adaptive. Existing congestion control schemes treat co...

Because of travel time uncertainty in traffic networks, the shortest path determined with a priori information may consist of links for which there are long delays and the path may not be optimal. Adaptive routing would suggest more reliable guidance by providing alternative links for en-route switching in the case of traffic congestion and a risk-averse hyperpath particularly provides an alter...

In this chapter the authors study the problems of data dissemination and query routing in mobile peer-to-peer networks. They provide a taxonomy and discussion of existing literature, spanning overlay topologies, query routing, and data propagation. They proceed by proposing content-driven routing and adaptive data dissemination algorithms for intelligently routing search queries in a peer-to-pe...