Adaptive Gravitational Gossip: A Gossip-Based Communication Protocol with User-Selectable Rates

Gossip-based communication protocols are attractive in cases where absolute delivery guarantees are not required due to their scalability, low overhead, and probabilistically high reliability. In earlier work, a gossip-based protocol known as gravitational gossip was created that allows the selection of quality ratings within subgroups based on workload and information update frequency. This paper presents an improved protocol that adds an adaptive component that matches the actual subgroup communication rates with desired rates coping with network variations by modifying underlying gossip weights. The protocol is designed for use in environments where many information streams are being generated and interest levels vary between nodes in the system. The gossip-based protocol is able to allow subscribers to reduce their expected workload in return for a reduced information rate. The protocol is a good fit for applications such as military information systems, sensor networks, and rescue operations. Experiments were conducted in order to compare the merits of different adaptation mechanisms. Experimental results show promise for this approach.

[1]  Alexandros G. Dimakis,et al.  Geographic Gossip: Efficient Averaging for Sensor Networks , 2007, IEEE Transactions on Signal Processing.

[2]  Kenneth P. Birman,et al.  Overcoming communication, distributed systems, and simulation challenges: a case study involving the protection and control of the electric power grid using a utility intranet based on internet technology , 2004 .

[3]  P. N. Paraskevopoulos,et al.  Modern Control Engineering , 2001 .

[4]  Michael T. Heath,et al.  Scientific Computing , 2018 .

[5]  Liang-Tien Chia,et al.  NBgossip - Neighborhood Gossip with Network Coding Based Message Aggregation , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[6]  Fernando Pedone,et al.  An adaptive algorithm for efficient message diffusion in unreliable environments , 2004, International Conference on Dependable Systems and Networks, 2004.

[7]  Deger Cenk Erdil,et al.  Grid Resource Scheduling with Gossiping Protocols , 2007, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007).

[8]  Weijia Jia,et al.  Local Retransmission-Based Gossip Protocol in Mobile Ad Hoc Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[9]  C. Morefield,et al.  Information Management to Support the Warrior , 1998 .

[10]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[11]  S. Busenberg,et al.  A general solution of the problem of mixing of subpopulations and its application to risk- and age-structured epidemic models for the spread of AIDS. , 1991, IMA journal of mathematics applied in medicine and biology.

[12]  Man-Hon Wong,et al.  Performance of Semantic-dependent Two-tier Gossip Mechanisms , 2007, 2007 IEEE Sensors Applications Symposium.

[13]  Anne-Marie Kermarrec,et al.  Adaptive gossip-based broadcast , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..

[14]  Joint Vision 2020 America ’ s Military — Preparing for Tomorrow , 2022 .

[15]  Katsuhiko Ogata,et al.  Discrete-time control systems , 1987 .

[16]  Deborah Estrin,et al.  Advances in network simulation , 2000, Computer.