Performance Estimation of Overlaid Lightpath Networks for Lambda Users

H. Harai, T. Tachibana
{"title":"Performance Estimation of Overlaid Lightpath Networks for Lambda Users","authors":"H. Harai, T. Tachibana","doi":"10.1109/BROADNETS.2006.4374346","DOIUrl":null,"url":null,"abstract":"In future, lightpaths will be dynamically provided to users by the use of GMPLS but lightpath networks may be overlaid to the users. When the users want to find idle wavelengths by probing for lightpath provisioning, they may not be able to obtain information about all the idle wavelengths along the route in the overlaid lightpath network. They are only allowed to include a limited number of wavelengths for probing. In order to avoid wavelength contention and reduce blocking probability, we present a method for performance estimation of overlaid lightpath networks from a user side. In this method, we try to find wavelengths that are likely to be idle. This is done by the wavelength- based rank accounting for each pair of a source and a destination. Rank is calculated each time a lightpath is provisioned at a pair regardless of the success or failure of the provisioning. We demonstrate that the method of estimation is effective through simulation experiments and also present an initial implementation of a lightpath-provisioning system that uses our performance estimation method based on the GMPLS RSVP-TE mechanism.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 3rd International Conference on Broadband Communications, Networks and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BROADNETS.2006.4374346","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In future, lightpaths will be dynamically provided to users by the use of GMPLS but lightpath networks may be overlaid to the users. When the users want to find idle wavelengths by probing for lightpath provisioning, they may not be able to obtain information about all the idle wavelengths along the route in the overlaid lightpath network. They are only allowed to include a limited number of wavelengths for probing. In order to avoid wavelength contention and reduce blocking probability, we present a method for performance estimation of overlaid lightpath networks from a user side. In this method, we try to find wavelengths that are likely to be idle. This is done by the wavelength- based rank accounting for each pair of a source and a destination. Rank is calculated each time a lightpath is provisioned at a pair regardless of the success or failure of the provisioning. We demonstrate that the method of estimation is effective through simulation experiments and also present an initial implementation of a lightpath-provisioning system that uses our performance estimation method based on the GMPLS RSVP-TE mechanism.
Lambda用户覆盖光路网络的性能评估
在未来,光路将通过使用GMPLS动态地提供给用户,但光路网络可能会覆盖到用户。当用户想通过探测光路配置来寻找空闲波长时,他们可能无法获得覆盖光路网络中沿路由的所有空闲波长的信息。它们只允许包含有限数量的波长用于探测。为了避免波长竞争和降低阻塞概率,我们提出了一种从用户端对叠加光路网络进行性能估计的方法。在这种方法中,我们试图找到可能空闲的波长。这是通过对每一对源和目标的波长进行排序来完成的。无论配置成功还是失败,每次在一对上配置光路时都会计算Rank。我们通过仿真实验证明了估计方法的有效性,并提出了一个基于GMPLS RSVP-TE机制的性能估计方法的光路供应系统的初步实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信