Efficient algorithms for constructing broadcast disks programs in asymmetric communication environments

Abstract

A well-known technique for broadcast program construction is the Broadcast Disks technique. However, in the Broadcast Disks approach there are some important disadvantages. For example some parts of the broadcast program remain empty during the construction procedure and the disk relative frequencies have to be selected very carefully. This paper gives a new approach of the broadcast program construction in a Broadcast Disk System, presenting three new algorithms, which face successfully these problems. According to this approach, the broadcast program is constructed with the minimum possible length, while retaining the selected disk relative frequencies and keeps the average delays on retrieving data-items low. The constructed broadcast programs have no empty parts, and retain their desired properties in any numbered combination of disk relative frequencies. We implemented all methods in a simulator application and experimental results show that our approach is more efficient than Broadcast Disks in all cases.