An Introduction to Models of Online Peer-to-Peer Social Networking

This book concerns peer-to-peer applications and mechanisms operating on the Internet, particularly those that are not fully automated and involve significant human interaction. So, the realm of interest is the intersection of distributed systems and online social networking. Generally, simple models are described to clarify the ideas. Beginning with short overviews of caching, graph theory and game theory, we cover the basic ideas of structured and unstructured search. We then describe a simple framework for reputations and for iterated referrals and consensus. This framework is applied to a problem of sybil identity management. The fundamental result for iterated Byzantine consensus for a relatively important issue is also given. Finally, a straight-forward epidemic model is used to describe the propagation of malware on-line and for BitTorrent-style file-sharing. This short book can be used as a preliminary orientation to this subject matter. References are given for the interested student to papers with good survey and tutorial content and to those with more advanced treatments of specific topics. For an instructor, this book is suitable for a one-semester seminar course. Alternatively, it could be the framework for a semester's worth of lectures where the instructor would supplement each chapter with additional lectures on related or more advanced subject matter. A basic background is required in the areas of computer networking, probability theory, stochastic processes, and queueing. Table of Contents: Networking overview / Graphs / Games / Search in structured networks / Search in unstructured networks / Transactions, reputations, and referrals / False Referrals / Peer-to-peer file sharing / Consensus in dynamical belief systems / Byzantine consensus / Epidemics

[1]  Cem U. Saraydar,et al.  Power control in a multicell CDMA data system using pricing , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[2]  Abhishek Kumar,et al.  Efficient and scalable query routing for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Lea Kutvonen,et al.  Reputation Management Survey , 2007, The Second International Conference on Availability, Reliability and Security (ARES'07).

[4]  Richard M. Karp,et al.  Probabilistic recurrence relations , 1994, JACM.

[5]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[6]  Ishai Menache,et al.  Rate-Based Equilibria in Collision Channels with Fading , 2008, IEEE Journal on Selected Areas in Communications.

[7]  James Aspnes,et al.  Randomized protocols for asynchronous consensus , 2002, Distributed Computing.

[8]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Eli Upfal,et al.  The Complexity of Parallel Search , 1988, J. Comput. Syst. Sci..

[10]  Matteo Dell Amico.  A Measurement of Mixing Time in Social Networks , 2009 .

[11]  Ming Zhong,et al.  Popularity-Biased Random Walks for Peer-to-Peer Search under the Square-Root Principle , 2006, IPTPS.

[12]  Jesús Seade.  THE STABILITY OF COURNOT REVISITED , 1980 .

[13]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[14]  Thorsten Holz,et al.  As the net churns: Fast-flux botnet observations , 2008, 2008 3rd International Conference on Malicious and Unwanted Software (MALWARE).

[15]  Serge A. Plotkin,et al.  A non-manipulable trust system based on EigenTrust , 2005, SECO.

[16]  Feng Xiao,et al.  SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).

[17]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[18]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[19]  James Aspnes,et al.  Fault-tolerant routing in peer-to-peer systems , 2002, PODC '02.

[20]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[21]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[22]  Zhuoqing Morley Mao,et al.  Toward understanding distributed blackhole placement , 2004, WORM '04.

[23]  Chita R. Das,et al.  A dynamic quarantine scheme for controlling unresponsive TCP sessions , 2008, Telecommun. Syst..

[24]  Christos Faloutsos,et al.  Epidemic spreading in real networks: an eigenvalue viewpoint , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[25]  Claudio Mezzetti,et al.  Learning in Games by Random Sampling , 2001, J. Econ. Theory.

[26]  David R. Karger,et al.  Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2006, Theory of Computing Systems.

[27]  Miguel Castro,et al.  Security for Structured Peer-to-peer Overlay Networks , 2004 .

[28]  Donald F. Towsley,et al.  Code red worm propagation modeling and analysis , 2002, CCS '02.

[29]  Dahlia Malkhi,et al.  A unifying framework of rating users and data items in peer-to-peer and social networks , 2008, Peer-to-Peer Netw. Appl..

[30]  Ramesh Govindan,et al.  Using the small-world model to improve Freenet performance , 2004, Comput. Networks.

[31]  Paolo Avesani,et al.  Trust-aware recommender systems , 2007, RecSys '07.

[32]  Licia Capra,et al.  SOFIA: Social Filtering for Robust Recommendations , 2008, IFIPTM.

[33]  Eitan Altman,et al.  From Altruism to Non-Cooperation in Routing Games , 2008, ArXiv.

[34]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[35]  Ness B. Shroff,et al.  A utility-based power-control scheme in wireless cellular systems , 2003, TNET.

[36]  David M. Nicol,et al.  Simulating realistic network worm traffic for worm warning system design and testing , 2003, WORM '03.

[37]  George Kesidis,et al.  Preliminary results using scale-down to explore worm dynamics , 2004, WORM '04.

[38]  Vern Paxson,et al.  How to Own the Internet in Your Spare Time , 2002, USENIX Security Symposium.

[39]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  Yoram Moses,et al.  Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds , 1998, SIAM J. Comput..

