.png){kind=icon}
返回
Coding-Based Data Broadcast Scheduling in On-Demand Broadcast
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2011.092011.101652.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
According to data broadcast, we can satisfy multiple requests for the same data item in a broadcast tick. However, there is no significant breakthrough in performance improvement until recently that some studies proposed to use network coding in data broadcast. After broadcasting an encoded packet which encodes a number of data items, multiple clients can retrieve different requested data items in a broadcast tick. This not only utilizes bandwidth more efficiently, but also improves system performance. In this work, we propose a generalized encoding framework to incorporate network coding into data scheduling algorithms for on-demand broadcast. In the framework, data scheduling can be formulated as a weighted maximum clique problem in a graph where the weight of the clique is defined according to the performance objectives of the applications. Under the proposed framework, existing data scheduling algorithms for on-demand broadcast can be migrated into their corresponding coding versions while preserving their original criteria in scheduling data items. Our simulation results using a number of representative scheduling algorithms show that significant performance improvement can be achieved with coding.
Keyword:
Data broadcast scheduling
on-demand broadcast
network coding
clique
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
Mesoporous molecular sieve Sn-MCM-41 as Baeyer-Villiger oxidation catalyst for sterically demanding aromatic and a,ß-unsaturated aldehydes.png)
Arkivoc
OAAI
ArkivocIF0
OAAI分享收藏分享收藏
分享收藏Predicting Dropout from Children’s Mental Health Services: Using a Need-Based Definition of Dropout
PREAI
分享收藏
查看更多内容