.png){kind=icon}
返回
Broadcast Scheduling With Multiple Concurrent Costs
.png){kind=icon}
PRE
AI
DOI：10.1109/TBC.2012.2191028.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Multiple costs
optimal periodic scheduling
wireless
期刊
IF:
4.8
论文数:
2.1K
被引数:
3.0K
机构
引用论文
分享收藏Do adverts increase the probability of finding online cognitive behavioural therapy for depression? Cross-sectional study.png)
BMJ Open
OAAI
BMJ OpenIF0
OAAI分享收藏
查看更多内容