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

Slides:

Advertisements

Similar presentations

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

Advertisements

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

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

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

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.

Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.

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

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #13: P2P and Sensor Networks Shivkumar Kalyanaraman:

SIP for Mobile Services Arjun Roychowdhury Hughes Software Systems.

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.

VoIP and IP conferencing over satellites Workshop on VoIP Technology: Research and Standards for reliable applications PIMRC 08, Cannes France 15 September.

Object Naming & Content based Object Search 2/3/2003.

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

SkipNet: A Scaleable Overlay Network With Practical Locality Properties Presented by Rachel Rubin CS294-4: Peer-to-Peer Systems By Nicholas Harvey, Michael.

Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.

Focus on Distributed Hash Tables Distributed hash tables (DHT) provide resource locating and routing in peer-to-peer networks –But, more than object locating.

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.

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,

INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.

Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.

P2PSIP Charter Proposal Many people helped write this charter…

09/07/2004Peer-to-Peer Systems in Mobile Ad-hoc Networks 1 Lookup Service for Peer-to-Peer Systems in Mobile Ad-hoc Networks M. Tech Project Presentation.

 Introduction  VoIP  P2P Systems  Skype  SIP  Skype - SIP Similarities and Differences  Conclusion.

P2P Networking for Consumer Electronics (CE) Devices November 12, 2005 Eunsoo Shim Greg Perkins Panasonic Digital Networking Laboratory P2P SIP Ad-hoc.

1 Kommunikatsiooniteenuste arendus IRT0080 Loeng 8 Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.

Thesis Proposal Data Consistency in DHTs. Background Peer-to-peer systems have become increasingly popular Lots of P2P applications around us –File sharing,

On P2P Collaboration Infrastructures Manfred Hauswirth, Ivana Podnar, Stefan Decker Infrastructure for Collaborative Enterprise, th IEEE International.

A Distributed Architecture for Multi-dimensional Indexing and Data Retrieval in Grid Environments Athanasia Asiki, Katerina Doka, Ioannis Konstantinou,

Peer to Peer Research survey TingYang Chang. Intro. Of P2P Computers of the system was known as peers which sharing data files with each other. Build.

Security for the Optimized Link- State Routing Protocol for Wireless Ad Hoc Networks Stephen Asherson Computer Science MSc Student DNA Lab 1.

Jonathan Walpole CSE515 - Distributed Computing Systems 1 Teaching Assistant for CSE515 Rahul Dubey.

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

1 Peer-to-Peer Systems. 2 Introduction What is peer One that of equal standing with another Peer-to-peer A way of structure distributed applications Each.

1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)

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

National Institute of Advanced Industrial Science and Technology Query Processing for Distributed RDF Databases Using a Three-dimensional Hash Index Akiyoshi.

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

1 Towards Taxonomy-based Routing in P2P Networks Alexander L¨oser 指導老師 : 許子衝老師學生 : 羅英辰學號 :M97G0216.

A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside

1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.

1 Distributed Hash Table CS780-3 Lecture Notes In courtesy of Heng Yin.

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

A Cooperative SIP Infrastructure for Highly Reliable Telecommunication Services BY Sai kamal neeli AVINASH THOTA.

1. Efficient Peer-to-Peer Lookup Based on a Distributed Trie 2. Complex Queries in DHT-based Peer-to-Peer Networks Lintao Liu 5/21/2002.

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.

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

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.

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

March 20, 2007BLISS BOF IETF-681 Requirements and Implementation Options for the Multiple Line Appearance Feature using the Session Initiation Protocol.

P2P Search COP6731 Advanced Database Systems. P2P Computing  Powerful personal computer Share computing resources P2P Computing  Advantages: Shared.

Challenge: Peers on Wheels – A Road to New Traffic Information Systems Jedrzej Rybicki, Björn Scheuermann, Wolfgang Kiess Christian Lochert, Pezhman Fallahi,

P2P Content Search: Give the Web Back to the People Matthias Bender Sebastin Michel Peter Triantafillou Gerhard Weikum Christian Zimmer Mariam John CSE.

Malugo – a scalable peer-to-peer storage system..

OPTIMIZATION OF SIGNALING TRAFFIC IN CENTRALIZED CONFERENCES USING SIP Submitted by D.NEHRU S.JAYABALAN B.Tech IT II Year.

1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.

1 P2PSIP Peer Protocol Design Questions Presenter: Philip Matthews (based on input from the authors of the various proposals)

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.

Peer to peer Internet telephony challenges, status and trend

Ad-hoc Networks.

Peer-to-peer SIP Ad-hoc meeting

Plethora: Infrastructure and System Design

DHT Routing Geometries and Chord

Jiang XingFeng (Johnson) P2PSIP WG, IETF #68

網際網路電話系統期中考重點整理.

Peer-to-peer SIP Ad-hoc meeting

Presentation transcript:

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

2 Why Distributed Hash Tables (DHTs)? High success rate of search If all the DHT routing tables are correct, 100% success. Even for data with little replication Smaller number of replications are easier to maintain consistency for dynamic data  User locations are of dynamic data. Slow delay increase Delay – O(log(N)) hops where N: number of active nodes. Low cost for search No (or few) duplicate query messages High cost for maintenance

3 SIP-Based : Use SIP for Distributed Data Access and Overlay Maintenance SIP Node Registration is used for DHT JOIN. SIP Node Registration expiration is used for DHT LEAVE. User record is created via SIP User Registration INVITE is routed along the path dictated by DHT. DHT layer is a thin layer just maintaining DHT routing table. DHT key information is carried as a part of SIP messages. Additional DHT maintenance information is carried by SIP Registration messages. Existing designs --- Kundan/Henning, Cullen/David DHT Layer SIP Layer DHT Layer SIP Layer DHT Layer SIP Layer DHT Layer SIP Layer INVITE message flow

4 Pros & Cons of SIP-Based Approach Pros Efficiency: SIP signaling can be combined with search and overlay maintenance  Smaller number of messages, Less delay Can consider SIP semantics in search processes and overlay maintenance.  Ex) Call forking Protocol Reuse: May be able to reuse many things from existing SIP messages Cons Complexity Reusing existing SIP methods may be confusing --- different semantics need more care (Pointed in Alan Johnston’s draft) Only P2P-SIP nodes can participate in the overlay network. Challenge --- how to support different overlay algorithms?

5 DHT-Based DHT layer provides the following interface. Lookup(in key, in type, out data) Place(in key, in type, in data) Resource search is managed by DHT layer. SIP is just an application over DHT layer. DHT provides a kind of distributed data base functions to its applications. DHT lookup messages are generic ---- independent of SIP call semantics or resource types DHT Layer SIP Layer DHT Layer SIP Layer DHT Layer SIP Layer 7 INVITE message flow

6 About Trapezoid Routing Preserving the trapezoid routing No trapezoid routing DHT UA Proxy UA DHT UA

7 Pros & Cons of DHT-based Approach Pros Clarity No confusion with semantics of existing SIP messages Flexibility Easier to support different overlay algorithms with little change in SIP messages Sharing the overlay network --- common lookup mechanism for many things! No change in DHT operation required to support advanced features of SIP-based P2P VoIP, IM, and Presence Can share the same overlay network with more applications beyond basic VoIP call or IM.  For example, for P2P-based conferencing later. Nodes without SIP entity can participate in the overlay network. Cons Less efficiency No optimization of search and overlay maintenance by using SIP call semantics Separate lookup from call signaling (Invite messages) Defining new protocols Challenge: Can we reuse any existing protocol? Challenge: Can we define a common protocol with extensions for different overlay algorithms?