ACM Home Page
Please provide us with feedback. Feedback
Scheduling methods for broadcasting multiple continuous media data
Full text pdf formatPdf (365 KB)
Source ACM International Workshop On Multimedia Databases archive
Proceedings of the 1st ACM international workshop on Multimedia databases table of contents
New Orleans, LA, USA
SESSION: Multimedia communications, relevance feedback and indexing table of contents
Pages: 40 - 47  
Year of Publication: 2003
ISBN:1-58113-726-5
Authors
Tomoki Yoshihisa  Osaka University, Osaka, Japan
Masahiko Tsukamoto  Osaka University, Osaka, Japan
Shojiro Nishio  Osaka University, Osaka, Japan
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
SIGMIS: ACM Special Interest Group on Management Information Systems
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 27,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/951676.951685
What is a DOI?

ABSTRACT

Recently, various schemes for broadcasting continuous media data such as music or movies have been studied. These schemes reduce the waiting time for playing the data under the continuity condition, i.e., playing continuous media data without any intermittence until the end of the data. These schemes usually employ multiple channels to broadcast the data. However, most clients are not able to receive data from multiple channels concurrently. In this paper, we propose methods for reducing client waiting time for multiple data via a single channel. In our proposed methods, we divide each data into several segments and produce a schedule that includes the first segment of each data more frequent than the rest. By changing the number of segments according to the playback ratio, client waiting time is effectively reduced.


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
J.-F. Paris, S.W. Carter, and D.D.E. Long. A hybrid broadcasting protocol for video on demand. Proc. Multimedia Computing and Networking Conference (MMCN '99) , pp.317--326, 1999.
 
4
5
6
 
7
L.-S. Juhn and L.M. Tseng. Fast data broadcasting and receiving scheme for popular video service. IEEE Trans. Broadcasting, Vol.44, No.1, pp.100--105, 1998.
 
8
L.-S. Juhn and L.M. Tseng. Harmonic broadcasting for video-on-demand service. IEEE Trans. Broadcasting , Vol.43, No.3, pp.268--271, 1997.
 
9
R. Braden, et al. Resource reservation protocol (RSVP), RFC 2205, 1997.
 
10
S. Viswanathan and T. Imilelinski. Pyramid broadcasting for video on demand service. Proc. SPIE Multimedia Computing and Networking Conference ( MMCN '95), pp.66--77, 1995.
 
11
T. Yoshihisa, M. Tsukamoto, and S. Nishio. Scheduling Methods Based on Data Division for Continuous Media Data Broadcast. IEEE Pacific Rim Conference Communications, Computers and Signal Processing (PACRIM '03), 2003.
 
12
Y.-C. Tseng, C.-M. Hsieh, M.-H. Yand, W.-H. Liao, and J.-P. Sheu. Data broadcasting and seamless channel transition for highly-demanded videos. Proc. IEEE INFOCOM'00, pp.727---736, 2000.

Collaborative Colleagues:
Tomoki Yoshihisa: colleagues
Masahiko Tsukamoto: colleagues
Shojiro Nishio: colleagues

Peer to Peer - Readers of this Article have also read: