首页 > 最新文献

2012 16th International Conference on Optical Network Design and Modelling (ONDM)最新文献

英文 中文
Performance modelling and analysis of dynamic virtual optical network composition 动态虚拟光网络组成的性能建模与分析
Pub Date : 2012-04-17 DOI: 10.1109/ONDM.2012.6210208
S. Peng, R. Nejabati, E. Escalona, D. Simeonidou, M. Anastasopoulos, K. Georgakilas, A. Tzanakaki, A. Vernitski
High-capacity networks based on optical technologies enable global delivery of high-performance network-based applications driven by Future Internet services. Due to the accelerated evolution of these applications, dynamic adaptability of the underlying optical infrastructure becomes crucial to support efficient data transport through the operators' networks. Optical network virtualization can be considered as a key technology for addressing this challenge. This paper presents a novel architecture enabled by optical network virtualization that adopts the concept of Infrastructure as a Service (IaaS). For the IaaS framework, three intelligent and dynamic composition mechanisms, employing Mixed Integer Linear Programming (MILP), K-Shortest Path (K-SP) and Random path routing algorithms are proposed. The performance of these algorithms in terms of the virtual optical network (VON) composition performance and the algorithm computational complexity is evaluated and compared in this study. The results show that MILP can provide optimal solutions for VON composition but it takes the longest time to execute, while the proposed Random algorithm can achieve the shortest running time.
基于光技术的大容量网络能够实现由未来互联网服务驱动的高性能网络应用的全球交付。由于这些应用的加速发展,底层光基础设施的动态适应性对于支持通过运营商网络的高效数据传输变得至关重要。光网络虚拟化可以被认为是解决这一挑战的关键技术。本文提出了一种采用基础设施即服务(IaaS)概念的光网络虚拟化新架构。针对IaaS框架,提出了采用混合整数线性规划(MILP)、k -最短路径(K-SP)和随机路径路由算法的三种智能动态组合机制。本文从虚拟光网络(VON)组成性能和算法计算复杂度两方面对这些算法的性能进行了评价和比较。结果表明,MILP算法可以为VON组合提供最优解,但执行时间较长,而随机算法可以实现最短的运行时间。
{"title":"Performance modelling and analysis of dynamic virtual optical network composition","authors":"S. Peng, R. Nejabati, E. Escalona, D. Simeonidou, M. Anastasopoulos, K. Georgakilas, A. Tzanakaki, A. Vernitski","doi":"10.1109/ONDM.2012.6210208","DOIUrl":"https://doi.org/10.1109/ONDM.2012.6210208","url":null,"abstract":"High-capacity networks based on optical technologies enable global delivery of high-performance network-based applications driven by Future Internet services. Due to the accelerated evolution of these applications, dynamic adaptability of the underlying optical infrastructure becomes crucial to support efficient data transport through the operators' networks. Optical network virtualization can be considered as a key technology for addressing this challenge. This paper presents a novel architecture enabled by optical network virtualization that adopts the concept of Infrastructure as a Service (IaaS). For the IaaS framework, three intelligent and dynamic composition mechanisms, employing Mixed Integer Linear Programming (MILP), K-Shortest Path (K-SP) and Random path routing algorithms are proposed. The performance of these algorithms in terms of the virtual optical network (VON) composition performance and the algorithm computational complexity is evaluated and compared in this study. The results show that MILP can provide optimal solutions for VON composition but it takes the longest time to execute, while the proposed Random algorithm can achieve the shortest running time.","PeriodicalId":151401,"journal":{"name":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131158452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A research and experimentation overview on future optical network control plane in the ADRENALINE testbed 未来光网络控制平面在ADRENALINE试验台的研究与实验综述
Pub Date : 2012-04-17 DOI: 10.1109/ONDM.2012.6210275
R. Muñoz, R. Casellas, R. Martínez, R. Vilalta
Future optical transport networks will be constituted by a virtualized, multi-domain and multi-layer transport infrastructure, delivering the efficient aggregation and statistical multiplexing of MPLS-TP packet transport technology, supporting IP and Ethernet services, along with the cost/energy-efficiency, coarse bandwidth capacity and deterministic performance of fixed/elastic WSON optical circuit technology. The automation of these future transport networks can be efficiently encompassed through the deployment of a distributed control plane, based on the Generalized Multi-Protocol Label Switching (GMPLS) architecture with Path Computation Elements (PCE). This paper overviews the recent research and experimental activities for the future optical network control plane carried out within the ADRENALINE testbed.
未来的光传输网络将由虚拟化、多域和多层传输基础设施组成,提供MPLS-TP分组传输技术的高效聚合和统计多路复用,支持IP和以太网业务,以及固定/弹性WSON光电路技术的成本/能效、粗带宽容量和确定性性能。这些未来传输网络的自动化可以通过部署分布式控制平面来有效地实现,该控制平面基于具有路径计算元素(PCE)的通用多协议标签交换(GMPLS)架构。本文综述了肾上腺素试验台近年来对未来光网络控制平面的研究和实验活动。
{"title":"A research and experimentation overview on future optical network control plane in the ADRENALINE testbed","authors":"R. Muñoz, R. Casellas, R. Martínez, R. Vilalta","doi":"10.1109/ONDM.2012.6210275","DOIUrl":"https://doi.org/10.1109/ONDM.2012.6210275","url":null,"abstract":"Future optical transport networks will be constituted by a virtualized, multi-domain and multi-layer transport infrastructure, delivering the efficient aggregation and statistical multiplexing of MPLS-TP packet transport technology, supporting IP and Ethernet services, along with the cost/energy-efficiency, coarse bandwidth capacity and deterministic performance of fixed/elastic WSON optical circuit technology. The automation of these future transport networks can be efficiently encompassed through the deployment of a distributed control plane, based on the Generalized Multi-Protocol Label Switching (GMPLS) architecture with Path Computation Elements (PCE). This paper overviews the recent research and experimental activities for the future optical network control plane carried out within the ADRENALINE testbed.","PeriodicalId":151401,"journal":{"name":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127234476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Cost-effective sub-wavelength solution for data centre location in scaled next-generation networks 用于下一代规模化网络中数据中心位置的经济高效的亚波长解决方案
Pub Date : 2012-04-17 DOI: 10.1109/ONDM.2012.6210262
C. K. Kallo, J. Shields, Conor O'Malley, R. Carley, V. López, J. Palacios
This paper summarises the modelling results obtained with a sub-wavelength optical packet switching technology, called OPST (Optical Packet Switch and Transport), when compared against an IPoDWDM solution. In particular, the impact of data centre location in the network on the network cost is studied for two architectures based on different technologies. Data centre location, routing strategies, service mix, traffic growth and subscriber service take-up is modelled to obtain a broad view about the cost sensitivities in these networks. The main contribution of the paper is to demonstrate that resilience to data centre location and changing traffic patterns enable the sub-wavelength packet optical solution to achieve cost savings of 150% when compared to the IPoDWDM approach. Such flexibility of the packet optical solution also enables 100-300% of power consumption cost reduction and an average 150% savings on rack cabinets for typical configurations.
本文总结了与IPoDWDM解决方案相比,亚波长光分组交换技术(称为OPST(光分组交换和传输))获得的建模结果。特别针对基于不同技术的两种体系结构,研究了数据中心在网络中的位置对网络成本的影响。对数据中心位置、路由策略、服务组合、流量增长和用户服务接受情况进行建模,以获得有关这些网络中成本敏感性的广泛视图。本文的主要贡献是证明了对数据中心位置和不断变化的流量模式的弹性,与IPoDWDM方法相比,亚波长分组光解决方案可以节省150%的成本。这种分组光解决方案的灵活性还可以使功耗成本降低100-300%,在典型配置下,机架机柜平均节省150%。
{"title":"Cost-effective sub-wavelength solution for data centre location in scaled next-generation networks","authors":"C. K. Kallo, J. Shields, Conor O'Malley, R. Carley, V. López, J. Palacios","doi":"10.1109/ONDM.2012.6210262","DOIUrl":"https://doi.org/10.1109/ONDM.2012.6210262","url":null,"abstract":"This paper summarises the modelling results obtained with a sub-wavelength optical packet switching technology, called OPST (Optical Packet Switch and Transport), when compared against an IPoDWDM solution. In particular, the impact of data centre location in the network on the network cost is studied for two architectures based on different technologies. Data centre location, routing strategies, service mix, traffic growth and subscriber service take-up is modelled to obtain a broad view about the cost sensitivities in these networks. The main contribution of the paper is to demonstrate that resilience to data centre location and changing traffic patterns enable the sub-wavelength packet optical solution to achieve cost savings of 150% when compared to the IPoDWDM approach. Such flexibility of the packet optical solution also enables 100-300% of power consumption cost reduction and an average 150% savings on rack cabinets for typical configurations.","PeriodicalId":151401,"journal":{"name":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127300231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Robust upgrade in optical networks under traffic uncertainty 流量不确定条件下光网络的鲁棒升级
Pub Date : 2012-04-17 DOI: 10.1109/ONDM.2012.6210204
R. Aparicio-Pardo, P. Pavón-Mariño, B. Mukherjee
Optical network operators face the challenge of upgrading the WDM network capacity to adapt to estimated traffic growths. Network upgrades are commonly carried out in scheduled intervals (i.e. every six months), using traffic forecasts. The uncertainty in the forecasts is a major issue in the capacity upgrading process. If it is not handled appropriately, the network is exposed to service degradation caused by an unexpected traffic progression. Despite of its relevance, the effects of uncertainty in the forecasts is a factor that has not been well studied in the literature. In this paper, we apply the robust optimization paradigm to incorporate this uncertainty into the network upgrade problem. Under this robust network upgrade model, we can dimension the network by tuning the tradeoff between network cost and robustness level. This proposal is applied to a case study where several experiments are conducted comparing different levels of robustness and different WDM technologies, namely pure 10G (single line rate), pure 40G SLR, pure 100G SLR and 10/40/100G MLR (mixed line rate).
光网络运营商面临着升级WDM网络容量以适应预计流量增长的挑战。根据流量预测,网络升级通常按预定间隔(即每六个月)进行。预测的不确定性是产能升级过程中的一个主要问题。如果处理不当,网络将暴露于由意外流量进展引起的服务降级。尽管其相关性,不确定性对预测的影响是一个尚未在文献中得到很好研究的因素。在本文中,我们应用鲁棒优化范式将这种不确定性纳入到网络升级问题中。在这种鲁棒性网络升级模型下,我们可以通过调整网络成本和鲁棒性水平之间的权衡来确定网络的维度。本文将该方案应用于一个案例研究中,对纯10G(单线速率)、纯40G单反、纯100G单反和10/40/100G MLR(混合线速率)这几种WDM技术的不同鲁棒性水平进行了实验比较。
{"title":"Robust upgrade in optical networks under traffic uncertainty","authors":"R. Aparicio-Pardo, P. Pavón-Mariño, B. Mukherjee","doi":"10.1109/ONDM.2012.6210204","DOIUrl":"https://doi.org/10.1109/ONDM.2012.6210204","url":null,"abstract":"Optical network operators face the challenge of upgrading the WDM network capacity to adapt to estimated traffic growths. Network upgrades are commonly carried out in scheduled intervals (i.e. every six months), using traffic forecasts. The uncertainty in the forecasts is a major issue in the capacity upgrading process. If it is not handled appropriately, the network is exposed to service degradation caused by an unexpected traffic progression. Despite of its relevance, the effects of uncertainty in the forecasts is a factor that has not been well studied in the literature. In this paper, we apply the robust optimization paradigm to incorporate this uncertainty into the network upgrade problem. Under this robust network upgrade model, we can dimension the network by tuning the tradeoff between network cost and robustness level. This proposal is applied to a case study where several experiments are conducted comparing different levels of robustness and different WDM technologies, namely pure 10G (single line rate), pure 40G SLR, pure 100G SLR and 10/40/100G MLR (mixed line rate).","PeriodicalId":151401,"journal":{"name":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","volume":"48 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133017143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Degradation attacks on Passive Optical Networks 无源光网络的退化攻击
Pub Date : 2012-04-17 DOI: 10.1109/ONDM.2012.6210184
Sanda Drakulic, M. Tornatore, G. Verticale
Passive Optical Networks (PONs) are a promising candidate to solve the last-mile problem in access networks. By using optical fibers, PONs can offer to the subscribers higher capacity than other traditional access technologies, such as xDSL or Cable-TV, at a lower cost than FTTx solutions. As for any other access-network technology, security is a very important issue. PONs have very specific security requirements because (i) the downstream transmission channel is inherently broadcast, and (ii) malicious transmissions in the upstream channel can not be easily detected and prevented. This paper shows that malicious upstream transmissions can be used to conduct very intrusive degradation attacks upon the upstream traffic and quantifies the decrement of the upstream throughput over a PON under different scenarios of degradation attack. Further, the paper considers how the effect of a degradation attack carried on at the physical layer is greatly amplified by the TCP congestion control algorithm resulting in a strong degradation with little effort by the attacker. The attacker could then exploit bandwidth sharing mechanisms to gain an unfair amount of bandwidth. We also propose a possible mitigation strategy that pinpoints the attacker and re-establishes fairness in terms of throughput per ONU.
无源光网络(PONs)是解决接入网最后一英里问题的一个很有前途的候选者。通过使用光纤,PONs可以为用户提供比其他传统接入技术(如xDSL或Cable-TV)更高的容量,而成本比FTTx解决方案更低。与其他接入网技术一样,安全是一个非常重要的问题。pon具有非常特殊的安全要求,因为(i)下游传输通道本身就是广播的,(ii)上游通道中的恶意传输不容易被检测和阻止。本文证明了恶意上游传输可以对上游流量进行侵入性很强的降级攻击,并量化了在不同降级攻击场景下PON上游吞吐量的衰减。此外,本文还考虑了在物理层进行的降级攻击的影响如何被TCP拥塞控制算法极大地放大,从而导致攻击者只需付出很少的努力就能实现强降级。然后攻击者可以利用带宽共享机制来获得不公平的带宽。我们还提出了一种可能的缓解策略,该策略可以精确定位攻击者并根据每个ONU的吞吐量重新建立公平性。
{"title":"Degradation attacks on Passive Optical Networks","authors":"Sanda Drakulic, M. Tornatore, G. Verticale","doi":"10.1109/ONDM.2012.6210184","DOIUrl":"https://doi.org/10.1109/ONDM.2012.6210184","url":null,"abstract":"Passive Optical Networks (PONs) are a promising candidate to solve the last-mile problem in access networks. By using optical fibers, PONs can offer to the subscribers higher capacity than other traditional access technologies, such as xDSL or Cable-TV, at a lower cost than FTTx solutions. As for any other access-network technology, security is a very important issue. PONs have very specific security requirements because (i) the downstream transmission channel is inherently broadcast, and (ii) malicious transmissions in the upstream channel can not be easily detected and prevented. This paper shows that malicious upstream transmissions can be used to conduct very intrusive degradation attacks upon the upstream traffic and quantifies the decrement of the upstream throughput over a PON under different scenarios of degradation attack. Further, the paper considers how the effect of a degradation attack carried on at the physical layer is greatly amplified by the TCP congestion control algorithm resulting in a strong degradation with little effort by the attacker. The attacker could then exploit bandwidth sharing mechanisms to gain an unfair amount of bandwidth. We also propose a possible mitigation strategy that pinpoints the attacker and re-establishes fairness in terms of throughput per ONU.","PeriodicalId":151401,"journal":{"name":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116083432","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Suboptimal PON network designing algorithm for minimizing deployment cost of optical fiber cables 最小光缆部署成本的次优PON网络设计算法
Pub Date : 2012-04-17 DOI: 10.1109/ONDM.2012.6210195
A. Agata, Kosuke Nishimura
In order to meet the bandwidth requirements for the access network, many network operators nowadays have been rapidly expanding their fiber-to-the-home (FTTH) service area. In such an area, a passive double star (PDS) network, which shares one optical fiber with multiple subscribers by using a power splitter, is commonly deployed as an infrastructure for the passive optical network (PON) systems. One of the main focuses for PON network planning is to determine the locations of the optical splitters and optical fiber cable routes that connect every splitter to the central offices (COs) based on the forecasted demands, within a limited deployment cost under realistic restrictions. In this paper, we propose and demonstrate a novel suboptimal design algorithm of PON optical distribution network (ODN). Based on the forecasted demand, it can automatically generate a suboptimal PON network in terms of the total cable deployment construction length under realistic restrictions.
为了满足接入网对带宽的要求,目前许多网络运营商都在迅速扩大光纤到户(FTTH)的业务范围。在这样的地区,无源双星(PDS)网络通常作为无源光网络(PON)系统的基础设施部署,该网络通过功率分配器与多个用户共享一根光纤。PON网络规划的主要焦点之一是根据预测的需求,在有限的部署成本下,确定光分路器的位置和将每个分路器连接到中心局(co)的光纤电缆路由。本文提出并论证了一种新型的PON光分配网络(ODN)次优设计算法。根据预测的需求,在实际的限制条件下,根据电缆总部署长度自动生成次优PON网络。
{"title":"Suboptimal PON network designing algorithm for minimizing deployment cost of optical fiber cables","authors":"A. Agata, Kosuke Nishimura","doi":"10.1109/ONDM.2012.6210195","DOIUrl":"https://doi.org/10.1109/ONDM.2012.6210195","url":null,"abstract":"In order to meet the bandwidth requirements for the access network, many network operators nowadays have been rapidly expanding their fiber-to-the-home (FTTH) service area. In such an area, a passive double star (PDS) network, which shares one optical fiber with multiple subscribers by using a power splitter, is commonly deployed as an infrastructure for the passive optical network (PON) systems. One of the main focuses for PON network planning is to determine the locations of the optical splitters and optical fiber cable routes that connect every splitter to the central offices (COs) based on the forecasted demands, within a limited deployment cost under realistic restrictions. In this paper, we propose and demonstrate a novel suboptimal design algorithm of PON optical distribution network (ODN). Based on the forecasted demand, it can automatically generate a suboptimal PON network in terms of the total cable deployment construction length under realistic restrictions.","PeriodicalId":151401,"journal":{"name":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","volume":" 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120832355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Minimum CAPEX design of segment p-cycles with full node protection 具有全节点保护的分段p循环的最小CAPEX设计
Pub Date : 2012-04-17 DOI: 10.1109/ONDM.2012.6210190
B. Jaumard, Honghui Li
Shared-segment protection offers a good compromise between shared link and path protection, i.e., has the features of high resource efficiency and short protection-switching time. In this paper, we further investigate segment protection along two directions, (i) within the context of pre-configured pre-cross connected protection schemes (i.e., with p-cycles), and (ii) with the evaluation of the additional required CAPEX cost in order to ensure node protection in addition to protection against single link failures. We propose a scalable model which takes advantage of large scale optimization tools for its solution, and compare the best trade-off between regular segment protection (segment p-Cycles) and enhanced segment protection (with node protection) (Np-cycles) within the p-cycle protection framework. Numerical results show that protection against single node failures can be ensured with about 3% extra CAPEX and no more than 3% extra spare capacity, throughout an adaptation of segment p-cycles. This suggests that segment Np-cycles constitute an attractive protection scheme for protection against single node or link failures.
共享段保护是共享链路和共享路径保护的一种很好的折衷,具有资源效率高、保护切换时间短的特点。在本文中,我们进一步研究了两个方向上的区段保护,(i)在预配置的预交叉连接保护方案(即p循环)的背景下,以及(ii)评估额外所需的CAPEX成本,以确保除了防止单链路故障外,还能保护节点。我们提出了一个可扩展的模型,该模型利用大规模优化工具来解决它的问题,并比较了在p环保护框架内常规段保护(段p-Cycles)和增强段保护(带节点保护)(Np-cycles)之间的最佳权衡。数值结果表明,在整个分段p周期的适应过程中,仅需要3%的额外CAPEX和不超过3%的额外备用容量,即可确保对单节点故障的保护。这表明,对于防止单节点或链路故障,段np环构成了一个有吸引力的保护方案。
{"title":"Minimum CAPEX design of segment p-cycles with full node protection","authors":"B. Jaumard, Honghui Li","doi":"10.1109/ONDM.2012.6210190","DOIUrl":"https://doi.org/10.1109/ONDM.2012.6210190","url":null,"abstract":"Shared-segment protection offers a good compromise between shared link and path protection, i.e., has the features of high resource efficiency and short protection-switching time. In this paper, we further investigate segment protection along two directions, (i) within the context of pre-configured pre-cross connected protection schemes (i.e., with p-cycles), and (ii) with the evaluation of the additional required CAPEX cost in order to ensure node protection in addition to protection against single link failures. We propose a scalable model which takes advantage of large scale optimization tools for its solution, and compare the best trade-off between regular segment protection (segment p-Cycles) and enhanced segment protection (with node protection) (Np-cycles) within the p-cycle protection framework. Numerical results show that protection against single node failures can be ensured with about 3% extra CAPEX and no more than 3% extra spare capacity, throughout an adaptation of segment p-cycles. This suggests that segment Np-cycles constitute an attractive protection scheme for protection against single node or link failures.","PeriodicalId":151401,"journal":{"name":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128928528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Iteration-free node-disjoint paths search in WDM networks with asymmetric nodes 非对称节点WDM网络的无迭代节点不相交路径搜索
Pub Date : 1900-01-01 DOI: 10.1109/ondm.2012.6210276
T. Hashiguchi, Yi Zhu, K. Tajima, Y. Takita, T. Naito, J. Jue
Provisioning of a pair of disjoint paths is crucial in WDM network planning and management in order to provide fault tolerant services. However, in networks with asymmetric nodes that have restrictions on the internal connections between outer links, existing methods for node-disjoint paths search have trap problems and require time consuming iterative procedures. In this paper, we present a novel iteration-free method for finding a pair of node-disjoint paths considering asymmetric nodes. The proposed method includes a novel network transformation and a constraint-based path search. Through simulation, we confirm that the presented method can successfully find optimum node-disjoint paths without encountering trap problems, which implies that the method can support any number of asymmetric nodes and any type of asymmetric connections.
在WDM网络规划和管理中,提供一对不相交的路径是提供容错服务的关键。然而,在具有非对称节点的网络中,外部链路之间的内部连接受到限制,现有的节点不相交路径搜索方法存在陷阱问题,并且需要耗时的迭代过程。本文提出了一种求解非对称节点不相交路径的无迭代方法。该方法包括一种新的网络变换和一种基于约束的路径搜索。仿真结果表明,该方法能够成功地找到最优的节点不相交路径,而不会遇到陷阱问题,这意味着该方法可以支持任意数量的非对称节点和任意类型的非对称连接。
{"title":"Iteration-free node-disjoint paths search in WDM networks with asymmetric nodes","authors":"T. Hashiguchi, Yi Zhu, K. Tajima, Y. Takita, T. Naito, J. Jue","doi":"10.1109/ondm.2012.6210276","DOIUrl":"https://doi.org/10.1109/ondm.2012.6210276","url":null,"abstract":"Provisioning of a pair of disjoint paths is crucial in WDM network planning and management in order to provide fault tolerant services. However, in networks with asymmetric nodes that have restrictions on the internal connections between outer links, existing methods for node-disjoint paths search have trap problems and require time consuming iterative procedures. In this paper, we present a novel iteration-free method for finding a pair of node-disjoint paths considering asymmetric nodes. The proposed method includes a novel network transformation and a constraint-based path search. Through simulation, we confirm that the presented method can successfully find optimum node-disjoint paths without encountering trap problems, which implies that the method can support any number of asymmetric nodes and any type of asymmetric connections.","PeriodicalId":151401,"journal":{"name":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116595862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
期刊
2012 16th International Conference on Optical Network Design and Modelling (ONDM)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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