Eisenstein-Jacobi网络的泛连通性算法
Panconnectivity Algorithm for Eisenstein-Jacobi Networks
摘要:
互连网络中的环是衡量网络拓扑效率和可靠性的一种通信类型。如果在两个节点u和v之间存在长度为$l$的圈,则称该网络是泛连通的,对于所有l = d(u,v),d(u,v)+1,d(u,v)+2,.,其中d(u,v)是给定网络中u和v之间的最短距离,n是网络中节点的总数。在本文中,我们提出了一个算法,通过构造网络中任意两个长度为l的节点之间的所有圈,使得3 <= l < n,来生成并证明Eisenstein-Jacobi网络的泛连通性。证明了该算法的正确性,其时间复杂度为O(n^4).
英文摘要:
The cycles in an interconnection network are one of the communication types that are considered as a factor to measure the efficiency and reliability of the networks' topology. The network is said to be panconnected if there are cycles of length $l$ between two nodes u and v, for all l = d(u, v), d(u, v) +1, d(u, v) +2, ..., n-1 where d(u, v) is the shortest distance between u and v in a given network, and n is the total number of nodes in the network. In this paper, we propose an algorithm that generates and proves the panconnectivity of Eisenstein-Jacobi networks by constructing all cycles between any two nodes in the network of length l such that 3 <= l < n. The correctness of the proposed algorithm is given with the time complexity O(n^4).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。