IEEE ICNP 2013 Zhenkai Zhu and Alexander Afanasyev

Slides:



Advertisements
Similar presentations
Named Data Networking for Social Network Content delivery P. Truong, B. Mathieu (Orange Labs), K. Satzke (Alu) E. Stephan (Orange Labs) draft-truong-icnrg-ndn-osn-00.txt.
Advertisements

Responder Anonymity and Anonymous Peer-to-Peer File Sharing. by Vincent Scarlata, Brian Levine and Clay Shields Presentation by Saravanan.
© 2007 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets with Internet Applications, 4e By Douglas.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
CEN Network Fundamentals Chapter 19 Binding Protocol Addresses (ARP) To insert your company logo on this slide From the Insert Menu Select “Picture”
Internet Control Message Protocol (ICMP). Objective l IP and ICMP l Why need ICMP? l ICMP Message Format l ICMP fields l Examples: »Ping »Traceroute.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
CMPT 471 Networking II Address Resolution IPv4 ARP RARP 1© Janice Regan, 2012.
Tsunami: Maintaining High Bandwidth Under Dynamic Network Conditions Dejan Kostić, Ryan Braud, Charles Killian, Eric Vandekieft, James W. Anderson, Alex.
Hyung-Min Lee ©Networking Lab., 2001 Chapter 8 ARP and RARP.
Let’s ChronoSync: Decentralized Dataset State Synchronization in Named Data Networking Zhenkai Zhu Alexander Afanasyev (presenter) Tuesday, October 8,
Review of the literature : DMND:Collecting Data from Mobiles Using Named Data Takashima Daiki Park Lab, Waseda University, Japan 1/15.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
1 Network Administration Module 3 ARP/RARP. 2 Address Resolution The problem Physical networks use physical addresses, not IP addresses Need the physical.
1 Kyung Hee University Chapter 8 ARP(Address Resolution Protocol)
Peer to Peer Network Design Discovery and Routing algorithms
Mapping IP Addresses to Hardware Addresses Chapter 5.
Geometry-driven Scheme for Geocast Routing in Mobile Ad Hoc Networks Sung-Hee Lee, Young-Bae Ko College of Information and Communication, Ajou University,
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
IEEE ICACT( Advanced Communication Technology ) 2014 conference Zhimu Huang, Ryo Yamamoto, Yoshiaki Tanaka 1.
RIP Routing Protocol. 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.
ACT: Audio Conference Tool Over Named Data Networking Zhenkai Zhu, Sen Wang, Xu Yang, Van Jacobson, Lixia Zhang ICN ‘11 August 19 Presenter: Junghwan Song.
1 Group Communications: Host Group and IGMP Dr. Rocky K. C. Chang 19 March, 2002.
Chapter 9 Introduction To Data-Link Layer 9.# 1
Behrouz A. Forouzan TCP/IP Protocol Suite, 3rd Ed.
The Story of ChronoShare, or How NDN Brought Distributed File Sharing Back Alex Afanasyev, Zhenkai Zhu, Yingdi Yu, Lijing Wang, Yukai Tu, Lixia Zhang.
Chapter 5 Network and Transport Layers
Scaling the Network Chapters 3-4 Part 2
Chapter 5 Network and Transport Layers
Chapter 16 – Networking Outline 16.1 Introduction
Dynamic Routing Protocols part2
Distributed Cache Technology in Cloud Computing and its Application in the GIS Software Wang Qi Zhu Yitong Peng Cheng
NFD Tunnel Authentication
Client/Server Databases and the Oracle 10g Relational Database
Ad-hoc Networks.
Chapter 8 ARP(Address Resolution Protocol)
Chapter 9 ICMP.
ARP and RARP Objectives Chapter 7 Upon completion you will be able to:
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Peer-to-peer networking
Chapter 4 Data Link Layer Switching
CHAPTER 3 Architectures for Distributed Systems
Internet Networking recitation #4
Understanding the OSI Reference Model
Ivy Eva Wu.
A comparison of Ad-Hoc Routing Protocols
#01 Client/Server Computing
Internet Networking recitation #12
Chapter 5 Network and Transport Layers
Spyridon (Spyros) Mastorakis University of California, Los Angeles
Net 323: NETWORK Protocols
Net 431 D: ADVANCED COMPUTER NETWORKS
View Change Protocols and Reconfiguration
Dynamic Routing Protocols part2
Internet Control Message Protocol Version 4 (ICMPv4)
SSH: SECURE LOGIN CONNECTIONS OVER THE INTERNET
Presentation by Theodore Mao CS294-4: Peer-to-peer Systems
Overview Jaringan Komputer (3)
Chapter 7 ARP and RARP Prof. Choong Seon HONG.
Chapter 10 IGMP Prof. Choong Seon HONG.
Lecture 4 Communication Network Protocols
Ch 17 - Binding Protocol Addresses
Other Routing Protocols
A Routing Protocol for WLAN Mesh
Lecture 4a Mobile IP 1.
BiCuts: A fast packet classification algorithm using bit-level cutting
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
#01 Client/Server Computing
Design and Implementation of OverLay Multicast Tree Protocol
Presentation transcript:

