Self-stabilizing End-to-End Communication in (Bounded Capacity, Omitting, Duplicating and non-FIFO) Dynamic Networks

(Extended Abstract)
  • Shlomi Dolev
  • Ariel Hanemann
  • Elad Michael Schiller
  • Shantanu Sharma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7596)


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.


Dynamic Network Leader Election Transient Fault Distinct Label Communication Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Afek, Y., Brown, G.M.: Self-stabilization over unreliable communication media. Distributed Computing 7(1), 27–34 (1993)CrossRefGoogle Scholar
  2. 2.
    Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction. In: FOCS, pp. 268–277. IEEE Computer Society (1991)Google Scholar
  3. 3.
    Bui, A., Datta, A.K., Petit, F., Villain, V.: State-optimal snap-stabilizing pif in tree networks. In: Workshop on Self-stabilizing Systems (ICDCS 1999), pp. 78–85. IEEE Computer Society (1999)Google Scholar
  4. 4.
    Chung, H.C., Robinson, P., Welch, J.L.: Brief Announcement: Regional Consecutive Leader Election in Mobile Ad-Hoc Networks. In: Scheideler, C. (ed.) ALGOSENSORS 2010. LNCS, vol. 6451, pp. 89–91. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Cournier, A., Dubois, S., Villain, V.: A snap-stabilizing point-to-point communication protocol in message-switched networks. In: 23rd IEEE International Symposium on Parallel and Distributed (IPDPS 2009), pp. 1–11 (2009)Google Scholar
  6. 6.
    Datta, A.K., Larmore, L.L., Piniganti, H.: Self-stabilizing Leader Election in Dynamic Networks. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 35–49. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. 7.
    Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)zbMATHCrossRefGoogle Scholar
  8. 8.
    Dolev, S.: Self-Stabilization. MIT Press (2000)Google Scholar
  9. 9.
    Dolev, S., Dubois, S., Potop-Butucaru, M., Tixeuil, S.: Stabilizing data-link over non-fifo channels with optimal fault-resilience. Inf. Process. Lett. 111(18), 912–920 (2011)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Dolev, S., Hanemann, A., Schiller, E.M., Sharma, S.: Self-stabilizing data link over non-fifo channels without duplication. Technical Report 2012:01, Chalmers University of Technology (2012) ISSN 1652-926XGoogle Scholar
  11. 11.
    Dolev, S., Israeli, A., Moran, S.: Resource bounds for self-stabilizing message-driven protocols. SIAM J. Comput. 26(1), 273–290 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilitzing group communication in ad hoc networks. In: PODC, p. 259 (2002)Google Scholar
  13. 13.
    Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilizing group communication in ad-hoc networks. In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), pp. 70–79 (2002)Google Scholar
  14. 14.
    Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput. 5(7), 893–905 (2006)CrossRefGoogle Scholar
  15. 15.
    Dolev, S., Welch, J.L.: Crash resilient communication in dynamic networks. IEEE Trans. Computers 46(1), 14–26 (1997)CrossRefGoogle Scholar
  16. 16.
    Flauzac, O., Villain, V.: An implementable dynamic automatic self-stabilizing protocol. In: ISPAN, pp. 91–97. IEEE Computer Society (1997)Google Scholar
  17. 17.
    Gouda, M.G., Multari, N.J.: Stabilizing communication protocols. IEEE Trans. Computers 40(4), 448–458 (1991)CrossRefGoogle Scholar
  18. 18.
    Haeupler, B., Karger, D.R.: Faster information dissemination in dynamic networks via network coding. In: 30th Annual ACM Symposium on Principles of Distributed Computing (PODC 2011), pp. 381–390 (2011)Google Scholar
  19. 19.
    Ingram, R., Shields, P., Walter, J.E., Welch, J.L.: An asynchronous leader election algorithm for dynamic networks. In: 23rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2009), pp. 1–12 (2009)Google Scholar
  20. 20.
    Jelasity, M., Montresor, A., Babaoglu, Ö.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219–252 (2005)CrossRefGoogle Scholar
  21. 21.
    Kuhn, F., Locher, T., Oshman, R.: Gradient clock synchronization in dynamic networks. Theory Comput. Syst. 49(4), 781–816 (2011)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: ACM Symposium on Theory of Computing (STOC 2010), pp. 513–522 (2010)Google Scholar
  23. 23.
    Kuhn, F., Oshman, R., Moses, Y.: Coordinated consensus in dynamic networks. In: 30th ACM Symposium on Principles of Distributed Computing (PODC 2011), pp. 1–10 (2011)Google Scholar
  24. 24.
    Spinelli, J.: Self-stabilizing sliding window arq protocols. IEEE/ACM Trans. Netw. 5(2), 245–254 (1997)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Tanenbaum, A.S.: Computer networks, 4th edn. Prentice-Hall (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Shlomi Dolev
    • 1
  • Ariel Hanemann
    • 1
  • Elad Michael Schiller
    • 2
  • Shantanu Sharma
    • 1
  1. 1.Department of Computer ScienceBen-Gurion University of the NegevIsrael
  2. 2.Department of Computer Science and EngineeringChalmers University of TechnologySweden

Personalised recommendations