基于red的流量感知网络准入控制算法

R. Stankiewicz, J. Domżał, R. Wójcik
{"title":"基于red的流量感知网络准入控制算法","authors":"R. Stankiewicz, J. Domżał, R. Wójcik","doi":"10.1109/NETWKS.2014.6959197","DOIUrl":null,"url":null,"abstract":"Measurement-based admission control mechanism in Flow-Aware Networks (FAN) may lead to performance issues related to over-admitting, especially when traffic sources generate large number of flows. When too many new transmissions arrive close in time to each other, all of them may be accepted even though there is no room in the outgoing link. The source lies, unfortunately, in the very basic principles of the mechanism. In this paper, we show that there is a simple, yet very efficient remedy to the problem. The proposed solution utilizes the Random Early Detection algorithm. As a result we can steer the number of accepted flows taking into consideration current load in a link. The proposed solution has significant advantages over currently available algorithms for admission control in FAN. Moreover it provides better performance which is confirmed by the simulation results.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"RED-based admission control algorithm for flow-aware networks\",\"authors\":\"R. Stankiewicz, J. Domżał, R. Wójcik\",\"doi\":\"10.1109/NETWKS.2014.6959197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Measurement-based admission control mechanism in Flow-Aware Networks (FAN) may lead to performance issues related to over-admitting, especially when traffic sources generate large number of flows. When too many new transmissions arrive close in time to each other, all of them may be accepted even though there is no room in the outgoing link. The source lies, unfortunately, in the very basic principles of the mechanism. In this paper, we show that there is a simple, yet very efficient remedy to the problem. The proposed solution utilizes the Random Early Detection algorithm. As a result we can steer the number of accepted flows taking into consideration current load in a link. The proposed solution has significant advantages over currently available algorithms for admission control in FAN. Moreover it provides better performance which is confirmed by the simulation results.\",\"PeriodicalId\":410892,\"journal\":{\"name\":\"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETWKS.2014.6959197\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2014.6959197","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

流量感知网络(Flow-Aware Networks, FAN)中基于度量的准入控制机制可能会导致过度准入的性能问题,特别是在流量源产生大量流量的情况下。当太多的新传输及时到达时,即使出链路中没有空间,它们也可以全部被接受。不幸的是,根源在于该机制的非常基本的原则。在本文中,我们提出了一种简单而有效的方法来解决这个问题。该方案采用随机早期检测算法。因此,我们可以根据链路中的当前负载来控制可接受流的数量。与现有的FAN准入控制算法相比,该方案具有显著的优势。仿真结果证实了该方法具有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
RED-based admission control algorithm for flow-aware networks
Measurement-based admission control mechanism in Flow-Aware Networks (FAN) may lead to performance issues related to over-admitting, especially when traffic sources generate large number of flows. When too many new transmissions arrive close in time to each other, all of them may be accepted even though there is no room in the outgoing link. The source lies, unfortunately, in the very basic principles of the mechanism. In this paper, we show that there is a simple, yet very efficient remedy to the problem. The proposed solution utilizes the Random Early Detection algorithm. As a result we can steer the number of accepted flows taking into consideration current load in a link. The proposed solution has significant advantages over currently available algorithms for admission control in FAN. Moreover it provides better performance which is confirmed by the simulation results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信