2013
DOI: 10.1016/j.ins.2012.06.004
|View full text |Cite
|
Sign up to set email alerts
|

Fixed Interval Nodes Estimation: An accurate and low cost algorithm to estimate the number of nodes in Distributed Hash Tables

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2016
2016

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…However, it is difficult for each node to obtain the current network size, especially in a network with frequent arrivals and departures. A relatively trivial approach, proposed and adopted by Viceroy [9] and Symphony, is based on the following insight. By randomly choosing a set of s distinct nodes, we compute the sum of the zone areas managed by these nodes.…”
Section: Estimation Methodsmentioning
confidence: 99%
“…However, it is difficult for each node to obtain the current network size, especially in a network with frequent arrivals and departures. A relatively trivial approach, proposed and adopted by Viceroy [9] and Symphony, is based on the following insight. By randomly choosing a set of s distinct nodes, we compute the sum of the zone areas managed by these nodes.…”
Section: Estimation Methodsmentioning
confidence: 99%