Layered Multicast Scheduling
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
Case Western Reserve University School of Graduate Studies / OhioLINK
2008
|
| Subjects: | |
| Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=case1205436479 |
| id |
ndltd-OhioLink-oai-etd.ohiolink.edu-case1205436479 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-OhioLink-oai-etd.ohiolink.edu-case12054364792021-08-03T05:32:35Z Layered Multicast Scheduling Cai, Qingbo Computer Science Network Apporximation Algorithm Layered multicast Scheduling <p>Layered multicast addresses the problem of heterogeneous end-to-end network bandwidth and consequently is a scalable solution to data dissemination in heterogeneous networks such as the Internet. The performance of layered multicast hingesupon the transmission schedule. In this dissertation, we study the scheduling problem in the layered multicast context. Our objective is to generate a multicast schedulewith or without the knowledge of the user subscription profiles such that the long run average latency for a client to retrieve a data item is minimized. This work generalizesthe extensively studied multicast scheduling problem (layered and non-layered) by introducing simultaneously data popularity and the interaction among layers, andaddresses both the L<sub>1</sub> and the strictest L<sub>∞</sub> objective to find a schedule which is good for all individual layers.</p><p>We present a simple 2-approximation randomized algorithm for the layered multicast scheduling problem. In the presence of user subscription profiles (the L<sub>1</sub> objective), we provide a deterministic 2-approximation algorithm for the general multilayer cases. If the user subscription profiles are absent (the L<sub>∞</sub> objective), we present a combinatorial construction for the two-layer case which is 1.6875-approximation ignoring an additive constant. Further, we provide a polynomial-time approximation algorithm that uses a fundamentally different approach and can address the general layered multicast scheduling problem with an arbitrary number of layers. This algorithm is 1.334-approximation for the two-layer case and 1.862-approximation for the general multi-layer cases.</p> 2008-03-18 English text Case Western Reserve University School of Graduate Studies / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=case1205436479 http://rave.ohiolink.edu/etdc/view?acc_num=case1205436479 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws. |
| collection |
NDLTD |
| language |
English |
| sources |
NDLTD |
| topic |
Computer Science Network Apporximation Algorithm Layered multicast Scheduling |
| spellingShingle |
Computer Science Network Apporximation Algorithm Layered multicast Scheduling Cai, Qingbo Layered Multicast Scheduling |
| author |
Cai, Qingbo |
| author_facet |
Cai, Qingbo |
| author_sort |
Cai, Qingbo |
| title |
Layered Multicast Scheduling |
| title_short |
Layered Multicast Scheduling |
| title_full |
Layered Multicast Scheduling |
| title_fullStr |
Layered Multicast Scheduling |
| title_full_unstemmed |
Layered Multicast Scheduling |
| title_sort |
layered multicast scheduling |
| publisher |
Case Western Reserve University School of Graduate Studies / OhioLINK |
| publishDate |
2008 |
| url |
http://rave.ohiolink.edu/etdc/view?acc_num=case1205436479 |
| work_keys_str_mv |
AT caiqingbo layeredmulticastscheduling |
| _version_ |
1719421507550052352 |