Premium
Efficient and fair scheduling for two‐level information broadcasting systems
Author(s) -
Lee ByoungHoon,
Lim SungHwa,
Kim JaiHoon,
Cho WeDuke
Publication year - 2008
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1342
Subject(s) - computer science , popularity , scheduling (production processes) , scheme (mathematics) , computer network , broadcasting (networking) , psychology , mathematical analysis , social psychology , operations management , mathematics , economics
Abstract 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.