基于最小执行时间技术的GMPLS光网络动态带宽分配

Monika, Simranjit Singh, A. Wason
{"title":"基于最小执行时间技术的GMPLS光网络动态带宽分配","authors":"Monika, Simranjit Singh, A. Wason","doi":"10.1109/Indo-TaiwanICAN48429.2020.9181358","DOIUrl":null,"url":null,"abstract":"A new dynamic bandwidth allocation technique named as Minimum Execution Time (MET) is developed for reducing the blocking probability to improve quality of service of the Generalized Multi Protocol Label Switched (GMPLS) optical network. A statistical model of an optical network is developed for blocking probability of held calls and cleared calls. The bandwidth is allocated to users on the basis of predictable completion intervals at the servers in the proposed technique for bandwidth allocation, i.e. it calculates the minimum time required to execute the request so that bandwidth can be allocated to another user. Thus, the bandwidth can be allocated in an efficient manner in this process. The blocking probability variation is studied based on the traffic load and wavelengths available at the time of user request in the GMPLS network. The results revealed that the blocking probability drops off with increasing number of available wavelengths. The value of blocking probability remains below 1% by using the proposed bandwidth allocation technique.","PeriodicalId":171125,"journal":{"name":"2020 Indo – Taiwan 2nd International Conference on Computing, Analytics and Networks (Indo-Taiwan ICAN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic Bandwidth Allocation in GMPLS Optical Networks using Minimum Execution Time Technique\",\"authors\":\"Monika, Simranjit Singh, A. Wason\",\"doi\":\"10.1109/Indo-TaiwanICAN48429.2020.9181358\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new dynamic bandwidth allocation technique named as Minimum Execution Time (MET) is developed for reducing the blocking probability to improve quality of service of the Generalized Multi Protocol Label Switched (GMPLS) optical network. A statistical model of an optical network is developed for blocking probability of held calls and cleared calls. The bandwidth is allocated to users on the basis of predictable completion intervals at the servers in the proposed technique for bandwidth allocation, i.e. it calculates the minimum time required to execute the request so that bandwidth can be allocated to another user. Thus, the bandwidth can be allocated in an efficient manner in this process. The blocking probability variation is studied based on the traffic load and wavelengths available at the time of user request in the GMPLS network. The results revealed that the blocking probability drops off with increasing number of available wavelengths. The value of blocking probability remains below 1% by using the proposed bandwidth allocation technique.\",\"PeriodicalId\":171125,\"journal\":{\"name\":\"2020 Indo – Taiwan 2nd International Conference on Computing, Analytics and Networks (Indo-Taiwan ICAN)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 Indo – Taiwan 2nd International Conference on Computing, Analytics and Networks (Indo-Taiwan ICAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/Indo-TaiwanICAN48429.2020.9181358\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Indo – Taiwan 2nd International Conference on Computing, Analytics and Networks (Indo-Taiwan ICAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/Indo-TaiwanICAN48429.2020.9181358","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了降低阻塞概率,提高通用多协议标签交换(GMPLS)光网络的服务质量,提出了一种新的动态带宽分配技术——最小执行时间(MET)。建立了光网络保持呼叫和清除呼叫阻塞概率的统计模型。在带宽分配建议的技术中,带宽是根据服务器上可预测的完成间隔分配给用户的,即它计算执行请求所需的最小时间,以便将带宽分配给另一个用户。因此,在此过程中可以有效地分配带宽。研究了GMPLS网络中基于用户请求时的流量负荷和可用波长的阻塞概率变化。结果表明,阻挡概率随可用波长数的增加而下降。采用所提出的带宽分配技术,阻塞概率值保持在1%以下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic Bandwidth Allocation in GMPLS Optical Networks using Minimum Execution Time Technique
A new dynamic bandwidth allocation technique named as Minimum Execution Time (MET) is developed for reducing the blocking probability to improve quality of service of the Generalized Multi Protocol Label Switched (GMPLS) optical network. A statistical model of an optical network is developed for blocking probability of held calls and cleared calls. The bandwidth is allocated to users on the basis of predictable completion intervals at the servers in the proposed technique for bandwidth allocation, i.e. it calculates the minimum time required to execute the request so that bandwidth can be allocated to another user. Thus, the bandwidth can be allocated in an efficient manner in this process. The blocking probability variation is studied based on the traffic load and wavelengths available at the time of user request in the GMPLS network. The results revealed that the blocking probability drops off with increasing number of available wavelengths. The value of blocking probability remains below 1% by using the proposed bandwidth allocation technique.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信