ACM Home Page
Please provide us with feedback. Feedback
TOSA: a near-optimal scheduling algorithm for multi-channel data broadcast
Full text PdfPdf (388 KB)
Source International Conference On Mobile Data Management archive
Proceedings of the 6th international conference on Mobile data management table of contents
Ayia Napa, Cyprus
SESSION: Broadcast scheduling table of contents
Pages: 29 - 37  
Year of Publication: 2005
ISBN:1-59593-041-8
Authors
Baihua Zheng  Singapore Management University
Xia Wu  Hong Kong University of Science and Technology
Xing Jin  Hong Kong University of Science and Technology
Dik Lun Lee  Hong Kong University of Science and Technology
Sponsors
: University of Cyprus
SIGMOD: ACM Special Interest Group on Management of Data
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 21,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1071246.1071252
What is a DOI?

ABSTRACT

Wireless broadcast is very suitable for delivering information to a large user population. In this paper, we concentrate on data allocation methods for multiple broadcast channels. To the best of our knowledge, this is the first allocation model that takes into the consideration of items' access frequencies, items' lengths. and bandwidth of different channels. We first derive the optimal average expected delay for multiple channels for the general case where data access frequencies, data sizes, and channel bandwidths can all be non-uniform. Second, we develop TOSA, a multi-channel allocation method that does not assume a uniform broadcast schedule for data items on the same channel. TOSA is based on the idea of two-level data allocation, i.e., a high-level optimization step for allocating data to the channels, followed by a low-level optimization step to schedule data within a channel. We show that TOSA achieves near-optimal performance in terms of average waiting time and significantly outperforms the existing algorithms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
G. H. Hardy, J. E. Littlewood, and G. Plya. Further Remarks on Method: The Inequality of Schwarz. Cambridge University Press, 1952.
 
4
 
5
 
6
A. R. Hurson, Y. C. Chehadeh, and J. Hannan. Object organization on parallel broadcast channels in a global information sharing environment. In Proceedings of 19th IEEE International Performance, Computing, and Communications Conference (IPCCC'00), February 2000.
 
7
 
8
 
9
 
10
H. Schwetman. Mesquite Software, Inc, http://www.mesquite.com, 1998.
 
11
 
12
N. H. Vaidya and S. Hameed. Data broadcast in asymmetric environments. In Proceedings of the 1st International Workshop on Satellite-based Information Services (WOSBIS'96), Rye, NY, USA, November 1996.
13
 
14

CITED BY  8

Collaborative Colleagues:
Baihua Zheng: colleagues
Xia Wu: colleagues
Xing Jin: colleagues
Dik Lun Lee: colleagues