对于动态数据的周期性网络广播,分时优于分频

K. Foltz, Jehoshua Bruck
{"title":"对于动态数据的周期性网络广播,分时优于分频","authors":"K. Foltz, Jehoshua Bruck","doi":"10.1109/ISIT.2001.936021","DOIUrl":null,"url":null,"abstract":"We consider two ways to send items over a broadcast channel and compare them using the metric of expected waiting time. The first is frequency division, where each item is broadcast on its own subchannel of lower bandwidth. We find the optimal allocation of bandwidth to the subchannels for this method. Then we look at time division, where items are sent sequentially on a single full-bandwidth channel. We show that for any frequency division broadcast schedule, we can find a better time division schedule. Thus time division is better than frequency division.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Time division is better than frequency division for periodic Internet broadcast of dynamic data\",\"authors\":\"K. Foltz, Jehoshua Bruck\",\"doi\":\"10.1109/ISIT.2001.936021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider two ways to send items over a broadcast channel and compare them using the metric of expected waiting time. The first is frequency division, where each item is broadcast on its own subchannel of lower bandwidth. We find the optimal allocation of bandwidth to the subchannels for this method. Then we look at time division, where items are sent sequentially on a single full-bandwidth channel. We show that for any frequency division broadcast schedule, we can find a better time division schedule. Thus time division is better than frequency division.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.936021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.936021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

我们考虑两种通过广播通道发送项目的方法,并使用预期等待时间的度量对它们进行比较。第一种是分频,其中每个项目在其自己的较低带宽的子信道上广播。我们找到了子信道的最优带宽分配方法。然后我们看一下时间划分,其中项目在单个全带宽信道上按顺序发送。结果表明,对于任何分频广播调度,都可以找到一个较好的分频调度。因此,时分优于频分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Time division is better than frequency division for periodic Internet broadcast of dynamic data
We consider two ways to send items over a broadcast channel and compare them using the metric of expected waiting time. The first is frequency division, where each item is broadcast on its own subchannel of lower bandwidth. We find the optimal allocation of bandwidth to the subchannels for this method. Then we look at time division, where items are sent sequentially on a single full-bandwidth channel. We show that for any frequency division broadcast schedule, we can find a better time division schedule. Thus time division is better than frequency division.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A simple encodable/decodable OFDM QPSK code with low peak-to-mean envelope power ratio The effect of redundancy on measurement Decision directed algorithms for multiuser detection A new modulation scheme using asymmetric error correcting code embedded in optical orthogonal code for optical CDMA Matrix CUSUM: a recursive multi-hypothesis change detection algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1