Abstract
While the setting of this question may appear implausible, this is precisely the environment in which services that span multiple administrative domains (MAD) must function. In such services—which include applications such as content dissemination (e.g.., [2]), file backup (e.g., [6]), volunteer computing (e.g., [5]),multihop wireless networking (e.g., [4]), and Internet routing—resources are not under the control of a single administrative domain, so the necessary cooperation cannot simply be achieved by fiat. Instead, it is imperative that the service be structured so that nodes—which are administered by different, potentially selfish entities—have an incentive to help sustain it. Indeed, such issues are not imaginary: ample evidence suggests that a large number of peers will free-ride or deviate from the assigned protocol if it is in their interest to do so (e.g., [3,9,16,21]).
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.
References
1 in 5 Macs has malware on it. Does yours?, http://nakedsecurity.sophos.com/2012/04/24/mac-malware-study
BitTorrent, http://bittorrent.com
Kazaa Lite, http://en.wikipedia.org/wiki/Kazaa_Lite
OpenGarden, http://opengarden.com
SETI@home, http://setiathome.ssl.berkeley.edu
SpaceMonkey, http://spacemonkey.com
Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of the 25th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (July 2006)
Abraham, I., Dolev, D., Halpern, J.Y.: Lower bounds on implementing robust and resilient mediators. In: Proceedings of the 5th IACR Theory of Cryptography Conference (March 2008)
Adar, E., Huberman, B.A.: Free riding on Gnutella. First Monday 5(10), 2–13 (2000), http://www.firstmonday.org/issues/issue5_10/adar/index.html
Aiyer, A.S., Alvisi, L., Clement, A., Dahlin, M., Martin, J.P., Porth, C.: BAR fault tolerance for cooperative services. In: Proceedings of the 20th ACM Symposium on Operating Systems Principles (October 2005)
Alyias, D., Batchelder, D., Blackbird, J., Faulhaber, J., Felstead, D., Henry, P., Jones, J., Kuo, J., Lauricella, M., Li, L., Ng, N., Rains, T., Sekhar, V., Stewart, H., Thomlinson, M., Zink, T.: Microsoft Security Intelligence Report, July through December, vol. 14 (2012)
Aumann, R.J.: Acceptable points in general cooperative n-person games. Annals of Mathematics Study 40(4), 287–324 (1959)
Bernheim, B.D., Peleg, B., Whinston, M.D.: Coalition-proof Nash equilibria, I. Concepts. Journal of Economic Theory 42(1), 1–12 (1987)
Clement, A., Li, H.C., Napper, J., Martin, J.P., Alvisi, L., Dahlin, M.: Bar primer. In: DSN, pp. 287–296 (2008)
Eliaz, K.: Fault tolerant implementation. Review of Economic Studies 69, 589–610 (2002)
Hughes, D., Coulson, G., Walkerdine, J.: Free riding on Gnutella revisited: The bell tolls? IEEE Distributed Systems Online 6(6) (June 2005)
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3), 382–401 (1982)
Li, H.C., Clement, A., Marchetti, M., Kapritsos, M., Robison, L., Alvisi, L., Dahlin, M.: FlightPath: Obedience vs. choice in cooperative services. In: Proceedings of the 8th USENIX Symposium on Operating Systems Design and Implementation (December 2008)
Li, H.C., Clement, A., Wong, E.L., Napper, J., Roy, I., Alvisi, L., Dahlin, M.: BAR Gossip. In: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation (November 2006)
Moscibroda, T., Schmid, S., Wattenhofer, R.: When selfish meets evil: Byzantine players in a virus inoculation game. In: Proceedings of the 25th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (July 2006)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of the 9th Annual ACM/SPIE Multimedia Computing and Networking (January 2002)
Wong, E.L., Alvisi, L.: What’s a little collusion between friends? In: Proceedings of the 32nd Annual ACM Symposium on Principles of Distributed Computing (July 2013)
Wong, E.L., Leners, J.B., Alvisi, L.: It’s on me! the benefit of altruism in BAR environments. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 406–420. Springer, Heidelberg (2010)
Wong, E.L., Levy, I., Alvisi, L., Clement, A., Dahlin, M.: Regret freedom isn’t free. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 80–95. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alvisi, L., Wong, E.L. (2013). Reasoning with MAD Distributed Systems. In: D’Argenio, P.R., Melgratti, H. (eds) CONCUR 2013 – Concurrency Theory. CONCUR 2013. Lecture Notes in Computer Science, vol 8052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40184-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-40184-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40183-1
Online ISBN: 978-3-642-40184-8
eBook Packages: Computer ScienceComputer Science (R0)