Data broadcast is a new kind of value-add service of DTV broadcasting and some data broadcast protocols have already been established. However, these protocols only describe the method for locating files in data streams, and a method for distribution of a large collection of files in one or more data streams is not provided. Research on this problem mainly focuses on how to decrease the wait time and some methods of allocating files on multiple streams based on access probability are proposed, but how to assign the file with a reasonable bandwidth is ignored. In this paper, we introduced an object multiplex algorithm to optimize the allocation of objects on a DTV channel. This method assigns different bandwidth statistically to a different object according to its size and access probability. In this method, both download time and wait time are considered. It adopts a modified virtual clock (VC) scheduling algorithm to multiplex files accurately and smoothly.
[1]
Lixia Zhang.
VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks
,
1991,
ACM Trans. Comput. Syst..
[2]
Rafael Alonso,et al.
Broadcast disks: data management for asymmetric communication environments
,
1995,
SIGMOD '95.
[3]
George Varghese,et al.
Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness
,
1997,
PODC '97.
[4]
Tomasz Imielinski,et al.
Data on Air: Organization and Access
,
1997,
IEEE Trans. Knowl. Data Eng..
[5]
Edwin A. Heredia.
Optimal object allocation for multimedia broadcast
,
1998,
Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).