Skip to main content
SpringerLink
Log in

Solving the quorumcast routing problem by constraint programming

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

The quorumcast routing problem is a generalization of multicasting which arises in many distributed applications. It consists of finding a minimum cost tree that spans the source node r and at least q out of m specified nodes on a given undirected weighted graph. This paper proposes a complete and an incomplete approach, both based on the same Constraint Programming (CP) model, but with two different specific search heuristics based on shortest paths. Experimental results show the efficiency of the two proposed approaches. Our complete approach (CP model + complete search) is better than the state of the art complete algorithm and our incomplete approach (CP model + incomplete search) is better than the state of the art incomplete algorithm. Moreover, the proposed complete search is better than the standard First-Fail search in the same CP model.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Althaus, E., Polzin, T., & Daneshmand, S. V. (2003). Improving linear programming approaches for the Steiner tree problem. In Experimental and efficient algorithms. Lecture notes in computer science, 2003. (Vol. 2647/2003, pp. 1–14).

  2. Cheung, S. Y., & Kumar, A. (1994). Efficient quorumcast routing algorithms. In Proceedings of INFOCOM’94 (pp. 840–847).

  3. Chimani, M., Kandyba, M., & Ljubic, P. M. I. (2009). Obtaining optimal k-cardinality trees fast. ACM Journal of Experimental Algorithmics, 14(2), 5.1–5.23.

    MathSciNet  Google Scholar 

  4. Comet (2011). Comet user manual, dynadec. http://dynadec.com/. Accessed 15 Sept 2010.

  5. Dilkina, B. N., & Gomes, C. P. (2010). Solving connected subgraph problems in wildlife conservation. In 6. 7th International conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2010) (pp. 102–116).

  6. Dooms, G., & Katriel, I. (2006). The minimum spanning tree constraint. In 12th international conference on principles and practice of constraint programming (CP2006) (pp. 211–225).

  7. Dooms, G., & Katriel, I. (2007). The “not-too-heavy spanning tree” constraint. In 4th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2007) (pp. 59–70).

  8. Du, B., Gu, J., Tsang, D., & Wang, W. (1996). Quorumcast routing by multispace search. In Proceedings of IEEE Globecom 1996 (pp. 1069–1073).

  9. Li, S., Melhem, R., & Znati, T. (2004). An efficient algorithm for constructing delay bounded minimum cost multicast trees. Journal of Parallel and Distributed Computing, 64, 1399–1413.

    Article  MATH  Google Scholar 

  10. Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G. W., Mutzel, P., & Fischetti, M. (2006). An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming, 105(2–3), 427–449.

    Article  MathSciNet  MATH  Google Scholar 

  11. Low, C. P. (1998). A fast search algorithm for the quorumcast routing problem. Information Processing Letters, 66, 87–92.

    Article  MathSciNet  MATH  Google Scholar 

  12. Noronha, T. F., Ribeiro, C. C., & Santos, A. C. (2010). Solving diameter-constrained minimum spanning tree problems by constraint programming. International Transactions in Operational Research, 17, 653–665.

    Article  MathSciNet  MATH  Google Scholar 

  13. Régin, J.-C. (2008). Simpler and incremental consistency checking and arc consistency filtering algorithms for the weighted spanning tree constraint. In 5th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2008) (pp. 233–247).

  14. Rossi, F., van Beek, P., & Walsh, T. (2006). Handbook of constraint programming. New York, U.S.A.: Elsevier Science Inc.

    MATH  Google Scholar 

  15. She, Q., Kannasoot, N., Jue, J. P., & Kim, Y.-C. (2009). On finding minimum cost tree for multi-resource manycast in mesh networks. Optical Switching and Networking, 6, 29–36.

    Article  Google Scholar 

  16. Wang, B., & Hou, J. C. (2004). An efficient QoS routing algorithm for quorumcast communication. Computer Networks Journal, 44(1), 43–61.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hanoi University of Science and Technology, 1 Dai Co Viet Road, Hanoi, Viet Nam

    Quang Dung Pham

  2. Université catholique de Louvain, 1348, Louvain-la-Neuve, Louvain, Belgium

    Yves Deville

Authors
  1. Quang Dung Pham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yves Deville
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Quang Dung Pham.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pham, Q.D., Deville, Y. Solving the quorumcast routing problem by constraint programming. Constraints 17, 409–431 (2012). https://doi.org/10.1007/s10601-012-9125-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-012-9125-z

Keywords

Search

Navigation