Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks
Distributed, Parallel, and Cluster Computing
2016-11-15 v2 Data Structures and Algorithms
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 2-dimensional tori. They have similar topological properties; however, they are superiors in carrying communications due to their node-distance distributions and smaller diameters. In this paper, we present constructions of edge-disjoint node-independent spanning trees in dense Gaussian networks. Based on the constructed trees, we design algorithms that could be used in fault-tolerant routing or secure message distribution.
Cite
@article{arxiv.1601.06915,
title = {Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks},
author = {Bader AlBdaiwi and Zaid Hussain and Anton Cerny and Robert Aldred},
journal= {arXiv preprint arXiv:1601.06915},
year = {2016}
}