Efficient broadcast disks program construction in asymmetric communication environments
Eleftherios Tiakas, Stefanos Ougiaroglou, Petros Nicopolitidis · 2007
A well-known technique for broadcast program construction is the Broadcast Disks. However, in this approach there are some important disadvantages, as for example that the broadcast program construction procedure leaves some parts of the broadcast program empty (without information data). 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. We implemented all methods in a simulator to make several experiments. Experimental results show that this approach is more efficient than Broadcast Disks in all cases.