共享资源网络的高QoS约束研究

J. Bilbao, A. Calvo, I. Armendariz, P. Crespo
{"title":"共享资源网络的高QoS约束研究","authors":"J. Bilbao, A. Calvo, I. Armendariz, P. Crespo","doi":"10.1109/ANCS.2011.42","DOIUrl":null,"url":null,"abstract":"In this paper, we describe an innovative queue management mechanism in order to achieve an optimal use of shared communication resources. The target scenario contemplates different data flows sharing the same network resources at the same time. The main challenge over this scenario is to achieve the required QoS (Quality of Service) to redistribute real-time and high constraints services. The described queue management algorithm, proposes an innovative queue utilization method based on the combination of the data flows to be redistributed, providing a more efficient use of the network resources, and inducing important improvements in the caused delay and jitter. Present work describes the design of a mechanism based on Network Coding that achieves new QoS up-bound limits and reduces the queue occupancy that cannot be achieved with store-and-forward mechanisms. Finally, we describe the very promising preliminary results obtained by the simulation of a still open study, and discover a new potential future research field.","PeriodicalId":124429,"journal":{"name":"2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On High QoS Constraints over Shared Resource Networks\",\"authors\":\"J. Bilbao, A. Calvo, I. Armendariz, P. Crespo\",\"doi\":\"10.1109/ANCS.2011.42\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we describe an innovative queue management mechanism in order to achieve an optimal use of shared communication resources. The target scenario contemplates different data flows sharing the same network resources at the same time. The main challenge over this scenario is to achieve the required QoS (Quality of Service) to redistribute real-time and high constraints services. The described queue management algorithm, proposes an innovative queue utilization method based on the combination of the data flows to be redistributed, providing a more efficient use of the network resources, and inducing important improvements in the caused delay and jitter. Present work describes the design of a mechanism based on Network Coding that achieves new QoS up-bound limits and reduces the queue occupancy that cannot be achieved with store-and-forward mechanisms. Finally, we describe the very promising preliminary results obtained by the simulation of a still open study, and discover a new potential future research field.\",\"PeriodicalId\":124429,\"journal\":{\"name\":\"2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ANCS.2011.42\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANCS.2011.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在本文中,我们描述了一种创新的队列管理机制,以实现共享通信资源的最佳利用。目标场景考虑不同的数据流同时共享相同的网络资源。此场景的主要挑战是实现重新分配实时和高约束服务所需的QoS(服务质量)。所描述的队列管理算法提出了一种创新的队列利用方法,该方法基于需要重新分配的数据流的组合,提供了更有效的网络资源利用,并对所引起的延迟和抖动进行了重要的改进。目前的工作描述了一种基于网络编码的机制设计,该机制实现了新的QoS上限限制,并减少了存储转发机制无法实现的队列占用。最后,我们描述了一个仍在开放的研究中通过模拟获得的非常有希望的初步结果,并发现了一个新的潜在的未来研究领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On High QoS Constraints over Shared Resource Networks
In this paper, we describe an innovative queue management mechanism in order to achieve an optimal use of shared communication resources. The target scenario contemplates different data flows sharing the same network resources at the same time. The main challenge over this scenario is to achieve the required QoS (Quality of Service) to redistribute real-time and high constraints services. The described queue management algorithm, proposes an innovative queue utilization method based on the combination of the data flows to be redistributed, providing a more efficient use of the network resources, and inducing important improvements in the caused delay and jitter. Present work describes the design of a mechanism based on Network Coding that achieves new QoS up-bound limits and reduces the queue occupancy that cannot be achieved with store-and-forward mechanisms. Finally, we describe the very promising preliminary results obtained by the simulation of a still open study, and discover a new potential future research field.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信