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

Slides:



Advertisements
Similar presentations
C. Mastroianni, D. Talia, O. Verta - A Super-Peer Model for Resource Discovery Services in Grids A Super-Peer Model for Building Resource Discovery Services.
Advertisements

Scalable Content-Addressable Network Lintao Liu
Kademlia: A Peer-to-peer Information System Based on the XOR Metric Petar Mayamounkov David Mazières A few slides are taken from the authors’ original.
NAT Traversal for P2PSIP Philip Matthews Avaya. Peer X Peer Y Peer W 2. P2PSIP Network Establishing new Peer Protocol connection Peer Protocol messages.
Part IV: BGP Routing Instability. March 8, BGP routing updates  Route updates at prefix level  No activity in “steady state”  Routing messages.
Draft-bryan-sipping-p2p David Bryan IETF 63, Paris August 3, 2005.
Small-world Overlay P2P Network
CPSC 668Set 5: Synchronous LE in Rings1 CPSC 668 Distributed Algorithms and Systems Spring 2008 Prof. Jennifer Welch.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
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.
Mobile IP Overview: Standard IP Standard IP Evolution of Mobile IP Evolution of Mobile IP How it works How it works Problems Assoc. with it Problems Assoc.
Teknik Routing Pertemuan 20 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
Routing.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 06/04/2007.
1 Freenet  Addition goals to file location: -Provide publisher anonymity, security -Resistant to attacks – a third party shouldn’t be able to deny the.
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
ECE 544 Project 3 Content Based Routing Neelakantan Nurani Krishnan Shikha Kakkar Suja Srinivasan.
SIMULATING A MOBILE PEER-TO-PEER NETWORK Simo Sibakov Department of Communications and Networking (Comnet) Helsinki University of Technology Supervisor:
Mobile Ad-hoc Pastry (MADPastry) Niloy Ganguly. Problem of normal DHT in MANET No co-relation between overlay logical hop and physical hop – Low bandwidth,
Mobile IP Traversal Of NAT Devices By, Vivek Nemarugommula.
1 3 Web Proxies Web Protocols and Practice. 2 Topics Web Protocols and Practice WEB PROXIES  Web Proxy Definition  Three of the Most Common Intermediaries.
P2PSIP Charter Proposal Many people helped write this charter…
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
P2PSIP diagnostics Song Haibin draft-zheng-p2psip-diagnose-02
Mobile Routing protocols MANET
1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.
Ad hoc On-demand Distance Vector (AODV) Routing Protocol ECE 695 Spring 2006.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
SOS: Security Overlay Service Angelos D. Keromytis, Vishal Misra, Daniel Rubenstein- Columbia University ACM SIGCOMM 2002 CONFERENCE, PITTSBURGH PA, AUG.
A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.
HUAWEI TECHNOLOGIES CO., LTD. Page 1 Survey of P2P Streaming HUAWEI TECHNOLOGIES CO., LTD. Ning Zong, Johnson Jiang.
1 Countering DoS Through Filtering Omar Bashir Communications Enabling Technologies
A Survey of Geocast Routing Protocols 指導教授:許子衡 教授 報告學生:馬敏修 指導教授:許子衡 教授 報告學生:馬敏修.
#1 EETS 8316/NTU CC725-N/TC/ Routing - Circuit Switching  Telephone switching was hierarchical with only one route possible —Added redundant routes.
AODV: Introduction Reference: C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt,
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Network Layer4-1 Intra-AS Routing r Also known as Interior Gateway Protocols (IGP) r Most common Intra-AS routing protocols: m RIP: Routing Information.
Company Confidential 1 ICMPv6 Echo Replies for Teredo Clients draft-denis-icmpv6-generation-for-teredo-00 behave, IETF#75 Stockholm Teemu Savolainen.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
Protocol Requirements draft-bryan-p2psip-requirements-00.txt D. Bryan/SIPeerior-editor S. Baset/Columbia University M. Matuszewski/Nokia H. Sinnreich/Adobe.
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.
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
March P2PSIP Routing Discussion (“Routing: what does it look like?) Spencer Dawkins IETF 70 – December 2007 Vancouver, British.
Spring Routing: Part I Section 4.2 Outline Algorithms Scalability.
Extension to the Path Computation Element Communication Protocol for Enhanced Errors and Notifications draft-pouyllau-pce-enhanced-errors-02 H. Pouyllau.
Content Distribution Internetworking IETF BOF December 12, 2000 Phil Rzewski Gary Tomlinson.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Incrementally Improving Lookup Latency in Distributed Hash Table Systems Hui Zhang 1, Ashish Goel 2, Ramesh Govindan 1 1 University of Southern California.
RSVP-TE Extensions to Realize Dynamic Binding of Associated Bidirectional LSP CCAMP/MPLS WG, IETF 79th, Beijing, China draft-zhang-mpls-tp-rsvpte-ext-associated-lsp-01.
HIP-Based NAT Traversal in P2P-Environments
Peer to peer Internet telephony challenges, status and trend
Internet Networking recitation #4
Routing.
Greg Mirsky IETF-99 July 2017, Prague
Greg Mirsky Jeff Tantsura Mach Chen Ilya Varlashkin
Intradomain Routing Outline Introduction to Routing
NSIS Operation Over IP Tunnels draft-shen-nsis-tunnel-01.txt
Jiang XingFeng (Johnson) P2PSIP WG, IETF #68
draft-bryan-sipping-p2p
NSIS Operation Over IP Tunnels draft-ietf-nsis-tunnel-04.txt
Technical Issues with draft-ietf-mpls-bfd-directed
Routing.
Virtual LAN (VLAN).
Kademlia: A Peer-to-peer Information System Based on the XOR Metric
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:

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

