March 2008IETF 71 (P2PSIP)1 Data types in P2P systems Henning Schulzrinne Columbia University.

Slides:



Advertisements
Similar presentations
Yunling Wang VoIP Security COMS 4995 Nov 24, 2008 XCAP The Extensible Markup Language (XML) Configuration Access Protocol (XCAP)
Advertisements

CS4432: Database Systems II Buffer Manager 1. 2 Covered in week 1.
Csci5233 Computer Security1 Bishop: Chapter 10 (Cont.) Key Management: Certificates.
 Alexandra Constantin  James Cook  Anindya De Computer Science, UC Berkeley.
Address Settlement by Peer to Peer (ASP) Jonathan Rosenberg Cullen Jennings Eric Rescorla.
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.
1 Chapter 11: File-System Interface  File Concept  Access Methods  Directory Structure  File System Mounting  File Sharing  Protection  Chapter.
File Management Chapter 12. File Management A file is a named entity used to save results from a program or provide data to a program. Access control.
1 Foundations of Software Design Fall 2002 Marti Hearst Lecture 18: Hash Tables.
P2P-SIP Presentation Philip Matthews Nimcat / Avaya.
PHP (2) – Functions, Arrays, Databases, and sessions.
1 Dynamic Key-Updating: Privacy- Preserving Authentication for RFID Systems Li Lu, Lei Hu State Key Laboratory of Information Security, Graduate School.
Hash Tables and Associative Containers CS-212 Dick Steflik.
Lecture 10: The FAT, VFAT, and NTFS Filesystems 6/17/2003 CSCE 590 Summer 2003.
March 2009 (IETF 74)IETF - P2PRG1 Security Issues and Solutions in Peer-to- peer Systems for Real-time Communications draft-schulzrinne-p2prg-rtc-security-00.
P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.
1 Operating Systems Chapter 7-File-System File Concept Access Methods Directory Structure Protection File-System Structure Allocation Methods Free-Space.
ITIS 6200/8200. time-stamping services Difficult to verify the creation date and accurate contents of a digital file Required properties of time-stamping.
COMP 171 Data Structures and Algorithms Tutorial 10 Hash Tables.
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
File Concept §Contiguous logical address space §Types: l Data: Numeric Character Binary l Program.
PHP Scripting Language. Introduction “PHP” is an acronym for “PHP: Hypertext Preprocessor.” It is an interpreted, server-side scripting language. Originally.
Long-term Archive Service Requirements draft-ietf-ltans-reqs-00.txt.
Secure File Storage Nathanael Paul CRyptography Applications Bistro March 25, 2004.
December 2007IETF 70 - SIPPING1 SIP URI Service Discovery using DNS-SD draft-lee-sip-dns-sd-uri-02 Presented by Henning Schulzrinne Jae Woo Lee & Henning.
Hashing 1. Def. Hash Table an array in which items are inserted according to a key value (i.e. the key value is used to determine the index of the item).
A RELOAD Usage for Distributed Conference Control (DisCo) draft-knauf-p2psip-disco-00 Alexander Knauf Gabriel Hege Thomas Schmidt Matthias Wählisch
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.
DB Libraries: An Alternative to DBMS By Matt Stegman November 22, 2005.
M i SMob i S Mob i Store - Mobile i nternet File Storage Platform Chetna Kaur.
Introduction: Databases and Database Users
Computers Data Representation Chapter 3, SA. Data Representation and Processing Data and information processors must be able to: Recognize external data.
CS212: DATA STRUCTURES Lecture 10:Hashing 1. Outline 2  Map Abstract Data type  Map Abstract Data type methods  What is hash  Hash tables  Bucket.
October 8, 2015 University of Tulsa - Center for Information Security Microsoft Windows 2000 DNS October 8, 2015.
Chapter 10: File-System Interface Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Jan 1, 2005 Chapter 10: File-System.
Session 8: Databases Teaching Computing to GCSE Level with Python.
Peer-to-Peer Name Service (P2PNS) Ingmar Baumgart Institute of Telematics, Universität Karlsruhe IETF 70, Vancouver.
Crystal And Elliott Edward M. Kwang President. Objective A brief demo of Crystal Report to entice you –People spend thousand of dollars to attend Crystal.
Copyright © 2014 EMC Corporation. All Rights Reserved. Managing Host Access to Storage Upon completion of this module, you should be able to: Explain Access.
INFO1408 Database Design Concepts Week 15: Introduction to Database Management Systems.
1 Tree Indexing (1) Linear index is poor for insertion/deletion. Tree index can efficiently support all desired operations: –Insert/delete –Multiple search.
Silberschatz, Galvin, and Gagne  Applied Operating System Concepts Module 11: File-System Interface File Concept Access Methods Directory Structure.
Alternative Architecture for Information in Digital Libraries Onno W. Purbo
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
PART3 Data collection methodology and NM paradigms 1.
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
1 CSCD 326 Data Structures I Hashing. 2 Hashing Background Goal: provide a constant time complexity method of searching for stored data The best traditional.
CHAPTER 9 HASH TABLES, MAPS, AND SKIP LISTS ACKNOWLEDGEMENT: THESE SLIDES ARE ADAPTED FROM SLIDES PROVIDED WITH DATA STRUCTURES AND ALGORITHMS IN C++,
SIP-Based or DHT-Based? November 12, 2005 Eunsoo Shim Panasonic Digital Networking Laboratory P2P SIP Ad-hoc Meeting IETF64, Vancouver.
March 20, 2007BLISS BOF IETF-681 Requirements and Implementation Options for the Multiple Line Appearance Feature using the Session Initiation Protocol.
March P2PSIP Routing Discussion (“Routing: what does it look like?) Spencer Dawkins IETF 70 – December 2007 Vancouver, British.
Operating Systems Files, Directory and File Systems Operating Systems Files, Directory and File Systems.
1 P2PSIP Peer Protocol Design Questions Presenter: Philip Matthews (based on input from the authors of the various proposals)
Packet Classification Using Multi- Iteration RFC Author: Chun-Hui Tsai, Hung-Mao Chu, Pi-Chung Wang Publisher: 2013 IEEE 37th Annual Computer Software.
CSC 143T 1 CSC 143 Highlights of Tables and Hashing [Chapter 11 p (Tables)] [Chapter 12 p (Hashing)]
File System Security in Unix Annie Calpe. Overview Unix Basics File System Security: - Account Security: Passwords - File Permissions - Access Control.
Innovations in P2P Communications David A. Bryan College of William and Mary April 11, 2006 Advisor: Bruce B. Lowekamp.
Lecture : chapter 9 and 10 file system 1. File Concept A file is a collection of related information defined by its creator. Contiguous logical address.
OceanStore : An Architecture for Global-Scale Persistent Storage Jaewoo Kim, Youngho Yi, Minsik Cho.
Module 11: File Structure
Peer to peer Internet telephony challenges, status and trend
COMP 430 Intro. to Database Systems
SIP URI Service Discovery using DNS-SD draft-lee-sip-dns-sd-uri-02
Directory Structure A collection of nodes containing information about all files Directory Files F 1 F 2 F 3 F 4 F n Both the directory structure and the.
History Database - Typical historical query requirements
Lecture 4: File-System Interface
Data types in P2P systems
A RELOAD Usage for Distributed Conference Control (DisCo) – Update
Presentation transcript:

