Author:
Liu Hui,Li Xiaowan,Wang Shenling
Abstract
Bidirectional double-loop networks (BDLNs) are widely used in computer networks for their simplicity, symmetry and scalability. One common way to improve their performance is to decrease the diameter and average distance. Attempts have been made to find BDLNs with minimal diameters; however, such BDLNs will not necessarily have the minimum average distance. In this paper, we construct dual optimal BDLNs with minimum diameters and average distances using an efficient method based on coordinate embedding and transforming. First, we get the lower bounds of both the diameter and average distance by embedding a BDLN into Cartesian coordinates. Then, we construct tight optimal BDLNs that provide the aforementioned lower bounds based on an embedding graph. On the basis of node distribution regularity in tight optimal BDLNs, we construct dual optimal BDLNs with minimum diameters and average distances for any number of nodes. Finally, we present on-demand optimal message routing algorithms for the dual optimal BDLNs that we have constructed. The presented algorithms do not require routing tables and are efficient, requiring little computation.
Funder
National Key R&D Program of China
National Natural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference31 articles.
1. A Survey on the Use of Preferences for Virtual Machine Placement in Cloud Data Centers;Alashaikh;ACM Comput. Surv.,2021
2. Two-Aggregator Topology Optimization Using Single Paths in Data Center Networks;Das;IEEE Trans. Cloud Comput.,2021
3. Integrated Blockchain and Cloud Computing Systems: A Systematic Survey, Solutions, and Challenges;Zou;ACM Comput. Surv.,2022
4. Energy-Efficient Task Execution for Application as a General Topology in Mobile Cloud Computing;Zhang;IEEE Trans. Cloud Comput.,2018
5. A Survey of State-of-the-art on Edge Computing: Theoretical Models, Technologies, Directions, and Development Paths;Liu;IEEE Access,2022
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献