Profit-based on-demand broadcast scheduling of real-time multi-item requests

Authors:
Jingsong Lv;Victor Lee;Minming Li;Enhong Chen
Affiliations:
University of Science and Technology of China, Hefei, Anhui, China;City University of Hong Kong, Kowloon, Hong Kong;City University of Hong Kong, Kowloon, Hong Kong;University of Science and Technology of China, Hefei, Anhui, China
Venue:
Proceedings of the 2010 ACM Symposium on Applied Computing
Year:
2010

Citing 4
Cited 1

Analysis of Broadcast Delivery in a Videotex System

IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
CSIM19: CSIM19: a powerful tool for building system models

Proceedings of the 33nd conference on Winter simulation
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation

IEEE Transactions on Parallel and Distributed Systems

Editorial: Profit-based scheduling and channel allocation for multi-item requests in real-time on-demand data broadcast systems

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

On-demand broadcast is a widely accepted approach for dynamic and scalable wireless information dissemination systems. With the proliferation of real-time applications, minimizing the deadline miss ratio in scheduling multi-item requests becomes an emergent task in the current architecture. In this paper, we propose a profit-based scheduling algorithm, called PVC, which utilizes two new concepts "profit" of a data item and "opportunity cost" of a request. Note that, to the best of our knowledge, it is also the first time to introduce opportunity cost, which is derived from economics, into on-demand scheduling. Finally, the simulation results show the great improvement in comparison with traditional algorithms. On average, PVC has more than 5% advantage in terms of deadline miss ratio than the best of others.