David A. Bryan P2PSIP AdHoc Meeting IETF 64 (Vancouver)

Slides:



Advertisements
Similar presentations
Implementing Declarative Overlays From two talks by: Boon Thau Loo 1 Tyson Condie 1, Joseph M. Hellerstein 1,2, Petros Maniatis 2, Timothy Roscoe 2, Ion.
Advertisements

NEURAL NETWORKS Perceptron
Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
Scope Discussion Seems to be a good deal of interest in moving this toward a working group If we want to work toward this, we need to have a clearly defined.
Draft-bryan-sipping-p2p David Bryan IETF 63, Paris August 3, 2005.
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.
1/14 Ad Hoc Networking, Eli M. Gafni and Dimitri P. Bertsekas Distributed Algorithm for Generating Loop-free Routes in Networks With Frequently.
P2P-SIP Presentation Philip Matthews Nimcat / Avaya.
Parallel Simulation etc Roger Curry Presentation on Load Balancing.
CS 536 Spring Global Optimizations Lecture 23.
Looking Up Data in P2P Systems Hari Balakrishnan M.Frans Kaashoek David Karger Robert Morris Ion Stoica.
Lesson 11-Virtual Private Networks. Overview Define Virtual Private Networks (VPNs). Deploy User VPNs. Deploy Site VPNs. Understand standard VPN techniques.
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Benefits of Early Cache Miss Determination Memik G., Reinman G., Mangione-Smith, W.H. Proceedings of High Performance Computer Architecture Pages: 307.
Prof. Fateman CS 164 Lecture 221 Global Optimization Lecture 22.
Reinforcement Learning Game playing: So far, we have told the agent the value of a given board position. How can agent learn which positions are important?
SE 555 Software Requirements & Specification 1 SE 555 Software Requirements & Specification Prototyping.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery Using NeuroSearch Presentation for the Agora Center InBCT-seminar Mikko Vapa, researcher InBCT 3.2.
Prof. Bodik CS 164 Lecture 16, Fall Global Optimization Lecture 16.
Draft-li-rtgwg-cc-igp-arch-00IETF 88 RTGWG1 An Architecture of Central Controlled Interior Gateway Protocol (IGP) draft-li-rtgwg-cc-igp-arch-00 Zhenbin.
Exploring the multi- router SOHO network draft-baker-fun-multi-router Fred Baker.
Reliable, Robust Data Collection in Sensor Networks Murali Rangan Russell Sears Fall 2005 – Sensornet.
Operations Research Models
Slicing the Onion: Anonymity Using Unreliable Overlays Sachin Katti Jeffrey Cohen & Dina Katabi.
P2PSIP Charter Proposal Many people helped write this charter…
A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks By Kiana Karimpour.
Introduction to Networked Graphics Part 3 of 5: Latency.
Computer Science Informed Content Delivery Across Adaptive Overlay Networks Overlay networks have emerged as a powerful and highly flexible method for.
1 National Research Council - Pisa - Italy Marco Conti Italian National Research Council (CNR) IIT Institute Executive board meeting 2nd MobileMAN Workshop.
Operators and the IETF – the survey Standardizing the future, together Jan Žorž and Chris Grundemann, ISOC mailto:
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 LAN Switching and Wireless Implement Spanning Tree Protocols (STP) Chapter.
Section 3.1: Proof Strategy Now that we have a fair amount of experience with proofs, we will start to prove more difficult theorems. Our experience so.
Intro to Network Design
Simulation is the process of studying the behavior of a real system by using a model that replicates the behavior of the system under different scenarios.
Ensembles. Ensemble Methods l Construct a set of classifiers from training data l Predict class label of previously unseen records by aggregating predictions.
Evaluation of the XL Routing Algorithm in Multiple Failure Conditions Nguyen Cao Julie Morris Khang Pham.
ALTO BOF Charter Discussion. Charter Iterated (twice) on the list  Several comments on the first version Terminology, caching  No complains on current.
COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM.
Opportunistic Traffic Scheduling Over Multiple Network Path Coskun Cetinkaya and Edward Knightly.
Doc.: IEEE /0267r0 Submission Jack Winters March 2005 Slide 1 Proposal for Higher Spatial Reuse Date: Authors: Notice: This document.
A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Evaluating Wireless Network Performance David P. Daugherty ITEC 650 Radford University March 23, 2006.
Wireless Network Optimisation Mike Morgan. Categories of Wireless Device ➲ Fixed ● Physically fixed in position e.g. Antenna mounted on tower or rooftop.
Evaluation of ad hoc routing over a channel switching MAC protocol Ethan Phelps-Goodman Lillie Kittredge.
Requirements for Peer protocol draft-jiang-p2psip-peer-protocol-requirement-00.txt Jiang XingFeng (Johnson) P2PSIP WG, IETF #68.
Peter R Pietzuch and Jean Bacon Peer-to-Peer Overlay Networks in an Event-Based Middleware DEBS’03, San Diego, CA, USA,
SIP-Based or DHT-Based? November 12, 2005 Eunsoo Shim Panasonic Digital Networking Laboratory P2P SIP Ad-hoc Meeting IETF64, Vancouver.
1 CO Games Development 1 Week 8 A* Gareth Bellaby.
SIP Events: Changes and Open Issues IETF 50 / SIP Working Group Adam Roach
March P2PSIP Routing Discussion (“Routing: what does it look like?) Spencer Dawkins IETF 70 – December 2007 Vancouver, British.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Implement Spanning Tree Protocols (STP) LAN Switching and Wireless – Chapter.
1 IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo, Jose G. Delgado-Frias Publisher: Journal of Systems.
1 Semijoin Reduction in Query Processors Stocker, Kossman, Braumandl, Kemper Integrating Semi-Join-Reducers into State-of-the-Art Query Processors ICDE.
SOSIMPLE: A Serverless, Standards- based, P2P SIP Communication System David A. Bryan and Bruce B. Lowekamp College of William and Mary Cullen Jennings.
P2P Cullen Jennings Out of scope Mechanisms File Sharing Fluffy’s Hair XCAP.
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
Introduction to Machine Learning, its potential usage in network area,
Concurrent Broadcast for Information Dissemination
Plethora: Infrastructure and System Design
*current controlled assessment plans are unknown
Lock Ahead: Shared File Performance Improvements
ديبــــاجــــــة: صادق الكنيست الإسرائيلي في تاريخ على اقتراح قانون دائرة أراضي إسرائيل (تعديل رقم7) – 2009 الذي يشكّل، عمليًا، خطة إصلاح شاملة.
Jiang XingFeng (Johnson) P2PSIP WG, IETF #68
David Noveck IETF99 at Prague July 20, 2017
draft-bryan-sipping-p2p
Modeling and Analysis Tutorial
Presentation transcript:

