Results 211 to 220 of about 10,328 (262)

The case for chaotic adaptive routing

IEEE Transactions on Computers, 1997
Chaotic routers are randomizing, nonminimal adaptive packet routers designed for use in the communication networks of parallel computers. Chaotic routers combine the flexibility found in adaptive routing with a design simple enough to be competitive with the most streamlined oblivious routers.
Kevin Bolding, Melanie L. Fulgham, Lawrence Snyder 0001   +2 more
openaire   +1 more source

An adaptive hierarchical routing protocol

IEEE Transactions on Computers, 1989
An adaptive hierarchical routing protocol based on the extension of the new Arpanet scheme is proposed and its simulated performance is presented. The protocol can adapt to rapidly changing environments and works for arbitrarily large networks. A number of existing schemes as well as the proposed scheme are simulated under many different environments ...
Wei-Tek Tsai, C. V. Ramamoorthy, Wei Kang Tsai, Osamu Nishiguchi   +3 more
openaire   +1 more source

Adaptive lightpath routing in wavelength-routed networks

IEEE International Conference on Communications, 2005. ICC 2005. 2005, 2005
In this paper, we study the issue of dynamically selecting shortest paths in wavelength-routed networks. We present several fast shortest path selection algorithms for networks with and without wavelength conversions. The presented algorithms employ the strategies of sequential search, backward routing, and informed search.
Baoxian Zhang, Jun Zheng 0002, Hussein T. Mouftah   +2 more
openaire   +1 more source

Centralized Adaptive Routing for NoCs

IEEE Computer Architecture Letters, 2010
As the number of applications and programmable units in CMPs and MPSoCs increases, the Network-on-Chip (NoC) encounters diverse and time dependent traffic loads. This trend motivates the introduction of NoC load-balanced, adaptive routing mechanisms that achieve higher throughput as compared with traditional oblivious routing schemes that are perceived
Ran Manevich, Israel Cidon, Avinoam Kolodny, Isask'har Walter   +3 more
openaire   +1 more source

Mobility Metrics for Adaptive Routing

2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, 2006
Most existing mobile ad hoc routing protocols preset the parameters for the nodes based on some assumed network conditions. Because of the dynamic characteristics of a MANET, network conditions are changing at different points of time. Adaptively adjusting routing behavior by individual nodes will improve the routing protocol performance. In this paper,
Liang Qin 0002, Thomas Kunz
openaire   +1 more source

Adaptive Routing on the Plane

Operations Research, 1996
Demands for service arrive at random times, in random locations, in a region of the plane. The service time of each demand is random. A server that travels with constant speed moves from demand to demand providing service. The server spends its time either in providing service or in traveling.
openaire   +1 more source

Dimensioning of adaptively routed networks

IEEE/ACM Transactions on Networking, 1993
The authors present an algorithm for the multihour dimensioning of telephone networks operating with residual capacity adaptive routing. The method is based on dimensioning techniques for networks operating with nonhierarchical alternate routing and relies on a conservative approximation for traffic evaluation.
André Girard, Bernard Liau
openaire   +1 more source

Adaptive packet routing in a hypercube

Proceedings of the third conference on Hypercube concurrent computers and applications Architecture, software, computer systems, and general issues -, 1988
All commercial hypercubes use fixed-path routing for packet switching. However, it has long been known that adaptive routing reduces packet delay by sending packets via less congested areas. Moreover, the hypercube topology contains many alternative, equal-length paths, suggesting the desirability of adaptive routing.
Chong-kwon Kim, Daniel A. Reed
openaire   +1 more source

Mobile agents for adaptive routing

Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 2002
This paper introduces AntNet, a new routing algorithm for telecommunication networks. AntNet is an adaptive, distributed, mobile-agents-based algorithm which was inspired by recent work on the ant colony metaphor. We apply AntNet in a datagram network and compare it with both static and adaptive state-of-the-art routing algorithms.
Di Caro, Gianni, Dorigo, Marco
openaire   +2 more sources

Adaptive routing in Clos networks

Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors, 2002
We describe a method of controlling a three-stage Clos nonblocking switch where "speculative" self-routing over the Clos fabric is augmented with reservations over a control network that connects controllers in the input and output stages of the switch.
Peter A. Franaszek, Christos J. Georgiou, Chung-Sheng Li   +2 more
openaire   +1 more source