Routing in Peer-to-Peer Networks

Abstract

Chapter 3 focuses on the issues of searching. In particular, the chapter introduces several modes of searching according to different types of P2P architectures. In this chapter, we start with routing strategies employed in unstructured P2P systems, where we discuss both basic routing techniques such as breadth-first search and depth-first search and heuristic-based routing techniques such as intelligent search, routing indices based search, adaptive probabilistic search, and bloom filter based search. After that, we show a variety of routing strategies used in different structured P2P systems such as Chord, CAN, PRR Trees, Pastry, Tapestry, Viceroy, Crescendo, Skip Graph, SkipNet, P-Grid, P-Tree, and BATON. Since the routing strategies of structured P2P systems strongly depend on the topologies the systems are built on, we also discuss in details topologies employed by these structured P2P systems. Finally, we discuss routing strategies in hybrid P2P systems with examples of Edutella, Ultrapeers, and Structured Superpeers.