UbiStore: Ubiquitous and Opportunistic Backup Architecture. Feiselia Tan, Sebastien Ardon, Max Ott Presented by: Zainab Aljazzaf.

Slides:



Advertisements
Similar presentations
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
Advertisements

Supporting Cooperative Caching in Disruption Tolerant Networks
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
© 2005 Andreas Haeberlen, Rice University 1 Glacier: Highly durable, decentralized storage despite massive correlated failures Andreas Haeberlen Alan Mislove.
Mobile Routing protocols MANET Lecture: 4. DIALOGUE CONTROL In any communication there are two types of user dialogues. –long session-oriented transactions.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
Network and Server Basics. 6/1/20152 Learning Objectives After viewing this presentation, you will be able to: Understand the benefits of a client/server.
6/3/ Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness CS495 – Spring 2005 Northwestern University.
Haiyun Luo, Fan Ye, Jerry Cheng, Songwu Lu, Lixia Zhang
Module 3.4: Switching Circuit Switching Packet Switching K. Salah.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Networking Theory (Part 1). Introduction Overview of the basic concepts of networking Also discusses essential topics of networking theory.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Database caching in MANETs Based on Separation of Queries and Responses Author: Hassan Artail, Haidar Safa, and Samuel Pierre Publisher: Wireless And Mobile.
DAKNET Presented By: rreema.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
A Study on Mobile P2P Systems Hongyu Li. Outline  Introduction  Characteristics of P2P  Architecture  Mobile P2P Applications  Conclusion.
Barracuda Networks Confidential1 Barracuda Backup Service Integrated Local & Offsite Data Backup.
Maintaining Windows Server 2008 File Services
A Collaborative Music DJ for Ad Hoc Networks Ursula Wolz Mike Massimi Eric Tarn Department of Computer Science The College of New Jersey.
1 Napster & Gnutella An Overview. 2 About Napster Distributed application allowing users to search and exchange MP3 files. Written by Shawn Fanning in.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Mobile Databases: a Selection of Open Issues and Research Directions Authors: Rachid Guerraoui et al. Sources: SIGMOD Record, 33(2), pp.78-83, 2004 Adviser:
Ad Hoc Networking via Named Data Michael Meisel, Vasileios Pappas, and Lixia Zhang UCLA, IBM Research MobiArch’10, September 24, Shinhaeng.
Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.
Version 4.0. Objectives Describe how networks impact our daily lives. Describe the role of data networking in the human network. Identify the key components.
An affinity-driven clustering approach for service discovery and composition for pervasive computing J. Gaber and M.Bakhouya Laboratoire SeT Université.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Gil EinzigerRoy Friedman Computer Science Department Technion.
Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random Walks Bo Han, Aravind Srinivasan University of Maryland.
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.
Wireless Ad Hoc Podcasting. Ad hoc ad hoc network typically refers to a system of network requiring little or no planning a decentralized type of wireless.
A Study of Live Video Streaming over Highway Vehicular Ad hoc Networks Meenakshi Mittal ©2010 International Journal of Computer Applications ( )Volume.
1 Heterogeneity in Multi-Hop Wireless Networks Nitin H. Vaidya University of Illinois at Urbana-Champaign © 2003 Vaidya.
Computer and Information Science Ch1.3 Computer Networking Ch1.3 Computer Networking Chapter 1.
BitTorrent enabled Ad Hoc Group 1  Garvit Singh( )  Nitin Sharma( )  Aashna Goyal( )  Radhika Medury( )
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Michael J. Neely, University of Southern California CISS, Princeton University, March 2012 Wireless Peer-to-Peer Scheduling.
ONLINE GAME NETWORK TRAFFIC OPTIMIZATION Jaewoo kim Youngho yi Minsik cho.
Computer Networks with Internet Technology William Stallings
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Diagnostic Pathfinder for Instructors. Diagnostic Pathfinder Local File vs. Database Normal operations Expert operations Admin operations.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Peer-to-Peer Network Tzu-Wei Kuo. Outline What is Peer-to-Peer(P2P)? P2P Architecture Applications Advantages and Weaknesses Security Controversy.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
03/19/02Scalab Seminar Series1 Routing in Peer-to-Peer Systems Ramaswamy N.Vadivelu Scalab, ASU.
A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks Reporter: Yanlin Peng Wenrui Zhao, Mostafa Ammar, College of Computing,
Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
A Cooperative SIP Infrastructure for Highly Reliable Telecommunication Services BY Sai kamal neeli AVINASH THOTA.
© 2008 Frans Ekman Mobility Models for Mobile Ad Hoc Network Simulations Frans Ekman Supervisor: Jörg Ott Instructor: Jouni Karvo.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
P2P Networking: Freenet Adriane Lau November 9, 2004 MIE456F.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
( ) 1 Chapter # 8 How Data is stored DATABASE.
CS791Aravind Elango Maintenance-Free Global Data Storage Sean Rhea, Chris Wells, Patrick Eaten, Dennis Geels, Ben Zhao, Hakim Weatherspoon and John Kubiatowicz.
Network and Server Basics. Learning Objectives After viewing this presentation, you will be able to: Understand the benefits of a client/server network.
Presented by Edith Ngai MPhil Term 3 Presentation
Analysis the performance of vehicles ad hoc network simulation based
Ad-hoc Networks.
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Effective Replica Allocation
ONLINE SECURE DATA SERVICE
Brahim Ayari, Abdelmajid Khelil and Neeraj Suri
Presentation transcript:

UbiStore: Ubiquitous and Opportunistic Backup Architecture. Feiselia Tan, Sebastien Ardon, Max Ott Presented by: Zainab Aljazzaf

Table of contents: Introduction. Introduction. Goals and constrains. Goals and constrains. UbiStore overviews. UbiStore overviews. - Assumptions. - Assumptions. - Evaluation criteria. - Evaluation criteria. - Model. - Model. Node Architecture. Node Architecture. Evaluation. Evaluation. - Simulation mobility models. - Simulation mobility models. - Simulation result. - Simulation result. Related Work. Related Work. Conclusion. Conclusion.

Table of contents: Introduction. Introduction. Goals and constrains. Goals and constrains. UbiStore overviews. UbiStore overviews. - Assumptions. - Assumptions. - Evaluation criteria. - Evaluation criteria. - Model. - Model. Node Architecture. Node Architecture. Evaluation. Evaluation. - Simulation mobility models. - Simulation mobility models. - Simulation result. - Simulation result. Related Work. Related Work. Conclusion. Conclusion.

Introduction.. To prevent data loss in case of malfunctioning or lost devices. To prevent data loss in case of malfunctioning or lost devices. Backup! Backup! Backup has to be done periodically and often manually  up to date? Backup has to be done periodically and often manually  up to date? Many of these devices have, or soon, will have wireless connectivity. Many of these devices have, or soon, will have wireless connectivity. Portable backup system

Mobile Computing Environments

Introduction Mobile devices (mobile telephones, personal audio players, PDA, laptop computers.. etc) are used in many locations and environments than desktop computers. Mobile devices (mobile telephones, personal audio players, PDA, laptop computers.. etc) are used in many locations and environments than desktop computers. Those devices continuously record user’s life artifacts. Those devices continuously record user’s life artifacts. Storage is mainly local to the device. Storage is mainly local to the device.

Mobile lost ! BACKUP …

Introduction.. SIM Card information backup machine Mobile backup cardUSB SIM card reader - Mobile Backup system: AT&T mobile backup service allow its subscribers to store, update and access their contact information from the Web. - Backup cards:

Introduction.. - Mobile backup system:

Introduction.. The data volume and associated network cost makes traditional backup to a backup server cost prohibitive for most consumers. The data volume and associated network cost makes traditional backup to a backup server cost prohibitive for most consumers. What is needed is an automatic and ideally operating cost free solution for mobile devices. What is needed is an automatic and ideally operating cost free solution for mobile devices. Use short-range and peer-to-peer communication capability. Use short-range and peer-to-peer communication capability. UbiStore: a backup architecture, where mobile devices backup their data over short-range, ad- hoc wireless links to other devices encountered as a result of user mobility. UbiStore: a backup architecture, where mobile devices backup their data over short-range, ad- hoc wireless links to other devices encountered as a result of user mobility.

UbiStore Mobile to mobile backup - Main idea: typical user mobility patterns will incur some repetitive encounters in the course of daily life (public transports, home/office) which can facilitate the recovery of data in case of a device failure.