Routing Modes Symmetric Recursive –Request and corresponding response follow the same path; –Adopted in the current RELOAD draft Direct Response –Send response directly back if the requesting peer allows it (e.g. it is publicly reachable) Relay Peer –With help from relay peers with unrestricted connections, the response could go through the relay peer to reach the request originator Forward Response –Response is considered as a distinct transaction from request and routed through the overlay based on the Node ID of request originator, (i.e. routing based on the underlying P2P algorithm) Iterative –where the intermediate peers merely return a response indicating the next hop, but do not actually forward the message to that next hop themselves

Why Relay Peer And Direct Response? Improve Success Rate NOT meant to REPLACE symmetric recursive –Enhancement to symmetric recursive –Could work together with symmetric recursive Main Benefit –Reduce the number of hops of response path to Number of hops = 1 - Direct Response Number of hops = 2 - Relay Peer –Improve success rate of P2PSIP transaction

Where Is Relay/Direct Response Helpful? Dynamic Scenarios Concerns about routing in P2P systems –Node’s stability –Connectivity stability between peers Where Symmetric MAY NOT Work Well –Heavy churn –Path with larger hop count The number of hops often follows a uniform distribution within [0, M]; M: lookup complexity of the specific algorithm in use Symmetric works well with smaller hop count –Stability of TURN peers has an impact on the connectivity stability between peers –Overlays with large scales, for example, over 1000 peers

How Relay Peer Works - 1 A B C D Z X Y Request Originator Intermediate Peer Destination Peer Relay Peer Pre-established connection Request Symmetric Recursive Relay Peer

How Relay Peer Works - 2 A typical message sequence –Originator discovers relay peers first –Originator carries info about relay peers in the request to be routed around the overlay –Destination peer sends the responses to the relay peers which forwards the response toward the request originator When Relay Peer is triggered –The destination peer decides whether or not Relay Peer is used –Possible criteria The request has traversed so many hops that it is highly probable that one of reverse connections broke down

Concerns – Relay Peer Relay Peer –Considered as a kind of service, just like STUN/TURN service; –Unrestricted connection – Identify Relay Peer Possible to decide whether a peer is on the public Internet in P2PSIP, for example, with the help from bootstrap peer or enrollment server who are already on public Internet; While being on the public Internet, a peer can use Direct Response to determine whether or not it is behind a firewall or address-independent firewall;

Concerns – DoS Attack Attack 1 –A large number of responses are sent to the Relay peer to overload the Relay peer Relay peer only forwards response to the peer with whom (peer) it has direct connections; Attack 2 –Malicious peers send a great number of requests and the destination peer may try using Relay Peer and symmetric recursive routing at the same time, which will amplify the number of the response to the request originator Destination peer will base response on some criteria treated as a parameter, such as total hops the request’s traversed, to decide whether relay peers are used to route the response; This mitigates the impact from the response amplification

Next Step –Adopted as a WG item (Direct Response and Relay Peer)? Or –The choice of Routing modes be a open issue and need more investigation? (including symmetric recursive)