Solving the quorumcast routing problem by constraint programming

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.

[1]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[2]  Young-Chon Kim,et al.  On finding minimum cost tree for multi-resource manycast in mesh networks , 2009, Opt. Switch. Netw..

[3]  Danny H. K. Tsang,et al.  Quorumcast routing by multispace search , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[4]  Jean-Charles Régin,et al.  Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint , 2008, CPAIOR.

[5]  Celso C. Ribeiro,et al.  Solving diameter-constrained minimum spanning tree problems by constraint programming , 2010, Int. Trans. Oper. Res..

[6]  Ernst Althaus,et al.  Improving Linear Programming Approaches for the Steiner Tree Problem , 2003, WEA.

[7]  Chor Ping Low.  A Fast Search Algorithm for the Quorumcast Routing Problem , 1998, Inf. Process. Lett..

[8]  Bin Wang,et al.  An efficient QoS routing algorithm for quorumcast communication , 2004, Comput. Networks.

[9]  Rami G. Melhem,et al.  An efficient algorithm for constructing delay bounded minimum cost multicast trees , 2004, J. Parallel Distributed Comput..

[10]  Irit Katriel,et al.  The "Not-Too-Heavy Spanning Tree" Constraint , 2007, CPAIOR.

[11]  Matteo Fischetti,et al.  An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem , 2006, Math. Program..

[12]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[13]  Bistra N. Dilkina,et al.  Solving Connected Subgraph Problems in Wildlife Conservation , 2010, CPAIOR.

[14]  Irit Katriel,et al.  The Minimum Spanning Tree Constraint , 2006, CP.

[15]  Akhil Kumar,et al.  Efficient quorumcast routing algorithms , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[16]  Markus Chimani,et al.  Obtaining Optimal k-Cardinality Trees Fast , 2008, ALENEX.