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

Slides:



Advertisements
Similar presentations
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Advertisements

P2P data retrieval DHT (Distributed Hash Tables) Partially based on Hellerstein’s presentation at VLDB2004.
Peer to Peer and Distributed Hash Tables
David A. Bryan P2PSIP AdHoc Meeting IETF 64 (Vancouver)
FIspace Review meeting M12 CSB. Cloud Service Bus Bus Coordinator Bus Node Service A Service SDI VM External Services and Data Scalable communication,
NAT Traversal for P2PSIP Philip Matthews Avaya. Peer X Peer Y Peer W 2. P2PSIP Network Establishing new Peer Protocol connection Peer Protocol messages.
P2psip WG, IETF841 Jin Peng Qing Yu Yuan Li One Hop Lookups Algorithm Plugin for RELOAD draft-peng-p2psip-one-hop-plugin-02.
UNIT-IV Computer Network Network Layer. Network Layer Prepared by - ROHIT KOSHTA In the seven-layer OSI model of computer networking, the network layer.
Key Negotiation Protocol & Trust Router draft-howlett-radsec-knp ABFAB, IETF March, Prague.
Concepts and Terminology for Peer to Peer SIP IETF-82 David Bryan, Philip Matthews, Eunsoo Shim, Dean Willis, Spencer Dawkins draft-ietf-p2psip-concepts-04.
Topics in Reliable Distributed Systems Lecture 2, Fall Dr. Idit Keidar.
CCNA 1 v3.1 Module 8 Review.
ICE Jonathan Rosenberg dynamicsoft. Issue 1: Port Restricted Flow This case does not work well with ICE right now Race condition –Works if message 13.
P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.
Transition Mechanisms for Ipv6 Hosts and Routers RFC2893 By Michael Pfeiffer.
Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.
When Networking meets Wireless When Networking meets Wireless.
(part 3).  Switches, also known as switching hubs, have become an increasingly important part of our networking today, because when working with hubs,
SIMULATING A MOBILE PEER-TO-PEER NETWORK Simo Sibakov Department of Communications and Networking (Comnet) Helsinki University of Technology Supervisor:
Introduction to networking (Yarnfield) Introduction to routing.
Lecture Week 8 The Routing Table: A Closer Look
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.
David A. Bryan, PPSP Workshop, Beijing, China, June 17th and 18th 2010 Tracker Protocol Proposal.
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.
P2PSIP Charter Proposal Many people helped write this charter…
P2P Networking for Consumer Electronics (CE) Devices November 12, 2005 Eunsoo Shim Greg Perkins Panasonic Digital Networking Laboratory P2P SIP Ad-hoc.
March 7, 2005MOBIKE WG, IETF 621 Mobility Protocol Options for IKEv2 (MOPO-IKE) Pasi Eronen.
Lecture 8 Page 1 Advanced Network Security Review of Networking Basics: Internet Architecture, Routing, and Naming Advanced Network Security Peter Reiher.
AD HOC WIRELESS MUTICAST ROUTING. Multicasting in wired networks In wired networks changes in network topology is rare In wired networks changes in network.
P2PSIP diagnostics Song Haibin draft-zheng-p2psip-diagnose-02
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.
1/28/2010 Network Plus Network Device Review. Physical Layer Devices Repeater –Repeats all signals or bits from one port to the other –Can be used extend.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
CSC 600 Internetworking with TCP/IP Unit 8: IP Multicasting (Ch. 17) Dr. Cheer-Sun Yang Spring 2001.
BitTorrent enabled Ad Hoc Group 1  Garvit Singh( )  Nitin Sharma( )  Aashna Goyal( )  Radhika Medury( )
Autonomic Prefix Management in Large-scale Networks ANIMA WG IETF 91, November 2014 draft-jiang-anima-prefix-management Sheng Jiang Brian Carpenter Qiong.
Peer-to-Peer Name Service (P2PNS) Ingmar Baumgart Institute of Telematics, Universität Karlsruhe IETF 70, Vancouver.
Peering Considerations for Directory Assistance and Operator Services - John Haluska Telcordia SPEERMINT, IETF 68 Prague, Czech Republic 20 March 2007.
Multiple Interfaces (MIF) WG IETF 79, Beijing, China Margaret Wasserman Hui Deng
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 11: Network Address Translation for IPv4 Routing And Switching.
1 Requirements for Internet Routers (Gateways) and Hosts Relates to Lab 3. (Supplement) Covers the compliance requirements of Internet routers and hosts.
SIPeerior Technologies A superior way to connect Emerging IETF Standards Work on P2PSIP David A. Bryan.
Protocol Requirements draft-bryan-p2psip-requirements-00.txt D. Bryan/SIPeerior-editor S. Baset/Columbia University M. Matuszewski/Nokia H. Sinnreich/Adobe.
Requirements for Peer protocol draft-jiang-p2psip-peer-protocol-requirement-00.txt Jiang XingFeng (Johnson) P2PSIP WG, IETF #68.
The NAT Traversal Problem in P2PSIP Bruce Lowekamp (SIPeerior) Philip Matthews (Avaya)
UNIT 2 LESSON 8 CS PRINCIPLES. UNIT 2 LESSON 8 OBJECTIVES Students will be able to: Describe how routers develop routing tables to determine how to send.
Moving towards an IRS WG Charter Ross Callon IETF 85, Atlanta.
Networking Components Assignment 3 Corbin Watkins.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
RELOAD draft-bryan-p2psip-reload-01 draft-lowekamp-p2psip-reload-security-01 Bruce Lowekamp David Bryan Jim Deverick Marcia Zangrilli.
Discussion On Routing Modes IETF72 P2PSIP WG draft-jiang-p2psip-sep-01 Jiang XingFeng Carlos Macian Victor Pascual.
March HIP Checksum Coverage draft-dawkins-hip-checksum-coverage-00 XingFeng Jiang, Philip Matthews, Spencer Dawkins IETF 70 – December 2007 Vancouver,
1 P2PSIP Peer Protocol Design Questions Presenter: Philip Matthews (based on input from the authors of the various proposals)
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.
Peer-to-Peer Protocol (P2PP) Salman Baset, Henning Schulzrinne Columbia University.
CCNA1 v3 Module 8 v3 CCNA 1 Module 8 JEOPARDY S Dow.
Chapter 29 Peer-to-Peer Paradigm Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Innovations in P2P Communications David A. Bryan College of William and Mary April 11, 2006 Advisor: Bruce B. Lowekamp.
HIP-Based NAT Traversal in P2P-Environments
Instructor & Todd Lammle
Chapter 3: Packet Switching (overview)
Chapter 2 Network Models
Exams hints The exam will cover the same topics covered in homework. If there was no homework problem on the topic, then there will not be any exam question.
Review session For DS final exam.
Multiprocessor Cache Coherency
LOCSER + HIP draft-hautakorpi-p2psip-peer-protocol-00
Jiang XingFeng (Johnson) P2PSIP WG, IETF #68
draft-bryan-sipping-p2p
Figure Areas in an autonomous system
Chapter 11: Network Address Translation for IPv4
Presentation transcript:

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

