TY - GEN
T1 - Distributed adaptive protocols for information dissemination in large-scale communication systems
AU - Shetty, Sachin
AU - Song, Min
AU - Wang, Jun
PY - 2009
Y1 - 2009
N2 - One approach for information dissemination in large-scale communication systems is using epidemic protocols. Current epidemic protocols, however, adopt a constant fanout policy, which does not enable end users to control the information dissemination process. For distributed applications that need to compute a global function within a pre-determined response time, better procedures to control the information dissemination process have to be developed. In this paper, we introduce two distributed adaptive epidemic protocols using a dynamic fanout scheme. They are named Round-Based dynamic fanout (RBdf) and Cluster-Based dynamic fanout (CBdf). In RBdf, the network topology is flat and each node transmits a message with a varied fanout every round. In CBdf, the network topology is hierarchical, and the fanout values in every cluster differ within the same round. The main objectives are to ensure that peers receive messages within a bounded latency and that the system message overhead is a bounded value. The performance of the proposed protocols are verified through both theoretical and simulation studies.
AB - One approach for information dissemination in large-scale communication systems is using epidemic protocols. Current epidemic protocols, however, adopt a constant fanout policy, which does not enable end users to control the information dissemination process. For distributed applications that need to compute a global function within a pre-determined response time, better procedures to control the information dissemination process have to be developed. In this paper, we introduce two distributed adaptive epidemic protocols using a dynamic fanout scheme. They are named Round-Based dynamic fanout (RBdf) and Cluster-Based dynamic fanout (CBdf). In RBdf, the network topology is flat and each node transmits a message with a varied fanout every round. In CBdf, the network topology is hierarchical, and the fanout values in every cluster differ within the same round. The main objectives are to ensure that peers receive messages within a bounded latency and that the system message overhead is a bounded value. The performance of the proposed protocols are verified through both theoretical and simulation studies.
UR - http://www.scopus.com/inward/record.url?scp=72849133367&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=72849133367&partnerID=8YFLogxK
U2 - 10.1109/MUE.2009.56
DO - 10.1109/MUE.2009.56
M3 - Conference contribution
AN - SCOPUS:72849133367
SN - 9780769536583
T3 - 3rd International Conference on Multimedia and Ubiquitous Engineering, MUE 2009
SP - 279
EP - 286
BT - 3rd International Conference on Multimedia and Ubiquitous Engineering, MUE 2009
T2 - 3rd International Conference on Multimedia and Ubiquitous Engineering, MUE 2009
Y2 - 4 June 2009 through 6 June 2009
ER -