Scheduling time-constrained multicast messages in circuit-switched tree networks

Authors:
Oh-Heum Kwon
Affiliations:
Pukyong National University, Electronics, Computer, and Communication Division, Daeyeon-dong 599-1, Nam-gu, 608-737 Pusan, South Korea
Venue:
Information Processing Letters
Year:
2002

Citing 3
Cited 0

On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems

SIAM Journal on Discrete Mathematics
Greedy local improvement and weighted set packing approximation

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Routing in the Internet (2nd ed.)

Routing in the Internet (2nd ed.)

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we consider a kind of multicast scheduling problem in a tree network. Each multicast message is transmitted through a directed subtree within the tree network. The transmission time of each multicast message is assumed to be one unit. Two messages can be transmitted at the same time if their subtrees are edge-disjoint. Each message is constrained by a ready time and a deadline, and has a weight we can gain if it is scheduled within its deadline. The optimality criterion is the total weight we gain. We assume that the degree of each subtree is bounded by a constant d and present an approximation algorithm of which the approximation ratio is at most 4d + 15.