Analysis of Broadcast Delivery in a Videotex System
IEEE Transactions on Computers
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
CSIM19: CSIM19: a powerful tool for building system models
Proceedings of the 33nd conference on Winter simulation
A complementary approach to data broadcasting in mobile information systems
Data & Knowledge Engineering
Efficient Data Allocation over Multiple Channels at Broadcast Servers
IEEE Transactions on Computers
QEM: A Scheduling Method for Wireless Broadcast Data
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
A Lazy Data Request Approach for On-Demand Data Broadcasting
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
IEEE Transactions on Parallel and Distributed Systems
Scheduling dependent items in data broadcasting environments
Proceedings of the 2006 ACM symposium on Applied computing
Scheduling real-time requests in on-demand data broadcast environments
Real-Time Systems
Efficient index and data allocation for wireless broadcast services
Data & Knowledge Engineering
Broadcast scheduling: algorithms and complexity
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient heuristics for data broadcasting on multiple channels
Wireless Networks
A game approach for multi-channel allocation in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Data Broadcast with Adaptive Network Coding in Heterogeneous Wireless Networks
IEEE Transactions on Mobile Computing
FCLOS: A client-server architecture for mobile OLAP
Data & Knowledge Engineering
Profit-based on-demand broadcast scheduling of real-time multi-item requests
Proceedings of the 2010 ACM Symposium on Applied Computing
A data partition based near optimal scheduling algorithm for wireless multi-channel data broadcast
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
On the performance of real-time multi-item request scheduling in data broadcast environments
Journal of Systems and Software
An Enhanced Global Index for Location-Based Mobile Broadcast Services
AINA '10 Proceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and Applications
Transaction processing in a peer to peer database network
Data & Knowledge Engineering
Diagnostic Evaluation of Information Retrieval Models
ACM Transactions on Information Systems (TOIS)
Extracting hot spots of topics from time-stamped documents
Data & Knowledge Engineering
Utility driven optimization of real time data broadcast schedules
Applied Soft Computing
AIDOA: An Adaptive and Energy-Conserving Indexing Method for On-Demand Data Broadcasting Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A hybrid scheduling scheme for data broadcast over a single channel in mobile environments
Journal of Intelligent Manufacturing
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Hi-index | 0.00 |
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 request deadline miss ratio in scheduling multi-item requests has become an important task in the current architecture. In this paper, we prove the NP-hardness of broadcast scheduling of real-time multi-item requests in both single- and multi-channel environments. Furthermore, we propose two profit-based scheduling algorithms, PVC and SSA, for single- and multi-channel scheduling, respectively, both of which utilize our new concept ''profit'' of pending items and ''opportunity cost'' of pending requests. To the best of our knowledge, it is also the first time to introduce opportunity cost, which is derived from economics, into on-demand broadcast scheduling. Based on the scheduling result of PVC for pending requests, SSA is proposed to allocate selected items of scheduled requests to available channels. Finally, simulation results show great improvement in comparison with traditional algorithms. In general, PVC for single channel scheduling is superior to the best of other algorithms in terms of request deadline miss ratio. For multi-channel scheduling, SSA has larger advantage with increasing number of channels in terms of request deadline miss ratio than the best of other algorithms.