Improvement of maximum admissible QoS traffic by traffic observations

T. Mikoshi, T. Takenaka, Takayuki Fujiwara, A. Masuda, K. Shiomoto
{"title":"Improvement of maximum admissible QoS traffic by traffic observations","authors":"T. Mikoshi, T. Takenaka, Takayuki Fujiwara, A. Masuda, K. Shiomoto","doi":"10.1109/HPSR.2011.5986020","DOIUrl":null,"url":null,"abstract":"We propose a scalable call admission control (CAC) scheme that avoids link congestion while maximizing the total admissible traffic of an IP backbone network. Our proposed scheme is scalable in the sense that it requires bandwidth reservation management only at ingress nodes instead of at every links in the core network. We have already evaluated the performance of admissible traffic in case where traffic observations are not executed at ingress nodes in the reference [1]. In this paper, in order to increase admissible traffic volumes, we newly formulate an LP problem in case where traffic observations are executed at ingress nodes for estimating offered traffic volumes between ingress and egress node pairs. We evaluated our proposed scheme for NSFNET and COST239 and showed that the total admissible traffic increases about 2.7 and 2.5 times more for NSFNET and COST239, respectively, compared with the case where traffic observations are not executed.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 12th International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2011.5986020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We propose a scalable call admission control (CAC) scheme that avoids link congestion while maximizing the total admissible traffic of an IP backbone network. Our proposed scheme is scalable in the sense that it requires bandwidth reservation management only at ingress nodes instead of at every links in the core network. We have already evaluated the performance of admissible traffic in case where traffic observations are not executed at ingress nodes in the reference [1]. In this paper, in order to increase admissible traffic volumes, we newly formulate an LP problem in case where traffic observations are executed at ingress nodes for estimating offered traffic volumes between ingress and egress node pairs. We evaluated our proposed scheme for NSFNET and COST239 and showed that the total admissible traffic increases about 2.7 and 2.5 times more for NSFNET and COST239, respectively, compared with the case where traffic observations are not executed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过流量观察改进最大允许QoS流量
我们提出了一种可扩展的呼叫允许控制(CAC)方案,该方案避免了链路拥塞,同时最大限度地提高了IP骨干网的总可接受流量。我们提出的方案是可扩展的,因为它只需要在入口节点上进行带宽保留管理,而不是在核心网络的每个链路上进行带宽保留管理。我们已经在参考[1]中的入口节点不执行流量观测的情况下评估了可接受流量的性能。为了增加可接受的交通量,本文提出了一个在入口节点进行流量观测的LP问题,用于估计入口和出口节点对之间的可提供交通量。我们在NSFNET和COST239上评估了我们提出的方案,结果表明,与不执行流量观测的情况相比,NSFNET和COST239的总可接受流量分别增加了2.7倍和2.5倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Assessing network vulnerability under probabilistic region failure model Group-based two-hop relay with redundancy in MANETs Evaluating the energy-awareness of future Internet devices FPGA implementation of lookup algorithms StablePlus: A practical 100% throughput scheduling for input-queued switches
×
引用
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