On the wide diameter of directed double-loop networks

Authors:
Yebin Chen;Ying Li;Jiankun Wang
Affiliations:
Department of Computer Science, Anhui University of Technology, Ma'anshan 243002, People's Republic of China;Department of Science and Engineering, Ma'anshan Teacher's College, Ma'anshan 243041, People's Republic of China;Department of Computer Science, Anhui University of Technology, Ma'anshan 243002, People's Republic of China
Venue:
Journal of Network and Computer Applications
Year:
2011

Citing 12
Cited 1

Fault diameter of interconnection networks

Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Discrete Optimization Problem in Local Networks and Data Alignment

IEEE Transactions on Computers
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
An Optimal Fault-Tolerant Routing Algorithm for Weighted Bidirectional Double-Loop Networks

IEEE Transactions on Parallel and Distributed Systems
An efficient algorithm to find a double-loop network that realizes a given L-shape

Theoretical Computer Science
Optimal routing in double loop networks

Theoretical Computer Science
Optimal designs of directed double-loop networks

CIS'04 Proceedings of the First international conference on Computational and Information Science

Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In parallel transmission system, the wide diameter has become an important factor to measure transmission efficiency instead of the diameter. The minimum distance diagram of a directed double-loop network yields an L-shaped tile, an L-shaped tile can be described by four geometric parameters: a, b, p and q, let m=a-p, n=b-q, the L-shaped tiles can be classified into 4 types according to the value of m and n. In this paper, through classification and superposition to L-shaped tiles, we give a method to search the equivalent node, and provide the formulas for the wide diameter of directed double-loop networks. We also prove that for any directed double-loop networks, the lower and the upper bounds of the wide diameter are ceil (sqrt(3xN))-1 and N-1, respectively. Next, we use simulation results to demonstrate the relationship between the wide diameter and tight optimal directed double-loop networks. It is obvious that the wide diameter doesn't always obtain minimum value in tight optimal directed double-loop networks, but the directed double-loop network must be tight optimal one when its wide diameter obtains minimum value. The simulation results indicate that there are many double tight optimal directed double-loop networks.