Table of contents: Introduction. Introduction. Goals and constrains. Goals and constrains. UbiStore overviews. UbiStore overviews. - Assumptions. - Assumptions. - Evaluation criteria. - Evaluation criteria. - Model. - Model. Node Architecture. Node Architecture. Evaluation. Evaluation. - Simulation mobility models. - Simulation mobility models. - Simulation result. - Simulation result. Related Work. Related Work. Conclusion. Conclusion.

Goals and constrains.. No need for 100% recovery. No need for 100% recovery. Fully decentralized architecture. Fully decentralized architecture. Only short-range, peer-to-peer communication. Only short-range, peer-to-peer communication. Maintain user’s privacy and data integrity. Maintain user’s privacy and data integrity. Maximize the incentive to participate. Maximize the incentive to participate.

Table of contents: Introduction. Introduction. Goals and constrains. Goals and constrains. UbiStore overviews. UbiStore overviews. - Assumptions. - Assumptions. - Evaluation criteria. - Evaluation criteria. - Model. - Model. Node Architecture. Node Architecture. Evaluation. Evaluation. - Simulation mobility models. - Simulation mobility models. - Simulation result. - Simulation result. Related Work. Related Work. Conclusion. Conclusion.

The exponential increase of mobile device’s storage satisfy the user needs. The exponential increase of mobile device’s storage satisfy the user needs. The existence of free P2P communication (Blutooth) -> discovery mode. The existence of free P2P communication (Blutooth) -> discovery mode. Encounter of other devices during the day. Encounter of other devices during the day. Human activity is largely repetitive. Human activity is largely repetitive. A unique information can survive the loss. A unique information can survive the loss. UbiStore overviews : Assumptions..

UbiStore overviews : Evaluation criteria.. The recovery time: Time necessary to restore lost data. The recovery time: Time necessary to restore lost data. It is the most important parameter as it deals with direct user’s perception of the system’s performance. It is the most important parameter as it deals with direct user’s perception of the system’s performance. The space efficiency: Ratio between backup data and effective data. It is impacting the per-bit cost of the overall backup system. The space efficiency: Ratio between backup data and effective data. It is impacting the per-bit cost of the overall backup system. The communication efficiency: reflects the communication overhead of using several peer-to-peer communication links compared with centralized backup mechanism. The communication efficiency: reflects the communication overhead of using several peer-to-peer communication links compared with centralized backup mechanism. The paper present an initial evaluation of UbiStore using the recovery time criteria, for two different mobility models. The paper present an initial evaluation of UbiStore using the recovery time criteria, for two different mobility models.

UbiStore overviews : Model.. A node in UbiStore is a software agent executed on a user’s device, and assigned a data area to be backed up. A node in UbiStore is a software agent executed on a user’s device, and assigned a data area to be backed up. Encounter: the event of two nodes establishing communication in the view to exchange data. Encounter: the event of two nodes establishing communication in the view to exchange data. At any time, each node in UbiStore operates in one of the following two modes: At any time, each node in UbiStore operates in one of the following two modes: - Backup mode: a node keeps sending data blocks to other nodes while at the same time receiving and storing data from other nodes. - Backup mode: a node keeps sending data blocks to other nodes while at the same time receiving and storing data from other nodes. - Recovery mode: used after a device failure or a lost device, where a node will seek to recover its data from any node encountered. - Recovery mode: used after a device failure or a lost device, where a node will seek to recover its data from any node encountered.

Table of contents: Introduction. Introduction. Goals and constrains. Goals and constrains. UbiStore overviews. UbiStore overviews. - Assumptions. - Assumptions. - Evaluation criteria. - Evaluation criteria. - Model. - Model. Node Architecture. Node Architecture. Evaluation. Evaluation. - Simulation mobility models. - Simulation mobility models. - Simulation result. - Simulation result. Related Work. Related Work. Conclusion. Conclusion.

Architecture Block: the elementary unit of storage in UbiStore. Block: the elementary unit of storage in UbiStore. Blocks are immutable: once generated, they cannot be modified. Blocks are immutable: once generated, they cannot be modified. Any block is assigned a globally unique identifier, associated with an owner. Any block is assigned a globally unique identifier, associated with an owner. Blocks are not forwarded from one node to another node, i.e. a node will only send its own blocks to another node. Blocks are not forwarded from one node to another node, i.e. a node will only send its own blocks to another node.

