 Two armies are camped on the outskirts of either side of an enemy city.

Slides:



Advertisements
Similar presentations
Learning Outcome To practice technique of answering interpretation source questions To practice technique of answering interpretation source questions.
Advertisements

Causality in online gaming Objectives – Understand how online gaming relates to causality research in distributed systems – Be able to apply distributed.
Unlikely Instrument For Revival 2 Kings 7: Then Elisha said, “Hear the word of the L ORD. Thus says the L ORD : ‘Tomorrow about this time a seah.
Byzantine Generals. Outline r Byzantine generals problem.
TELE202 Lecture 13 TCP/UDP (1) 1 Lecturer Dr Z. Huang Overview ¥This Lecture »Internet Protocols (4) »Source: chapter 15 ¥This Lecture »TCP/UDP (1) »Source:
The Byzantine Generals Problem Boon Thau Loo CS294-4.
The Byzantine Generals Problem Leslie Lamport, Robert Shostak, Marshall Pease Distributed Algorithms A1 Presented by: Anna Bendersky.
A. P. E. P. We need YOUR help!!! Unless we learn about the Songhai Empire and at the end of the day, everyone learns something about the lesson then Earth.
Termination Detection Part 1. Goal Study the development of a protocol for termination detection with the help of invariants.
Systems of Distributed Systems Module 2 -Distributed algorithms Teaching unit 3 – Advanced algorithms Ernesto Damiani University of Bozen Lesson 6 – Two.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 26 Introduction to Computer Networks.
Termination Detection Presented by: Yonni Edelist.
1 Fault-Tolerant Consensus. 2 Failures in Distributed Systems Link failure: A link fails and remains inactive; the network may get partitioned Crash:
A Quest for the Holy Land
Idit Keidar, Principles of Reliable Distributed Systems, Technion EE, Spring Principles of Reliable Distributed Systems Lecture 5: Synchronous Uniform.
Distributed DBMSPage © 1998 M. Tamer Özsu & Patrick Valduriez Outline Introduction Background Distributed DBMS Architecture Distributed Database.
S A B D C T = 0 S gets message from above and sends messages to A, C and D S.
Distributed Computing Principles Keith Marzullo. 2 It’s all about distributed systems now…
1 More on Distributed Coordination. 2 Who’s in charge? Let’s have an Election. Many algorithms require a coordinator. What happens when the coordinator.
Multiprocess Synchronization Algorithms ( ) Lecturer: Danny Hendler.
Time, Clocks, and the Ordering of Events in a Distributed System Leslie Lamport (1978) Presented by: Yoav Kantor.
Spanish Verbs  Welcome to Spanish 1010! I hope you enjoy your time in class.  This introductory presentation will review two key concepts: conjugation.
THE ALLIANCE SYSTEM The Build up to World War One.
A-Level Computing#BristolMet Session Objectives#12 MUST define the term data packet SHOULD describe packet switching and circuit switching COULD explain.
Electromagnetic Radiation23 Jan Class listSeating Plan ELECTROMAGNETIC RADIATION!!! 23 Jan 2012.
The thirteen colonies were established by what European country?
BY Zachary Hamer. Step one  First you will need to go to your desktop and click on the START button. A box should pop up.
POSTER TEMPLATE BY: Whitewater HTTP Vulnerabilities Nick Berry, Joe Joyce, & Kevin Vaccaro. Syntax & Routing Attempt to capture.
The Allies Strike Back Chapter 22 Section 2 Pages
It’s a Big Deal. ‘It’s a Big Deal’  If a photo is sent to you, do not send it to other people.  If you receive a photo from someone you.
Slides for Chapter 12: Coordination and Agreement From Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edition 4, © Pearson.
CSE 486/586 CSE 486/586 Distributed Systems Concurrency Control Steve Ko Computer Sciences and Engineering University at Buffalo.
CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems Concurrency Control Steve Ko Computer Sciences and Engineering University at Buffalo.
C: Result Q’s for Double Passages What will happen to the report now? A) It won't be approved in time. B) It won't be sent by overnight mail. C) It will.
Bullying Mediators Restorative Mediation. Bullying Mediator  This will build on your natural aptitude for helping others  Build on your listening skills.
Transportation Layer (1). Transportation Layer Very similar to the data link layer. – two hosts connected by a link or two hosts connected by a network.
1 Chapter 12 Consensus ( Fault Tolerance). 2 Reliable Systems Distributed processing creates faster systems by exploiting parallelism but also improve.
Byzantine Fault Tolerance in Stateful Web Service Yilei ZHANG 30/10/2009.
Lamport’s Logical Clocks & Totally Ordered Multicasting.
Dig Site 7 Blue Level Questions. 1.What did God send Joshua and the entire Israelite army to Ai to do? 1.Make a treaty with Ai 2.Attack Ai 3.Make a meal.
Bacon’s Rebellion and The French and Indian War
Chapter 1 Building Responsibility
Lessons from NASA on Intercultural Teamwork. After participating in the simulation participants should be able to: Recognize some of the differences in.
Welcome Back!!! TDHS School Year. Anyone do anything exciting?
Hernan Cortes.
Committed:Effects are installed to the database. Aborted:Does not execute to completion and any partial effects on database are erased. Consistent state:
Identifying Verbs Spanish. Spanish Verbs Welcome to Spanish 1010! I hope you enjoy your time in class. This introductory presentation will review two.
Chap 15. Agreement. Problem Processes need to agree on a single bit No link failures A process can fail by crashing (no malicious behavior) Messages take.
Logical Clocks. Topics r Logical clocks r Totally-Ordered Multicasting.
By: Veronica Roth.  Tris Prior: Tris is a girl who has fought in one big battle- a war. After she gets the mind control serum out of the way, there’s.
CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems Byzantine Fault Tolerance Steve Ko Computer Sciences and Engineering University at Buffalo.
Dig Site 15 Red Level Questions. What did the Lord tell Gideon about the size of his army? (7:2) 1.It was too small. 2.It was just the right size. 3.It.
Dealing with Conflict Relationships. What is Conflict? Conflict is a disagreement or struggle between two or more people. It happens in ALL relationships,
I Sam 11:1 – Who came up and encamped against Jabesh Gilead? # 11-1 A. Saul the Benjamite B. Nahash the Ammonite C. Goliath the Philistine.
Communication Process. Defining Communication On a sticky note, write down your own definition of communication. Be as detailed as possible. With a group,
From Al Scarfone. COLLABORATION A practice that is always performed by two or more people working together to receive a common goal, or achieve by agreeing.
CHAPTER 9 – THE GREEK WORLD Sparta and Athens Fight.
The Causes for Independence Objective: Understand why Texans wanted to be a nation separate from Mexico.
Guide By Phoebi Stewart. has changed the way we communicate with each other. Being able to send information quickly across the internet.
The Causes for Independence
Issues from telemedical-callflows
COMP28112 – Lecture 14 Byzantine fault tolerance: dealing with arbitrary failures The Byzantine Generals’ problem (Byzantine Agreement) 13-Oct-18 COMP28112.
The Struggle to Control North America
COMP28112 – Lecture 13 Byzantine fault tolerance: dealing with arbitrary failures The Byzantine Generals’ problem (Byzantine Agreement) 19-Nov-18 COMP28112.
Outline Introduction Background Distributed DBMS Architecture
Chapter 5 TCP Control Flow
COMP28112 – Lecture 13 Byzantine fault tolerance: dealing with arbitrary failures The Byzantine Generals’ problem (Byzantine Agreement) 22-Feb-19 COMP28112.
Writing Focus: Messages:
How did Rome’s location protect them from enemy attacks?
Ancient Rome: A New Power Rises
Presentation transcript:

 Two armies are camped on the outskirts of either side of an enemy city.

 The generals of the armies can only communicate via messengers who must travel through enemy territory and are thus subject to delays or capture.

