Assignment of multicast groups to publish/subscribe topics in multi-domain networks

We address a problem where binary vectors need to be assigned to groups. The vectors are distributed among two or more domains. No two vectors from two different domains may be assigned to the same group. However, a domain may donate groups to another domain if this would improve the overall assignment. This problem arises in the context of assigning multicast groups to publish/subscriber topics in multi-domain networks. We present an ILP formulation of the problem, and a randomized iterative algorithm. We prove that the iterative algorithm converges to optimum. We evaluate the convergence time empirically.