The minimum distance diagram and diameter of undirected double-loop networks

DOI

10.2991/icmemtc-16.2016.319How to use a DOI?

Keywords

undirected double-loop networks; minimum distance diagram; shortest path; optimal network.

Abstract

This thesis proposes a minimum distance diagram of undirected double-loop, which makes use of the cyclic graph's excellent properties on the node number and path length to achieve high performance. Main issues include the method to build the minimum distance diagram of undirected double-loop networks, the algorithm to calculate its diameter, and the step to build optimal undirected double-loop networks, etc. We prove that the diameter of the undirected double-loop network is equal to the height of its tree structure, and propose a rapid algorithm to calculate the diameter, and find that there are lots of optimal undirected double-loop networks in some infinite clusters. Finally, the lower bound proposed by Yebra is verified by experiment. According to these results above, the transmission performance of undirected double-loop will be optimized.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ying Li
AU  - Yebin Chen
AU  - Weipeng Tai
AU  - Renwei Wang
PY  - 2016/04
DA  - 2016/04
TI  - The minimum distance diagram and diameter of undirected double-loop networks
BT  - Proceedings of the 2016 3rd International Conference on Materials Engineering, Manufacturing Technology and Control
PB  - Atlantis Press
SP  - 1682
EP  - 1687
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmemtc-16.2016.319
DO  - 10.2991/icmemtc-16.2016.319
ID  - Li2016/04
ER  -