ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS-Reference-Cited by-同舟云学术

ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS

Published:1992-09 Issue:03 Volume:03 Page:323-331
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

CHENG Y.¹,HWANG F.K.²,AKYILDIZ I.F.³,HSU D.F.⁴

Affiliation:

1. AT&T Bell Laboratories, Holmdel, New Jersey 07733, USA

2. AT&T Bell Laboratories, Murray Hill, New Jersey 07974, USA

3. School of Information and Computer Science, Georgia Institute of Technology, Atlanta, Georgia 30332, USA

4. Department of Computer Science, Fordham University, Bronx, New York 10458, USA

Abstract

We give a new routing algorithm for double loop networks with n nodes which requires O(log n) time for preprocessing and constant processing time at each node on the route. A simple modification of the algorithm works for the case of a single fault (either node or link). The routing is always through a shortest path and the only information needed by a node to process is the address of the destination.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054192000188

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Vertex-Colouring of Some 3-Chromatic Circulant Graphs Cn(A, B, C) with Gcd(N, a) Mod 3 = 0;2023

2. Vertex-colouring of 3-chromatic circulant graphs;Discrete Applied Mathematics;2017-10

3. An optimal fault-tolerant routing algorithm for weighted bidirectional double-loop networks;IEEE Transactions on Parallel and Distributed Systems;2005-09

4. A Constant Time Optimal Routing Algorithm for Undirected Double-Loop Networks;Lecture Notes in Computer Science;2005

5. SOME COMBINATORIAL PROPERTIES OF MIXED CHORDAL RINGS;Journal of Interconnection Networks;2003-03