Abstract
We argue that some group communication protocols should be concerned about agreed delivery order (ADO) of exchanged messages, but not about membership control and occasional ADO violations. A LAN-oriented protocol called Distributed Precedence Graph (DPG) is outlined and investigated via simulation. Site anonymity permitted by DPG invites selfish free riding site behavior i.e., participation in the benefits of DPG (delivery of messages in agreed order) while shirking from the costly obligations (multicast of control messages). Such behavior, known from P2P and MANET systems, has been alien to agreed order multicast. We study free riding relative to the group size and message reception miss rate, and propose a simple disincentive.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amir, Y., Moser, L.E., Melliar-Smith, P.M., Agarwal, D.A., Ciarfella, P.: Fast Message Ordering and Membership Using a Logical Token-Passing Ring. In: Proceedings of the 14th ICDCS, pp. 551–560 (1993)
Birman, K.P., Schiper, A., Stephenson, P.: Lightweight Causal and Atomic Group Multicast. ACM Trans. on Comp. Systems 9, 272–314 (1991)
Buttyan, L., Hubaux, J.P.: Stimulating Cooperation in Self-organizing Mobile Ad Hoc Networks. ACM/Kluwer Mobile Networks and Applications 8, 579–592 (2003)
Diot, C., Dabbous, W., Crowcroft, J.: Multipoint Communication: A Survey of Protocols, Functions and Mechanisms. IEEE J. on Selected Areas in Comm. 15, 277–290 (1997)
Dolev, D., Kramer, S., Malki, D.: Early Delivery Totally Ordered Multicast in Asynchronous Environments. In: Proceedings of the 23rd FTCS, pp. 544–553 (1993)
Ezhilchelvan, P.D., Macedo, R.A., Shrivastava, S.K.: Newtop: A Fault-Tolerant Group Communication Protocol. In: Proceedings of the 15th ICDCS, pp. 336–356 (1995)
Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)
Golle, P., Leyton-Brown, K., Mironov, I., Lillibridge, M.: Incentives for Sharing in Peer-to-Peer Networks. In: Proceedings of the the 3rd ACM Conf. on Electronic Commerce, pp. 264–267 (2001)
Konorski, J.: Membership-Insensitive Totally Ordered Multicast: Properties and Performance. In: Pujolle, G., Perros, H.G., Fdida, S., Körner, U., Stavrakakis, I. (eds.) NETWORKING 2000. LNCS, vol. 1815, Springer, Heidelberg (2000)
Konorski, J.: Distributed Network Protocols for Anonymous Stations in Cooperative and Noncooperative Settings. Gdansk University of Technology (2006)
Melliar-Smith, P.M., Moser, L.E., Agrawala, V.: Broadcast Protocols for Distributed Systems. IEEE Trans. on Parallel and Distributed Systems 1, 17–25 (1990)
Moser, L.E., Amir, Y., Melliar-Smith, P.M., Agarwal, D.A.: Extended Virtual Synchrony. In: Proceedings of the 14th ICDCS, pp. 56–65 (1994)
Nakamura, A., Takizawa, M.: Priority-Based and Semi-Total Ordering Broadcast Protocols. In: Proceedings of the 12th ICDCS, pp. 178–185 (1992)
Peterson, L.L., Bucholz, N.C., Schlichting, R.D.: Preserving and Using Context Information in Interprocess Communication. ACM Trans. on Comp. Systems 7, 217–246 (1989)
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
Konorski, J. (2006). Anonymous Agreed Order Multicast: Performance and Free Riding. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds) Distributed Computing and Internet Technology. ICDCIT 2006. Lecture Notes in Computer Science, vol 4317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11951957_12
Download citation
DOI: https://doi.org/10.1007/11951957_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68379-7
Online ISBN: 978-3-540-68380-3
eBook Packages: Computer ScienceComputer Science (R0)