Implementasi Algoritma Gosip Dalam Jaringan Peer-to-Peer
DOI:
https://doi.org/10.31358/techne.v17i01.153Keywords:
protokol, jaringan, algoritma gosipAbstract
Algoritma gosip merupakan algoritma yang mengatur proses pertukaran data antar dua buah node yang terhubung. Pada algortima gosip semua node menjalankan fungsi yang sama atau dengan kata lain tidak ada client/server. Untuk mengimplementasikan algoritma gosip terdapat dua hal yang paling utama yaitu active thread dan passive thread. Active thread mulai berjalan saat node menghubungi node tetangga untuk diajak bertukar data, sedangkan passive thread akan menunggu sampai ada ajakan dari tetangga. Setelah dua node terhubung, proses komunikasi dan pertukaran data yang terjadi berjalan baik dan lancar.
Downloads
Download data is not yet available.
References
M. Crescimbene, F. Longa, and T. Lanza, The Science of Rumors, Roma: Annals of Geophysics, h. 421-425, 2012.
B. Baker and R. Shostak, Gossip and Telephones, North Holland Publishing Company, h. 191-193, 1971.
S. Boyd, Arpita Ghosh, et al., “Analysis and optimization of randomized gossip algorithms”, IEEE Trans. on Inf. Theory, Vol. 52, No. 6, 2004.
L. Alvisi, et al., “How robust are gossip-based communication protocols?” ACM SIGOPS Operating Systems Review, h. 14-18, 2007.
Z. Guo and H. Sun, “Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading,” SODA ’15 Proceedings of the twenty-sixthannual ACM-SIAM symposium on Discrete algorithms, h. 411-430, 2015.
B. Sosinsky, Networking Bible, Indiana: Wiley Publishing Inc., 2009.
R. Bakhshi, D. Gavidia, et al., “A modeling framework for gossip-based information spread”, In Quantitative Evaluation of Systems (QEST) 2011 Eighth International Conference, h 245–254, 2011.
B. Baker and R. Shostak, Gossip and Telephones, North Holland Publishing Company, h. 191-193, 1971.
S. Boyd, Arpita Ghosh, et al., “Analysis and optimization of randomized gossip algorithms”, IEEE Trans. on Inf. Theory, Vol. 52, No. 6, 2004.
L. Alvisi, et al., “How robust are gossip-based communication protocols?” ACM SIGOPS Operating Systems Review, h. 14-18, 2007.
Z. Guo and H. Sun, “Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading,” SODA ’15 Proceedings of the twenty-sixthannual ACM-SIAM symposium on Discrete algorithms, h. 411-430, 2015.
B. Sosinsky, Networking Bible, Indiana: Wiley Publishing Inc., 2009.
R. Bakhshi, D. Gavidia, et al., “A modeling framework for gossip-based information spread”, In Quantitative Evaluation of Systems (QEST) 2011 Eighth International Conference, h 245–254, 2011.
Downloads
Published
30-04-2018
How to Cite
Tama, A. N., Nugroho, S., & Wardana, H. K. (2018). Implementasi Algoritma Gosip Dalam Jaringan Peer-to-Peer. Techné : Jurnal Ilmiah Elektroteknika, 17(01), 7–11. https://doi.org/10.31358/techne.v17i01.153
Issue
Section
Articles
