Online distributed statistical-delay MBAC with QoS guarantees for VPLS connections

N.A. Ali, H. Mouftah, S. Gazor
{"title":"Online distributed statistical-delay MBAC with QoS guarantees for VPLS connections","authors":"N.A. Ali, H. Mouftah, S. Gazor","doi":"10.1109/CONTEL.2005.185911","DOIUrl":null,"url":null,"abstract":"Real time traffic in Virtual Private Network (VPN) connections can tolerate minor violations to their end to end delay bounds. This allowed Service Providers (SP) to increase the number of admitted requests by taking advantage of the statistical multiplexing behavior of such traffic. Usually, each VPN connection has different QoS requirements such as delay and violation probability bounds. Also, each set of requirements are to be fulfilled in isolation, independently from requirements of other connections. Several Measurement Based Admission Control (MBAC) algorithms were designed to meet the soft real time services quality of service (QoS) requirements. However, intensive studies of the existing MBAC algorithms revealed that almost none of these algorithms can meet the distinct violation probability requirements of the connections. This motivated designing a novel algorithm that is capable of reserving resources to distinctly satisfy the desired violation probability and delay bounds of a connection's QoS requirements. The proposed algorithm is an online distributed algorithm. It is based on measuring the delay of the link traffic. The empirical histogram of the measured delay is fitted to a gamma distribution, which is used to calculate the required bandwidth to be reserved in order to meet the connections' QoS requirements. The simulation results for evaluating the algorithm performance show that the algorithm is capable of meeting the distinct QoS requirements of the connections while admitting two to three times the number of connections a deterministic admission control algorithm can admit.","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONTEL.2005.185911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Real time traffic in Virtual Private Network (VPN) connections can tolerate minor violations to their end to end delay bounds. This allowed Service Providers (SP) to increase the number of admitted requests by taking advantage of the statistical multiplexing behavior of such traffic. Usually, each VPN connection has different QoS requirements such as delay and violation probability bounds. Also, each set of requirements are to be fulfilled in isolation, independently from requirements of other connections. Several Measurement Based Admission Control (MBAC) algorithms were designed to meet the soft real time services quality of service (QoS) requirements. However, intensive studies of the existing MBAC algorithms revealed that almost none of these algorithms can meet the distinct violation probability requirements of the connections. This motivated designing a novel algorithm that is capable of reserving resources to distinctly satisfy the desired violation probability and delay bounds of a connection's QoS requirements. The proposed algorithm is an online distributed algorithm. It is based on measuring the delay of the link traffic. The empirical histogram of the measured delay is fitted to a gamma distribution, which is used to calculate the required bandwidth to be reserved in order to meet the connections' QoS requirements. The simulation results for evaluating the algorithm performance show that the algorithm is capable of meeting the distinct QoS requirements of the connections while admitting two to three times the number of connections a deterministic admission control algorithm can admit.
具有QoS保证的VPLS连接在线分布式统计延迟MBAC
虚拟专用网(VPN)连接中的实时流量可以容忍轻微的端到端延迟限制。这使得服务提供商(SP)可以利用这种流量的统计多路复用行为来增加接收请求的数量。通常情况下,每个VPN连接都有不同的QoS要求,如延迟、违规概率界限等。此外,每一组需求都要独立于其他连接的需求来单独满足。为了满足软实时服务质量(QoS)的要求,设计了几种基于测量的允许控制(MBAC)算法。然而,对现有MBAC算法的深入研究表明,这些算法几乎都不能满足连接的不同违反概率要求。这激发了设计一种新的算法,该算法能够保留资源以明显满足连接的QoS要求的期望违反概率和延迟界限。该算法是一种在线分布式算法。它是基于测量链路流量的延迟。将测量到的延迟的经验直方图拟合成伽马分布,用于计算为满足连接的QoS要求而保留的所需带宽。仿真结果表明,该算法在允许的连接数是确定性允许控制算法的2 ~ 3倍的情况下,能够满足不同连接的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学术官方微信