INDEXED MULTIDISK SCHEDULING ALGORITHMS FOR DATA BROADCASTING IN ASYMMETRIC NETWORK ENVIRONMENTS

Data broadcasting is an effective way for data dissemination in an asymmetric communication network, like wireless network. To minimize the tuning time of the broadcast schedule with skewed access probabilities of data items, two indexed multidisk scheduling algorithms, called IMD RI and IMD MUX are proposed. The theoretical analysis and experimental results indicate that both of them are effective algorithms, because they can significantly reduce the tuning time of the broadcast schedule, while still keeping the access time within reasonable limit.