Finite horizon online packet scheduling with energy and delay constraints

Baran Tan Bacinoglu, E. Uysal-Biyikoglu
{"title":"Finite horizon online packet scheduling with energy and delay constraints","authors":"Baran Tan Bacinoglu, E. Uysal-Biyikoglu","doi":"10.1109/BlackSeaCom.2013.6623408","DOIUrl":null,"url":null,"abstract":"A finite horizon optimal packet scheduling problem with data and energy causality constraints is posed. The slotted structure of the problem makes discrete time stochastic dynamic programming suitable for obtaining its optimal solution. This structure also enables an offline optimal solution that facilitates an online scheduling heuristic. The online heuristic, which does not require prior knowledge of data and energy arrival statistics, is observed (via simulations) to perform closely to the online optimal. The simulations also exhibit that policies designed for longer-term optimal performance can fail in the short term and perform much poorly with respect to the online scheduling heuristic.","PeriodicalId":170309,"journal":{"name":"2013 First International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"1 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 First International Black Sea Conference on Communications and Networking (BlackSeaCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BlackSeaCom.2013.6623408","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A finite horizon optimal packet scheduling problem with data and energy causality constraints is posed. The slotted structure of the problem makes discrete time stochastic dynamic programming suitable for obtaining its optimal solution. This structure also enables an offline optimal solution that facilitates an online scheduling heuristic. The online heuristic, which does not require prior knowledge of data and energy arrival statistics, is observed (via simulations) to perform closely to the online optimal. The simulations also exhibit that policies designed for longer-term optimal performance can fail in the short term and perform much poorly with respect to the online scheduling heuristic.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有能量和延迟约束的有限视界在线分组调度
提出了一个具有数据和能量因果约束的有限视界最优分组调度问题。该问题的开槽结构使得离散时间随机动态规划适合于求解该问题的最优解。这种结构还支持离线最优解决方案,从而促进在线调度启发式。在线启发式不需要数据和能量到达统计的先验知识,观察到(通过模拟)执行接近在线最优。模拟还表明,针对长期最优性能设计的策略可能在短期内失败,并且相对于在线调度启发式执行得很差。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Finite horizon online packet scheduling with energy and delay constraints Design of a self-portrait application with sensor-assisted guiding for smart devices Forward and reverse coding for bacteria nanonetworks Exploiting multiple wireless interfaces in smartphones for traffic offloading A new block Markov coding strategy for pairwise and collective cooperation in the three user MAC
×
引用
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