Message

Acknowledgeme nt Message

 The two generals have previously agreed on a plan of attack, but they must communicate to set up the attack time.  If one army attacks but the other doesn’t they will be defeated and then the enemy city will defeat the other army.

 If the first general decides to send the message saying, ◦ “Let’s attack at noon tomorrow”

 One of three things could happen ◦ Scenario 1 ◦ Scenario 2 ◦ Scenario 3

 SCENARIO 1 The message could intercepted when it is being sent to the second general

Message

 SCENARIO 1  So what?  Well Army1 will attack at noon, but Army2 won’t.  Army1 will be defeated.  Army2 will be attacked and defeated.

 SCENARIO 2  The message could be received by the second general but the acknowledgement that is sent back could be intercepted.

Acknowledgeme nt Message

Acknowledgeme nt Message

Acknowledgeme nt Message

 SCENARIO 2  So what?  Well Army2 will attack at noon, but Army1 won’t know if the message was received so Army1 won’t attack in case Army2 doesn’t.  Army2 will be defeated.  Army1 will be attacked and defeated.

 SCENARIO 3  The message is received by the second general and the acknowledgement is sent back.

Acknowledgeme nt Message

 SCENARIO 3  So what?  Army1 and Army2 attacked together, and defeat the enemy.

 In groups of three or four, think of five ways to help ensure that both armies attack together.