Timeliness and QoS Aware Packet Scheduling for Next Generation Networks

Y. Lien, Yung-Chuan Wun
{"title":"Timeliness and QoS Aware Packet Scheduling for Next Generation Networks","authors":"Y. Lien, Yung-Chuan Wun","doi":"10.1109/NBiS.2009.64","DOIUrl":null,"url":null,"abstract":"Running time sensitive multimedia services such as Voice-over-IP (VoIP) and Video-on-Demand (VoD) on All-IP Networks may have lower quality, i.e. Quality of Service (QoS), than its counterpart on conventional circuit-switched networks. We could enhance overall QoS without investing more resources if routers could forward packets based on their timeliness and QoS class giving important late packets proper precedence. This paper proposes a charge-based optimization model for packet scheduling aiming to maximize overall QoS satisfaction factor. We also developed a simple and effective scheduling policy based on this concept for the environments where each packet has a predefined hop-by-hop traveling schedule. Routers are assumed in three different queue architectures: ideal single preemptive queue and practical multiple FIFO queue with and without a priority queue. To forward a packet, a router first assigns an adequate profit function to the packet based on its timeliness and QoS class as well as the loading status of the succeeding routers along its traveling path, and then inserts the packet into an appropriate position in the output queues. The performance of this approach is evaluated by simulation using NS-2 network simulator. Simulation results show that, under heavy load, our approach can outperform easily the Simulated Priority Queue that differentiates QoS class only.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Network-Based Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NBiS.2009.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Running time sensitive multimedia services such as Voice-over-IP (VoIP) and Video-on-Demand (VoD) on All-IP Networks may have lower quality, i.e. Quality of Service (QoS), than its counterpart on conventional circuit-switched networks. We could enhance overall QoS without investing more resources if routers could forward packets based on their timeliness and QoS class giving important late packets proper precedence. This paper proposes a charge-based optimization model for packet scheduling aiming to maximize overall QoS satisfaction factor. We also developed a simple and effective scheduling policy based on this concept for the environments where each packet has a predefined hop-by-hop traveling schedule. Routers are assumed in three different queue architectures: ideal single preemptive queue and practical multiple FIFO queue with and without a priority queue. To forward a packet, a router first assigns an adequate profit function to the packet based on its timeliness and QoS class as well as the loading status of the succeeding routers along its traveling path, and then inserts the packet into an appropriate position in the output queues. The performance of this approach is evaluated by simulation using NS-2 network simulator. Simulation results show that, under heavy load, our approach can outperform easily the Simulated Priority Queue that differentiates QoS class only.
下一代网络的时效性和QoS感知分组调度
运行时间敏感的多媒体服务,如全ip网络上的ip语音(VoIP)和视频点播(VoD),其质量可能低于传统电路交换网络上的相应服务,即服务质量(QoS)。如果路由器可以根据数据包的时效性和QoS类来转发数据包,并给予重要的延迟数据包适当的优先级,则可以在不投入更多资源的情况下提高整体QoS。提出了一种基于收费的数据包调度优化模型,以最大限度地提高整体QoS满意度。我们还基于这个概念开发了一个简单而有效的调度策略,用于每个数据包具有预定义的逐跳行进计划的环境。假设路由器有三种不同的队列结构:理想的单抢占队列和实际的多FIFO队列,有优先级队列和没有优先级队列。路由器在转发数据包时,首先根据数据包的时效性和QoS等级,以及路由沿线后续路由器的加载状态,为数据包分配适当的利润函数,然后将数据包插入输出队列中的适当位置。利用NS-2网络模拟器对该方法的性能进行了仿真。仿真结果表明,在高负载情况下,该方法的性能明显优于仅区分QoS类别的模拟优先队列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信