Scalable Concurrency Control in a Dynamic Membership

Ciuffoletti, Augusto; Ali, Asim

doi:10.1007/978-0-387-85966-8_15

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, there are no general algorithms for estimating the size of any given natural network. Furthermore, a sufficiently precise estimate of the network size can be useful in optimizing, for example, cache size in P2P networks based on the parameter of the network [7], [8], epidemic spreading [9], [10], or scalable concurrency control [11].…”

Section: Introductionmentioning

confidence: 99%

Estimating the Size of Natural Networks Using Local Information

Bustos-Jiménez

Barrientos

Schaeffer

2010

2010 XXIX International Conference of the Chilean Computer Science Society

View full text Add to dashboard Cite

In this work, we address the problem of locally estimating the size of a natural network using local information: fitting the sum of new neighbors discovered at step of a breadth-first search (BFS) with a logarithmic function we determined as a ln(Γ(i)) c + b. With rather little computation, we reach an estimation error of at most five percent, only allowing the BFS to visit at most ten percent of the whole network. The main contributions of this work are a new approach to estimate network size with a precision higher than 95%, an estimation algorithm that can be applied in an arbitrary natural network, and an example of the use of structural properties in optimizing network algorithms.

show abstract