March 2008IETF 71 (P2PSIP)1 Data types in P2P systems Henning Schulzrinne Columbia University

March 2008IETF 71 (P2PSIP)2 Data issues What do we store and fetch? How do we protect it? –separate topic: CMS, homebrew,... Analogies –file system (meta data, ACL, blob) some had/have data types (e.g., VMS records) –hash libraries (e.g., hcreate()) –database libraries (e.g., gdbm) –language features such as arrays and dictionaries Tcl, Perl, PHP, Python, Ruby,... data ID crypto wrapper

March 2008IETF 71 (P2PSIP)3 Requirements Need to be able to store any data item –of reasonable size New types MUST NOT require rewriting node software –otherwise, little chance to generalize ID (“database key”) must allow non-AOR values –otherwise, doesn’t generalize to VoD and other uses Allow both “standard” data objects and application-specific ones –e.g., SIP registration records and vendor-specific configuration data or I-D 00 experiments Provide access control –e.g., only creator can read –should work with semi-trusted nodes Provide policy control per node or overlay –e.g., maximum size of objects

March 2008IETF 71 (P2PSIP)4 Data typing RELOAD -03: 32-bit integer with some TBD allocation scheme –e.g., similar to IANA ports registry compromise between space efficiency and extensibility a “usage” may define one or more data types

March 2008IETF 71 (P2PSIP)5 Multiple objects with same “key” (ID) What happens if there’s a hash collision? Possibilities –global space {“egg”} is may cause DOS attacks if ID = AOR –creator e.g., ID space could be local to creator {“egg”, alice} and {“egg”, bob} are two different objects allows “only AOR can register AOR” policy –data type {“egg”, 17, alice} and {“egg”, 42, alice} are two different objects –auxiliary data {“egg”, 17, alice, label1} and {“egg”, 17, alice, label2} are two different objects

March 2008IETF 71 (P2PSIP)6 Access control & versioning Basic access control policy: only owner (= creator) can replace (or delete) object –enforced by peer –can’t prevent peer from disobeying policy Do we need more elaborate policies? –similar to Unix ACLs or chmod bits? –unbounded complexity

March 2008IETF 71 (P2PSIP)7 Versioning & timestamps Do objects have timestamps? Option 1: Just metadata Option 2: Cannot replace newer object with older one –prevents replay attack –does not require synchronized clock in overlay as long as all instances of owner have roughly synchronized clocks or fetch current value

March 2008IETF 71 (P2PSIP)8 Compound data structures Should there be compound data structures? Options (at least) But also STL (see next slide) Scripting languages (PHP, Tcl, Ruby,...) Need data structures AND operations –e.g., enumeration, traversal (iterator), insertion at beginning/end,... Interaction with policies and replication

March 2008IETF 71 (P2PSIP)9 Example: STL containers Sequentialvectorfast inserts at end listinserts anywhere dequeinserts start & end Associativemultisetduplicates allowed setno duplicates multimap1-to-many map1-to-1 AdapterstackFILO queueFIFO priority_queuesorted order

March 2008IETF 71 (P2PSIP)10 Example: Tcl set name(first) "Mary” Fake two-dimensional arrays: name(a,b) No ordering guarantees –PHP differs, for example (insertion order)

March 2008IETF 71 (P2PSIP)11 Proposed simple type Uniquely identified by H(data) –within {“ID”, owner, type} Operations –replace –list all {“ID”, owner, type} hashes (?)

March 2008IETF 71 (P2PSIP)12 Other proposals Three types: –singleton –numeric array –dictionary Issues that need to be resolved: –operations beyond single-element –replication –access control for [x] separate from data?

March 2008IETF 71 (P2PSIP)13 Example applications registrations –multiple handsets for same AOR voic –may generally use a server (announcement), not just storage –multiple writers? –but probably want to hide meta data TURN servers –possibly indexed by some location indication

March 2008IETF 71 (P2PSIP)14 Summary Data model independent of DHT and protocol But if more complicated, may need additional operations beyond store & fetch –or at least additional sub-operations (“last”) Security issues -- what gets exposed to the (untrusted) server?