P2psip WG, IETF841 Jin Peng Qing Yu Yuan Li One Hop Lookups Algorithm Plugin for RELOAD draft-peng-p2psip-one-hop-plugin-02.

Slides:

Advertisements

Similar presentations

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.

Advertisements

One Hop Lookups for Peer-to-Peer Overlays Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues Laboratory for Computer Science, MIT.

Peer to Peer and Distributed Hash Tables

The Chord P2P Network Some slides have been borowed from the original presentation by the authors.

Chord: A scalable peer-to- peer lookup service for Internet applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashock, Hari Balakrishnan.

FIspace Review meeting M12 CSB. Cloud Service Bus Bus Coordinator Bus Node Service A Service SDI VM External Services and Data Scalable communication,

Xiaowei Yang CompSci 356: Computer Network Architectures Lecture 22: Overlay Networks Xiaowei Yang

Common approach 1. Define space: assign random ID (160-bit) to each node and key 2. Define a metric topology in this space,  that is, the space of keys.

Small-world Overlay P2P Network

Peer to Peer File Sharing Huseyin Ozgur TAN. What is Peer-to-Peer?  Every node is designed to(but may not by user choice) provide some service that helps.

Topics in Reliable Distributed Systems Lecture 2, Fall Dr. Idit Keidar.

Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.

Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.

P2P Course, Structured systems 1 Introduction (26/10/05)

An SNMP Usage for RELOAD draft-peng-p2psip-snmp-00 IETF #79 Yonglin PENG Yu MENG Wei WANG

SIMULATING A MOBILE PEER-TO-PEER NETWORK Simo Sibakov Department of Communications and Networking (Comnet) Helsinki University of Technology Supervisor:

Effizientes Routing in P2P Netzwerken Chord: A Scalable Peer-to- peer Lookup Protocol for Internet Applications Dennis Schade.

Network Layer (3). Node lookup in p2p networks Section in the textbook. In a p2p network, each node may provide some kind of service for other.

CROSS-ROAD: CROSS-layer Ring Overlay for AD Hoc Networks Franca Delmastro IIT-CNR Pisa Cambridge, March 23 rd 2004.

P2PSIP diagnostics Song Haibin draft-zheng-p2psip-diagnose-02

Chord & CFS Presenter: Gang ZhouNov. 11th, University of Virginia.

Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.

Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved Chapter 2 ARCHITECTURES.

March 12, 2008© Copyright 2008 John Buford SAM Overlay Protocol draft-buford-irtf-sam-overlay-protocol-01.txt John Buford, Avaya Labs Research IETF 71.

TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.

Peer-to-Peer Name Service (P2PNS) Ingmar Baumgart Institute of Telematics, Universität Karlsruhe IETF 70, Vancouver.

CIS 725 Network Layer. This layer provides communication between any two nodes Uniform addressing scheme independent of the network technology Network.

Node Lookup in P2P Networks. Node lookup in p2p networks In a p2p network, each node may provide some kind of service for other nodes and also will ask.

An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.

Paper Survey of DHT Distributed Hash Table. Usages Directory service  Very little amount of information, such as URI, metadata, … Storage  Data, such.

15 November 2005LCN Collision Detection and Resolution in Hierarchical Peer-to-Peer Systems Verdi March 1, Yong Meng Teo 1,2, Hock Beng Lim 2, Peter.

Chord Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, Robert E. Gruber Google,

Chord Advanced issues. Analysis Search takes O(log(N)) time –Proof 1 (intuition): At each step, distance between query and peer hosting the object reduces.

Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.

Protocol Requirements draft-bryan-p2psip-requirements-00.txt D. Bryan/SIPeerior-editor S. Baset/Columbia University M. Matuszewski/Nokia H. Sinnreich/Adobe.

Application Layer Multicast Extensions to RELOAD draft-kolberg-sam-baseline-protocol-00 ALM Usage for RELOAD John Buford, Mario Kolberg 3/29/2011.

P2PSIP Security Analysis and evaluation draft-song-p2psip-security-eval-00 Song Yongchao Ben Y. Zhao

Requirements for Peer protocol draft-jiang-p2psip-peer-protocol-requirement-00.txt Jiang XingFeng (Johnson) P2PSIP WG, IETF #68.

Application Layer Multicast Extensions to RELOAD draft-kolberg-sam-baseline-protocol-01 Mario Kolberg, University of Stirling, UK (Editor) John Buford,

Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks

Peter R Pietzuch and Jean Bacon Peer-to-Peer Overlay Networks in an Event-Based Middleware DEBS’03, San Diego, CA, USA,

Click to edit Master title style Multi-Destination Routing and the Design of Peer-to-Peer Overlays Authors John Buford Panasonic Princeton Lab, USA. Alan.

LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.

Middleware issues: From P2P systems to Ad Hoc Networks

November 2005IETF 641 Interconnect SIP networks using P2P SIP Marc Bailly

Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.

SIP-Based or DHT-Based? November 12, 2005 Eunsoo Shim Panasonic Digital Networking Laboratory P2P SIP Ad-hoc Meeting IETF64, Vancouver.

March P2PSIP Routing Discussion (“Routing: what does it look like?) Spencer Dawkins IETF 70 – December 2007 Vancouver, British.

Discussion On Routing Modes IETF72 P2PSIP WG draft-jiang-p2psip-sep-01 Jiang XingFeng Carlos Macian Victor Pascual.

Data Structure of Chord  For each peer -successor link on the ring -predecessor link on the ring -for all i ∈ {0,..,m-1} Finger[i] := the peer following.

The Cost of Inconsistency in Chord Shelley Zhuang, Ion Stoica, Randy Katz OASIS/i3 Retreat, January 2005.

Vehicular Communications Paradigms ORT Braude College of Engineering Software Engineering Department April 2012 Students: Evgeny Yudashkin & Tal Bahalool.

The Chord P2P Network Some slides taken from the original presentation by the authors.

Peer-to-Peer Information Systems Week 12: Naming

The Chord P2P Network Some slides have been borrowed from the original presentation by the authors.

Distributed Hash Tables

Peer-to-Peer Data Management

COS 461: Computer Networks

CSC 336 Data Communications and Networking

Plethora: Infrastructure and System Design

DHT Routing Geometries and Chord

Prof. Leonardo Mostarda University of Camerino

Koorde: A simple degree optimal DHT

P2PSIP WG IETF 84 P2PSIP WG Agenda & Status Tuesday, July 31st, 2012

Jiang XingFeng (Johnson) P2PSIP WG, IETF #68

COS 461: Computer Networks

MIT LCS Proceedings of the 2001 ACM SIGCOMM Conference

P2P: Distributed Hash Tables

Peer-to-Peer Information Systems Week 12: Naming

An Extension to RELOAD to Support Direct Response and Relay Peer draft-jiang-p2psip-relay-05.txt IETF80 Prague Roni Even Ning Zong.

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, ng 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.

p2psip WG, IETF848 Q&A