David A. Bryan P2PSIP AdHoc Meeting IETF 64 (Vancouver)

draft-bryan-sipping-p2p-01 Did not iterate draft for this IETF Another iteration soon Moving forward, I expect this will change a great deal to adapt and change to reflect protocol decisions made in this meeting and future (?) meetings

New Work Evaluating routing techniques –Looking at a limited set of P2P approaches –Which common approaches are specifically appropriate for real time communications? –Simulations of performance in communications situations of many P2P algorithms –Much of this work is academic, but the non- academic part of this work is likely to result in an informational draft for input to decision making on finding appropriate routing technique

Routing Techniques Preliminary results –We can eliminate a large number of existing P2P approaches designed for file sharing Don’t guarantee termination Optimized for number of hits, not lookup speed Have never actually been implemented (far more common than you might imagine) –Because we have buddy lists, may be able to take advantage of “social networking” in overlay approach Can be significant performance improvement (see Sprout algorithm)

Routing Techniques Need to ensure system supports redundancy –In some approaches designed for file sharing, this hasn’t been as much of a concern since multiple copies are assumed We aren’t likely to find a perfect or “best” technique – evaluating each and every one is likely to be a rat hole –New techniques every day In Summary –The criterion we need for communications is likely to be quite different than for file sharing

More New Work Use Cases Draft(s?) –Have an extensive use cases draft After discussion at this IETF have several more to add plan to combine this work with Eunsoo Shim Will release soon –Possibly one draft on immediate uses and another of more speculative/long term uses Speculative might be best presented in P2PRG