Skip to main content

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

  • Book
  • © 2011

Overview

  • 392 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 37.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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

Table of contents (11 chapters)

  1. Background

  2. Peer–to–Peer Search

  3. Reputations and Referrals

  4. Consensus

Authors and Affiliations

  • Pennsylvania State University, USA

    George Kesidis

About the author

George Kesidis received his B.A.Sc. in Electrical Engineering from the University of Waterloo in 1988, and his M.S. and Ph.D. in EECS from U.C. Berkeley in 1990 and 1992, respectively. He was a professor in the E&CE Dept. of the University of Waterloo, Canada, from 1992 to 2000. Since April 2000, he has been a professor in both the CSE and EE departments of the Pennsylvania State University. He has served as TPC co-chair of IEEE INFOCOM and is currently an IEEE Senior Member. His research on networking, including this, his third short book, has been generously supported by the National Science Foundation and Cisco Systems.

Bibliographic Information

Publish with us