The Experts below are selected from a list of 42489 Experts worldwide ranked by ideXlab platform
Chunming Qiao - One of the best experts on this subject based on the ideXlab platform.
-
survivable Virtual Infrastructure mapping with dedicated protection in transport software defined networks invited
IEEE\ OSA Journal of Optical Communications and Networking, 2015Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:Efficiently mapping multiple Virtual Infrastructures (VIs) onto the same physical substrate with survivability is one of the fundamental challenges related to network Virtualization in transport software-defined networks (T-SDNs). In this paper, we study the survivable VI mapping problem in T-SDNs with the objective of minimizing the VI request blocking probability. In particular, we address the subproblems of modulation selection and spectrum allocation in the process of provisioning optical channels to support Virtual links, taking into consideration the optical layer constraints such as the transmission reach constraint and the spectral continuity constraint. We propose an auxiliary-graph-based algorithm, namely, parallel VI mapping (PAR), to offer dedicated protection against any single physical node or link failure. More specifically, the PAR algorithm can jointly optimize the assignments of mapping the primary and backup VIs by adopting the modified Suurballe algorithm to find the shortest pair of node-disjoint paths for each Virtual link. Through extensive simulations, we demonstrate that the PAR algorithm can significantly reduce the VI request blocking probability and improve the traffic-carrying capacity of the networks, compared to the baseline sequential VI mapping approaches.
-
survivable Virtual Infrastructure mapping with dedicated protection in transport software defined networks invited
IEEE\ OSA Journal of Optical Communications and Networking, 2015Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:Efficiently mapping multiple Virtual Infrastructures (VIs) onto the same physical substrate with survivability is one of the fundamental challenges related to network Virtualization in transport software-defined networks (T-SDNs). In this paper, we study the survivable VI mapping problem in T-SDNs with the objective of minimizing the VI request blocking probability. In particular, we address the subproblems of modulation selection and spectrum allocation in the process of provisioning optical channels to support Virtual links, taking into consideration the optical layer constraints such as the transmission reach constraint and the spectral continuity constraint. We propose an auxiliary-graph-based algorithm, namely, parallel VI mapping (PAR), to offer dedicated protection against any single physical node or link failure. More specifically, the PAR algorithm can jointly optimize the assignments of mapping the primary and backup VIs by adopting the modified Suurballe algorithm to find the shortest pair of node-disjoint paths for each Virtual link. Through extensive simulations, we demonstrate that the PAR algorithm can significantly reduce the VI request blocking probability and improve the traffic-carrying capacity of the networks, compared to the baseline sequential VI mapping approaches.
-
regional failure resilient Virtual Infrastructure mapping in a federated computing and networking system
IEEE\ OSA Journal of Optical Communications and Networking, 2014Co-Authors: Chunming Qiao, Jianping Wang, Vishal AnandAbstract:Network-wide Virtualization is a promising technique that will enable future Internet to support a variety of network services and architectures over a shared optical network substrate. In network-wide Virtualization, it is important to efficiently map a Virtual Infrastructure (VI) over a wide-area optical network and guarantee the survivability of such a VI against failures. In this paper, we study the regional failure-resilient VI mapping (RRVIM) problem, where a failure-dependent protection approach is used to enable efficient sharing of protection resources among different regional failure scenarios. We first formulate the minimum-cost RRVIM problem using mixed integer linear programming (MILP) and then propose four heuristic algorithms to solve the problem. The efficiency of the MILP and the heuristics is compared via extensive simulation experiments under various performance metrics.
-
upgrade aware Virtual Infrastructure mapping in software defined elastic optical networks
Photonic Network Communications, 2014Co-Authors: Zilong Ye, Xiaojun Cao, Ankitkumar N. Patel, Philip N. Ji, Xu Li, Chunming QiaoAbstract:An emerging use case in software-defined networking is to provide efficient mapping of multiple Virtual Infrastructures (VIs) simultaneously over the same physical substrate (PS) which can increase the resource utilization of the PS, thus improving its provider's revenue. In this paper, for the first time, we investigate a practical and yet theoretically challenging issue related to dynamic VI mapping in software-defined elastic optical networks while considering the presence of possible upgrade of the VIs and the optical layer constraints, which has not been addressed in any of the existing studies. More specifically, we investigate the following aspects: (1) Which revenue models are appropriate? (2) How to map a new VI request or to upgrade an existing VI to maximize the PS providers revenue? In particular, we study two different revenue models in terms of the incremental pricing policy and the binding pricing policy and propose a number of efficient heuristics to solve the upgrade-aware VI mapping (U-VIM) problem. We also perform comprehensive performance evaluation in different scenario, and the results show that plan-ahead is a desirable strategy when conducting VI mapping in the presence of VI upgrade.
-
survivable Virtual Infrastructure mapping over transport software defined networks t sdn
Optical Fiber Communication Conference, 2014Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:An algorithm is proposed to map Virtual Infrastructures with survivability over T-SDN for the first time. The algorithm improves the traffic-carrying capacity of networks by provisioning at least 13% more demands than the baseline algorithms.
Zilong Ye - One of the best experts on this subject based on the ideXlab platform.
-
survivable Virtual Infrastructure mapping with dedicated protection in transport software defined networks invited
IEEE\ OSA Journal of Optical Communications and Networking, 2015Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:Efficiently mapping multiple Virtual Infrastructures (VIs) onto the same physical substrate with survivability is one of the fundamental challenges related to network Virtualization in transport software-defined networks (T-SDNs). In this paper, we study the survivable VI mapping problem in T-SDNs with the objective of minimizing the VI request blocking probability. In particular, we address the subproblems of modulation selection and spectrum allocation in the process of provisioning optical channels to support Virtual links, taking into consideration the optical layer constraints such as the transmission reach constraint and the spectral continuity constraint. We propose an auxiliary-graph-based algorithm, namely, parallel VI mapping (PAR), to offer dedicated protection against any single physical node or link failure. More specifically, the PAR algorithm can jointly optimize the assignments of mapping the primary and backup VIs by adopting the modified Suurballe algorithm to find the shortest pair of node-disjoint paths for each Virtual link. Through extensive simulations, we demonstrate that the PAR algorithm can significantly reduce the VI request blocking probability and improve the traffic-carrying capacity of the networks, compared to the baseline sequential VI mapping approaches.
-
survivable Virtual Infrastructure mapping with dedicated protection in transport software defined networks invited
IEEE\ OSA Journal of Optical Communications and Networking, 2015Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:Efficiently mapping multiple Virtual Infrastructures (VIs) onto the same physical substrate with survivability is one of the fundamental challenges related to network Virtualization in transport software-defined networks (T-SDNs). In this paper, we study the survivable VI mapping problem in T-SDNs with the objective of minimizing the VI request blocking probability. In particular, we address the subproblems of modulation selection and spectrum allocation in the process of provisioning optical channels to support Virtual links, taking into consideration the optical layer constraints such as the transmission reach constraint and the spectral continuity constraint. We propose an auxiliary-graph-based algorithm, namely, parallel VI mapping (PAR), to offer dedicated protection against any single physical node or link failure. More specifically, the PAR algorithm can jointly optimize the assignments of mapping the primary and backup VIs by adopting the modified Suurballe algorithm to find the shortest pair of node-disjoint paths for each Virtual link. Through extensive simulations, we demonstrate that the PAR algorithm can significantly reduce the VI request blocking probability and improve the traffic-carrying capacity of the networks, compared to the baseline sequential VI mapping approaches.
-
upgrade aware Virtual Infrastructure mapping in software defined elastic optical networks
Photonic Network Communications, 2014Co-Authors: Zilong Ye, Xiaojun Cao, Ankitkumar N. Patel, Philip N. Ji, Xu Li, Chunming QiaoAbstract:An emerging use case in software-defined networking is to provide efficient mapping of multiple Virtual Infrastructures (VIs) simultaneously over the same physical substrate (PS) which can increase the resource utilization of the PS, thus improving its provider's revenue. In this paper, for the first time, we investigate a practical and yet theoretically challenging issue related to dynamic VI mapping in software-defined elastic optical networks while considering the presence of possible upgrade of the VIs and the optical layer constraints, which has not been addressed in any of the existing studies. More specifically, we investigate the following aspects: (1) Which revenue models are appropriate? (2) How to map a new VI request or to upgrade an existing VI to maximize the PS providers revenue? In particular, we study two different revenue models in terms of the incremental pricing policy and the binding pricing policy and propose a number of efficient heuristics to solve the upgrade-aware VI mapping (U-VIM) problem. We also perform comprehensive performance evaluation in different scenario, and the results show that plan-ahead is a desirable strategy when conducting VI mapping in the presence of VI upgrade.
-
survivable Virtual Infrastructure mapping over transport software defined networks t sdn
Optical Fiber Communication Conference, 2014Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:An algorithm is proposed to map Virtual Infrastructures with survivability over T-SDN for the first time. The algorithm improves the traffic-carrying capacity of networks by provisioning at least 13% more demands than the baseline algorithms.
-
survivable Virtual Infrastructure mapping with shared protection in transport software defined networks t sdns
Australian Conference on Optical Fibre Technology, 2014Co-Authors: Ankitkumar N. Patel, Philip N. Ji, Zilong Ye, Chunming QiaoAbstract:We propose the first algorithm to embed Virtual Infrastructures with shared protection over T-SDNs. The algorithm optimizes network utilization by provisioning at least 20% more Virtual Infrastructures over physical substrates compared to the baseline algorithm.
Ting Wang - One of the best experts on this subject based on the ideXlab platform.
-
multi layer Virtual Infrastructure embedding in software defined flexible grid transport networks
2015Co-Authors: Ankitkumar Patel, Philip Nan Ji, Ting WangAbstract:Methods and systems for embedding VI demands in a software-defined network include mapping Virtual nodes over physical nodes in a network topology. An auxiliary graph including Virtual links between physical nodes that have a residual capacity sufficient to meet a Virtual Infrastructure demand is constructed. Virtual links over physical links are mapped to maximize use of existing optical channels and to minimize switching of a Virtual link between a wavelength division multiplexing layer and an IP layer. New optical channels with a maximum spectral efficiency are established. A set of potential solutions for embedding a set of Virtual Infrastructure demands is determined. A solution is selected from the set of potential solutions that maximizes a weighted average of spectrum needed to support the set of Virtual Infrastructure demands and a cost of provisioning the Virtual Infrastructure demands.
-
Virtual Infrastructure embedding over software defined flex grid optical networks
Global Communications Conference, 2013Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming Qiao, Ting WangAbstract:Software-Defined Networking (SDN) enables efficient and scalable network Virtualization. Infrastructure resources, such as computing and networking resources, can be abstracted and outsourced as a service using Virtualization technology. These SDN features can be extended to the optical transport networks to enable high capacity, low cost, and long reach transport networks. In this paper, we introduce an architecture for Software-Defined Optical Network (SDON), and study the Virtual Infrastructure embedding (VIE) problem over SDON with the objective of minimizing the blocking probability of VIE requests. We propose two novel heuristic algorithms, namely Compute followed by Network Load Balance (CNLB) and Network followed by Compute Load Balance (NCLB). Specifically, NCLB is the first ever attempt to solve the VIE problem by allocating the networking resource first followed by provisioning the computing resource. We compare these two algorithms with the Shortest-Path Based Embedding (SPBE) algorithm. The simulation results show that both CNLB and NCLB outperform SPBE in terms of minimizing the request blocking probability, and NCLB achieves the best performance.
-
Virtual Infrastructure embedding over software defined flex grid optical networks
Global Communications Conference, 2013Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming Qiao, Ting WangAbstract:Software-Defined Networking (SDN) enables efficient and scalable network Virtualization. Infrastructure resources, such as computing and networking resources, can be abstracted and outsourced as a service using Virtualization technology. These SDN features can be extended to the optical transport networks to enable high capacity, low cost, and long reach transport networks. In this paper, we introduce an architecture for Software-Defined Optical Network (SDON), and study the Virtual Infrastructure embedding (VIE) problem over SDON with the objective of minimizing the blocking probability of VIE requests. We propose two novel heuristic algorithms, namely Compute followed by Network Load Balance (CNLB) and Network followed by Compute Load Balance (NCLB). Specifically, NCLB is the first ever attempt to solve the VIE problem by allocating the networking resource first followed by provisioning the computing resource. We compare these two algorithms with the Shortest-Path Based Embedding (SPBE) algorithm. The simulation results show that both CNLB and NCLB outperform SPBE in terms of minimizing the request blocking probability, and NCLB achieves the best performance.
Philip N. Ji - One of the best experts on this subject based on the ideXlab platform.
-
survivable Virtual Infrastructure mapping with dedicated protection in transport software defined networks invited
IEEE\ OSA Journal of Optical Communications and Networking, 2015Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:Efficiently mapping multiple Virtual Infrastructures (VIs) onto the same physical substrate with survivability is one of the fundamental challenges related to network Virtualization in transport software-defined networks (T-SDNs). In this paper, we study the survivable VI mapping problem in T-SDNs with the objective of minimizing the VI request blocking probability. In particular, we address the subproblems of modulation selection and spectrum allocation in the process of provisioning optical channels to support Virtual links, taking into consideration the optical layer constraints such as the transmission reach constraint and the spectral continuity constraint. We propose an auxiliary-graph-based algorithm, namely, parallel VI mapping (PAR), to offer dedicated protection against any single physical node or link failure. More specifically, the PAR algorithm can jointly optimize the assignments of mapping the primary and backup VIs by adopting the modified Suurballe algorithm to find the shortest pair of node-disjoint paths for each Virtual link. Through extensive simulations, we demonstrate that the PAR algorithm can significantly reduce the VI request blocking probability and improve the traffic-carrying capacity of the networks, compared to the baseline sequential VI mapping approaches.
-
survivable Virtual Infrastructure mapping with dedicated protection in transport software defined networks invited
IEEE\ OSA Journal of Optical Communications and Networking, 2015Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:Efficiently mapping multiple Virtual Infrastructures (VIs) onto the same physical substrate with survivability is one of the fundamental challenges related to network Virtualization in transport software-defined networks (T-SDNs). In this paper, we study the survivable VI mapping problem in T-SDNs with the objective of minimizing the VI request blocking probability. In particular, we address the subproblems of modulation selection and spectrum allocation in the process of provisioning optical channels to support Virtual links, taking into consideration the optical layer constraints such as the transmission reach constraint and the spectral continuity constraint. We propose an auxiliary-graph-based algorithm, namely, parallel VI mapping (PAR), to offer dedicated protection against any single physical node or link failure. More specifically, the PAR algorithm can jointly optimize the assignments of mapping the primary and backup VIs by adopting the modified Suurballe algorithm to find the shortest pair of node-disjoint paths for each Virtual link. Through extensive simulations, we demonstrate that the PAR algorithm can significantly reduce the VI request blocking probability and improve the traffic-carrying capacity of the networks, compared to the baseline sequential VI mapping approaches.
-
upgrade aware Virtual Infrastructure mapping in software defined elastic optical networks
Photonic Network Communications, 2014Co-Authors: Zilong Ye, Xiaojun Cao, Ankitkumar N. Patel, Philip N. Ji, Xu Li, Chunming QiaoAbstract:An emerging use case in software-defined networking is to provide efficient mapping of multiple Virtual Infrastructures (VIs) simultaneously over the same physical substrate (PS) which can increase the resource utilization of the PS, thus improving its provider's revenue. In this paper, for the first time, we investigate a practical and yet theoretically challenging issue related to dynamic VI mapping in software-defined elastic optical networks while considering the presence of possible upgrade of the VIs and the optical layer constraints, which has not been addressed in any of the existing studies. More specifically, we investigate the following aspects: (1) Which revenue models are appropriate? (2) How to map a new VI request or to upgrade an existing VI to maximize the PS providers revenue? In particular, we study two different revenue models in terms of the incremental pricing policy and the binding pricing policy and propose a number of efficient heuristics to solve the upgrade-aware VI mapping (U-VIM) problem. We also perform comprehensive performance evaluation in different scenario, and the results show that plan-ahead is a desirable strategy when conducting VI mapping in the presence of VI upgrade.
-
survivable Virtual Infrastructure mapping over transport software defined networks t sdn
Optical Fiber Communication Conference, 2014Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:An algorithm is proposed to map Virtual Infrastructures with survivability over T-SDN for the first time. The algorithm improves the traffic-carrying capacity of networks by provisioning at least 13% more demands than the baseline algorithms.
-
survivable Virtual Infrastructure mapping with shared protection in transport software defined networks t sdns
Australian Conference on Optical Fibre Technology, 2014Co-Authors: Ankitkumar N. Patel, Philip N. Ji, Zilong Ye, Chunming QiaoAbstract:We propose the first algorithm to embed Virtual Infrastructures with shared protection over T-SDNs. The algorithm optimizes network utilization by provisioning at least 20% more Virtual Infrastructures over physical substrates compared to the baseline algorithm.
Ankitkumar N. Patel - One of the best experts on this subject based on the ideXlab platform.
-
survivable Virtual Infrastructure mapping with dedicated protection in transport software defined networks invited
IEEE\ OSA Journal of Optical Communications and Networking, 2015Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:Efficiently mapping multiple Virtual Infrastructures (VIs) onto the same physical substrate with survivability is one of the fundamental challenges related to network Virtualization in transport software-defined networks (T-SDNs). In this paper, we study the survivable VI mapping problem in T-SDNs with the objective of minimizing the VI request blocking probability. In particular, we address the subproblems of modulation selection and spectrum allocation in the process of provisioning optical channels to support Virtual links, taking into consideration the optical layer constraints such as the transmission reach constraint and the spectral continuity constraint. We propose an auxiliary-graph-based algorithm, namely, parallel VI mapping (PAR), to offer dedicated protection against any single physical node or link failure. More specifically, the PAR algorithm can jointly optimize the assignments of mapping the primary and backup VIs by adopting the modified Suurballe algorithm to find the shortest pair of node-disjoint paths for each Virtual link. Through extensive simulations, we demonstrate that the PAR algorithm can significantly reduce the VI request blocking probability and improve the traffic-carrying capacity of the networks, compared to the baseline sequential VI mapping approaches.
-
survivable Virtual Infrastructure mapping with dedicated protection in transport software defined networks invited
IEEE\ OSA Journal of Optical Communications and Networking, 2015Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:Efficiently mapping multiple Virtual Infrastructures (VIs) onto the same physical substrate with survivability is one of the fundamental challenges related to network Virtualization in transport software-defined networks (T-SDNs). In this paper, we study the survivable VI mapping problem in T-SDNs with the objective of minimizing the VI request blocking probability. In particular, we address the subproblems of modulation selection and spectrum allocation in the process of provisioning optical channels to support Virtual links, taking into consideration the optical layer constraints such as the transmission reach constraint and the spectral continuity constraint. We propose an auxiliary-graph-based algorithm, namely, parallel VI mapping (PAR), to offer dedicated protection against any single physical node or link failure. More specifically, the PAR algorithm can jointly optimize the assignments of mapping the primary and backup VIs by adopting the modified Suurballe algorithm to find the shortest pair of node-disjoint paths for each Virtual link. Through extensive simulations, we demonstrate that the PAR algorithm can significantly reduce the VI request blocking probability and improve the traffic-carrying capacity of the networks, compared to the baseline sequential VI mapping approaches.
-
upgrade aware Virtual Infrastructure mapping in software defined elastic optical networks
Photonic Network Communications, 2014Co-Authors: Zilong Ye, Xiaojun Cao, Ankitkumar N. Patel, Philip N. Ji, Xu Li, Chunming QiaoAbstract:An emerging use case in software-defined networking is to provide efficient mapping of multiple Virtual Infrastructures (VIs) simultaneously over the same physical substrate (PS) which can increase the resource utilization of the PS, thus improving its provider's revenue. In this paper, for the first time, we investigate a practical and yet theoretically challenging issue related to dynamic VI mapping in software-defined elastic optical networks while considering the presence of possible upgrade of the VIs and the optical layer constraints, which has not been addressed in any of the existing studies. More specifically, we investigate the following aspects: (1) Which revenue models are appropriate? (2) How to map a new VI request or to upgrade an existing VI to maximize the PS providers revenue? In particular, we study two different revenue models in terms of the incremental pricing policy and the binding pricing policy and propose a number of efficient heuristics to solve the upgrade-aware VI mapping (U-VIM) problem. We also perform comprehensive performance evaluation in different scenario, and the results show that plan-ahead is a desirable strategy when conducting VI mapping in the presence of VI upgrade.
-
survivable Virtual Infrastructure mapping over transport software defined networks t sdn
Optical Fiber Communication Conference, 2014Co-Authors: Zilong Ye, Ankitkumar N. Patel, Philip N. Ji, Chunming QiaoAbstract:An algorithm is proposed to map Virtual Infrastructures with survivability over T-SDN for the first time. The algorithm improves the traffic-carrying capacity of networks by provisioning at least 13% more demands than the baseline algorithms.
-
survivable Virtual Infrastructure mapping with shared protection in transport software defined networks t sdns
Australian Conference on Optical Fibre Technology, 2014Co-Authors: Ankitkumar N. Patel, Philip N. Ji, Zilong Ye, Chunming QiaoAbstract:We propose the first algorithm to embed Virtual Infrastructures with shared protection over T-SDNs. The algorithm optimizes network utilization by provisioning at least 20% more Virtual Infrastructures over physical substrates compared to the baseline algorithm.
