Then this information is wrong

Slides:



Advertisements
Similar presentations
The Important Thing About By. The Important Thing About ******** The important thing about ***** is *****. It is true s/he can *****, *****, and *****.
Advertisements

Add title Add a picture or a description. Question 1(True) Click to type your question here I have made this an easy True/false question true False Next.
I Love To Tell The Story I love to tell the story Of unseen things above, Of Jesus and His glory, Of Jesus and His love;
Chapter 13 Leader Election. Breaking the symmetry in system Similar to distributed mutual exclusion problems, the first process to enter the CS can be.
OSPF Header OSPF HEADER OSPF HEADER for this project Types we will use
Lecture 8: Asynchronous Network Algorithms
In peer-to-peer networks such as gnutella, each host must search out other hosts. When a host finds another host, these hosts become neighbors. Often a.
Why a lot of HKU students choose Mobile 3 Vivid, Liu Chu.
NQC: Control Structures: Branching Last updated 10/6/05 10:00am References: Baum Chapter 3 pp NQC Tutorial pp Baum Appendix D pg 368.
MPLS H/W update Brief description of the lab What it is? Why do we need it? Mechanisms and Protocols.
S A B D C T = 0 S gets message from above and sends messages to A, C and D S.
Distributed systems Module 2 -Distributed algorithms Teaching unit 1 – Basic techniques Ernesto Damiani University of Bozen Lesson 4 – Consensus and reliable.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
1 Internet Networking Spring 2006 Tutorial 3 Ad-hoc networks TBRPF (based on IETF tutorials on TBRPF)
Berkeley slides were used for this tutorial1 Internet Networking Spring 2006 Tutorial 2 DUAL Algorithm.
Introduction to computer networking Distributed Algorithms Class Recitation.
LEAP: Efficient Security Mechanisms for Large-Scale Distributed Sensor Networks By: Sencun Zhu, Sanjeev Setia, and Sushil Jajodia Presented By: Daryl Lonnon.
Friends and friendship.
Here I Am Send Me Take my hands They are Yours to use Take my feet
Carlos Rodrigo Aponte OLSRv2 High Level Overview.
1. I love to tell the story, Of unseen things above, Of Jesus and His glory, Of Jesus and His love; I love to tell the story Because I know 'tis true;
I Love to Tell the Story 1. I love to tell the story Of unseen things above, Of Jesus and His glory, Of Jesus and His love; I love to tell the story Because.
WHO AM I?
I’m not that dumb! Pick 4 ads from below. For each ad, choose one thing that the ad promises that is NOT true. Then write the truth. DELETE ALL OTHER SLIDES.
Page 1 Distributed Systems Election Algorithms* *referred to slides by Prof. Hugh C. Lauer at Worcester Polytechnic Institute.
Basics 2. Write a macro that … … uses a popup message box to say Hello. (msgbox ”Hello”) … writes the contents of the active cell in a message box. (you.
Article Of The Month Article 17 Every child has the right to reliable information from television, radio, newspapers and other types of communication.

-Example Questions / Statements: -What do I / you think will happen next? -What words / images do I / you expect to see or hear in this text? -What.
Presentation Skills Trainer. Make or Break Your Business in 30 Seconds.
120 I am an even number. 120 I am an even number. I am more than 100.
LO: to calculate a fraction of a number Next Page.
Chapter Objectives After completing this chapter you will be able to: Describe why SCSP is needed Describe the three phases of SCSP and how they are implemented.
In peer-to-peer networks such as gnutella, each host must search out other hosts. When a host finds another host, these hosts become neighbors. Often a.
Mental Maths LO: To add together coins and notes. Can you add together the coins and notes you see? Type your name and send: Next Slide.
Ad-hoc On Demand Distance Vector Protocol Hassan Gobjuka.
Rules A question will be asked. The first person to press the button will be given a chance to answer. Wrong answers do not count against you.
Computer Science Using Directional Antennas to Prevent Wormhole Attacks Stephen Thomas Acknowledgement: Portions of this presentation have been donated.
NDSS 2004Hu and Evans, UVa1 Using Directional Antennas to Prevent Wormhole Attacks Lingxuan Hu and David Evans [lingxuan, Department.
Who am I that You are mindful of me? That you hear me When I call Is it true that You are thinking of me? How You love me It's amazing.
Friend of God Who am I that You are mindful of me?
Tzu-Han Wu Yi-Chi Chiang Han-Yang Ou
Hwajung Lee. Mutual Exclusion CS p0 p1 p2 p3 Some applications are:  Resource sharing  Avoiding concurrent update on shared data  Controlling the.
CSC 8420 Advanced Operating Systems Georgia State University Yi Pan Transactions are communications with ACID property: Atomicity: all or nothing Consistency:
Give the best translation of the following forms:.
CIS 825 Lecture 9. Minimum Spanning tree construction Each node is a subtree/fragment by itself. Select the minimum outgoing edge of the fragment Send.
Geographical Routing Using Partial Information for Wireless Ad Hoc Networks Rahul Jain, Anuj Puri, and Raja Sengupta Department of EECS University of California,
Hello Educational presentation.
Snapshots, checkpoints, rollback, and restart
´cUlcitþnwgEføgR)ab;erOg
Welcome back.
To do While (1) Receive hello Search for more neighbors?
Lists C++ Standard template library list
Friend of God 1. Who am I that You are mindful of me?
شروط الموصي.
And the text with form..
BRAIN PART status update
Friend Of God.
and the properties. I named this lblName.
In peer-to-peer networks such as gnutella, each host must search out other hosts. When a host finds another host, these hosts become neighbors. Often a.
Garrett’s Story about Right and Wrong
What to do when a message arrives
Brad Karp UCL Computer Science
Angles on a straight line Vertically opposite angles
Simultaneous Equations
Shadows CSE 681.
I am A I have heard: no one A B Have heard list Have heard list.
Simultaneous Insertions in Tapestry
Look! I am about to do something new.
Presentation transcript:

Then this information is wrong Time out old neighbors Each neighbor sends hello every 10 seconds If a neighbor does not send a hello in 40 seconds, then remove the neighbor from the list When a hello arrives, update the “last time a hello arrived from the neighbor” Every now and then, if the “last time a hello arrived from the neighbor” is more than 40 seconds ago, then remove neighbor from lists Suppose node B crashes A B Then this information is wrong Have heard list Have heard list B and B hears me A and A hears me

Each neighbor sends hello every 10 seconds Time out old neighbors Each neighbor sends hello every 10 seconds If a neighbor does not send a hello in 40 seconds, then remove the neighbor from the list When a hello arrives, update the “last time a hello arrived from the neighbor” Every now and then, if the “last time a hello arrived from the neighbor” is more than 40 seconds ago, then remove neighbor from lists Current Time: 12:00:10 I am B I have heard: A A B Have heard list Have heard list B and B hears me A and A hears me Unidirectional Neighbors Bidirectional Neighbors Neighbor: HostId=B, lastTime=12:00:00

Each neighbor sends hello every 10 seconds Time out old neighbors Each neighbor sends hello every 10 seconds If a neighbor does not send a hello in 40 seconds, then remove the neighbor from the list When a hello arrives, update the “last time a hello arrived from the neighbor” Every now and then, if the “last time a hello arrived from the neighbor” is more than 40 seconds ago, then remove neighbor from lists Current Time: 12:00:10 Current Time: 12:00:20 I am B I have heard: A I am B I have heard: A A B Have heard list Have heard list B and B hears me A and A hears me Unidirectional Neighbors Bidirectional Neighbors Neighbor: HostId=B, lastTime=12:00:10

Each neighbor sends hello every 10 seconds Time out old neighbors Each neighbor sends hello every 10 seconds If a neighbor does not send a hello in 40 seconds, then remove the neighbor from the list When a hello arrives, update the “last time a hello arrived from the neighbor” Every now and then, if the “last time a hello arrived from the neighbor” is more than 40 seconds ago, then remove neighbor from lists Current Time: 12:00:20 Current Time: 12:00:30 I am B I have heard: A I am B I have heard: A A B Have heard list Have heard list B and B hears me A and A hears me Unidirectional Neighbors Bidirectional Neighbors Neighbor: HostId=B, lastTime=12:00:20

Each neighbor sends hello every 10 seconds Time out old neighbors Each neighbor sends hello every 10 seconds If a neighbor does not send a hello in 40 seconds, then remove the neighbor from the list When a hello arrives, update the “last time a hello arrived from the neighbor” Every now and then, if the “last time a hello arrived from the neighbor” is more than 40 seconds ago, then remove neighbor from lists Current Time: 12:00:30 Current Time: 12:00:40 Current Time: 12:00:70 Current Time: 12:00:50 I am B I have heard: A More than 40 seconds difference! A B Have heard list Have heard list B and B hears me A and A hears me Unidirectional Neighbors Bidirectional Neighbors Neighbor: HostId=B, lastTime=12:00:30

Each neighbor sends hello every 10 seconds Time out old neighbors Each neighbor sends hello every 10 seconds If a neighbor does not send a hello in 40 seconds, then remove the neighbor from the list When a hello arrives, update the “last time a hello arrived from the neighbor” Every now and then, if the “last time a hello arrived from the neighbor” is more than 40 seconds ago, then remove neighbor from lists Current Time: 12:00:70 More than 40 seconds difference! A B Have heard list Have heard list B and B hears me A and A hears me Unidirectional Neighbors Bidirectional Neighbors Neighbor: HostId=B, lastTime=12:00:30

Recall processing a hello message Received message from A if thisHost is in the helloMessage’s list of neighbors isBidirectional = True else isBidirectional = False if (isBidirectional == False) Add source of hello message to list of unidirectional neighbors, if not already in that list Update last time a hello was received if (isBidirectional == True) Add source of hello message to list of bidirectional neighbors, if not already in that list Remove source from list of unidirectional neighbor Recall processing a hello message for (NeighborInfo &neighbor : bidirectionalNeighbors) { if (neighbor == helloMessage.source) neighbor. updateTimeToCurrentTime(); } …. I am A I have heard: B, C, D A B Have heard list Have heard list B and B hears me A and A hears me Unidirectional Neighbors Bidirectional Neighbors Unidirectional Neighbors Bidirectional Neighbors B A

Each neighbor sends hello every 10 seconds Time out old neighbors Each neighbor sends hello every 10 seconds If a neighbor does not send a hello in 40 seconds, then remove the neighbor from the list When a hello arrives, update the “last time a hello arrived from the neighbor” Every now and then, if the “last time a hello arrived from the neighbor” is more than 40 seconds ago, then remove neighbor from lists Current Time: 12:00:70 More than 40 seconds difference! A B Have heard list Have heard list B and B hears me A and A hears me Unidirectional Neighbors Bidirectional Neighbors Neighbor: HostId=B, lastTime=12:00:30

Each neighbor sends hello every 10 seconds Time out old neighbors Each neighbor sends hello every 10 seconds If a neighbor does not send a hello in 40 seconds, then remove the neighbor from the list When a hello arrives, update the “last time a hello arrived from the neighbor” Every now and then, if the “last time a hello arrived from the neighbor” is more than 40 seconds ago, then remove neighbor from lists Current Time: 12:00:70 More than 40 seconds difference! A B Have heard list Have heard list B and B hears me A and A hears me Unidirectional Neighbors Bidirectional Neighbors Neighbor: HostId=B, lastTime=12:00:30

Time out old neighbors time_t currentTime, lastTimeNeighborsChecked; while (1) { // lots of other things time(&currentTime); if (difftime(currentTime, lastTimeNeighborsChecked)>=10) { for(NeighborInfo &neighbor : unidirectionalNeighbors) { if (difftime(currentTime, neighbor.timeWhenLastHelloArrived) > 40) { // remove old neighbor unidirectionalNeighbors.remove(neighbor); break; }