Skip to main content

Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies

  • Conference paper
  • 957 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7129)

Abstract

In this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide solutions that either use a significant number of buffers (that is n buffers per processor, where n is the number of processors in the network) making the solution not scalable or, they reserve all the buffers from the sender to the receiver to forward only one message. The only solution that uses a constant number of buffers per link was introduced in [1]. However the solution works only on a chain networks. In this paper, we propose a snap-stabilizing algorithm for the message forwarding problem that uses a constant number of buffers per link as in [1] but works on tree topologies.

Keywords

  • Message Forwarding
  • Snap-stabilization
  • Token Circulation

This work has been supported in part by the ANR project SPADES (08-ANR-SEGI-025). Details of the project on http://graal.ens-lyon.fr/SPADES

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cournier, A., Dubois, S., Lamani, A., Petit, F., Villain, V.: Snap-Stabilizing Linear Message Forwarding. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 546–559. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  2. Dolev, S.: Self-stabilization. MIT Press (2000)

    Google Scholar 

  3. Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilization and PIF in tree networks. Distributed Computing 20, 3–19 (2007)

    MATH  Google Scholar 

  4. Duato, J.: A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks. IEEE Trans. Parallel Distrib. Syst. 7, 841–854 (1996)

    CrossRef  Google Scholar 

  5. Merlin, P.M., Schweitzer, P.J.: Deadlock avoidance in store-and-forward networks. In: Jerusalem Conference on Information Technology, pp. 577–581 (1978)

    Google Scholar 

  6. Toueg, S.: Deadlock- and livelock-free packet switching networks. In: STOC, pp. 94–99 (1980)

    Google Scholar 

  7. Toueg, S., Ullman, J.D.: Deadlock-free packet switching networks. SIAM J. Comput. 10, 594–611 (1981)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilizing end-to-end communication. Journal of High Speed Networks 5, 365–381 (1996)

    Google Scholar 

  9. Kushilevitz, E., Ostrovsky, R., Rosén, A.: Log-space polynomial end-to-end communication. In: STOC 1995: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, pp. 559–568. ACM (1995)

    Google Scholar 

  10. 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 Processing (IPDPS 2009), pp. 1–11 (2009)

    Google Scholar 

  11. Cournier, A., Dubois, S., Villain, V.: How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity? In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 195–208. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  12. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commum. ACM 17(11), 643–644 (1974)

    CrossRef  MATH  Google Scholar 

  13. Burns, J., Gouda, M., Miller, R.: On relaxing interleaving assumptions. In: Proceedings of the MCC Workshop on Self-Stabilizing Systems, MCC Technical Report No. STP-379-89 (1989)

    Google Scholar 

  14. Merlin, P.M., Schweitzer, P.J.: Deadlock avoidance in store-and-forward networks. In: Jerusalem Conference on Information Technology, pp. 577–581 (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cournier, A., Dubois, S., Lamani, A., Petit, F., Villain, V. (2012). Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds) Distributed Computing and Networking. ICDCN 2012. Lecture Notes in Computer Science, vol 7129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25959-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25959-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25958-6

  • Online ISBN: 978-3-642-25959-3

  • eBook Packages: Computer ScienceComputer Science (R0)