View article

Shlomi Dolev, Ariel Hanemann, Elad M Schiller, Shantanu Sharma

Goal: Simulate FIFO behavior over non-FIFO dynamic networks Page 1 Goal: Simulate FIFO behavior over non-FIFO dynamic networks Objective Concept 1 2 Properties of the Algorithm 5 Shlomi Dolev1, Ariel Hanemann1, Elad M. Schiller2, Shantanu Sharma1 1Ben-Gurion University of the Negev, Israel. 2Chalmers University of Technology, Sweden. An algorithm for a bounded capacity nonFIFO dynamic network, which ensures one time messages delivery at the receiver without omission, duplication, reorder • Error correcting bits • Alternating index • Distinct labels • Message to packet formation and via-versa The Sender does: • Transmission of packets infinitely often • Wait for ‘capacity + 1’ distinct labels acknowledgement before the next fetch The Receiver: • Collects packets of ‘capacity + 1’ distinct labels with identical alternating index before the delivery of messages Packet Formation at the Sender 3 • Self-…