The Experts below are selected from a list of 22122 Experts worldwide ranked by ideXlab platform
Ken-ichi Sato - One of the best experts on this subject based on the ideXlab platform.
-
Survivable Hierarchical Optical Path Network Design With Dedicated Wavelength Path Protection
Journal of Lightwave Technology, 2011Co-Authors: Yoshihisa Yamada, Hiroshi Hasegawa, Ken-ichi SatoAbstract:In this paper, we propose a novel network design algorithm that yields the hierarchical optical Path network with dedicated wavelength Path Protection. A hierarchical optical Path network provides two granularities in implementing dedicated Protection in the optical layer, namely waveband Path Protection and wavelength Path Protection. The characteristics of both Protection mechanisms are investigated. We develop the concept of the source-destination Cartesian product space to aggregate closely located traffic demands, which leads to a significant reduction in network resources needed. The proposed wavelength Path Protection algorithm achieves lower network costs than that possible with waveband Protection when traffic volume is relatively small. On the other hand, in the large traffic demand area, both schemes offer almost the same cost, which makes the waveband Protection scheme attractive because of its operational simplicity. Numerical results clarify that survivable hierarchical optical Path network is more cost effective than the single layer optical Path network with optical layer Protection, irrespective of which Protection scheme is utilized.
-
Survivable hierarchical optical Path networks employing waveband and wavelength Path Protection
Optical Fiber Communication - incudes post deadline papers 2009. OFC 2009. Conference on, 2009Co-Authors: Yoshiyuki Yamada, Hiroshi Hasegawa, Ken-ichi SatoAbstract:We propose a novel hierarchical optical Path network design algorithm ensuring wavelength Path Protection. The effectiveness of the waveband networks that adopt waveband or wavelength Path Protection are elucidated compared to single layer optical networks.
Lei Guo - One of the best experts on this subject based on the ideXlab platform.
-
Partial SRLG-disjoint shared Path Protection with differentiated reliability in survivable WDM network
AEU - International Journal of Electronics and Communications, 2007Co-Authors: Jin Cao, Lei GuoAbstract:Abstract This paper addresses the problem of shared Path Protection algorithm in survivable wavelength-division-multiplexing (WDM) optical networks, taking into consideration of differentiated reliability (DiR) under Shared-Risk-Link-Group (SRLG) constraint. A subset of network links that share the risk of failure at the same time are said to be in a common SRLG. Rather than the conventional complete SRLG-disjoint shared Path Protection, we introduce a heuristic Partial SRLG-disjoint Shared Path Protection algorithm (Pd-SPP) based on the concept of SRLG conditional failure probability, to provide differentiated reliability Protection. The main target of our work is to improve the network resource utilization ratio under the DiR constraint. We adopt the ideas of partial SRLG-disjoint and the K -shortest Paths algorithm such we can efficiently solve the “trap” problem. The experimental results show that our algorithm outperforms the complete SRLG-disjoint shared Path Protection in both blocking probability ratio and network resource utilization, i.e. the results are found to be promising.
-
Differentiated Reliable Partial SRLG-disjoint Shared Path Protection in Survivable WDM Network
2006 International Conference on Communications Circuits and Systems, 2006Co-Authors: Jin Cao, Lei GuoAbstract:In this paper, we address the problem of differentiated reliable shared Path Protection algorithm under Shared-Risk-Link-Group (SRLG) constraint in survivable wavelength-division-multiplexing (WDM) optical networks. Rather than the conventional complete SRLG-disjoint shared Path Protection, we introduce a heuristic Partial SRLG-disjoint Shared Path Protection algorithm (Pd-SPP) based on the concept of SRLG conditional failure probability, to provide differentiated reliability Protection. Our goal is to further improve the network resource utilization ratio under the DiR constraint. We adopt the ideas of partial SRLG-disjoint and the K-shortest Paths algorithm such we can efficiently solve the "trap" problem. The experimental results show that our algorithm outperforms the complete SRLG-disjoint shared Path Protection in both blocking probability ratio and network resource utilization, the results are found to be promising.
-
A novel hop constrained sub-Path Protection routing algorithm in WDM networks
Optics Communications, 2006Co-Authors: Jin Cao, Lei GuoAbstract:Abstract The survivable design is a key issue in reliable WDM optical networks to assure the service guarantee to customers. The sub-Path Protection metrics can achieve shorter failure recovery time than Path Protection metrics for a modest sacrifice in resource utilization. Rather than the conventional equal-length sub-Path Protection metrics (CDR algorithm), in this paper we propose a novel heuristic dynamic hop constrained sub-Path Protection (HCSPP) routing algorithm to provide a more flexible way to compute the primary sub-Paths and the backup sub-Paths. The main idea of HCSPP is that we first compute the primary Path and its end-to-end backup Path, the found primary and its end-to-end backup Path constitute a Protection cycle, then we partition the Protection cycle into several smaller Protection cycles by the straddling Paths we introduced, the hop count for each small Protection cycle should be constrained in a threshold value and the value can be adjusted according to different network topologies or different management policy, thus we can control the tradeoff between the failure recovery time and the resource utilization ratio. Compared with the CDR [P.-H. Ho, J. Tapolcai, T. Cinkler, IEEE/ACM Trans. Networking 12 (6) (2004) 1105] algorithm, HCSPP can achieve a better compromise between the blocking probability and the failure recovery time. We evaluate the effectiveness of the HCSPP and the results are found to be promising.
-
ICN (1) - A new Path Protection algorithm for meshed survivable wavelength-division-multiplexing networks
Networking - ICN 2005, 2005Co-Authors: Lei GuoAbstract:In this paper, we investigate the relationship between the resource sharing degree and the Protection ability, and propose a new Path Protection algorithm (PPA) to protect the multi-link failures in survivable wavelength-division-multiplexing (WDM) mesh networks. Under dynamic traffic with different load, the simulation results show that PPA not only provide 100% Protection for the single-link failure but also has higher resource utilization ratio than the dedicated-Path Protection (DPP) and higher Protection ability than the shared-Path Protection (SPP) as the multi-link failures occur. With configuring different parameter, PPA can determine the appropriate tradeoffs between the resource utilization ratio and the Protection ability.
Yoshihisa Yamada - One of the best experts on this subject based on the ideXlab platform.
-
Survivable Hierarchical Optical Path Network Design With Dedicated Wavelength Path Protection
Journal of Lightwave Technology, 2011Co-Authors: Yoshihisa Yamada, Hiroshi Hasegawa, Ken-ichi SatoAbstract:In this paper, we propose a novel network design algorithm that yields the hierarchical optical Path network with dedicated wavelength Path Protection. A hierarchical optical Path network provides two granularities in implementing dedicated Protection in the optical layer, namely waveband Path Protection and wavelength Path Protection. The characteristics of both Protection mechanisms are investigated. We develop the concept of the source-destination Cartesian product space to aggregate closely located traffic demands, which leads to a significant reduction in network resources needed. The proposed wavelength Path Protection algorithm achieves lower network costs than that possible with waveband Protection when traffic volume is relatively small. On the other hand, in the large traffic demand area, both schemes offer almost the same cost, which makes the waveband Protection scheme attractive because of its operational simplicity. Numerical results clarify that survivable hierarchical optical Path network is more cost effective than the single layer optical Path network with optical layer Protection, irrespective of which Protection scheme is utilized.
Biswanath Mukherjee - One of the best experts on this subject based on the ideXlab platform.
-
New and improved approaches for shared-Path Protection in WDM mesh networks
Journal of Lightwave Technology, 2004Co-Authors: Jing Zhang, Hui Zang, L. Sahasrabuddhe, Biswanath MukherjeeAbstract:This paper investigates the problem of dynamic survivable lightPath provisioning in optical mesh networks employing wavelength-division multiplexing (WDM). In particular, we focus on shared-Path Protection because it is resource efficient due to the fact that backup Paths can share wavelength links when their corresponding working Paths are mutually diverse. Our main contributions are as follows. 1) First, we prove that the problem of finding an eligible pair of working and backup Paths for a new lightPath request requiring shared-Path Protection under the current network state is NP-complete. 2) Then, we develop a heuristic, called CAFES, to compute a feasible solution with high probability. 3) Finally, we design another heuristic, called OPT, to optimize resource consumption for a given solution. The merits of our approaches are that they capture the essence of shared-Path Protection and approach to optimal solutions without enumerating Paths. We evaluate the effectiveness of our heuristics and the results are found to be promising.
-
near optimal approaches for shared Path Protection in wdm mesh networks
International Conference on Communications, 2003Co-Authors: Jing Zhang, Hui Zang, L. Sahasrabuddhe, Biswanath MukherjeeAbstract:This paper investigates the problem of dynamic shared-Path-protected lightPath provisioning in optical mesh networks employing wavelength-division multiplexing (WDM). We prove that the problem of finding an eligible pair of working and backup Paths for a new lightPath request requiring shared-Path Protection under the current network state is NP-complete. We develop a heuristic, called CAFES, to compute a feasible solution and an algorithm, called OPT, to optimize resource consumption for a given solution. The merits of our approaches are that they capture the essence of shared-Path Protection and approach to optimal solutions without enumerating Paths. We evaluate the effectiveness of our heuristics and the results are found to be promising.
-
ICC - Near-optimal approaches for shared-Path Protection in WDM mesh networks
IEEE International Conference on Communications 2003. ICC '03., 1Co-Authors: Jing Zhang, Hui Zang, L. Sahasrabuddhe, Biswanath MukherjeeAbstract:This paper investigates the problem of dynamic shared-Path-protected lightPath provisioning in optical mesh networks employing wavelength-division multiplexing (WDM). We prove that the problem of finding an eligible pair of working and backup Paths for a new lightPath request requiring shared-Path Protection under the current network state is NP-complete. We develop a heuristic, called CAFES, to compute a feasible solution and an algorithm, called OPT, to optimize resource consumption for a given solution. The merits of our approaches are that they capture the essence of shared-Path Protection and approach to optimal solutions without enumerating Paths. We evaluate the effectiveness of our heuristics and the results are found to be promising.
-
Sub-Path Protection for scalability and fast recovery in WDM mesh networks
Optical Fiber Communication Conference and Exhibit, 1Co-Authors: Biswanath Mukherjee, H. ZangAbstract:Summary form only given. In an optical wavelength-division multiplexing (WDM) network, the failure of a network element (e.g., fiber link, cross-connect, etc.) can cause the failure of several optical channels, thereby leading to large data (and revenue) loss. A significant amount of work has been done to provide Protection switching in ring topologies. As networks migrate from stacked rings to meshes because of the excessive resource redundancy used in ring-based Protection, mesh-structured Protection schemes have been receiving increasing attention. We propose a variation of shared-Path Protection called sub-Path Protection, which minimizes the total resource usage (in terms of wavelength-links), for a given traffic demand and area partitioning, while guaranteeing fast recovery time.
Hiroshi Hasegawa - One of the best experts on this subject based on the ideXlab platform.
-
Survivable Hierarchical Optical Path Network Design With Dedicated Wavelength Path Protection
Journal of Lightwave Technology, 2011Co-Authors: Yoshihisa Yamada, Hiroshi Hasegawa, Ken-ichi SatoAbstract:In this paper, we propose a novel network design algorithm that yields the hierarchical optical Path network with dedicated wavelength Path Protection. A hierarchical optical Path network provides two granularities in implementing dedicated Protection in the optical layer, namely waveband Path Protection and wavelength Path Protection. The characteristics of both Protection mechanisms are investigated. We develop the concept of the source-destination Cartesian product space to aggregate closely located traffic demands, which leads to a significant reduction in network resources needed. The proposed wavelength Path Protection algorithm achieves lower network costs than that possible with waveband Protection when traffic volume is relatively small. On the other hand, in the large traffic demand area, both schemes offer almost the same cost, which makes the waveband Protection scheme attractive because of its operational simplicity. Numerical results clarify that survivable hierarchical optical Path network is more cost effective than the single layer optical Path network with optical layer Protection, irrespective of which Protection scheme is utilized.
-
Survivable hierarchical optical Path networks employing waveband and wavelength Path Protection
Optical Fiber Communication - incudes post deadline papers 2009. OFC 2009. Conference on, 2009Co-Authors: Yoshiyuki Yamada, Hiroshi Hasegawa, Ken-ichi SatoAbstract:We propose a novel hierarchical optical Path network design algorithm ensuring wavelength Path Protection. The effectiveness of the waveband networks that adopt waveband or wavelength Path Protection are elucidated compared to single layer optical networks.
