DocumentCode
3124874
Title
A distributed algorithm to estimate node counts in self-organizing ring topologies
Author
Schwerdel, Dennis ; Priebe, Matthias ; Müller, Paul
Author_Institution
Univ. of Kaiserslautern, Kaiserslautern, Germany
fYear
2011
fDate
9-12 Jan. 2011
Firstpage
187
Lastpage
191
Abstract
Ring topologies are peer to peer network structures that organize the nodes in a ring. Each node knows its direct neighbors and a few other nodes but has no global view of the network. In such a network it is complicated to measure or estimate the number of participating nodes. We provide a lightweight, distributed algorithm to estimate the size of the node population. We also show how correct the estimates are with simulations.
Keywords
peer-to-peer computing; telecommunication network topology; P2P; distributed algorithm; node count estimation; node population; peer to peer network structures; self-organizing ring topologies; Convergence; Estimation; Maintenance engineering; Optimization; Oscillators; Peer to peer computing; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Communications and Networking Conference (CCNC), 2011 IEEE
Conference_Location
Las Vegas, NV
Print_ISBN
978-1-4244-8789-9
Type
conf
DOI
10.1109/CCNC.2011.5766450
Filename
5766450
Link To Document