NISp1-08: Secure Aggregation in Large Scale Overlay Networks

2006 ◽  
Author(s):  
Waseem Ahmad ◽  
Ashfaq Khokhar
Keyword(s):  
Large Scale ◽  
Overlay Networks

A Fully Distributed Method to Detect and Reduce Cut Vertices in Large-Scale Overlay Networks

2012 ◽  
Vol 61 (7) ◽  
pp. 969-985 ◽  
Author(s):  
Xiaomei Liu ◽  
Li Xiao ◽  
Andrew Kreling
Keyword(s):  
Large Scale ◽  
Overlay Networks ◽  
Distributed Method

Topology Design for Large Scale Service Overlay Networks

2010 ◽  
Vol 32 (4) ◽  
pp. 841-845
Author(s):  
Dong Zhang ◽  
Chun-ming Wu ◽  
Ming Jiang ◽  
Wei Xiong
Keyword(s):  
Large Scale ◽  
Overlay Networks ◽  
Topology Design ◽  
Service Overlay Networks

Adaptive Self-Organization in Distributed Tree Topologies

2014 ◽  
Vol 5 (3) ◽  
pp. 24-57 ◽  
Author(s):  
Evangelos Pournaras ◽  
Martijn Warnier ◽  
Frances M.T. Brazier
Keyword(s):  
Large Scale ◽  
Overlay Networks ◽  
Adaptation Strategies ◽  
Self Organization ◽  
Self Organized ◽  
Trade Offs ◽  
Organization Process ◽  
Tree Topologies ◽  
Hierarchical Communication ◽  
Message Overhead

Tree topologies are often deployed in large-scale distributed systems to structure a hierarchical communication. Building and maintaining overlay networks self-organized in tree topologies is challenging to achieve in dynamic environments. Performance trade-offs between resilience to failures and message overhead need to be considered. This paper introduces eight adaptation strategies that provide a higher abstraction, modularity and reconfigurability in the tree self-organization process. Performance can be further enhanced by dynamically changing strategies during system runtime. Experimental evaluation illustrates the performance trade-offs and properties of adaptation strategies.

scholarly journals Self-Stabilizing Prefix Tree Based Overlay Networks

2016 ◽  
Vol 27 (05) ◽  
pp. 607-630
Author(s):  
Eddy Caron ◽  
Ajoy K. Datta ◽  
Franck Petit ◽  
Cédric Tedeschi
Keyword(s):  
Dynamic Systems ◽  
Message Passing ◽  
Large Scale ◽  
Overlay Networks ◽  
Initial State ◽  
Prefix Tree ◽  
Distributed Structure ◽  
Distributed Structures ◽  
Self Stabilization ◽  
The Many

Computing over large platforms calls for the ability to maintain distributed structures at large scale. Among the many different structures proposed in this context, the prefix tree structure has been identified as an adequate one for indexing and retrieving information. One weakness of using such a distributed structure stands in its poor native fault tolerance, leading to the use of preventive costly mechanisms such as replication.Self-stabilization is a suitable approach to design reliable solutions for dynamic systems, and was recently enhanced with new models to be able to deal with large scale dynamic platforms. A self-stabilizing system is guaranteed to reach a correct configuration, whatever its initial state is. Following this path, it is becoming possible to make distributed structures self-stabilizing at large scale.In this paper, we focus on making tries self-stabilizing over such platforms, and propose a self-stabilizing maintenance algorithm for a prefix tree using a message passing model. The proof of self-stabilization is provided, and simulation results are given, to better capture its performances. Still based on simulations, we provide evidences that the protocol, beyond its capacity to repair the structure, can significantly improve the system’s availability, even when the system is not yet stabilized.

scholarly journals Decentralized Ranking in Large-Scale Overlay Networks

2008 ◽  
Author(s):  
Alberto Montresor ◽  
Márk Jelasity ◽  
Ozalp Babaoglu
Keyword(s):  
Large Scale ◽  
Overlay Networks
Sign in / Sign up

Export Citation Format

Share Document