Results 171 to 180 of about 5,549 (211)

Genetic Algorithms for Route Discovery

IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 2006
Packet routing in networks requires knowledge about available paths, which can be either acquired dynamically while the traffic is being forwarded, or statically (in advance) based on prior information of a network's topology. This paper describes an experimental investigation of path discovery using genetic algorithms (GAs).
Erol Gelenbe, Peixiang Liu, Jeremy Lainé   +2 more
openaire   +3 more sources

A Routing Algorithm for Digraphs

IEEE Transactions on Communications, 1977
Abstract : A new algorithm for routing data packets in networks of computers connected by communication links is given by Chyung and Reddy. Because they assume that the communication links are two-way, their result applies, properly, to routing messages in a graph.
openaire   +1 more source

A Heuristic Routing Algorithm

IEEE Micro, 1983
This algorithm, implemented on an inexpensive microcomputer, solved a sophisticated operations research problem.
openaire   +1 more source

Routing algorithms performance in different routing scopes

2010 17th IEEE International Conference on Electronics, Circuits and Systems, 2010
Whenever new routing algorithms are proposed, corresponding performance gains are reported. Are these gains the same for different interconnect scenarios? Do the proposed techniques always outperform the previous ones in all possible routing scopes? We found out that the answer for these questions is no.
Tiago Reimann, Glauco B. V. dos Santos, Ricardo A. L. Reis   +2 more
openaire   +1 more source

A QoS routing algorithm based on ant algorithm

Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000, 2002
The requirements of routing due to multimedia applications are discussed. In order to solve the QoS constrained routing effectively and efficiently, we construct a globally optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source during their search for food.
Zhang Subing, Liu Zemin
openaire   +1 more source

Source Management Routing Algorithm (SMRA): A Backup Routing Algorithm for BGP

2008 10th IEEE International Conference on High Performance Computing and Communications, 2008
In this paper, we present source management routing algorithm (SMRA) providing a backup routing path for BGP. Each AS has a unique name, and chooses its virtual neighbors by name. Each AS only maintains one routing path to its virtual neighbors, and the ASes along a path to its virtual neighbors keep track of this path.
Shu Wang, Changjia Chen
openaire   +1 more source

The New Routing Algorithm for the ARPANET

IEEE Transactions on Communications, 1980
The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations.
John M. McQuillan, Ira Richer, Eric C. Rosen   +2 more
openaire   +1 more source

Algorithms for permutation channel routing

Integration, 1987
In this paper the channel routing problem is generalized to allow the interchange of some of the pins in the channel. The generalized problem is called the Permutation Channel Routing Problem (PCRP). This model arises naturally when there are logically equivalent (and therefore interchangeable) pins.
H. W. Leong, C. L. Liu 0001
openaire   +1 more source

Improvement of a Shortest Routes Algorithm

2007 IEEE Intelligent Transportation Systems Conference, 2007
This article describes an original shortest path algorithm for graphs representing a real road network. We test the influence of a coefficient weighing the evaluated distance used in such short path algorithms. This coefficient has an influence on the performance of the shortest path algorithm which uses the evaluated distance as heuristic.
Nicolas Lassabe, Alain Berro, Yves Duthen   +2 more
openaire   +1 more source

On quadratic adaptive routing algorithms

Communications of the ACM, 1976
Two analytic models of a store-and-forward communications network are constructed, one to find the optimal message routing and the other to illustrate the equilibrium (stationary state) maintained by an adaptive routing algorithm. These models show that adaptive routing does not satisfy the necessary conditions for an optimal routing.
openaire   +1 more source