Efficient broadcast disks program construction in asymmetric communication environments

A well-known technique for broadcast program construction is the Broadcast Disks. However, it has important disadvantages, as for example that the broadcast program construction procedure leaves some parts of the broadcast program empty. This paper proposes a new approach for the construction of the broadcast program. Specifically, it presents three new algorithms, which face the problems of the Broadcast Disk Technique. According to our approach, the broadcast program is constructed with the minimum possible length, respecting the selected disk relative frequencies and keeps the average delays of retrieving data-items low. The constructed broadcast programs have no empty parts and retain their desired properties in any combination of disk relative frequencies. Experimental results show that this approach is more efficient than Broadcast Disks in all cases.