Bibliographic Details
| Title: |
Edge-disjoint node-independent spanning trees in dense Gaussian networks. |
| Authors: |
AlBdaiwi, Bader1 bdaiwi@cs.ku.edu.kw, Hussain, Zaid1 zhussain@cs.ku.edu.kw, Cerny, Anton2 anton.cerny@ku.edu.kw, Aldred, Robert3 raldred@maths.otago.ac.nz |
| Source: |
Journal of Supercomputing. Dec2016, Vol. 72 Issue 12, p4718-4736. 19p. |
| Subjects: |
Fault-tolerant computing, Computer reliability, Telecommunication, Electric network topology, Routing (Computer network management) |
| Abstract: |
Independent trees are used in building secure and/or fault-tolerant network communication protocols. They have been investigated for different network topologies including tori. Dense Gaussian networks are potential alternatives for two-dimensional tori. They have similar topological properties; however, they are superiors in carrying communications due to their node-distance distributions and smaller diameters. No result on fault-tolerant communications in Gaussian networks exists in the literature. In this paper, we present constructions of edge-disjoint node-independent spanning trees in dense Gaussian networks. Based on the constructed trees, we design novel fault-tolerant communication algorithms that could be used in fault-tolerant routing, broadcasting, or secure message distribution. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
