Gossip Message Dissemination Protocols in the Presence of Link Instability

  • Takumu Hirooka
  • Naohiro HayashibaraEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 926)


In peer-to-peer networks, each node directly connects to other nodes without access points. This type of network system is useful for information sharing by using mobile devices (e.g., smartphones). Although it is easy to construct an ad-hoc network, there are several problems, for instance, the management of the network under node churn. On message delivery over the network, it might be difficult to assume the static routing if the structure of the network can be changed frequently by node churn and link failures. In this paper, we evaluate the message reachability by gossip protocols on random geometric graphs under link instability. Specifically, we focus on the distribution of link failures on the network. The result shows that the link instability caused by nodes’ churn has a significant impact on the message reachability compared to a uniform link instability.


  1. 1.
    Aberer, K., Cudré-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-Grid: a self-organizing structured P2P system. SIGMOD Rec. 32(3), 29–33 (2003). Scholar
  2. 2.
    Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. In: Frey, H., Li, X., Ruehrup, S. (eds.) Ad-hoc, Mobile, and Wireless Networks, pp. 346–359. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  3. 3.
    Castro, M., Costa, M., Rowstron, A.: Performance and dependability of structured peer-to-peer overlays. In: Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), pp. 9–18 (2004)Google Scholar
  4. 4.
    Das, A., Gupta, I., Motivala, A.: SWIM: scalable weakly-consistent infection-style process group membership protocol. In: Proceedings International Conference on Dependable Systems and Networks, pp. 303–312 (2002).
  5. 5.
    Ferretti, S., D’Angelo, G.: Multiplayer online games over scale-free networks: a viable solution? In: Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques, SIMUTools 2010, pp. 5:1–5:8. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), ICST, Brussels (2010).
  6. 6.
    Frey, D., Guerraoui, R., Kermarrec, A.M., Koldehofe, B., Mogensen, M., Monod, M., Quéma, V.: Heterogeneous gossip. In: Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware, Middleware 2009, pp. 3:1–3:20. Springer, New York (2009).
  7. 7.
    Hu, R., Sopena, J., Arantes, L., Sens, P., Demeure, I.: A fair comparison of gossip algorithms over large-scale random topologies. In: 2012 IEEE 31st Symposium on Reliable Distributed Systems (SRDS) (2012)Google Scholar
  8. 8.
    Kermarrec, A.M., Massoulie, L., Ganesh, A.J.: Probabilistic reliable dissemination in large-scale systems. IEEE TPDS 3, 248–258 (2003)Google Scholar
  9. 9.
    Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)CrossRefGoogle Scholar
  10. 10.
    Philips, T.K., Panwar, S., Tantawi, A.N.: Connectivity properties of a packet radio network model. IEEE Trans. Inf. Theory, 35(5) (1989)Google Scholar
  11. 11.
    Raman, V., Gupta, I.: Performance tradeoffs among percolation-based broadcast protocols in wireless sensor networks. Int. J. Parallel Emerg. Distrib. Syst. 25(6), 509–530 (2010). Scholar
  12. 12.
    van Renesse, R., Minsky, Y., Hayden, M.: A gossip-style failure detection service. In: Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing, Middleware 1998, pp. 55–70. Springer, London (1998).
  13. 13.
    Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Middleware 2001, pp. 329–350 (2001)Google Scholar
  14. 14.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2001, pp. 149–160. ACM, New York (2001).
  15. 15.
    Yamamasu, D., Hayashibara, N.: On message reachability of gossip algorithms in degree-biased peer-to-peer networks. In: 2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS), pp. 817–822 (2014).

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Kyoto Sangyo UniversityKyotoJapan

Personalised recommendations