Double loop networks with minimum delay
Discrete Mathematics
Discrete Optimization Problem in Local Networks and Data Alignment
IEEE Transactions on Computers
Diameters of weighted double loop networks
Journal of Algorithms
Introduction to algorithms
Distributed loop network with minimum transmission delay
Theoretical Computer Science
Double commutative-step digraphs with minimum diameters
Discrete Mathematics - Special issue on combinatorics and algorithms
Analyzing the fault tolerance of double-loop networks
IEEE/ACM Transactions on Networking (TON)
An efficient algorithm to find optimal double loop networks
Selected papers of the 14th British conference on Combinatorial conference
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
A Combinatorial Problem Related to Multimodule Memory Organizations
Journal of the ACM (JACM)
The Minimum Distance Diagram of Double-Loop Networks
IEEE Transactions on Computers
A complementary survey on double-loop networks
Theoretical Computer Science
A simple algorithm to find the steps of double-loop networks
Discrete Applied Mathematics
Improved upper and lower bounds on the optimization of mixed chordal ring networks
Information Processing Letters
On the wide diameter of directed double-loop networks
Journal of Network and Computer Applications
Hi-index | 5.23 |
Double-loop networks have been widely studied as an architecture for local area networks. It is well known that the minimum distance diagram of a double-loop network yields an L-shape. Given a positive integer N, it is desirable to find a double-loop network with its diameter being the minimum among all double-loop networks with N nodes. Since the diameter of a double-loop network can be easily computed from its L-shape, one method is to start with a desirable L-shape and then find a double-loop network to realize it. This is a problem discussed by many authors [F. Aguiló, M.A. Fiol, An efficient algorithm to find optimal double loop networks, Discrete Math. 138 (1995) 15-29, R.C. Chan, C.Y. Chen, Z.X. Hong, A simple algorithm to find the steps of double-loop networks, Discrete Appl. Math. 121 (2002) 61-72, C.Y. Chen, F.K. Hwang, The minimum distance diagram of double-loop networks, IEEE Trans. Comput. 49 (2000) 977-979, P. Esqué, F. Aguiló, M.A. Fiol, Double commutative-step diagraphs with minimum diameters, Discrete Math. 114 (1993) 147-157] and it has been open for a long time whether this problem can be solved in O(log N) time. In this paper, we will provide a simple and efficient O(log N)-time algorithm for solving this problem.