Abstract
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, message delivery and so on. On message delivery over the network, it is very difficult to assume the static routing if the structure of the network can be changed frequently by node churn. In this paper, we propose a gossip-style message dissemination protocol based on biconnected components with churn-prone nodes and show the performance evaluation of other gossip protocols. Specifically, we focus on the churn rate and the distribution of links on the network in the evaluation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Middleware 2001, 329–350 (2001)
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). http://doi.acm.org/10.1145/383059.383071
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). http://doi.acm.org/10.1145/945721.945729
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). http://dx.doi.org/10.1080/17445760903548309
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). http://dl.acm.org/citation.cfm?id=1656980.1656984
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)
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)
Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Kermarrec, A.M., Massoulie, L., Ganesh, A.J.: Probabilistic reliable dissemination in large-scale systems. IEEE TPDS 3, 248–258 (2003)
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, Belgium, Belgium (2010). http://dx.doi.org/10.4108/ICST.SIMUTOOLS2010.8655
Philips, T.K., Panwar, S., Tantawi, A.N.: Connectivity properties of a packet radio network model. IEEE Trans. Inf. Theory 35(5), 1044–1047 (1989)
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)
Acknowledgement
This work was supported by JSPS KAKENHI Grant Number JP16K00449.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Hirooka, T., Yamamasu, D., Hayashibara, N. (2018). Gossip-Style Message Dissemination Based on Biconnected Components. In: Barolli, L., Enokido, T., Takizawa, M. (eds) Advances in Network-Based Information Systems. NBiS 2017. Lecture Notes on Data Engineering and Communications Technologies, vol 7. Springer, Cham. https://doi.org/10.1007/978-3-319-65521-5_63
Download citation
DOI: https://doi.org/10.1007/978-3-319-65521-5_63
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-65520-8
Online ISBN: 978-3-319-65521-5
eBook Packages: EngineeringEngineering (R0)