Packet delay under the golden ratio weighted tdm policy in a multiple-access channel
IEEE Transactions on Information Theory
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
The scheduling of maintenance service
Discrete Applied Mathematics
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Optimal broadcasting of two files over an asymmetric channel
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile computing and communications
The Data Broadcast Problem with Preemption
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research
Layered multicast scheduling for the L∞ objective
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
Layered multicast is a scalable solution to data dissemination in heterogeneous networks such as the Internet. In this paper, we study the scheduling problem arising in the layered multicast context. Our goal is to generate a multicast schedule for two different objectives, i.e., to minimize the weighted sum (the L1 objective) of the per-layer average waiting time, and to minimize the maximum approximation ratio (the L∞ objective) of the subschedules on individual layers. Compared to the previous work on multicast scheduling, this paper addresses the data popularity and the interaction among layers simultaneously. We present a simple randomized algorithm for both objectives of the layered multicast scheduling problem. For the L1 objective, we provide a deterministic 2-approximation algorithm for the general multi-layer cases. For the L∞ objective, we present an algorithm for the two-layer case which is 1.6875-approximation ignoring an additive constant.