Object scheduling in broadcast systems for energy-limited clients

D. N. Serpanos, A. P. Traganitis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Broadcast systems are popular in push-based information distribution environments, where subscribing clients are randomly switched on. The main problem in these systems is to construct a periodic (cyclic) schedule, where in every cycle each information object is transmitted several times, depending on its size and popularity. Existing algorithms consider memory-less clients and construct optimal schedules that optimize the aggregate access delay for objects; thus, they minimize client energy consumption. In this work, we analyze broadcast systems with memory equipped (caching) clients. We change the scheduling optimization criterion to include actual object reception time and thus, we provide a more realistic model for estimation of actual client power consumption. We prove that caching clients achieve reduced object reception time, leading to improved energy consumption. We give a simple proof 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 an NP-hard problem, we propose and analyze heuristic schedule modifications in order to achieve perfect periodicity for the more popular objects; heuristics include object transmission interleaving, preemptive transmission and exchange of object transmission order.

Original languageEnglish
Title of host publicationProceedings - IEEE Symposium on Computers and Communications
Pages989-994
Number of pages6
DOIs
Publication statusPublished - 1 Dec 2002
Externally publishedYes
Event7th International Symposium on Computers and Communications, ISCC 2002 - Taormina-Giardini Naxos, Italy
Duration: 1 Jul 20024 Jul 2002

Other

Other7th International Symposium on Computers and Communications, ISCC 2002
CountryItaly
CityTaormina-Giardini Naxos
Period1/7/024/7/02

Fingerprint

Broadcast
Scheduling
Energy
Schedule
Energy utilization
Periodicity
Data storage equipment
Caching
Energy Consumption
Computational complexity
Electric power utilization
Heuristics
Cycle
Object
Interleaving
NP-hard Problems
Scheduler
Power Consumption
Optimise
Minimise

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software
  • Mathematics(all)
  • Signal Processing

Cite this

Serpanos, D. N., & Traganitis, A. P. (2002). Object scheduling in broadcast systems for energy-limited clients. In Proceedings - IEEE Symposium on Computers and Communications (pp. 989-994). [1021792] https://doi.org/10.1109/ISCC.2002.1021792

Object scheduling in broadcast systems for energy-limited clients. / Serpanos, D. N.; Traganitis, A. P.

Proceedings - IEEE Symposium on Computers and Communications. 2002. p. 989-994 1021792.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Serpanos, DN & Traganitis, AP 2002, Object scheduling in broadcast systems for energy-limited clients. in Proceedings - IEEE Symposium on Computers and Communications., 1021792, pp. 989-994, 7th International Symposium on Computers and Communications, ISCC 2002, Taormina-Giardini Naxos, Italy, 1/7/02. https://doi.org/10.1109/ISCC.2002.1021792
Serpanos DN, Traganitis AP. Object scheduling in broadcast systems for energy-limited clients. In Proceedings - IEEE Symposium on Computers and Communications. 2002. p. 989-994. 1021792 https://doi.org/10.1109/ISCC.2002.1021792
Serpanos, D. N. ; Traganitis, A. P. / Object scheduling in broadcast systems for energy-limited clients. Proceedings - IEEE Symposium on Computers and Communications. 2002. pp. 989-994
@inproceedings{7048fce39e5a42b7b8c06fe5d27c7968,
title = "Object scheduling in broadcast systems for energy-limited clients",
abstract = "Broadcast systems are popular in push-based information distribution environments, where subscribing clients are randomly switched on. The main problem in these systems is to construct a periodic (cyclic) schedule, where in every cycle each information object is transmitted several times, depending on its size and popularity. Existing algorithms consider memory-less clients and construct optimal schedules that optimize the aggregate access delay for objects; thus, they minimize client energy consumption. In this work, we analyze broadcast systems with memory equipped (caching) clients. We change the scheduling optimization criterion to include actual object reception time and thus, we provide a more realistic model for estimation of actual client power consumption. We prove that caching clients achieve reduced object reception time, leading to improved energy consumption. We give a simple proof 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 an NP-hard problem, we propose and analyze heuristic schedule modifications in order to achieve perfect periodicity for the more popular objects; heuristics include object transmission interleaving, preemptive transmission and exchange of object transmission order.",
author = "Serpanos, {D. N.} and Traganitis, {A. P.}",
year = "2002",
month = "12",
day = "1",
doi = "10.1109/ISCC.2002.1021792",
language = "English",
isbn = "0769516718",
pages = "989--994",
booktitle = "Proceedings - IEEE Symposium on Computers and Communications",

}

TY - GEN

T1 - Object scheduling in broadcast systems for energy-limited clients

AU - Serpanos, D. N.

AU - Traganitis, A. P.

PY - 2002/12/1

Y1 - 2002/12/1

N2 - Broadcast systems are popular in push-based information distribution environments, where subscribing clients are randomly switched on. The main problem in these systems is to construct a periodic (cyclic) schedule, where in every cycle each information object is transmitted several times, depending on its size and popularity. Existing algorithms consider memory-less clients and construct optimal schedules that optimize the aggregate access delay for objects; thus, they minimize client energy consumption. In this work, we analyze broadcast systems with memory equipped (caching) clients. We change the scheduling optimization criterion to include actual object reception time and thus, we provide a more realistic model for estimation of actual client power consumption. We prove that caching clients achieve reduced object reception time, leading to improved energy consumption. We give a simple proof 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 an NP-hard problem, we propose and analyze heuristic schedule modifications in order to achieve perfect periodicity for the more popular objects; heuristics include object transmission interleaving, preemptive transmission and exchange of object transmission order.

AB - Broadcast systems are popular in push-based information distribution environments, where subscribing clients are randomly switched on. The main problem in these systems is to construct a periodic (cyclic) schedule, where in every cycle each information object is transmitted several times, depending on its size and popularity. Existing algorithms consider memory-less clients and construct optimal schedules that optimize the aggregate access delay for objects; thus, they minimize client energy consumption. In this work, we analyze broadcast systems with memory equipped (caching) clients. We change the scheduling optimization criterion to include actual object reception time and thus, we provide a more realistic model for estimation of actual client power consumption. We prove that caching clients achieve reduced object reception time, leading to improved energy consumption. We give a simple proof 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 an NP-hard problem, we propose and analyze heuristic schedule modifications in order to achieve perfect periodicity for the more popular objects; heuristics include object transmission interleaving, preemptive transmission and exchange of object transmission order.

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

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

U2 - 10.1109/ISCC.2002.1021792

DO - 10.1109/ISCC.2002.1021792

M3 - Conference contribution

SN - 0769516718

SN - 9780769516714

SP - 989

EP - 994

BT - Proceedings - IEEE Symposium on Computers and Communications

ER -