Skip to main content
SpringerLink
Log in

Dynamic Tree Switching for Distributed Message-Passing Applications

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

The changes in environmental parameters may demand switching between underlying topologies for better performance of distributed message passing applications. Arbitrary topology switching using distributed tree construction may lead to loss or redundancy in delivery of application messages. In this work, a set of algorithms has been proposed for dynamic switching between two spanning trees to offer better adaptivity towards the environment for different applications. Here, two extreme cases of spanning trees, a Breadth First Search (BFS) tree and a Depth First Search (DFS) tree, rooted at the core node, have been considered for switching. The core node initiates the switching and all other nodes cooperatively change their parents on the fly maintaining the DFS or BFS properties as required. However, the application remains transparent to the switching that assures the availability of the system at any instance of time. Simulation results show that each application message is delivered correctly to the destination without any loss or redundancy. The proposed scheme is scalable and the control message overhead for switching is linear with respect to the number of edges in the communication graph. Furthermore, there is no control message overhead to assure the delivery of application messages at the time of switching.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

References

  1. Andrews, G.R.: Paradigms for process interaction in distributed programs. ACM Comput. Surv. 23(1), 49–90 (1991)

    Article  Google Scholar 

  2. Annamalai, V., Gupta, S., Schwiebert, L.: On tree-based convergecasting in wireless sensor networks. In: Proceedings of IEEE Wireless Communication and Networking Conference, pp. 1942–1947 (2003)

  3. Awerbuch, B., Goldreich, O., Vainish, R., Peleg, D.: A trade-off between information and communication in broadcast protocols. J. ACM 37(2), 238–256 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ballardie, T., Francis, P., Crowcroft, J.: Core based trees (CBT). SIGCOMM Comput. Commun. Rev. 23(4), 85–95 (1993)

    Article  Google Scholar 

  5. Boulinier, C., Datta, A.K., Larmore, L.L., Petit, F.: Space efficient and time optimal distributed bfs tree construction. Inf. Process. Lett. 108, 273–278 (2008)

    Article  MathSciNet  Google Scholar 

  6. Chakraborty, S., Karmakar, S.: Adaptive convergecast by distributed topology switching. In: Proceedings of the 29th Brazilian Symposium on Computer Networks and Distributed Systems (SBRC 2011), pp. 545–557 (2011). http://www.lbd.dcc.ufmg.br/bdbcomp/servlet/Trabalho?id=10999

  7. Chen, T.S., Tsai, H.W., Chu, C.P.: Adjustable convergecast tree protocol for wireless sensor networks. Computer Communications 33, 559–570 (2010)

    Article  Google Scholar 

  8. Chlamtac, I., Kutten, S.: Tree-based broadcasting in multihop radio networks. IEEE Trans. Comput. 36, 1209–1223 (1987)

    Article  Google Scholar 

  9. Cournier, A., Rovedakis, S., Villain, V.: The first fully polynomial stabilizing algorithm for bfs tree construction. In: Proceedings of the 15th International conference on Principles of Distributed Systems, OPODIS’11, pp. 159–174 (2011)

  10. Dahan, S., Nicod, J.M., Philippe, L.: The distributed spanning tree: a scalable interconnection topology for efficient and equitable traversal. In: Proceedings of the IEEE International Symposium on Cluster Computing and the Grid, vol. 1, pp. 243–250 (2005)

  11. Derbel, B., Mosbah, M., Gruner, S.: Mobile agents implementing local computations in graphs. In: Graph Transformations (Proceedings of the 4th International Conference, ICGT 2008), Lecture Notes in Computer Science, vol. 5214, pp. 99–114 (2008)

  12. Fan, J., Ammar, M.H.: Dynamic topology configuration in service overlay networks: A study of reconfiguration policies. In: Proceedings of the 25th IEEE International Conference on Computer Communications (2006)

  13. Gandhi, R., Mishra, A., Parthasarathy, S.: Minimizing broadcast latency and redundancy in ad hoc networks. IEEE/ACM Trans. Netw. 16, 840–851 (2008)

    Article  Google Scholar 

  14. Grace, P., Coulson, G., Blair, G., Porter, B., Hughes, D.: Dynamic reconfiguration in sensor middleware. In: Proceedings of the International Workshop on Middleware for Sensor Networks (2006)

  15. Jain, A., Karmakar, S., Gupta, A.: Adaptive connected dominating set—an exercise in distributed output switching. In: Proceedings of the 8th International Conference on Distributed Computing and Networking, pp. 88–93 (2006)

  16. Javed, A., Khokhar, A.: Frequent pattern mining on message passing multiprocessor systems. Distrib. Parallel Databases 16(3), 321–334 (2004)

    Article  Google Scholar 

  17. Karmakar, S., Gupta, A.: Adaptive broadcast by fault-tolerant spanning tree switching. J. Parallel Distrib. Comput. 70(9), 889–906 (2010)

    Article  MATH  Google Scholar 

  18. Karmakar, S., Gupta, A.: Adaptive broadcast by distributed protocol switching. In: Proceedings of the 2007 ACM Symposium on Applied Computing, pp. 588–589 (2007)

  19. Karmakar, S., Gupta, A.: Self-stabilizing distributed protocol switching. In: Proceedings of the 9th International Conference on Distributed Computing and Networking, pp. 203–208 (2008)

  20. King, I., Ng, C.H., Sia, K.C.: Distributed content-based visual information retrieval system on peer-to-peer networks. ACM Trans. Inf. Syst. 22(3), 477–501 (2004)

    Article  Google Scholar 

  21. Koizumi, Y., Miyamura, T., Arakawa, S., Oki, E., Shiomoto, K., Murata, M.: Stability of virtual network topology control for overlay routing services. J. Opt. Netw. 7(7), 704–719 (2008)

    Article  Google Scholar 

  22. Li, C., Yu, B., Sycara, K.: An incentive mechanism for message relaying in unstructured peer-to-peer systems. Electron. Commer. Res. Appl. 8(6), 315–326 (2009)

    Google Scholar 

  23. Liu, X., van Renesse, R.: Fast protocol transition in a distributed environment (brief announcement). In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, p. 341 (2000)

  24. Liu, X., van Renesse, R., Bickford, M., Kreitz, C., Constable, R.: Protocol switching: exploiting meta-properties. In: Proceedings 21st International Conference on Distributed Computing Systems Workshops, pp. 37–42 (2001)

  25. Makki, S.A.M., Havas, G.: Distributed algorithms for depth-first search. Inf. Process. Lett. 60, 7–12 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  26. McLurkin, J.: Distributed algorithms for multi-robot systems. In: Proceedings of the 6th International Conference on Information Processing in Sensor Networks, pp. 545–546 (2007)

  27. Mocito, J., Rodrigues, L.: Run-time switching between total order algorithms. In: Euro-Par International 2006 Parallel Processing, Lecture Notes in Computer Science, vol. 4128, pp. 582–591 (2006)

  28. Ns-2 network simulator, version 2.34. http://www.isi.edu/nsnam/ns/

  29. Ogasa, T., Takahashi, Y., Ohsaki, H., Yagi, T., Murayama, J., Imase, M.: Dynamic topology reconfiguration method for service overlay networks using users’ community information. In: 2012 IEEE/IPSJ 12th International Symposium on Applications and the Internet, pp. 141–144 (2009)

  30. Ramirez, A., Knoester, D., Cheng, B., McKinley, P.: Applying genetic algorithms to decision making in autonomic computing systems. In: Proceedings of the 6th International Conference on Autonomic Computing, pp. 97–106 (2009)

  31. Tan, L., Zhan, X., Li, J., Zhao, F.: A novel tree-based broadcast algorithm for wireless ad hoc networks. Int. J. Wire. Mob. Comput. 1, 156–162 (2006)

    Article  Google Scholar 

  32. Yu, M., Yi, Y., Rexford, J., Chiang, M.: Rethinking virtual network embedding: substrate support for path splitting and migration. SIGCOMM Comput. Commun. Rev. 38(2), 17–29 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Guwahati, Guwahati, Assam, 781039, India

    Suchetana Chakraborty, Sandip Chakraborty, Sushanta Karmakar & Sukumar Nandi

Authors
  1. Suchetana Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandip Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sushanta Karmakar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sukumar Nandi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suchetana Chakraborty.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chakraborty, S., Chakraborty, S., Karmakar, S. et al. Dynamic Tree Switching for Distributed Message-Passing Applications. J Netw Syst Manage 23, 1–40 (2015). https://doi.org/10.1007/s10922-013-9275-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-013-9275-3

Keywords

Search

Navigation