为容量时变的流提供严格的QoS保证

P. Swiatek, M. Drwal, A. Grzech
{"title":"为容量时变的流提供严格的QoS保证","authors":"P. Swiatek, M. Drwal, A. Grzech","doi":"10.1109/ICSEng.2011.57","DOIUrl":null,"url":null,"abstract":"Many distributed applications require bandwidth provisioning to implement their functionality. A prominent example is a remote real-time monitoring service in e-health system, where a special type of emergency requests require strict guaranties regarding provided transmission rates. We consider the problem of network capacity sharing between two types of flows: standard best-effort flows and QoS-constrained flows. We derive distributed control algorithms for dynamic capacity allocation allowing to serve the QoS-constrained flows by preempting the best-effort flows. Such solution minimizes the amount of unused capacity. We also present how to estimate the capacity needed to deploy QoS-based application in a way to minimize the number of flow preemptions. The presented solution is evaluated in a simulation environment.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Providing Strict QoS Guaranties for Flows with Time-varying Capacity Requirements\",\"authors\":\"P. Swiatek, M. Drwal, A. Grzech\",\"doi\":\"10.1109/ICSEng.2011.57\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many distributed applications require bandwidth provisioning to implement their functionality. A prominent example is a remote real-time monitoring service in e-health system, where a special type of emergency requests require strict guaranties regarding provided transmission rates. We consider the problem of network capacity sharing between two types of flows: standard best-effort flows and QoS-constrained flows. We derive distributed control algorithms for dynamic capacity allocation allowing to serve the QoS-constrained flows by preempting the best-effort flows. Such solution minimizes the amount of unused capacity. We also present how to estimate the capacity needed to deploy QoS-based application in a way to minimize the number of flow preemptions. The presented solution is evaluated in a simulation environment.\",\"PeriodicalId\":387483,\"journal\":{\"name\":\"2011 21st International Conference on Systems Engineering\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 21st International Conference on Systems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSEng.2011.57\",\"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 21st International Conference on Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSEng.2011.57","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

许多分布式应用程序需要带宽配置来实现其功能。一个突出的例子是电子保健系统中的远程实时监测服务,其中一种特殊类型的紧急请求需要严格保证所提供的传输速率。我们考虑了两类流之间的网络容量共享问题:标准最佳努力流和qos约束流。我们推导了动态容量分配的分布式控制算法,允许通过抢占最佳努力流来服务qos约束流。这种解决方案最大限度地减少了未使用的容量。我们还介绍了如何估计部署基于qos的应用程序所需的容量,以最小化流抢占的数量。在仿真环境中对该解决方案进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Providing Strict QoS Guaranties for Flows with Time-varying Capacity Requirements
Many distributed applications require bandwidth provisioning to implement their functionality. A prominent example is a remote real-time monitoring service in e-health system, where a special type of emergency requests require strict guaranties regarding provided transmission rates. We consider the problem of network capacity sharing between two types of flows: standard best-effort flows and QoS-constrained flows. We derive distributed control algorithms for dynamic capacity allocation allowing to serve the QoS-constrained flows by preempting the best-effort flows. Such solution minimizes the amount of unused capacity. We also present how to estimate the capacity needed to deploy QoS-based application in a way to minimize the number of flow preemptions. The presented solution is evaluated in a simulation environment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信