Scheduling broadcasts in wireless networks

被引：0

作者：

Kalyanasundaram, Bala ^{[1
]}

Pruhs, Kirk ^{[2
]}

Velauthapillai, Mahe ^{[1
]}

机构：

[1] Dept. of Computer Science, Georgetown University, Washington,DC,20057, United States

[2] Dept. of Computer Science, University of Pittsburgh, Pittsburgh,PA,15260, United States

来源：

| 2000年 / Springer Verlag卷 / 1879期

关键词：

Wireless networks;

D O I：

10.1007/3-540-45253-2_27

中图分类号：

学科分类号：

摘要：

We consider problems involving how to schedule broadcasts in a pulled-based data-dissemination service, such as the DirecPC system, where data requested by the clients is delivered via broadcast. In particular, we consider the case where all the data items are of approximately equal in size and preemption is not allowed. We give an offline O(1)-speed O(1)-approximation algorithm for the problem of minimizing the average response time. We provide worst-case analysis, under various objective functions, of the online algorithms that have appeared in the literature, namely, Most Requests First, First Come First Served, and Longest Wait First. © Springer-Verlag Berlin Heidelberg 2000.

引用