This segment will be about Geometries, Routing Algorithms, Bootstrapping of Structured overlay. Structured P2P overlay A network overlay that connects nodes using a particular data structure or protocol to ensure that node lookup or data discovery is determinsitic. Distributed Hash Table(DHT)x A DHT that stores (key, value) pairs and is used for data lookups using a key. Key Based Routing The principle by which a message is routed to the owner of a key k from node n following the principle that either the node n owns the key or points to a node that is closed to a node that owns k terms of some key space defined by the DHT. Routing Table Data Structure, usually a table, at nodes that maintain links to other nodes in the structure. Churn Rate of node joins and leaves in a peer-to-peer network. Basic Features of Structured P2P Networks One way to understand the structured P2P overlays/networks and to compare various aspects include the geometries or data structures used i...