A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments

Abstract

Abstract-Large-scale distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions are inherently unpredictable and, therefore, robustness is a desirable property for the distributed operating environment. In this work, we describe and evaluate a robust topology for applications that operate on a spanning tree overlay network. Unlike previous work that is adaptive or reactive in nature, we take a proactive approach to robustness. The topology itself is able to simultaneously withstand disturbances and exhibit good performance. We present both centralized and distributed algorithms to construct the topology, and then demonstrate its effectiveness through analysis and simulation of two classes of distributed applications: Data collection in sensor networks and data dissemination in divisible load scheduling. The results show that our robust spanning trees achieve a desirable trade-off for two opposing metrics where traditional forms of spanning trees do not. In particular, the trees generated by our algorithms exhibit both resilience to data loss and low power consumption for sensor networks. When used as the overlay network for divisible load scheduling, they display both robustness to link congestion and low values for the makespan of the schedule.

Multi-level reconfigurable self-organization in overlay services

“…The application-dependence of most of the related approaches unavoidably results in a low customization and optimization options. Some of these approaches [England et al, 2007, Jagadish et al, 2006b, Leitao et al, 2007 introduce additional costly protocols and management mechanisms to improve the customization of self-organization in dynamic scenarios. For example, custom tree repairing, load-balancing and decentralization mechanisms are some of them.…”

An Enhanced Approach for a Multiagent Distributed Context Using Tree Topology and Transferable Belief Model

“…Various topology control algorithms also use minimum spanning tree to build well connected sub graphs with provable cost relative to the optimum. Both centralized and distributed algorithms have been proposed to construct the topology in [6].They demonstrates its effectiveness through investigation of two clauses of distributed applications: Data gathering of sensor networks and data dissemination in divisible load scheduling. Also an in depth study of design and analysis of gossip algorithm has been taken forward for averaging in an arbitrarily connected number of nodes [7].It examines the averaging problem under the gossip constraint for an arbitrary networks and finds that the averaging time of the gossip algorithm depends on the second largest Eigen values of a double stochastic matrix characterizing the algorithm.…”

Scheduling Multisource Divisible Loads on Arbitrary Networks

“…We use the shortest path for constructing a spanning tree because each processing node's communication delay is guaranteed to be a minimum. Thus, compared to other well-known spanning trees, such as shortest hop spanning tree, minimum spanning tree [21], and robust spanning tree [22], SPST usually admits better performance. Now we will introduce how SSS works.…”