13.07.2015 Views

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

76 R. Shah and N.C. Hutch<strong>in</strong>sonset consists of node {6} and its elim<strong>in</strong>ated set consists of nodes {0, 1, 3, 7}.When node 6 receives a HOLD message it starts the selection process but endsup elim<strong>in</strong>at<strong>in</strong>g all nodes from its neighbour list and thus the process term<strong>in</strong>atesat this node. Nodes 4 and 9 are the other nodes that hold the message.1620573498162305 4 978(a)(b)Fig. 1. (a) A network partition of 10 nodes (b) Node positions after some mobilityAfter a while if node 0 has another application message for an unreachablehost, the nodes that are selected this time may be different from the ones previouslyselected as some of the nodes have moved to different positions as shown <strong>in</strong>Figure 1b. When node 0 executes the algorithm it aga<strong>in</strong> ends up with the pickedset {2, 4} but this time the elim<strong>in</strong>ated set does not conta<strong>in</strong> node 3. This timethe elim<strong>in</strong>ated set is {1, 5}. When node 2 starts its selection process it requeststhe neighbour list from nodes 3 and 6. Node 3 is also be<strong>in</strong>g considered <strong>by</strong> node4 at the same time. If node 3 receives a HOLD or a NACK message for thesame application message from node 4 before the NBREQ message from node 2arrives at node 3 then node 3 reports its status appropriately to node 2 eitherstat<strong>in</strong>g that it already holds the message (status=HELD) or it has been elim<strong>in</strong>atedfrom consideration (status=NACKED) <strong>by</strong> some node which has selectedone of its neighbours to hold the message (<strong>in</strong> the present scenario node 3 wouldreceive a HOLD message from node 4). Ideally we would like a node to receiveeither a NACK or a HOLD control message for a particular application messageand not both. This cannot be achieved because of distributed nature of the algorithmand chang<strong>in</strong>g neighbour lists of the nodes dur<strong>in</strong>g the execution of thealgorithm. Thus it is possible for a node to receive both a NACK and a HOLDmessage for the same application message and <strong>in</strong> any order. Aga<strong>in</strong> referr<strong>in</strong>g toFigure 1b, if node 3 receives the NBREQ message from node 2 before it receivesthe HOLD control message from node 4, then it will receive a HOLD message

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!