Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-FIFO) dynamic networks

  • Authors:
  • Shlomi Dolev;Ariel Hanemann;Elad Michael Schiller;Shantanu Sharma

  • Affiliations:
  • Department of Computer Science, Ben-Gurion University of the Negev, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Israel;Department of Computer Science and Engineering, Chalmers University of Technology, Sweden;Department of Computer Science, Ben-Gurion University of the Negev, Israel

  • Venue:
  • SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

End-to-end communication over the network layer (or data link in overlay networks) is one of the most important communication tasks in every communication network, including legacy communication networks as well as mobile ad hoc networks, peer-to-peer networks and mash networks. We study end-to-end algorithms that exchange packets to deliver (high level) messages in FIFO order without omissions or duplications. We present a self-stabilizing end-to-end algorithm that can be applied to networks of bounded capacity that omit, duplicate and reorder packets. The algorithm is network topology independent, and hence suitable for always changing dynamic networks with any churn rate.