2008 Eighth International Conference on Peer-to-Peer Computing 2008
DOI: 10.1109/p2p.2008.30
|View full text |Cite
|
Sign up to set email alerts
|

Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(16 citation statements)
references
References 28 publications
(28 reference statements)
0
15
0
Order By: Relevance
“…If changes of the weights are asynchronous and infrequent, the a ected parent-child connections may be simply dropped and the coordination level of AETOS must guarantee that the new connections are coordinated based on the up-to-date weights. If dropping connections is not a desirable approach, alternative reactive mechanisms such as the one of Frey and Murphy [2008] may be applicable. Another solution is to use the 'healer' peer selection policy of the peer sampling service in the discovery level [Jelasity et al, 2007].…”
Section: Discussion and Future Workmentioning
confidence: 99%
See 3 more Smart Citations
“…If changes of the weights are asynchronous and infrequent, the a ected parent-child connections may be simply dropped and the coordination level of AETOS must guarantee that the new connections are coordinated based on the up-to-date weights. If dropping connections is not a desirable approach, alternative reactive mechanisms such as the one of Frey and Murphy [2008] may be applicable. Another solution is to use the 'healer' peer selection policy of the peer sampling service in the discovery level [Jelasity et al, 2007].…”
Section: Discussion and Future Workmentioning
confidence: 99%
“…Disconnected overlay networks do not perform well as network resources remain unexploited in multiple disconnected clusters or components as referred in graph theory. For example, a multimedia multicasting application is disrupted [Frey and Murphy, 2008] if a tree is disconnected and, therefore, content cannot be forwarded further. Similarly, aggregation queries over a disconnected tree result in inaccurate estimations of aggregates [Li et al, 2006, Ogston andJarvis, 2010].…”
Section: Graph Properties and Applicationsmentioning
confidence: 99%
See 2 more Smart Citations
“…Typical structures used in constructing reliable overlay networks for data dissemination include forest [12], [13], [14], [15], [16], [17] and mesh [11], [18], [19] structures. In these overlay networks, each node has multiple neighbors and hence there exist multiple data paths via which information may reach their final destinations; unless all paths are unavailable simultaneously, data dissemination works without any retransmission or reconfiguration.…”
Section: Introductionmentioning
confidence: 99%