DSpace About DSpace Software
 

DSpace at ICSY >
ICSY - Integrated Communication Systems Lab >
01: Publications / Publikationen >

Please use this identifier to cite or link to this item: http://dspace.icsy.de/handle/123456789/303

Title: A distributed algorithm to estimate node counts in self-organizing ring topologies
Authors: Schwerdel, Dennis
Priebe, Matthias
Müller, Paul
Keywords: Peer-to-peer
Issue Date: Jan-2011
Publisher: IEEE Consumer Communications and Networking Conference 2011
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.
URI: http://dspace.icsy.de/handle/123456789/303
Appears in Collections:01: Publications / Publikationen

Files in This Item:

File Description SizeFormat
2010_Estimation_CCNC2011.pdf211,23 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2007 MIT and Hewlett-Packard - Feedback