{"title":"Partial Protection in Optical WDM Networks: Enhanced Support for Dynamic Traffic","authors":"M. Sivakumar, K. Sivalingam, Arun Kumar Somani","doi":"10.1109/BROADNETS.2006.4374328","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a circuit-switched optical wavelength division multiplexed (WDM) network that offers protection services to the connections established in the network. A dynamic traffic model, where connection requests arrive based on some stochastic arrival process, is considered. In earlier work, the notion of partial protection was introduced for a WDM network with sub-wavelength capacity allocation capabilities, as in TDM-WDM networks, for a dynamic traffic model. Here, instead of setting up a backup path with the same capacity as the primary, the backup path is established with capacity that is less than the primary path's capacity, where the amount of backup path capacity is specified by the user. Intuitively, this will reduce backup path requirements, thereby increasing the number of connections accepted. In (J. Fang et al., 2005), the mechanism presented attempted to provide the maximum available protection bandwidth while ensuring that the minimum backup requirements are met. However, this can still result in wasted protection bandwidth if failures do not occur. In this paper, we present a mechanism to further improve the performance of partial protection schemes for dynamic traffic. When failure occurs, the connection is carried on the backup with reduced capacity. However, the system tries to identify additional spare capacity on the same backup path, on either the same wavelength or a different wavelength. The objective is to increase the amount of backup capacity at the time of failure, so that the connection's end user does not see a noticeable drop in bandwidth allocated. We present a heuristic connection admission control algorithm that prevents backup contention that occurs when backup paths of connections affected by a failure contend (share) for resources. A detailed performance evaluation of the mechanisms for different network topologies and other system parameters is presented. For one of the cases studied, the connection acceptance probability is increased from 95% to 99%, while providing nearly 100% backup capacity, when failure occurred. The mechanism proposed to counter backup contention is seen to provide an average of 120% reduction in the contention among backup paths of connections traversing a link, especially when the number of wavelengths in each link is small.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"51 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","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.4374328","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper, we consider a circuit-switched optical wavelength division multiplexed (WDM) network that offers protection services to the connections established in the network. A dynamic traffic model, where connection requests arrive based on some stochastic arrival process, is considered. In earlier work, the notion of partial protection was introduced for a WDM network with sub-wavelength capacity allocation capabilities, as in TDM-WDM networks, for a dynamic traffic model. Here, instead of setting up a backup path with the same capacity as the primary, the backup path is established with capacity that is less than the primary path's capacity, where the amount of backup path capacity is specified by the user. Intuitively, this will reduce backup path requirements, thereby increasing the number of connections accepted. In (J. Fang et al., 2005), the mechanism presented attempted to provide the maximum available protection bandwidth while ensuring that the minimum backup requirements are met. However, this can still result in wasted protection bandwidth if failures do not occur. In this paper, we present a mechanism to further improve the performance of partial protection schemes for dynamic traffic. When failure occurs, the connection is carried on the backup with reduced capacity. However, the system tries to identify additional spare capacity on the same backup path, on either the same wavelength or a different wavelength. The objective is to increase the amount of backup capacity at the time of failure, so that the connection's end user does not see a noticeable drop in bandwidth allocated. We present a heuristic connection admission control algorithm that prevents backup contention that occurs when backup paths of connections affected by a failure contend (share) for resources. A detailed performance evaluation of the mechanisms for different network topologies and other system parameters is presented. For one of the cases studied, the connection acceptance probability is increased from 95% to 99%, while providing nearly 100% backup capacity, when failure occurred. The mechanism proposed to counter backup contention is seen to provide an average of 120% reduction in the contention among backup paths of connections traversing a link, especially when the number of wavelengths in each link is small.
在本文中,我们考虑了一个电路交换的光波分复用(WDM)网络,该网络为网络中建立的连接提供保护服务。考虑了基于随机到达过程的连接请求到达的动态流量模型。在早期的工作中,部分保护的概念被引入到具有亚波长容量分配能力的WDM网络中,如TDM-WDM网络,用于动态业务模型。此处不建立与主路径容量相同的备份路径,而是建立容量小于主路径容量的备份路径,备份路径容量大小由用户指定。直观地说,这将减少备份路径需求,从而增加可接受的连接数量。在(J. Fang et al., 2005)中,提出的机制试图在保证满足最低备份要求的同时提供最大可用保护带宽。但是,如果没有发生故障,这仍然会导致浪费保护带宽。在本文中,我们提出了一种机制来进一步提高动态流量部分保护方案的性能。当发生故障时,连接在容量减少的备份上进行。然而,系统尝试在相同的备份路径上识别额外的备用容量,无论是在相同的波长上还是在不同的波长上。目标是在发生故障时增加备份容量,以便连接的最终用户不会看到分配的带宽明显下降。我们提出了一种启发式连接允许控制算法,该算法可以防止当连接的备份路径受到资源竞争(共享)失败影响时发生的备份争用。对不同网络拓扑和其他系统参数下的机制进行了详细的性能评估。在研究的一个案例中,连接接受概率从95%提高到99%,同时在发生故障时提供近100%的备份容量。所提出的对抗备份争用的机制可以使穿越一条链路的连接的备份路径之间的争用平均减少120%,特别是当每个链路中的波长数较小时。