Presentation on theme: "P2psip WG, IETF841 Jin Peng Qing Yu Yuan Li One Hop Lookups Algorithm Plugin for RELOAD draft-peng-p2psip-one-hop-plugin-02."— Presentation transcript:
p2psip WG, IETF841 Jin Peng Qing Yu Yuan Li One Hop Lookups Algorithm Plugin for RELOAD draft-peng-p2psip-one-hop-plugin-02
p2psip WG, IETF842 Agenda Update of the draft Why ONE-HOP-RELOAD Network Architecture Topology Disturbance Propagation Peer Data Structure
p2psip WG, IETF843 Update of the draft A specific Topology Plugin of RELOAD called ONE-HOP-RELOAD –A ramification of the basic One Hop Lookups based DHT algorithm A well-defined hierarchy network architecture –Three layered DHT to form dissemination trees –Topology disturbance event information propagation in the overlay within a specified amount of time redefine the relevant sections
Why One Hop Reload Compared with CHORD-RELOAD algorithm –The whole routing table –High routing effeciency Chord: O(log N) One Hop Lookups: O(1) –Reasonable bandwidth consumption The whole routing table maintaince bandwidth reqruiements are small enough in a 10^5 system Stringent latency requirements –Peer to peer storage system –Real time communication system December 4th, 200716ng WG, IETF704
p2psip WG, IETF845 Network Architecture Global DHT Slice A, Unit A Slice B, Unit A Slice A, Unit B Unit Leader Slice A Slice B, Unit B ： Ordinary Peer ： Unit Leader ： Slice Leader ： Peer on the Overlay Slice A Leader Unit Leader Slice B Slice B Leader ring topology A three layered DHT to form dissemination trees which are used to propagate topology disturbance event information, i.e., joins and leaves. Unit boundary
p2psip WG, IETF846 Topology Disturbance Propagation ： Ordinary Peer ： Unit Leader ： Slice Leader ： Peer on the Overlay Global DHT Slice A, Unit A Slice B, Unit A Slice A, Unit B Unit Leader Slice A Slice B, Unit B Slice A Leader Unit Leader Slice B Slice B Leader event_notification message: peer_leaving
p2psip WG, IETF847 Peer Data Structure Routing Table –the Whole Routing Table all of nodes’ routing information –Neighbor table at least three predecessors and successors information topology maintenance and node anomaly detection Peer Type and Region ID –Ordinary Peer / Unit Boundary / Unit Leader / Slice Leader Special Identification Information –Unit leader and slice leader information.