Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Approximation Algorithms for Layered Multicast Scheduling
verfasst von : Qingbo Cai, Vincenzo Liberatore
Erschienen in: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
L
1
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
L
1
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.