Eisenstein-Jacobi网络中的独立生成树
Independent Spanning Trees in Eisenstein-Jacobi Networks
摘要:
生成树在网络中广泛用于广播、容错和安全地传递消息。非对称互连网络具有许多实际应用。例如蜂窝网络、计算机图形和图像处理。Eisenstein-Jacobi(EJ)网络是六边形网格拓扑的推广。它们具有广泛的潜在应用,因此在不同的领域受到研究者的关注,其中包括互连网络和编码理论。本文给出了Eisenstein-Jacobi(EJ)的两种生成树的构造。第一种方法构造了三棵边不相交的节点独立生成树,第二种方法构造了六棵节点独立生成树,但不是边不相交的。基于构建的树,我们开发的路由算法,可以安全地提供一个消息,并容忍一些故障,在点对点或广播通信。所提出的工作也适用于高维EJ网络。
英文摘要:
Spanning trees are widely used in networks for broadcasting, fault-tolerance, and securely delivering messages. Hexagonal interconnection networks have a number of real life applications. Examples are cellular networks, computer graphics, and image processing. Eisenstein-Jacobi (EJ) networks are a generalization of hexagonal mesh topology. They have a wide range of potential applications, and thus they have received researchers' attention in different areas among which interconnection networks and coding theory. In this paper, we present two spanning trees' constructions for Eisenstein-Jacobi (EJ). The first constructs three edge-disjoint node-independent spanning trees, while the second constructs six node-independent spanning trees but not edge disjoint. Based on the constructed trees, we develop routing algorithms that can securely deliver a message and tolerate a number of faults in point-to-point or in broadcast communications. The proposed work is also applied on higher dimensional EJ networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。