Efficient and fair scheduling for two-level information broadcasting systems

In a ubiquitous environment, there are many applications where a server disseminates information of common interest to pervasive clients and devices. For an example, an advertisement server sends information from a broadcast server to display devices. We propose an efficient information scheduling s...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and computation 2008-12, Vol.20 (18), p.2179-2200
Main Authors: Lee, Byoung-Hoon, Lim, Sung-Hwa, Kim, Jai-Hoon, Cho, We-Duke
Format: Article
Language:English
Subjects:
data popularity
fairness
two-level broadcasting
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a ubiquitous environment, there are many applications where a server disseminates information of common interest to pervasive clients and devices. For an example, an advertisement server sends information from a broadcast server to display devices. We propose an efficient information scheduling scheme for information broadcast systems to reduce average waiting time for information access while maintaining fairness between information items. Our scheme allocates information items adaptively according to relative popularity for each local server. Simulation results show that our scheme can reduce the waiting time up to 30% compared with the round robin scheme while maintaining cost‐effective fairness. Copyright © 2008 John Wiley & Sons, Ltd.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.1342