On-line scheduling sequential objects for dynamic information dissemination

Chih Lin Hu, Ming Syan Chen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Many modern information applications spread dynamic data objects and process complex queries for retrieving multiple data objects. This paper studies the broadcast scheduling design for dynamic information dissemination. We formulate the problem of scheduling sequential data objects in an on-line fashion and derive the lower and the upper bounds of mean service access time. Accordingly, we further present several heuristic functions to approximate the schedule optimization. The experimental results show that the proposed design is able to on-line generate a broadcast schedule whose mean service access time is very close to the theoretical optimum.

Original languageEnglish
Title of host publicationGLOBECOM'05
Subtitle of host publicationIEEE Global Telecommunications Conference, 2005
Pages105-109
Number of pages5
DOIs
StatePublished - 2005
EventGLOBECOM'05: IEEE Global Telecommunications Conference, 2005 - St. Louis, MO, United States
Duration: 28 Nov 20052 Dec 2005

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference
Volume1

Conference

ConferenceGLOBECOM'05: IEEE Global Telecommunications Conference, 2005
Country/TerritoryUnited States
CitySt. Louis, MO
Period28/11/052/12/05

Fingerprint

Dive into the research topics of 'On-line scheduling sequential objects for dynamic information dissemination'. Together they form a unique fingerprint.

Cite this