Prediction of possible congestions in SLA creation process

S. Krile, I. Pezelj
{"title":"Prediction of possible congestions in SLA creation process","authors":"S. Krile, I. Pezelj","doi":"10.1109/CONTEL.2005.185913","DOIUrl":null,"url":null,"abstract":"In our paper we propose efficient tool to predict possible traffic congestions caused by contracting of a new SLA (Service Level Agreement). It could be an important part of admission control process in SLA creation (DiffServ networks). Naturally, it is off-line algorithm and we can use it only through negotiation process (SLA creation), just to ensure better QoS end-to-end routing in the moment of service invocation. The problem is seen as an expansion problem of link capacities in given limits for given traffic demands (SLAs). Such explicit traffic engineering technique provides the possibility to intelligently tailor the route such that different parts of the network remain equally loaded. It helps to avoid the creation of bottleneck links on the path and maintains high network resource utilization efficiency. Also, it is capable to consider the impact of end-to- end delay on network resource provisioning, in the moment of SLA creation. Index Terms - admission control in DiffServ networks, SLA creation, end-to-end QoS routing, traffic routing of aggregate flows.","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","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.185913","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In our paper we propose efficient tool to predict possible traffic congestions caused by contracting of a new SLA (Service Level Agreement). It could be an important part of admission control process in SLA creation (DiffServ networks). Naturally, it is off-line algorithm and we can use it only through negotiation process (SLA creation), just to ensure better QoS end-to-end routing in the moment of service invocation. The problem is seen as an expansion problem of link capacities in given limits for given traffic demands (SLAs). Such explicit traffic engineering technique provides the possibility to intelligently tailor the route such that different parts of the network remain equally loaded. It helps to avoid the creation of bottleneck links on the path and maintains high network resource utilization efficiency. Also, it is capable to consider the impact of end-to- end delay on network resource provisioning, in the moment of SLA creation. Index Terms - admission control in DiffServ networks, SLA creation, end-to-end QoS routing, traffic routing of aggregate flows.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
预测SLA创建过程中可能出现的拥塞
在我们的论文中,我们提出了一个有效的工具来预测由于签订新的SLA(服务水平协议)而导致的可能的交通拥堵。它可能是SLA创建(DiffServ网络)中准入控制过程的重要组成部分。当然,它是离线算法,我们只能通过协商过程(SLA创建)来使用它,只是为了在服务调用的时刻确保更好的QoS端到端路由。该问题被视为在给定流量需求(sla)的给定限制下链路容量的扩展问题。这种明确的流量工程技术提供了智能定制路由的可能性,使得网络的不同部分保持相同的负载。它有助于避免在路径上产生瓶颈链路,保持较高的网络资源利用效率。此外,它能够在创建SLA时考虑端到端延迟对网络资源供应的影响。索引术语- DiffServ网络中的准入控制,SLA创建,端到端QoS路由,聚合流的流量路由。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An insight into challenges of international and multicultural knowledge transfers within ict industry An energy efficient protocol exploiting cache data for sensor networks Prediction of possible congestions in SLA creation process Toward automatic generation of promela models from SDL specification All optical fibre auxiliary carrier based 2R regenerator
×
引用
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