ABSTRACT

This system will address the problem of online scheduling sequential data objects with the principle of periodicity in the context of dynamic information dissemination. Many modern information applications spread dynamically generated data objects and answer the complex query for retrieving multiple data objects. In dynamic environments, data streams need to be online processed rather than being stored and later retrieved to answer queries. Particularly, data objects are produced dynamically by the information providers, interleaved and disseminated efficiently by the broadcasting servers, and associated sequentially in the client sides. The proposed algorithm with a well-specific gain measure function prominently outperforms the FIFO schedule and is able to minimize the mean service access time to the extent close to the theoretical optimum.