The complexity of RP selection in multicast channelization

Authors:
Fei Che;Errol L. Lloyd
Affiliations:
University of Delaware, Newark, DE;University of Delaware, Newark, DE
Venue:
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Year:
2009

Citing 8
Cited 0

An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Lower Bound to Finding Convex Hulls

Journal of the ACM (JACM)
A PTAS for the multiple knapsack problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Performance and Feasibility of Multicast Core Selection Heuristics

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Core selection methods for multicast routing

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Channelization Problem in Large Scale Data Dissemination

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rendezvous point (RP) selection for multicast groups is the problem of selecting a node to serve as the RP-host for a multicast group. We consider rendezvous point selection in the context of channelization where groups have been established based on user preferences for a set of available flows. Thus, each of the flows associated with a group will arrive at the node that serves as the RP-host for that group, from which those flows will be multicast to the group subscribers. We study the simultaneous assignment of RP-hosts for a collection of multicast groups with the dual goals of a) not overloading any single node serving as a host; and, b) minimizing the total network traffic. Toward those ends we consider two versions of the problem. For Bounded Host Assignment, we give a polynomial time algorithm for finding an optimal assignment. For Host Traffic Constrained Assignment, we establish that the problem is NP-complete and then study approximation algorithms. Simulation results are provided for the latter problem comparing the effectiveness of the solutions produced by our algorithms with optimal solutions.