An Efficient Routing Algorithm for Average Distance of Directed Triple Loop Networks

Ying Li; Ye Bin Chen; Tao Chen

doi:10.4028/www.scientific.net/AMM.373-375.1695

Paper Titles

Novel Private Matching Protocol Suitable for Cloud Computing
p.1678

The Construction of Military Documents Electronic Lexicon
p.1682

Application of SARIMA Model in Cucumber Price Forecast
p.1686

Research on Code Obfuscation Based on Maze Protection Technology
p.1691

An Efficient Routing Algorithm for Average Distance of Directed Triple Loop Networks
p.1695

Information-Based Path Analysis of the Career Guidance for Chinese College Students from a Comparison Perspective
p.1699

Design and Development of Refueling Machine Operation Simulation System in Nuclear Power Plant
p.1703

Study on the Application of Desktop Cloud to Confidential Information System
p.1710

Semantic Web Ontology Integration Based on Formal Concept Analysis
p.1714

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 373-375An Efficient Routing Algorithm for Average...

An Efficient Routing Algorithm for Average Distance of Directed Triple Loop Networks

Abstract:

Used equivalent tree to construct the minimum distance diagram of triple loop networks and found the relationships between the layer of the equivalent tree and the shortest path of any two points in triple loop networks, and provided a formula to compute its average diameter. The experimental results show that average diameter approaches to a half of the diameter at the same network, in one infinite family, the diameter must obtain minimum value when average diameter obtains the minimum value, but the inverse is not. Studies also show that average diameter is the better parameter to measure transmission efficiency about loop networks instead of diameter.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 373-375)

Pages:

1695-1698

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.373-375.1695

Citation:

Cite this paper

Online since:

August 2013

Authors:

Ying Li, Ye Bin Chen, Tao Chen

Keywords:

Average Distance, Diameter, Minimum Distance Diagram, Shortest Path, Triple-Loop Networks

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Xiebin Chen. An oprimal routing algorithm for double loop networks with restricted steps. chinese joural of computers 2004; 27(5): 596-600.

Google Scholar

[2] Gómez Domingo, Gutierrez Jaime, Ibeas Álvar. Optimal routing in double loop networks. Theoretical Computer Science 2007; 381(1-3): 68-85.

DOI: 10.1016/j.tcs.2007.04.002

Google Scholar

[3] Baoxing Chen, Wenjun Xiao, Behrooz Parhami. Diameter formulas for a class of undirected double-loop networks. Journal of Interconnection Networks 2005; 6 (1): 1-15.

DOI: 10.1142/s0219265905001289

Google Scholar

[4] Robin Chi-Feng Chan, Chiuyuan Chen, Zhi-Xin Hong. A simple algorithm to find the steps of double-loop networks. Discrete Applied Mathematics 2002; 121(1-3): 61-72.

DOI: 10.1016/s0166-218x(01)00245-1

Google Scholar

[5] Chiuyuan Chen, K Lan James, Wenshiang Tang. An efficient algorithm to find a double-loop network that realizes a given L-shape. Theoretical Computer Science 2006; 359(1-3): 69-76.

DOI: 10.1016/j.tcs.2006.01.048

Google Scholar

[6] Yebin Chen, Ying Li, Jiankun Wang. On the wide diameter of directed double-loop network. Journal of Network and Computer Applications 2011; 34: 692-696.

DOI: 10.1016/j.jnca.2010.10.014

Google Scholar

[7] Yebin Chen, Ying Li, Tao Chen. Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks. Theoretical Computer Science, 2013, 468(1): 50-58.

DOI: 10.1016/j.tcs.2012.11.008

Google Scholar