Results 211 to 220 of about 19,422 (259)

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

Routing algorithms for anycast messages

Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205), 2002
We propose and analyze three routing algorithms for anycast packets: source-destination based routing with weighted random selection (SD/WRS); destination based routing with weighted random selection (D/WRS); and the shortest shortest path first (SSPF) algorithms.
Dong Xuan, Weijia Jia 0001, Wei Zhao 0001   +2 more
openaire   +1 more source

Routing algorithms in honeycomb meshes

International Journal of Parallel, Emergent and Distributed Systems, 2009
Honeycomb meshes are a promising class of topological structures for connecting processors within parallel computing. This paper addresses three routing algorithms for these networks. First, a unicast algorithm known as XYZ-ROUTE is presented by employing the classical virtual channel technique.
Weiwen Zhang, Xiaofan Yang, Yan Liang, Zhi Chao Huang   +3 more
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

A parallel optimal routing algorithm

Parallel Computing, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C. Ribeiro, Didier El Baz
openaire   +2 more sources

An optimal distributed routing algorithm

IEEE Transactions on Communications, 1991
The authors present a distributed optimal one-level routing algorithm. The algorithm, based on the Newton method, considers the interdependence among the variables. Using the variable reduction method, the Hessian matrix becomes diagonal. The objective function is proved to be convex and the algorithm is shown to be convergent, both under a mild ...
Zhonghe Wang, Douglas W. Browning
openaire   +1 more source

A Multicast Routing Algorithm for CSCW

2004
The CRMR, which is an algorithm for updating multicast tree dynamically, is presented. It constructs an initial multicast tree using KPP and builds a virtual trunk (VT) simultaneously. The nodes of the VT are relatively stable and nodes changes are based on the VT.
Xiongfei Li, Dandan Huan, Yuanfang Dong, Xin Zhou   +3 more
openaire   +1 more source