Introduction
Overview
Overlay Technology
Applications
Properties of Data
Structure of the Book
Network Technologies
Networking
Firewalls and NATs
Naming
Addressing
Routing
Multicast
Network Coordinates
Network Metrics
Properties of Networks and Data
Data on the Internet
Zipf’s Law
Scale-free Networks
Robustness
Small Worlds
Unstructured Overlays
Overview
Early Systems
Locating Data
Napster
Gnutella
Skype
BitTorrent
Cross-ISP BitTorrent
Freenet
Comparison
Foundations of Structured Overlays
Overview
Geometries
Consistent Hashing
Distributed Data Structures for Clusters
Distributed Hash Tables
Overview
APIs
Plaxton’s Algorithm
Chord
Pastry
Koorde
Tapestry
Kademlia
Content Addressable Network
Viceroy
Skip Graph
Comparison
Probabilistic Algorithms
Overview of Bloom Filters
Bloom Filters
Bloom Filters in Distributed Computing
Gossip Algorithms
Content-based Networking and Publish/Subscribe
Overview
DHT-based Data-centric Communications
Content-based Routing
Router Configurations
Siena and Routing Structures
Hermes
Formal Specification of Content-based Routing Systems
Pub/sub Mobility
Security
Overview
Attacks and Threats
Securing Data
Security Issues in P2P Networks
Anonymous Routing
Security Issues in Pub/Sub Networks
Applications
Amazon Dynamo
Overlay Video Delivery
SIP and P2PSIP
CDN Solutions
Conclusions
References
Index
Biography
Sasu Tarkoma is a professor at the Helsinki University of Technology, Department of Computer Science and Engineering. He is also a full professor in the Department of Computer Science at the University of Helsinki. He has managed and participated in national and international research projects at the University of Helsinki, Helsinki University of Technology, and Helsinki Institute for Information Technology (HIIT). He has worked in the IT industry as a consultant and chief system architect, and he is a principal member of the research staff at the Nokia Research Center. He has over 100 publications, and has also contributed to several books on mobile middleware.
… a great guide book … well written, composed as logically coherent whole …
—Bartosz Polaczvk, IEEE Communication Magazine
