2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems 2008
DOI: 10.1109/saso.2008.44
|View full text |Cite
|
Sign up to set email alerts
|

PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
49
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 36 publications
(49 citation statements)
references
References 25 publications
(31 reference statements)
0
49
0
Order By: Relevance
“…Any structured graph proposed in the literature can be chosen. In this work we use PeerCube [16] essentially because each vertex of the hypercube gather from Smin to Smax nodes, which makes this cluster-based DHT highly robust to churn. Thus, in FixMe overlay as shown in Fig.…”
Section: Self-organizing Nodes In Dense Seedsmentioning
confidence: 99%
See 3 more Smart Citations
“…Any structured graph proposed in the literature can be chosen. In this work we use PeerCube [16] essentially because each vertex of the hypercube gather from Smin to Smax nodes, which makes this cluster-based DHT highly robust to churn. Thus, in FixMe overlay as shown in Fig.…”
Section: Self-organizing Nodes In Dense Seedsmentioning
confidence: 99%
“…3, all the seeds are organized as follows. The first Smin nodes that are in a seed form the root of the hypercube, and upon new nodes arrivals, the dimension of the hypercube increases [16]. From the point of view of the neighboring seeds of any other seed s, only the root of the hypercube is visible.…”
Section: Self-organizing Nodes In Dense Seedsmentioning
confidence: 99%
See 2 more Smart Citations
“…Our solution relies on the clusterized version of peer-topeer overlays combined with a mechanism that allows the enforcement of limited nodes lifetime. Clusterized versions of structured-based overlays [1,3] are such that clusters of nodes substitute nodes at the vertices of the graph. Nodes are grouped together according to some distance function.…”
mentioning
confidence: 99%