Broadcast Scheduling With Multiple Concurrent Costs

Data dissemination via periodic broadcasting considers a set of items, each with a given request probability, size and scheduling cost. The goal is to construct a broadcast schedule that minimizes the mean query serving time and the mean scheduling cost at the same time. This task has been proven to...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on broadcasting 2012-06, Vol.58 (2), p.178-186
Main Authors: Liaskos, C., Xeros, A., Papadimitriou, G. I., Lestas, M., Pitsillides, A.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Broadcasting
Broadcasting. Videocommunications. Audiovisual
Complexity theory
Construction costs
Costs
Exact sciences and technology
Miscellaneous
Multiple costs
optimal periodic scheduling
Optimal scheduling
Optimization
Schedules
Scheduling
Tasks
Telecommunications
Telecommunications and information theory
wireless
Wireless communication
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:Data dissemination via periodic broadcasting considers a set of items, each with a given request probability, size and scheduling cost. The goal is to construct a broadcast schedule that minimizes the mean query serving time and the mean scheduling cost at the same time. This task has been proven to be NP-Hard, and related studies have gradually discarded the scheduling cost attribute in an effort to simplify the problem. The present study reinstates the cost attribute, as well as any number of additional cost attributes per data item. The proposed, MULTIOPT scheduling algorithm then achieves optimal mean serving time and mean values for all costs concurrently. Comparison with brute-force results and related approaches yield optimality in all tested cases.
ISSN:0018-9316
1557-9611
DOI:10.1109/TBC.2012.2191028