ACM Home Page
Please provide us with feedback. Feedback
Efficient data access to multi-channel broadcast programs
Full text PdfPdf (199 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the twelfth international conference on Information and knowledge management table of contents
New Orleans, LA, USA
SESSION: Database session 3: data management in mobile environments table of contents
Pages: 153 - 160  
Year of Publication: 2003
ISBN:1-58113-723-0
Authors
Wai Gen Yee  Illinois Institute of Technology, Chicago, IL
Shamkant B. Navathe  Georgia Institute of Technology, Atlanta, GA
Sponsors
ACM: Association for Computing Machinery
SIGMIS: ACM Special Interest Group on Management Information Systems
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 52,   Citation Count: 5
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/956863.956893
What is a DOI?

ABSTRACT

This paper studies fast access to data that are broadcast on multiple channels. Broadcast is a useful data dissemination technique because of its scalability, but is lacking when it comes to response time. Increasing the number of available broadcast channels is a logical way of increasing throughput. Little work, however, has considered the access structures necessary for making effective use of the additional channels. We propose various indexing schemes for a multi-channel broadcast program. We demonstrate the effectiveness of our techniques in decreasing response time and tuning time via extensive experiments over a wide range of parameters.


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
 
4
K. C. Almeroth, M. H. Ammar, and Z. Fei. Scalable delivery of web pages using cyclic best-effort (udp) multicast. In Proc. IEEE INFOCOM, March 1998.
 
5
M. H. Ammar and J. W. Wong. The design of teletext broadcast cycles. Performance Evaluation, 5(4):235--242, December 1985.
6
 
7
M. J. Donahoo, M. H. Ammar, and E. W. Zegura. Multiple-channel multicast scheduling for scalable bulk-data transport. In Proc. IEEE INFOCOM, March 1999.
 
8
J. Fernandez and K. Ramamritham. Adaptive dissemination of data in time critical asymmetric communication environments. In Proceedings of Euromicro Real-Time Systems Symposium, pages 195--203, 1999.
9
 
10
GSM Association. Gsm world. Web Document, 2002. www.gsmworld.com.
11
12
13
14
 
15
D. H. Layer. Digital radio takes to the road. IEEE Spectrum, July 2001.
 
16
 
17
 
18
Marimba, Inc. Marimba, inc. web site. Web Document, 2002. www.marimba.com.
19
 
20
 
21
S. M. Ross. Introduction to Probability Models. Academic Press, 6th edition, 1997.
 
22
 
23
 
24
S. Vishwanathan and T. Imielinski. Pyramid broadcasting for video on demand service. In IEEE Multimedia Computing and Networks Conference, February 1995.
 
25
W. G. Yee and S. B. Navathe. Efficient generation of broadcast schedules. In Submitted for Publication, 2002.
 
26
W. G. Yee and S. B. Navathe. Fast data access on multiple broadcast streams. Technical report, Georgia Institute of Technology, May 2003.
 
27


Collaborative Colleagues:
Wai Gen Yee: colleagues
Shamkant B. Navathe: colleagues