Scheduling objects in broadcast systems with energy-limited clients

D. N. Serpanos, A. P. Traganitis

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Broadcast systems are the popular infrastructure in push-based information distribution environments, where information objects are transmitted to subscribing clients, who are randomly switched on. The main problem in these systems is the construction of a periodic schedule (in cycles), where in every cycle each information object is transmitted several times; the number of appearances of each object is a function of its size and popularity. Existing algorithms try to transmit each object in a cycle with perfect periodicity, i.e. all object instances (appearances) in the cycle are equally spaced in time. These algorithms construct optimal schedules for environments with memory-less clients, optimizing the aggregate access delay for objects, and thus, minimizing client energy consumption accordingly. In this article, we provide an analysis of broadcast systems for memory-equipped (caching) clients. We change the scheduling optimization criterion to include actual object reception time in addition to access time, and thus, we provide a more realistic model for estimation of actual client power consumption. We prove that memory-equipped clients change the system model significantly, and allow for reduced object reception time, leading to improved energy consumption by clients. We give a simple proof of the fact that perfect periodicity in object transmission within scheduling cycles is necessary for optimal schedule, and calculate the conditions that optimal schedulers must satisfy. Since perfect periodicity is practically impossible to achieve (the problem is NP-hard), we analyze heuristic modifications of the broadcast schedule in order to achieve perfect periodicity for the more popular objects; heuristics include object transmission interleaving, preemptive transmission and exchange of object transmission order. We prove that interleaving should always be avoided and we calculate the conditions under which preemptive transmission and exchange of object transmission order result in reduced aggregate object reception delay, in systems with memory-less and memory-equipped clients.

Original languageEnglish
Pages (from-to)1036-1042
Number of pages7
JournalComputer Communications
Volume27
Issue number10
DOIs
Publication statusPublished - 20 Jun 2004
Externally publishedYes

Fingerprint

Scheduling
Data storage equipment
Energy utilization
Computational complexity
Computer systems
Electric power utilization

Keywords

  • Broadcast scheduling
  • Broadcast systems
  • Energy-limited clients
  • Memory equipped clients
  • Memoryless clients

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Scheduling objects in broadcast systems with energy-limited clients. / Serpanos, D. N.; Traganitis, A. P.

In: Computer Communications, Vol. 27, No. 10, 20.06.2004, p. 1036-1042.

Research output: Contribution to journalArticle

Serpanos, D. N. ; Traganitis, A. P. / Scheduling objects in broadcast systems with energy-limited clients. In: Computer Communications. 2004 ; Vol. 27, No. 10. pp. 1036-1042.
@article{3cae510177d14473b9ea0fdb69f07eee,
title = "Scheduling objects in broadcast systems with energy-limited clients",
abstract = "Broadcast systems are the popular infrastructure in push-based information distribution environments, where information objects are transmitted to subscribing clients, who are randomly switched on. The main problem in these systems is the construction of a periodic schedule (in cycles), where in every cycle each information object is transmitted several times; the number of appearances of each object is a function of its size and popularity. Existing algorithms try to transmit each object in a cycle with perfect periodicity, i.e. all object instances (appearances) in the cycle are equally spaced in time. These algorithms construct optimal schedules for environments with memory-less clients, optimizing the aggregate access delay for objects, and thus, minimizing client energy consumption accordingly. In this article, we provide an analysis of broadcast systems for memory-equipped (caching) clients. We change the scheduling optimization criterion to include actual object reception time in addition to access time, and thus, we provide a more realistic model for estimation of actual client power consumption. We prove that memory-equipped clients change the system model significantly, and allow for reduced object reception time, leading to improved energy consumption by clients. We give a simple proof of the fact that perfect periodicity in object transmission within scheduling cycles is necessary for optimal schedule, and calculate the conditions that optimal schedulers must satisfy. Since perfect periodicity is practically impossible to achieve (the problem is NP-hard), we analyze heuristic modifications of the broadcast schedule in order to achieve perfect periodicity for the more popular objects; heuristics include object transmission interleaving, preemptive transmission and exchange of object transmission order. We prove that interleaving should always be avoided and we calculate the conditions under which preemptive transmission and exchange of object transmission order result in reduced aggregate object reception delay, in systems with memory-less and memory-equipped clients.",
keywords = "Broadcast scheduling, Broadcast systems, Energy-limited clients, Memory equipped clients, Memoryless clients",
author = "Serpanos, {D. N.} and Traganitis, {A. P.}",
year = "2004",
month = "6",
day = "20",
doi = "10.1016/j.comcom.2004.01.022",
language = "English",
volume = "27",
pages = "1036--1042",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "10",

}