- Block generation process: Node Architecture..

- UbiStore node functional overview:

Node Architecture: Data manager Choosing which block to send: Choosing which block to send: Selecting blocks for deletion: blocks to be deleted are chosen from the tail of the queue (the blocks we are most likely to encounter again in the short term are dropped first). Selecting blocks for deletion: blocks to be deleted are chosen from the tail of the queue (the blocks we are most likely to encounter again in the short term are dropped first).

- Computing storage space offers: several strategies: Node Architecture.. Fixed size: a constant amount of storage space is advertised for each encounter. Fixed size: a constant amount of storage space is advertised for each encounter. Adaptive: the offered storage space is biased to favor frequently encountered nodes, with longer contact durations -> frequently encountered nodes are also likely to be frequently encountered when it is time to recover the data after a failure. Adaptive: the offered storage space is biased to favor frequently encountered nodes, with longer contact durations -> frequently encountered nodes are also likely to be frequently encountered when it is time to recover the data after a failure.

Table of contents: Introduction. Introduction. Goals and constrains. Goals and constrains. UbiStore overviews. UbiStore overviews. - Assumptions. - Assumptions. - Evaluation criteria. - Evaluation criteria. - Model. - Model. Node Architecture. Node Architecture. Evaluation. Evaluation. - Simulation mobility models. - Simulation mobility models. - Simulation result. - Simulation result. Related Work. Related Work. Conclusion. Conclusion.

Evaluation: simulation mobility models The random waypoint model in which nodes evolve in a two-dimensional square field with their destination and speed determined randomly. The random waypoint model in which nodes evolve in a two-dimensional square field with their destination and speed determined randomly. This model is unrealistic and does not represent any actual human mobility pattern, we use it to (This will provide baseline). This model is unrealistic and does not represent any actual human mobility pattern, we use it to (This will provide baseline). Commuters traveling on a train : high level of correlation between node movements. Commuters traveling on a train : high level of correlation between node movements.

Evaluation: Simulation result.. - Recovery speed vs. time (Random waypoint model):

The variation: recovery ratio vs. time (ratio=5) The variation: recovery ratio vs. time (ratio=5) Evaluation: Simulation result..

- Train scenario vs. random waypoint: This supports the main idea of UbiStore that the repetitiveness of human mobility over large timescale will increase the speed of date recovery.

Table of contents: Introduction. Introduction. Goals and constrains. Goals and constrains. UbiStore overviews. UbiStore overviews. - Assumptions. - Assumptions. - Evaluation criteria. - Evaluation criteria. - Model. - Model. Node Architecture. Node Architecture. Evaluation. Evaluation. - Simulation mobility models. - Simulation mobility models. - Simulation result. - Simulation result. Related Work. Related Work. Conclusion. Conclusion.

Related work OceanStore and PAST: provide a self-organizing file system storage infrastructure to applications. OceanStore and PAST: provide a self-organizing file system storage infrastructure to applications. PeerStore: is a backup system. Is not adapted to disconnected networks and opportunistic communication. PeerStore: is a backup system. Is not adapted to disconnected networks and opportunistic communication. Pastiche: buddy have similar set of files. Buddies only exchange data that is not common for both. Pastiche: buddy have similar set of files. Buddies only exchange data that is not common for both.

Table of contents: Introduction. Introduction. Goals and constrains. Goals and constrains. UbiStore overviews. UbiStore overviews. - Assumptions. - Assumptions. - Evaluation criteria. - Evaluation criteria. - Model. - Model. Node Architecture. Node Architecture. Evaluation. Evaluation. - Simulation mobility models. - Simulation mobility models. - Simulation result. - Simulation result. Related Work. Related Work. Conclusion. Conclusion.

Conclusion The paper has presented the concept and initial design of UbiStore. The paper has presented the concept and initial design of UbiStore. The main idea is to perform backup in other devices encountered by a mobile device over time. The main idea is to perform backup in other devices encountered by a mobile device over time. The paper presented an early performance evaluation which shows the benefit of exploiting repetitive patterns in human mobility. The paper presented an early performance evaluation which shows the benefit of exploiting repetitive patterns in human mobility.

Thank you..