ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Data scheduling for multi-item requests in multi-channel on-demand broadcast environments
Full text PdfPdf (488 KB)
Source International Workshop on Data Engineering for Wireless and Mobile Access archive
Proceedings of the Seventh ACM International Workshop on Data Engineering for Wireless and Mobile Access table of contents
Vancouver, Canada
SESSION: Communication and pervasive services table of contents
Pages: 47-54  
Year of Publication: 2008
ISBN:978-1-60558-221-4
Authors
Kai Liu  City University of Hong Kong, Kowloon, Hong Kong
Victor C. S. Lee  City University of Hong Kong, Kowloon, Hong Kong
Karl R. P. H. Leung  Hong Kong Institute of Vocational Education (Tsing Yi), Hong Kong
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 17,   Citation Count: 0
Additional Information:

abstract   references   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/1626536.1626546
What is a DOI?

ABSTRACT

On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and capability to handle dynamic user access patterns. With the rapid development of mobile applications, there is an increasing need for systems to support efficient processing of requests for multiple data items in multiple channels broadcast environments. Few studies, however, have considered the on-demand scheduling mechanisms for multi-item requests in multi-channel broadcast environments. In this paper, we investigate the scheduling problems arising in this new environment and observe that existing single-item requests based algorithms are unable to perform efficiently. Two potential problems are identified and examined. First, these algorithms take an excessively long time to serve the last few data items in a request because they disregard the relationship between data items and their parent requests. We claim that these algorithms suffer the request starvation problem in scheduling multi-item requests. Second, these algorithms cannot achieve the expected performance gain with multiple channels. We observed a broadcast mismatch problem in multi-channel broadcast environments. Thus, we propose an innovative algorithm to solve these two potential problems. The simulation results show that the performance of the proposed algorithm is superior to other classical algorithms under a variety of circumstances.


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
D. Aksoy and M. Franklin. RXW: Scheduling for Large-scale On-demand Data Broadcasting. INFOCOM'98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, 1998.
 
2
D. Aksoy and M. Leung. Pull vs Push: a Quantitative Comparison for Data Broadcast. Global Telecommunications Conference, GLOBECOM'04 IEEE, 2004.
 
3
 
4
 
5
C. Hu and M. Chen. Adaptive Balanced Hybrid Data Delivery for Multi-channel Data Broadcast. IEEE International Conference on Communications, 2, 2002.
 
6
J. Huang and W. Peng. An Effective Broadcast Program Generation Algorithm for Dependent Data. Emerging Information Technology Conference, 2005., pages 119--122, 2005.
 
7
 
8
K.-W. Lam and S.-L. Hung. Scheduling Real-Time Requests in On-Demand Broadcast Environments. Lecture Notes in Computer Science, NBiS, LNCS, 4658:258ĺC267, 2007.
 
9
 
10
 
11
 
12
 
13
K. Liu and V. Lee. Analysis of Data Scheduling Algorithms for Multi-item Requests in Multi-channel On-demand Broadcast Environments. Technical Report, Computer Science Department, City University of Hong Kong, 2008.
 
14
 
15
16
17
 
18
 
19
A. Waluyo, B. Srinivasan, D. Taniar, and W. Rahayu. Incorporating Global Index with Data Placement Scheme for Multi Channels Mobile Broadcast Environment. EUC 2005 LNCS, 3824:755--764, 2005.
 
20
J. Wong. Broadcast Delivery. Proceedings of the IEEE, 76(12):1566--1577, 1988.
 
21
 
22
 
23
G. Zipf. Human Behavior and the Principle of Least Effort. 1949.

Collaborative Colleagues:
Kai Liu: colleagues
Victor C. S. Lee: colleagues
Karl R. P. H. Leung: colleagues