Let’s ChronoSync: Decentralized Dataset State Synchronization in Named Data Networking IEEE ICNP 2013 Zhenkai Zhu and Alexander Afanasyev University of California, Los Angeles IEEE International Conference on Network Protocols

Outline Introduction of this paper NDN architecture ChronoSync Design Evaluation Conclusion

Introduction Synchronization in applications play an important role in our daily life. File sharing Group text messaging Collaborative editing ….Etc. Quite a few popular applications have their way to synchronize dataset: Dropbox and Google Docs : Centralization BitTorrent Sync service : Peer-to-Peer ChronoChat : based on ChronoSync protocol in Named Data Networking(NDN)

NDN architecture Two basic communication units : interest packet and data packet. All communication in NDN is receiver-driven. Pending Interest Table (PIT) : recording the interface which sent interest packet. PIT mechanism makes multicast be naturally supported in NDN.

ChronoSync overview Two interdependent components of ChronoSync-based application : The application logic module : Respond to the change of the dataset state. ChronoSync module : Synchronize the state of the dataset. State of the dataset

ChronoSync overview (cont.) ChronoSync encodes the state of dataset into a crypto form( e.g. SHA256 ), this form we call the state digest, or digest in short. In ChronoChat , ChronoSync module maintains the current user’s messages in digest tree , as well as history of the dataset state changes in digest log. Digest tree

Naming rules of ChronoSync Prefix The application name and the chatroom name. (3) Sequence number Prefix in broadcast namespace for a given broadcast domain. The application name and the chatroom name. The latest state digest of the interest sender. Prefix is just like route table (2) To identify the process that is responsible for handling such interest.

Maintaining dataset state Each child node of the tree root holds a cryptographic digest calculated by applying hash function over a user’s producer status. Whenever a ChronoChat user sends or learns messages , the corresponding branch of the digest tree is updated and the state digest is re-calculated.

Maintaining dataset state (cont.) Each party keeps a digest log along with the digest tree. This log is a list of key-value pairs arranged in chronological order , where the key is the state digest and the value field contains the producer status.

Propagating dataset changes – an example When Alice sends a text to the chatroom, ChronoSync module on her machine immediately notice that its state digest is newer and hence proceeds to satisfy the sync interest with sync data. Whoever receives the sync data updates the digest tree and sends out a new sync interest with the updated state digest. Tw : propagation delay. To cope with this problem, ChronoSync employs a randomized wait timer Tw, with value being set approximately on the order of the propagation delay. In the example, Bob’s state digest would become the same as the new digest after Alice’s reply reaches him, before Tw expires. Ted’s sync interest may reach Bob before he receives Alice’s sync data.. Sync data Wait timer Tw Sync interest

Handling simultaneous data generations When the wait time Tw times out, Ted proceed to send a sync interest with the previous state digest again, but this time with an exclude filter that contains the hash of Bob’s sync data. Routers understand that Bob’s sync data cannot be used as the reply to the interest. Wait Tw and send sync interest again - Exclude filter 的lifetime非常短,因為他是為了要synchronize data,若data存在,就應該早就在Router的cache裡面。(Wait Tw的目的就是為了等Data到Router) - Exclude filter : One of the selectors that can be sent along with the interest to exclude data that the requester no longer needs. - 若同時有很多data到達Router, 目前只能等很多次Tw times out, 再一次一次透過exclude filter把data 個別拿回來

Handling network partitions When the interest with exclude filter times out, ChronoSync infers that the network partitions have happened. The recipient of the unknown digest sends out a recovery interest. Those who recognize the digest (e.g. having it in their digest log) reply the recovery interest with the most recent producer status of all users. - Exclude filter 的lifetime非常短,因為他是為了要synchronize data,若data存在,就應該早就在Router的cache裡面。(Wait Tw的目的就是為了等Data到Router)

Evaluation : IRC vs ChronoChat IRC : Internet Relay Chat service, based on TCP/IP. (1) Performance under normal network condition : ChronoChat 整體的 Delay 較小

(b) (c) Evaluation (2) Synchronization resiliency to network failures:

Evaluation : IRC vs ChronoChat (3) Network utilization pattern ChronoChat : More or less equally utilizes all of the available network links between participants. IRC : A few links close to the server have high packet concentrations.

Evaluation : IRC vs ChronoChat (4) Overall overhead

Conclusion ChronoSync is a decentralized dataset synchronization protocol for distributed application running in NDN. This protocol removes both single point of failure and traffic concentration problems common associate with centralized implementations. ChronoSync is highly robust in faces of network partitions.