March Goal (from the agenda) How many routing techniques do we need, and can we pick a set? Discuss/compare different routing techniques (iterative, recursive, semi-recursive, as well as symmetric vs. asymmetric). Can we decide on a set for the protocol to implement?

March Routing mode high-level overview Assume at least enough paths to form an overlay –Predecessor, successors, finger table Peers can set up more paths as optimizations What do you do with the extra paths? –Iterative – peer gets not-for-self request and redirects –Recursive – peer gets not-for-self request and forwards –Semi-recursive – recursive request, return responses directly –Strict Forwarding – responses continue around overlay Related topic about responses –Same path as request (symmetric or asymmetric)? What modes make sense? Does more than one mode make sense?

March Since IETF 69 CONCEPTS didn’t discuss routing specifics –Left decisions about paths to DHT specifics (Chord …) RELOAD-01 described four routing mechanisms –Iterative, recursive, semi-recursive, strict forwarding RELOAD-02 is down to two –Dropped “semi-recursive” and “strict forwarding” Recent focus on recursive/symmetrical routing –Mostly due to NAT traversal concerns

March High-Order Bits (Spencer’s opinion) We have four categories of request routing –Lots of list traffic discussing recursive/semi-recursive NAT traversal is driving the discussion –Iterative, Semi-recursive, Asymmetric all penalized –“… but you might not be able to open a connection” Much less discussion of other aspects –Performance, latency, fairness, robustness, debugging –If you care about these topics, start talking!

March Last week was an interesting week… Dean Willis - P2PSIP intermixing two topics –SIP “finding” – figuring out where to send a request –SIP “routing” – forwarding a request that’s not for you Three possibilities –GET location, SEND request that P2P routes –GET location, send to that location (P2P does not route) –SEND request (P2P determines location) Unsolved mysteries –Do we need proxy-ish policy enforcement? –Do we need proxy-ish support for multiple devices, etc? –Are peers turning into Ad Hoc routers? Through NATs?

March A Few Words From Your Sponsor… It would be great if we all agreed on a few things Are overlays big enough to require SPF routing? –Some scenarios with “thousands” of peers Does somebody else GET to influence routing? –Some scenarios span administrative domains –Impeded access scenario explicitly votes “no” Does somebody else HAVE to influence routing? –Support for ad hoc overlays, first responders, etc. Please read (and savage) Applications Scenarios –draft-bryan-p2psip-app-scenarios-00.txt

March Please start talking now… How many routing techniques do we need, and can we pick a set? Discuss/compare different routing techniques (iterative, recursive, semi-recursive, as well as symmetric vs. asymmetric). Can we decide on a set for the protocol to implement?