TY - JOUR

T1 - Scheduling objects in broadcast systems with energy-limited clients

AU - Serpanos, D. N.

AU - Traganitis, A. P.

PY - 2004/6/20

Y1 - 2004/6/20

N2 - Broadcast systems are the popular infrastructure in push-based information distribution environments, where information objects are transmitted to subscribing clients, who are randomly switched on. The main problem in these systems is the construction of a periodic schedule (in cycles), where in every cycle each information object is transmitted several times; the number of appearances of each object is a function of its size and popularity. Existing algorithms try to transmit each object in a cycle with perfect periodicity, i.e. all object instances (appearances) in the cycle are equally spaced in time. These algorithms construct optimal schedules for environments with memory-less clients, optimizing the aggregate access delay for objects, and thus, minimizing client energy consumption accordingly. In this article, we provide an analysis of broadcast systems for memory-equipped (caching) clients. We change the scheduling optimization criterion to include actual object reception time in addition to access time, and thus, we provide a more realistic model for estimation of actual client power consumption. We prove that memory-equipped clients change the system model significantly, and allow for reduced object reception time, leading to improved energy consumption by clients. We give a simple proof of the fact that perfect periodicity in object transmission within scheduling cycles is necessary for optimal schedule, and calculate the conditions that optimal schedulers must satisfy. Since perfect periodicity is practically impossible to achieve (the problem is NP-hard), we analyze heuristic modifications of the broadcast schedule in order to achieve perfect periodicity for the more popular objects; heuristics include object transmission interleaving, preemptive transmission and exchange of object transmission order. We prove that interleaving should always be avoided and we calculate the conditions under which preemptive transmission and exchange of object transmission order result in reduced aggregate object reception delay, in systems with memory-less and memory-equipped clients.

AB - Broadcast systems are the popular infrastructure in push-based information distribution environments, where information objects are transmitted to subscribing clients, who are randomly switched on. The main problem in these systems is the construction of a periodic schedule (in cycles), where in every cycle each information object is transmitted several times; the number of appearances of each object is a function of its size and popularity. Existing algorithms try to transmit each object in a cycle with perfect periodicity, i.e. all object instances (appearances) in the cycle are equally spaced in time. These algorithms construct optimal schedules for environments with memory-less clients, optimizing the aggregate access delay for objects, and thus, minimizing client energy consumption accordingly. In this article, we provide an analysis of broadcast systems for memory-equipped (caching) clients. We change the scheduling optimization criterion to include actual object reception time in addition to access time, and thus, we provide a more realistic model for estimation of actual client power consumption. We prove that memory-equipped clients change the system model significantly, and allow for reduced object reception time, leading to improved energy consumption by clients. We give a simple proof of the fact that perfect periodicity in object transmission within scheduling cycles is necessary for optimal schedule, and calculate the conditions that optimal schedulers must satisfy. Since perfect periodicity is practically impossible to achieve (the problem is NP-hard), we analyze heuristic modifications of the broadcast schedule in order to achieve perfect periodicity for the more popular objects; heuristics include object transmission interleaving, preemptive transmission and exchange of object transmission order. We prove that interleaving should always be avoided and we calculate the conditions under which preemptive transmission and exchange of object transmission order result in reduced aggregate object reception delay, in systems with memory-less and memory-equipped clients.

KW - Broadcast scheduling

KW - Broadcast systems

KW - Energy-limited clients

KW - Memory equipped clients

KW - Memoryless clients

UR - http://www.scopus.com/inward/record.url?scp=1942516854&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1942516854&partnerID=8YFLogxK

U2 - 10.1016/j.comcom.2004.01.022

DO - 10.1016/j.comcom.2004.01.022

M3 - Article

AN - SCOPUS:1942516854

VL - 27

SP - 1036

EP - 1042

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 10

ER -