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 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 van reduce the waiting time up to 30% compared with the round robin scheme while maintaining cost-effective fairness. Copyright (C) 2008 John Wiley & Sons, Ltd.
fairness two-level broadcasting data popularity