2010 11th IEEE/ACM International Conference on Grid Computing 2010
DOI: 10.1109/grid.2010.5698019
|View full text |Cite
|
Sign up to set email alerts
|

Adaptation strategies for self-management of tree overlay networks

Abstract: Self-management of tree overlay networks for distributed applications is the challenge this paper addresses. Eight local adaptation strategies are introduced based on which autonomous self-organized agents establish connections that build and maintain a tree topology. Quantitative and qualitative experimental evaluation illustrates and compares the effects of adaptation strategies in the resulting tree topologies according to a defined self-organization goal and four metrics: connectedness, connectivity, insta… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
4
3

Relationship

3
4

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 12 publications
(16 reference statements)
0
9
0
Order By: Relevance
“…User ranking aggregation in recommender systems (Garcin et al 2009), is based on a finite and often restricted number of options for a user to rank an element. In applications of demand-side energy management (James et al 2006;Pournaras et al 2010), aggregate information about a finite number of alternative demand options improve the stability of the Smart Power Grid.…”
Section: Discussion and Future Workmentioning
confidence: 99%
See 1 more Smart Citation
“…User ranking aggregation in recommender systems (Garcin et al 2009), is based on a finite and often restricted number of options for a user to rank an element. In applications of demand-side energy management (James et al 2006;Pournaras et al 2010), aggregate information about a finite number of alternative demand options improve the stability of the Smart Power Grid.…”
Section: Discussion and Future Workmentioning
confidence: 99%
“…Robust tree overlays are a flexible methodology to compute a wide range of aggregates but require topology self-management (Pournaras et al 2010) in decentralized environments. Communication and storage complexity can be higher than the aggregation itself.…”
Section: Comparison With Related Workmentioning
confidence: 99%
“…EPOS coordinates demand by letting agents interact over self-organized tree topologies [15]. For the same tree topology, 10 instances are generated, in each of which the agents are positioned 9 Unfairness is also minimized as shown in this paper.…”
Section: Experimental Evaluationmentioning
confidence: 99%
“…EPOS decreases computational complexity to O(l c ), where c is the number of children per agent for a c-ary tree. Fault tolerance can be provided with self-organization mechanisms such as AETOS [12] that builds and maintains reconfigurable tree topologies in dynamic distributed environments.…”
Section: Coordinated Plan Selectionsmentioning
confidence: 99%
“…Each coordination phase of EPOS runs for 10 different 3-ary tree topologies. Each topology is built by the AETOS overlay service [12]. AETOS self-organizes agents in different random positions for each tree topology to capture the effect of topological positioning.…”
Section: Experimental Evaluationmentioning
confidence: 99%