[41]  S. Bornholdt,et al.  World Wide Web scaling exponent from Simon's 1955 model. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[42]  Donald F. Towsley,et al.  The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[43]  Robert Metcalfe,et al.  Reverse path forwarding of broadcast packets , 1978, CACM.

[44]  Donald F. Towsley,et al.  Modeling and Simulation Study of the Propagation and Defense of Internet E-mail Worms , 2007, IEEE Transactions on Dependable and Secure Computing.

[45]  Earl T. Barr,et al.  TrustDavis: a non-exploitable online reputation system , 2005, Seventh IEEE International Conference on E-Commerce Technology (CEC'05).

[46]  Eitan Altman,et al.  Application neutrality and a paradox of side payments , 2010, ReARCH '10.

[47]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[48]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[49]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[50]  George Kesidis,et al.  Equilibria of a noncooperative game for heterogeneous users of an ALOHA network , 2002, IEEE Communications Letters.

[51]  George Kesidis,et al.  A model of the spread of randomly scanning Internet worms that saturate access links , 2008, TOMC.

[52]  Anne-Marie Kermarrec,et al.  Epidemic information dissemination in distributed systems , 2004, Computer.

[53]  Michael Kaminsky,et al.  SybilGuard: defending against sybil attacks via social networks , 2006, SIGCOMM.

[54]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[55]  Alice Cheng,et al.  Sybilproof reputation mechanisms , 2005, P2PECON '05.

[56]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[57]  Alan J. Barrett,et al.  An asparaginyl endopeptidase processes a microbial antigen for class II MHC presentation , 1998, Nature.

[58]  Ion Stoica,et al.  Robust incentive techniques for peer-to-peer networks , 2004, EC '04.

[59]  Tansu Alpcan,et al.  A power control game based on outage probabilities for multicell wireless data networks , 2004 .

[60]  Chris Lesniewski-Laas,et al.  A Sybil-proof one-hop DHT , 2008, SocialNets '08.

[61]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[62]  D. Earn,et al.  Vaccination and the theory of games. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[63]  Keith W. Ross,et al.  Hash routing for collections of shared Web caches , 1997, IEEE Netw..

[64]  Eitan Altman,et al.  A survey on networking games in telecommunications , 2006, Comput. Oper. Res..

[65]  Danny Dolev,et al.  Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement , 1992, Inf. Comput..

[66]  Rayadurgam Srikant,et al.  Modeling and performance analysis of BitTorrent-like peer-to-peer networks , 2004, SIGCOMM 2004.

[67]  A. Zhang,et al.  Stability of Nash Equilibrium: The Multiproduct Case , 1996 .

[68]  Donald F. Towsley,et al.  Worm propagation modeling and analysis under dynamic quarantine defense , 2003, WORM '03.

[69]  Cem U. Saraydar,et al.  Pareto efficiency of pricing-based power control in wireless data networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[70]  D. Stroock,et al.  Simulated annealing via Sobolev inequalities , 1988 .

[71]  Edith Cohen,et al.  Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.

[72]  Kevin A. Kwiat,et al.  Modeling the spread of active worms , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[73]  Jordi Domingo-Pascual,et al.  On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains , 2006, IEEE Communications Magazine.

[74]  Eitan Altman,et al.  CDMA Uplink Power Control as a Noncooperative Game , 2002, Wirel. Networks.

[75]  Michael Mitzenmacher,et al.  A Brief History of Generative Models for Power Law and Lognormal Distributions , 2004, Internet Math..

[76]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[77]  Brian Neil Levine,et al.  Detecting the Sybil Attack in Mobile Ad hoc Networks , 2006, 2006 Securecomm and Workshops.

[78]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[79]  Stefan Savage,et al.  Inside the Slammer Worm , 2003, IEEE Secur. Priv..

[80]  H. Vincent Poor,et al.  A game-theoretic approach to energy-efficient power control in multicarrier CDMA systems , 2006, IEEE Journal on Selected Areas in Communications.

[81]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[82]  A. Zhang,et al.  Stability of a Cournot-Nash equilibrium: The multiproduct case , 1996 .

[83]  George Kesidis,et al.  A Stochastic Epidemiological Model and a Deterministic Limit for BitTorrent-Like Peer-to-Peer File-Sharing Networks , 2008, NET-COOP.

[84]  Nicholas Hopper,et al.  Scalable onion routing with torsk , 2009, CCS.

[85]  Ali al-Nowaihi,et al.  The stability of the cournot oligopoly model: A reassessment , 1985 .

[86]  Albert-László Barabási,et al.  Understanding the Spreading Patterns of Mobile Phone Viruses , 2009, Science.

[87]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[88]  Ayalvadi J. Ganesh,et al.  On the effectiveness of automatic patching , 2005, WORM '05.

[89]  Panayotis Antoniadis,et al.  Comparing economic incentives in peer-to-peer networks , 2004, Comput. Networks.

[90]  Jiangchuan Liu,et al.  Proxy caching for media streaming over the Internet , 2004, IEEE Communications Magazine.

[91]  Jussi Kangasharju,et al.  Explaining BubbleStorm: Resilient, Probabilistic, and Exhaustive PeertoPeer Search , 2007, SIGCOMM 2007.

[92]  George Danezis,et al.  SybilInfer: Detecting Sybil Nodes using Social Networks , 2009, NDSS.