Biclique completion problems for multicast network design

Authors:
Nathalie Faure;Philippe ChréTienne;Eric Gourdin;Francis Sourd
Affiliations:
Artelys, 12 rue du Quatre Septembre, 75002 Paris, France;Université Pierre et Marie Curie / LIP6 4, place Jussieu, 75252 PARIS CEDEX 05, France;France Telecom / R&D / CORE / CPN 38, rue du General-Leclerc, 92794 Issy-les-Moulineaux Cedex 9, France;Université Pierre et Marie Curie / LIP6 4, place Jussieu, 75252 PARIS CEDEX 05, France
Venue:
Discrete Optimization
Year:
2007

Citing 10
Cited 2

The PIM architecture for wide-area multicast routing

IEEE/ACM Transactions on Networking (TON)
Optimum multicast of multimedia streams

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic algorithms for packing of multiple-group multicasting

Computers and Operations Research
Packing Steiner trees

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Aggregated Multicast for Scalable QoS Multicast Provisioning

IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
The maximum edge biclique problem is NP-complete

Discrete Applied Mathematics
Multiple multicast tree allocation in IP network

Computers and Operations Research
Aggregated Multicast—A Comparative Study

Cluster Computing
Multicast routing algorithms and protocols: a tutorial

IEEE Network: The Magazine of Global Internetworking

k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of aggregating several multicast sessions. A multicast session is defined as a subset of clients requiring the same information. Besides, each client can require several multicast sessions. A telecommunication network cannot manage many multicast sessions at the same time. It is hence necessary to group the sessions into a limited number of clusters. The problem then consists in aggregating the sessions into clusters to limit the number of unnecessary information sent to clients. The strong relationship of the problems with biclique problems in bipartite graph is established. We then model the problems using integer quadratic and linear programming formulations. We investigate some properties to strengthen the models. Several algorithms are provided and compared with a series of numerical experiments.