Introduction There are many situations in which we might use replicated data Let’s look at another, different one And design a system to work well in that.

Slides:



Advertisements
Similar presentations
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Advertisements

1 Improving the Performance of Distributed Applications Using Active Networks Mohamed M. Hefeeda 4/28/1999.
Distributed components
Inside the Internet. INTERNET ARCHITECTURE The Internet system consists of a number of interconnected packet networks supporting communication among host.
1 System Models. 2 Outline Introduction Architectural models Fundamental models Guideline.
CH2 System models.
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
A) Describe 3 benefits of a company moving to a wireless network compared to staying with its cabled network(3) b) Describe 2 problems that may occur (2)
Caching Consistency and Concurrency Control Contact: Dingshan He
Distributed Systems CS Consistency and Replication – Part I Lecture 10, September 30, 2013 Mohammad Hammoud.
SURENDRA INSTITUTE OF ENGINEERING & MANAGEMENT PRESENTED BY : Md. Mubarak Hussain DEPT-CSE ROLL
Assignment 3 Jacob Seiz. Hub A hub provides a central access point for a network. Through multiple I/O ports a hub can connect multiple Ethernet devices.
What is a Protocol A set of definitions and rules defining the method by which data is transferred between two or more entities or systems. The key elements.
Behrouz A. Forouzan TCP/IP Protocol Suite, 3rd Ed.
Chapter Name Replication and Mobile Databases Transparencies
WHAT IS A NETWORK TYPES OF NETWORK NETWORK HARDWARE
Auction-based in-network caching in Information-centric networks Workshop ACROSS, 16th of September 2016 | Lucia D’Acunto.
Delay-Tolerant Networks (DTNs)
DELAY TOLERANT NETWORK
1.2 The Network Edge Beginning at the edge of a network we are looking at the components with which we are most familiar - namely, the computers that we.
Ad-hoc Networks.
The Underlying Technologies
Introduction to Wireless Sensor Networks
Computer Data Communications
Distributed Computing
INTERPLANETARY INTERNET
Wireless Sensor Network Architectures
Implementation of GPU based CCN Router
Computer Networks Dr. Abbas abdulazeez.
Internet Networking recitation #12
Client-Server Interaction
Net 431 D: ADVANCED COMPUTER NETWORKS
Advanced Operating Systems
Distributed Systems Bina Ramamurthy 11/12/2018 From the CDK text.
Computer Networks Lesson 1.
Overlay Networking Overview.
Wireless Ad-Hoc Networking
Fault Tolerance Distributed Web-based Systems
Distributed Systems Bina Ramamurthy 12/2/2018 B.Ramamurthy.
Quality of Service For Mobile IP.
CSE 4340/5349 Mobile Systems Engineering
Consistency and Replication
Architectures of distributed systems Fundamental Models
PRESENTATION COMPUTER NETWORKS
Architectures of distributed systems Fundamental Models
Net 323 D: Networks Protocols
Communications & Computer Networks Resource Notes - Introduction
Outline Announcements Lab2 Distributed File Systems 1/17/2019 COP5611.
Introduction to Servers
SAMANVITHA RAMAYANAM 18TH FEBRUARY 2010 CPE 691
Replication and Availability in Distributed Systems
Distributed Systems CS
Protocols & Packet Switching
Delay-Tolerant Mobile Ad-hoc Networks
Computer Networking A Top-Down Approach Featuring the Internet
Outline Review of Quiz #1 Distributed File Systems 4/20/2019 COP5611.
Protocols.
Computer Networks Lesson 1.
Architectures of distributed systems Fundamental Models
2019/5/2 Using Path Label Routing in Wide Area Software-Defined Networks with OpenFlow ICNP = International Conference on Network Protocols Presenter:Hung-Yen.
Cohesion and Coupling.
Overview of Networking
WJEC GCSE Computer Science
CS 381: Introduction to Computer Networks
System-Level Support CIS 640.
Error Checking continued
Protocols.
Distributed Systems CS
M. Mock and E. Nett and S. Schemmer
Presentation transcript:

Designing a Replication System CS 188 Distributed Systems February 12, 2015

Introduction There are many situations in which we might use replicated data Let’s look at another, different one And design a system to work well in that situation

Challenging Network Environments Some environments have a hard time maintaining: low-loss low-latency End-to-end communications Examples: Mobile ad hoc networks Wireless sensor nets Situations where wireless connectivity to Internet is costly

Internet Protocols in These Environments Not what the Internet was designed for E.g., TCP Poor throughput if you get lots of losses or highly varying delays Basic architecture also a poor match: Packet switching End-to-end retransmission on loss

An Alternative: Delay Tolerant Networking A message switching approach Using store-and-forward at message level Designed to handle seriously changing conditions Like mobility changing which links are available Or long-term failures of network elements

Delay Tolerant Networking and Mobile Computing Essentially, use device mobility to establish new network links Those links allow access to devices not easily reachable before As devices move around, connectivity changes “Carry” messages on the mobile devices, in the hopes of finding ways to deliver them

Using Delay Tolerant Networking for Replication Use the delayed message delivery to handle update propagation Apply updates at one place and propagate them quickly, when possible When not, attach them to mobile devices Which may not hold replicas themselves Use device mobility to get updates to the other places they must go

A Specific Scenario A sensor network in a forest Sensors hold replicated files related to their task E.g., schedules of measurements Any copy updatable Some sensors can communicate with each other But most have no connectivity to the Internet, directly or indirectly Forest rangers carrying mobile devices periodically move through the forest But not specifically to visit sensors Occasionally coming into range of some sensor

Making Use of Mobility

Some Replication Constraints We want all replicas updatable We want to achieve the highest degree of consistency as fast as feasible We want to avoid conflicts, when possible And at least know when they happen Avoid requiring extra hardware Especially out in the woods

A Couple of Very Important Questions What is insufficiently specified about this scenario to allow good design? In particular, things that it’s reasonable to know Not oracular knowledge of the future Are there constraints we should put in place?

So, What’s Our Replication System Going To Be Like? Optimistic or conservative? Server oriented or peer oriented? Replicas only or caching? How will updates occur? How will updates be propagated? What is our replication granularity? How can we achieve fast consistency? How do we handle concurrency?

A Final Question Is file system replication even suitable here? Is there some other type of distributed data management we should use instead?