It is believed that broadcast is an efficient way to transmit data in an asymmetric communication system. Most of the previous work focused on either pull-based or push-based scheduling. However, for systems with a very large number of data items, none of these schemes is efficient. We propose a novel scheduling algorithm which uses both pull- and push-based schemes. In our approach, data items are divided into two disjoint sets: one consisting of more-popular items and the other of less-popular items. The items in the former set are broadcast by a push-based schedule, while those in the latter set by a pull-based schedule. By optimally selecting the cut-off point to distinguish these two sets, the new hybrid scheduling algorithm achieves a lower expected access time than other existing schedules.
A new hybrid broadcast scheduling algorithm for asymmetric communication systems: push and pull data based on optimal cut-off point
PINOTTI, Maria Cristina
2001
Abstract
It is believed that broadcast is an efficient way to transmit data in an asymmetric communication system. Most of the previous work focused on either pull-based or push-based scheduling. However, for systems with a very large number of data items, none of these schemes is efficient. We propose a novel scheduling algorithm which uses both pull- and push-based schemes. In our approach, data items are divided into two disjoint sets: one consisting of more-popular items and the other of less-popular items. The items in the former set are broadcast by a push-based schedule, while those in the latter set by a pull-based schedule. By optimally selecting the cut-off point to distinguish these two sets, the new hybrid scheduling algorithm achieves a lower expected access time than other existing schedules.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
