WDM全光网络中动态业务的光路重路由方案

N. Amdouni, M. Koubàa, T. Aguili
{"title":"WDM全光网络中动态业务的光路重路由方案","authors":"N. Amdouni, M. Koubàa, T. Aguili","doi":"10.1109/ICCSII.2012.6454324","DOIUrl":null,"url":null,"abstract":"This paper considers rerouting and minimization of incurred disruption due to rerouting in all-optical wavelength division multiplexed (WDM) network with dynamic (random) traffic arrivals and departures. One limitation of such a network is the wavelength continuity constraint imposed by the all-optical cross-connect switches which do not allow a circuit to be placed on a non wavelength-continuous route. Rerouting is proposed to rearrange certain existing lightpaths to create a wavelength-continuous route in order to accommodate a new connection request. Recently, a wavelength rerouting scheme called “Parallel Move-To-Vacant Wavelength Retuning (MTV-WR)” with many attractive features such as shorter disruption period and simple switching control has been proposed. In this paper, we propose a new lightpath rerouting scheme based on the “Parallel MTV-WR” rerouting scheme minimizing the rejection ratio whilst keeping a little service disruption period due to rerouting. We assume that a new random lightpath demand (RLD) arrives at time t and that its routing phase fails to set up it. To establish the new RLD the proposed algorithm tries to reroute one or several RLDs by only changing the used wavelength whilst keeping the same physical path in order to reduce the disruption period. If it fails, it tries to reroute a minimum number of active RLDs by changing the physical path and then possibly the used wavelengths. Simulation results show that our proposed algorithm computes a better rejection ratio than the rerouting algorithms previously presented in the literature while keeping a minimum number of rerouted lightpaths and a very small service disruption period.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Lightpath rerouting scheme for dynamic traffic in WDM all-optical networks\",\"authors\":\"N. Amdouni, M. Koubàa, T. Aguili\",\"doi\":\"10.1109/ICCSII.2012.6454324\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers rerouting and minimization of incurred disruption due to rerouting in all-optical wavelength division multiplexed (WDM) network with dynamic (random) traffic arrivals and departures. One limitation of such a network is the wavelength continuity constraint imposed by the all-optical cross-connect switches which do not allow a circuit to be placed on a non wavelength-continuous route. Rerouting is proposed to rearrange certain existing lightpaths to create a wavelength-continuous route in order to accommodate a new connection request. Recently, a wavelength rerouting scheme called “Parallel Move-To-Vacant Wavelength Retuning (MTV-WR)” with many attractive features such as shorter disruption period and simple switching control has been proposed. In this paper, we propose a new lightpath rerouting scheme based on the “Parallel MTV-WR” rerouting scheme minimizing the rejection ratio whilst keeping a little service disruption period due to rerouting. We assume that a new random lightpath demand (RLD) arrives at time t and that its routing phase fails to set up it. To establish the new RLD the proposed algorithm tries to reroute one or several RLDs by only changing the used wavelength whilst keeping the same physical path in order to reduce the disruption period. If it fails, it tries to reroute a minimum number of active RLDs by changing the physical path and then possibly the used wavelengths. Simulation results show that our proposed algorithm computes a better rejection ratio than the rerouting algorithms previously presented in the literature while keeping a minimum number of rerouted lightpaths and a very small service disruption period.\",\"PeriodicalId\":281140,\"journal\":{\"name\":\"2012 International Conference on Computer Systems and Industrial Informatics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Computer Systems and Industrial Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSII.2012.6454324\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Computer Systems and Industrial Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSII.2012.6454324","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

本文研究了具有动态(随机)流量到达和离开的全光波分复用(WDM)网络中的重路由问题以及由重路由引起的干扰最小化问题。这种网络的一个限制是由全光交叉连接交换机施加的波长连续性约束,它不允许将电路放置在非波长连续的路由上。为了适应新的连接请求,建议重新安排某些现有光路以创建波长连续的路由。近年来,人们提出了一种名为“平行移动到空波长返回”的波长重路由方案,该方案具有中断时间短、切换控制简单等优点。在本文中,我们提出了一种新的光路重路由方案,基于“并行的MTV-WR”重路由方案,最大限度地减少了拒绝率,同时保持了一小段由于重路由引起的业务中断时间。我们假设一个新的随机光路需求(RLD)到达时间t,并且它的路由阶段未能建立它。为了建立新的RLD,该算法试图通过仅改变所使用的波长来重新路由一个或多个RLD,同时保持相同的物理路径,以减少中断时间。如果它失败了,它尝试通过改变物理路径,然后可能是使用的波长,来重新路由最小数量的活动rld。仿真结果表明,我们提出的算法在保持最小的重路由光路数量和非常小的服务中断时间的情况下,比文献中先前提出的重路由算法计算出更好的拒绝比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Lightpath rerouting scheme for dynamic traffic in WDM all-optical networks
This paper considers rerouting and minimization of incurred disruption due to rerouting in all-optical wavelength division multiplexed (WDM) network with dynamic (random) traffic arrivals and departures. One limitation of such a network is the wavelength continuity constraint imposed by the all-optical cross-connect switches which do not allow a circuit to be placed on a non wavelength-continuous route. Rerouting is proposed to rearrange certain existing lightpaths to create a wavelength-continuous route in order to accommodate a new connection request. Recently, a wavelength rerouting scheme called “Parallel Move-To-Vacant Wavelength Retuning (MTV-WR)” with many attractive features such as shorter disruption period and simple switching control has been proposed. In this paper, we propose a new lightpath rerouting scheme based on the “Parallel MTV-WR” rerouting scheme minimizing the rejection ratio whilst keeping a little service disruption period due to rerouting. We assume that a new random lightpath demand (RLD) arrives at time t and that its routing phase fails to set up it. To establish the new RLD the proposed algorithm tries to reroute one or several RLDs by only changing the used wavelength whilst keeping the same physical path in order to reduce the disruption period. If it fails, it tries to reroute a minimum number of active RLDs by changing the physical path and then possibly the used wavelengths. Simulation results show that our proposed algorithm computes a better rejection ratio than the rerouting algorithms previously presented in the literature while keeping a minimum number of rerouted lightpaths and a very small service disruption period.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
High-speed KATAN ciphers on-a-chip Developing context-dependent service-oriented applications On understanding software quality evolution from a defect perspective: A case study on an open source software system Computers and e-Health: Roles and new applications A systolic-based architecture for a novel reduced-complexity GPS receiver
×
引用
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