Abstract
Gossip-based protocol has been widely adopted by many large-scale multicast applications. In this paper, we study the impact of node cheating on decentralized gossip-based protocol. We mainly focus on two cheating strategies, one is to increase the subscription request sending times, and the other is to increase the PartialView size. We establish a cheating model of nodes for gossip-based protocol, and evaluate the system performance when node cheating happens. In the simulations, we analyze the impact of node cheating on a representative gossip-based protocol, SCAMP (Scalable Membership Protocol, a decentralized, gossip-based protocol). The results show that node cheating makes considerably negative effects on the system performance, and there exists a delicate relationship between the percentage of cheating nodes in the system and the benefit they can gain. The study results also show that cheating behaviors should be paid much more attention during the gossip-based protocol design in future.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Birman, K.P.: The process Group Approach to Reliable Distributed Computing. Communications of the ACM 36(12), 37–53 (1993)
Deering, S., Cheriton, D.: Multicast Routing in Datagram Internetworks and Extended LANs. ACM Transaction on Computer Systems 8(2), 85–110 (1990)
Mathy, L., Blundell, N., Roca, V., EI-Sayed, A.: Impact of Simple Cheating in Application-Level Multicast. In: The Proceedings of IEEE INFOCOM 2004 (March 2004)
Pendarakis, D., Shi, S., Verma, D., Waldvogel, M.: ALMI: An Application Level Multicast Infrastructure. In: Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems (USITS) (March 2001)
Banerjee, S., Bhattacharjee, B., Kommareddy, C.: Scalable Application Layer Multicast. In: Proceedings of ACM SIGCOMM (August 2002)
Zhang, B., Jamin, S., Zhang, L.: Host Multicast: A Framework for Delivering Multicast to End Users. In: Proceedings of IEEE INFOCOM 2002 (June 2002)
Birman, K.P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal Multicast. ACM Transaction on Computer Systems 17(2), 41–88 (1999)
Ganesh, A.J., Kermarrec, A.-M., Massoulié, L.: Peer-to-Peer Membership Management for Gossip-Based Protocols. IEEE Transactions on Computers 52(2) (February 2003)
Sun, Q., Sturman, D.C.: A Gossip-Based Reliable Multicast for Large-Scale High-Throughput Applications. In: Proceedings of IEEE International Conference on Dependable Systems and Networks (DSN 2000) (July 2000)
Zhang, X., Liu, J., Li, B., Yum, T.-S.P.: CoolStreaming/DONet: A Data-driven Overlay Network for Live Media Streaming. In: Proceedings of IEEE INFOCOM 2005 (March 2005)
Kermarrec, A.-M., Massoulié, L., Ganesh, A.J.: Probabilistic Reliable Dissemination in Large-Scale Systems. IEEE Transactions on Parallel and Distributed Systems 14(3) (March 2003)
Li, D., Cui, Y., Xu, K., Wu, J.P.: Impact of Receiver Cheating on the Stability of ALM Tree. In: Proceedings of GLOBECOM 2005 (November 2005)
Eugster, P., Handurukande, S., Guerraoui, R., Kermarrec, A.-M., Kouznetsov, P.: Lightweight Probabilistic Broadcast. In: Proceedings of IEEE International Conference on Dependable Systems and Networks (DSN 2001) (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, N., Shi, Y., Chang, B. (2006). Impact of Node Cheating on Gossip-Based Protocol. In: Sha, E., Han, SK., Xu, CZ., Kim, MH., Yang, L.T., Xiao, B. (eds) Embedded and Ubiquitous Computing. EUC 2006. Lecture Notes in Computer Science, vol 4096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802167_107
Download citation
DOI: https://doi.org/10.1007/11802167_107
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36679-9
Online ISBN: 978-3-540-36681-2
eBook Packages: Computer ScienceComputer Science (R0)