The Experts below are selected from a list of 10590 Experts worldwide ranked by ideXlab platform
Moshe Zukerman - One of the best experts on this subject based on the ideXlab platform.
-
Multicast Traffic grooming in tap-and-continue WDM mesh networks
Journal of Optical Communications and Networking, 2012Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:Multicast applications are expected to be major drivers of Internet Traffic growth. As most Multicast connections require much lower bandwidth than the capacity offered by a wavelength, Multicast Traffic grooming is needed to efficiently use network resources. Recent research on Multicast grooming has focused on light-trees because of their natural advantage for Multicast Traffic. However, using light-trees may lead to some serious negative side effects because of light splitting. In this paper, we investigate the Multicast Traffic grooming problem in tap-and-continue (TaC) networks, where a node can tap a small amount of incoming optical power for the local station while forwarding the remainder to an output. We first propose a simple and efficient node architecture with the TaC mechanism. We use this in an integer linear programming (ILP) formulation with the objective of minimizing the network cost in terms of the number of higher layer electronic ports and the number of wavelengths used. Since the ILP is not scalable, two heuristic algorithms, Multicast trail grooming (MTG) and multiple destination trail-based grooming (MDTG), are proposed. Using the ILP, we show that having more costly nodes with Multicast capability does not improve the performance significantly. The solutions obtained by MTG and MDTG are close to the ILP optimal solution. MTG and MDTG are shown to work efficiently for typical network topologies such as NSFNET, with MTG showing better performance than MDTG.
-
Leaking Strategy for Multicast Traffic Grooming in WDM Mesh Networks
Journal of Lightwave Technology, 2012Co-Authors: Wen-de Zhong, Sanjay Kumar Bose, Moshe ZukermanAbstract:The ever-increasing popularity and Traffic volume of Multicast applications motivates the need for development of methodologies for Traffic management and network design that especially cater for Multicast Traffic. Addressing the disparity between the bandwidth offered by a wavelength and the bandwidth required by a single connection is a key challenge in the efficient usage of any wavelength-division multiplexing (WDM) network. This problem is also relevant to WDM networks that support Multicast Traffic and can be mitigated by Multicast Traffic grooming. This paper considers Multicast Traffic grooming with a leaking strategy where a light-tree may deliver the Traffic of a Multicast connection to nodes that are not in the destination set of the connection. This leaking strategy improves the sharing of light-trees and add/drop ports, leading to lower blocking ratios. Two Multicast Traffic grooming algorithms with leaking strategy, namely, Multicast Traffic leaky grooming (MTLG), and Multicast Traffic hybrid grooming (MTHG) are proposed. MTLG grooms Traffic to light-trees if the Traffic leaked is less than a given threshold value. MTHG first grooms Traffic to light-trees without leaking; if some destinations remain, it then grooms Traffic to light-trees with leaking. MTHG is an improvement over MTLG as it can attain higher light-tree sharing with less Traffic leaked. Simulations show that the two proposed algorithms perform better than other algorithms at low add/drop port ratios with MTHG showing better performance.
-
Design of WDM Networks With Multicast Traffic Grooming
Journal of Lightwave Technology, 2011Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:With the growing popularity of Multicast applications and the recognition of the potential of achievable efficiency gain of Traffic grooming, we face the challenge of optimizing the design of WDM networks with Multicast Traffic grooming. As higher layer electronic ports become the dominant factor of the WDM network cost, it is critical to reduce their number when grooming Multicast Traffic into high bandwidth light-trees. This paper provides an optimal cost design of WDM networks with Multicast Traffic grooming. In particular, a light-tree based Integer Linear Programming (ILP) formulation is proposed to minimize the network cost associated with the number of higher layer electronic ports and the number of wavelengths used. Since solving the ILP formulation is time consuming for large networks, we propose a heuristic algorithm, called sub-light-tree saturated grooming (SLTSG), to achieve scalability. This algorithm tries to construct sub-light-trees which can be fully utilized. Simulations are conducted on several networks to compare the design cost and the required number of electronic ports and wavelengths. The results demonstrate significant benefits of using a light-tree based design over a design that only uses lightpaths.
-
ICICS - Heuristic algorithms for Multicast Traffic grooming in WDM mesh networks
2011 8th International Conference on Information Communications & Signal Processing, 2011Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:Multicast Traffic grooming is used to multiplex or groom multiple low bandwidth Multicast connections into a high bandwidth wavelength channel or light-tree to increase the utilization of wavelength. However, Multicast Traffic grooming is NP-hard problem. Thus, we propose two heuristic algorithms with polynomial complexities, called Adjacent Node Component based Grooming for Throughput (ANCG-T) and Dividable Light-Tree Grooming (DLTG) algorithm, to achieve scalable design for realistic networks in realistic networks. ANCG-T algorithm is to divide light-tree into sub-light-trees which are within two optical hops, to increase sharing of resources. DLTG algorithm is based on grooming Traffic to light-trees and also on dividing a light-tree to sub-light-trees and then grooming Traffic to these sub-light-trees to improve resource utilization. Simulations show that both the algorithms have throughput performances which are very close to optimal results, and that the DLTG algorithm can achieve better network throughput than the ANCG-T algorithm.
-
Light-tree based Multicast Traffic grooming in WDM mesh networks
2010Co-Authors: Rongping Lin, Sanjay Kumar Bose, Moshe Zukerman, Wen-de Zhong, Qirui HuangAbstract:To multiplex or groom multiple low bandwidth connections into a high bandwidth wavelength channel is called Traffic grooming in wavelength-division multiplexing (WDM) mesh networks. This paper proposes a light-tree-based mathematical formulation to provide optimal assignments of light-trees for Multicast Traffic grooming in order to maximize network throughput. Simulations show the validity of the formulation.
Wen-de Zhong - One of the best experts on this subject based on the ideXlab platform.
-
Multicast Traffic grooming in tap-and-continue WDM mesh networks
Journal of Optical Communications and Networking, 2012Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:Multicast applications are expected to be major drivers of Internet Traffic growth. As most Multicast connections require much lower bandwidth than the capacity offered by a wavelength, Multicast Traffic grooming is needed to efficiently use network resources. Recent research on Multicast grooming has focused on light-trees because of their natural advantage for Multicast Traffic. However, using light-trees may lead to some serious negative side effects because of light splitting. In this paper, we investigate the Multicast Traffic grooming problem in tap-and-continue (TaC) networks, where a node can tap a small amount of incoming optical power for the local station while forwarding the remainder to an output. We first propose a simple and efficient node architecture with the TaC mechanism. We use this in an integer linear programming (ILP) formulation with the objective of minimizing the network cost in terms of the number of higher layer electronic ports and the number of wavelengths used. Since the ILP is not scalable, two heuristic algorithms, Multicast trail grooming (MTG) and multiple destination trail-based grooming (MDTG), are proposed. Using the ILP, we show that having more costly nodes with Multicast capability does not improve the performance significantly. The solutions obtained by MTG and MDTG are close to the ILP optimal solution. MTG and MDTG are shown to work efficiently for typical network topologies such as NSFNET, with MTG showing better performance than MDTG.
-
Leaking Strategy for Multicast Traffic Grooming in WDM Mesh Networks
Journal of Lightwave Technology, 2012Co-Authors: Wen-de Zhong, Sanjay Kumar Bose, Moshe ZukermanAbstract:The ever-increasing popularity and Traffic volume of Multicast applications motivates the need for development of methodologies for Traffic management and network design that especially cater for Multicast Traffic. Addressing the disparity between the bandwidth offered by a wavelength and the bandwidth required by a single connection is a key challenge in the efficient usage of any wavelength-division multiplexing (WDM) network. This problem is also relevant to WDM networks that support Multicast Traffic and can be mitigated by Multicast Traffic grooming. This paper considers Multicast Traffic grooming with a leaking strategy where a light-tree may deliver the Traffic of a Multicast connection to nodes that are not in the destination set of the connection. This leaking strategy improves the sharing of light-trees and add/drop ports, leading to lower blocking ratios. Two Multicast Traffic grooming algorithms with leaking strategy, namely, Multicast Traffic leaky grooming (MTLG), and Multicast Traffic hybrid grooming (MTHG) are proposed. MTLG grooms Traffic to light-trees if the Traffic leaked is less than a given threshold value. MTHG first grooms Traffic to light-trees without leaking; if some destinations remain, it then grooms Traffic to light-trees with leaking. MTHG is an improvement over MTLG as it can attain higher light-tree sharing with less Traffic leaked. Simulations show that the two proposed algorithms perform better than other algorithms at low add/drop port ratios with MTHG showing better performance.
-
Design of WDM Networks With Multicast Traffic Grooming
Journal of Lightwave Technology, 2011Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:With the growing popularity of Multicast applications and the recognition of the potential of achievable efficiency gain of Traffic grooming, we face the challenge of optimizing the design of WDM networks with Multicast Traffic grooming. As higher layer electronic ports become the dominant factor of the WDM network cost, it is critical to reduce their number when grooming Multicast Traffic into high bandwidth light-trees. This paper provides an optimal cost design of WDM networks with Multicast Traffic grooming. In particular, a light-tree based Integer Linear Programming (ILP) formulation is proposed to minimize the network cost associated with the number of higher layer electronic ports and the number of wavelengths used. Since solving the ILP formulation is time consuming for large networks, we propose a heuristic algorithm, called sub-light-tree saturated grooming (SLTSG), to achieve scalability. This algorithm tries to construct sub-light-trees which can be fully utilized. Simulations are conducted on several networks to compare the design cost and the required number of electronic ports and wavelengths. The results demonstrate significant benefits of using a light-tree based design over a design that only uses lightpaths.
-
Source failure recovery for optical Multicast Traffic in WDM networks
2011 13th International Conference on Transparent Optical Networks, 2011Co-Authors: Wen-de Zhong, Feng ZhangAbstract:Most current research activities in the field of optical Multicast Traffic protection are mainly directed to link failure recovery and (intermediate) node failure recovery. Even with the guarantee of link failure recovery and (intermediate) node failure recovery, optical Multicast Traffic is still threatened by the catastrophic damage of source failures. Thus, we recently investigated flow p-cycle based dual-source protection approach for source failure recovery on top of combined node and link failure recovery. Results indicated that flow p-cycle based dual-source Multicast protection approach outperforms the extended optimal path pair based dual-source approach in capacity efficiency.
-
ICICS - Heuristic algorithms for Multicast Traffic grooming in WDM mesh networks
2011 8th International Conference on Information Communications & Signal Processing, 2011Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:Multicast Traffic grooming is used to multiplex or groom multiple low bandwidth Multicast connections into a high bandwidth wavelength channel or light-tree to increase the utilization of wavelength. However, Multicast Traffic grooming is NP-hard problem. Thus, we propose two heuristic algorithms with polynomial complexities, called Adjacent Node Component based Grooming for Throughput (ANCG-T) and Dividable Light-Tree Grooming (DLTG) algorithm, to achieve scalable design for realistic networks in realistic networks. ANCG-T algorithm is to divide light-tree into sub-light-trees which are within two optical hops, to increase sharing of resources. DLTG algorithm is based on grooming Traffic to light-trees and also on dividing a light-tree to sub-light-trees and then grooming Traffic to these sub-light-trees to improve resource utilization. Simulations show that both the algorithms have throughput performances which are very close to optimal results, and that the DLTG algorithm can achieve better network throughput than the ANCG-T algorithm.
Rongping Lin - One of the best experts on this subject based on the ideXlab platform.
-
Multicast Traffic grooming in tap-and-continue WDM mesh networks
Journal of Optical Communications and Networking, 2012Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:Multicast applications are expected to be major drivers of Internet Traffic growth. As most Multicast connections require much lower bandwidth than the capacity offered by a wavelength, Multicast Traffic grooming is needed to efficiently use network resources. Recent research on Multicast grooming has focused on light-trees because of their natural advantage for Multicast Traffic. However, using light-trees may lead to some serious negative side effects because of light splitting. In this paper, we investigate the Multicast Traffic grooming problem in tap-and-continue (TaC) networks, where a node can tap a small amount of incoming optical power for the local station while forwarding the remainder to an output. We first propose a simple and efficient node architecture with the TaC mechanism. We use this in an integer linear programming (ILP) formulation with the objective of minimizing the network cost in terms of the number of higher layer electronic ports and the number of wavelengths used. Since the ILP is not scalable, two heuristic algorithms, Multicast trail grooming (MTG) and multiple destination trail-based grooming (MDTG), are proposed. Using the ILP, we show that having more costly nodes with Multicast capability does not improve the performance significantly. The solutions obtained by MTG and MDTG are close to the ILP optimal solution. MTG and MDTG are shown to work efficiently for typical network topologies such as NSFNET, with MTG showing better performance than MDTG.
-
Design of WDM Networks With Multicast Traffic Grooming
Journal of Lightwave Technology, 2011Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:With the growing popularity of Multicast applications and the recognition of the potential of achievable efficiency gain of Traffic grooming, we face the challenge of optimizing the design of WDM networks with Multicast Traffic grooming. As higher layer electronic ports become the dominant factor of the WDM network cost, it is critical to reduce their number when grooming Multicast Traffic into high bandwidth light-trees. This paper provides an optimal cost design of WDM networks with Multicast Traffic grooming. In particular, a light-tree based Integer Linear Programming (ILP) formulation is proposed to minimize the network cost associated with the number of higher layer electronic ports and the number of wavelengths used. Since solving the ILP formulation is time consuming for large networks, we propose a heuristic algorithm, called sub-light-tree saturated grooming (SLTSG), to achieve scalability. This algorithm tries to construct sub-light-trees which can be fully utilized. Simulations are conducted on several networks to compare the design cost and the required number of electronic ports and wavelengths. The results demonstrate significant benefits of using a light-tree based design over a design that only uses lightpaths.
-
ICICS - Heuristic algorithms for Multicast Traffic grooming in WDM mesh networks
2011 8th International Conference on Information Communications & Signal Processing, 2011Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:Multicast Traffic grooming is used to multiplex or groom multiple low bandwidth Multicast connections into a high bandwidth wavelength channel or light-tree to increase the utilization of wavelength. However, Multicast Traffic grooming is NP-hard problem. Thus, we propose two heuristic algorithms with polynomial complexities, called Adjacent Node Component based Grooming for Throughput (ANCG-T) and Dividable Light-Tree Grooming (DLTG) algorithm, to achieve scalable design for realistic networks in realistic networks. ANCG-T algorithm is to divide light-tree into sub-light-trees which are within two optical hops, to increase sharing of resources. DLTG algorithm is based on grooming Traffic to light-trees and also on dividing a light-tree to sub-light-trees and then grooming Traffic to these sub-light-trees to improve resource utilization. Simulations show that both the algorithms have throughput performances which are very close to optimal results, and that the DLTG algorithm can achieve better network throughput than the ANCG-T algorithm.
-
Light-tree based Multicast Traffic grooming in WDM mesh networks
2010Co-Authors: Rongping Lin, Sanjay Kumar Bose, Moshe Zukerman, Wen-de Zhong, Qirui HuangAbstract:To multiplex or groom multiple low bandwidth connections into a high bandwidth wavelength channel is called Traffic grooming in wavelength-division multiplexing (WDM) mesh networks. This paper proposes a light-tree-based mathematical formulation to provide optimal assignments of light-trees for Multicast Traffic grooming in order to maximize network throughput. Simulations show the validity of the formulation.
Sanjay Kumar Bose - One of the best experts on this subject based on the ideXlab platform.
-
Multicast Traffic grooming in tap-and-continue WDM mesh networks
Journal of Optical Communications and Networking, 2012Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:Multicast applications are expected to be major drivers of Internet Traffic growth. As most Multicast connections require much lower bandwidth than the capacity offered by a wavelength, Multicast Traffic grooming is needed to efficiently use network resources. Recent research on Multicast grooming has focused on light-trees because of their natural advantage for Multicast Traffic. However, using light-trees may lead to some serious negative side effects because of light splitting. In this paper, we investigate the Multicast Traffic grooming problem in tap-and-continue (TaC) networks, where a node can tap a small amount of incoming optical power for the local station while forwarding the remainder to an output. We first propose a simple and efficient node architecture with the TaC mechanism. We use this in an integer linear programming (ILP) formulation with the objective of minimizing the network cost in terms of the number of higher layer electronic ports and the number of wavelengths used. Since the ILP is not scalable, two heuristic algorithms, Multicast trail grooming (MTG) and multiple destination trail-based grooming (MDTG), are proposed. Using the ILP, we show that having more costly nodes with Multicast capability does not improve the performance significantly. The solutions obtained by MTG and MDTG are close to the ILP optimal solution. MTG and MDTG are shown to work efficiently for typical network topologies such as NSFNET, with MTG showing better performance than MDTG.
-
Leaking Strategy for Multicast Traffic Grooming in WDM Mesh Networks
Journal of Lightwave Technology, 2012Co-Authors: Wen-de Zhong, Sanjay Kumar Bose, Moshe ZukermanAbstract:The ever-increasing popularity and Traffic volume of Multicast applications motivates the need for development of methodologies for Traffic management and network design that especially cater for Multicast Traffic. Addressing the disparity between the bandwidth offered by a wavelength and the bandwidth required by a single connection is a key challenge in the efficient usage of any wavelength-division multiplexing (WDM) network. This problem is also relevant to WDM networks that support Multicast Traffic and can be mitigated by Multicast Traffic grooming. This paper considers Multicast Traffic grooming with a leaking strategy where a light-tree may deliver the Traffic of a Multicast connection to nodes that are not in the destination set of the connection. This leaking strategy improves the sharing of light-trees and add/drop ports, leading to lower blocking ratios. Two Multicast Traffic grooming algorithms with leaking strategy, namely, Multicast Traffic leaky grooming (MTLG), and Multicast Traffic hybrid grooming (MTHG) are proposed. MTLG grooms Traffic to light-trees if the Traffic leaked is less than a given threshold value. MTHG first grooms Traffic to light-trees without leaking; if some destinations remain, it then grooms Traffic to light-trees with leaking. MTHG is an improvement over MTLG as it can attain higher light-tree sharing with less Traffic leaked. Simulations show that the two proposed algorithms perform better than other algorithms at low add/drop port ratios with MTHG showing better performance.
-
Design of WDM Networks With Multicast Traffic Grooming
Journal of Lightwave Technology, 2011Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:With the growing popularity of Multicast applications and the recognition of the potential of achievable efficiency gain of Traffic grooming, we face the challenge of optimizing the design of WDM networks with Multicast Traffic grooming. As higher layer electronic ports become the dominant factor of the WDM network cost, it is critical to reduce their number when grooming Multicast Traffic into high bandwidth light-trees. This paper provides an optimal cost design of WDM networks with Multicast Traffic grooming. In particular, a light-tree based Integer Linear Programming (ILP) formulation is proposed to minimize the network cost associated with the number of higher layer electronic ports and the number of wavelengths used. Since solving the ILP formulation is time consuming for large networks, we propose a heuristic algorithm, called sub-light-tree saturated grooming (SLTSG), to achieve scalability. This algorithm tries to construct sub-light-trees which can be fully utilized. Simulations are conducted on several networks to compare the design cost and the required number of electronic ports and wavelengths. The results demonstrate significant benefits of using a light-tree based design over a design that only uses lightpaths.
-
ICICS - Heuristic algorithms for Multicast Traffic grooming in WDM mesh networks
2011 8th International Conference on Information Communications & Signal Processing, 2011Co-Authors: Rongping Lin, Sanjay Kumar Bose, Wen-de Zhong, Moshe ZukermanAbstract:Multicast Traffic grooming is used to multiplex or groom multiple low bandwidth Multicast connections into a high bandwidth wavelength channel or light-tree to increase the utilization of wavelength. However, Multicast Traffic grooming is NP-hard problem. Thus, we propose two heuristic algorithms with polynomial complexities, called Adjacent Node Component based Grooming for Throughput (ANCG-T) and Dividable Light-Tree Grooming (DLTG) algorithm, to achieve scalable design for realistic networks in realistic networks. ANCG-T algorithm is to divide light-tree into sub-light-trees which are within two optical hops, to increase sharing of resources. DLTG algorithm is based on grooming Traffic to light-trees and also on dividing a light-tree to sub-light-trees and then grooming Traffic to these sub-light-trees to improve resource utilization. Simulations show that both the algorithms have throughput performances which are very close to optimal results, and that the DLTG algorithm can achieve better network throughput than the ANCG-T algorithm.
-
Light-tree based Multicast Traffic grooming in WDM mesh networks
2010Co-Authors: Rongping Lin, Sanjay Kumar Bose, Moshe Zukerman, Wen-de Zhong, Qirui HuangAbstract:To multiplex or groom multiple low bandwidth connections into a high bandwidth wavelength channel is called Traffic grooming in wavelength-division multiplexing (WDM) mesh networks. This paper proposes a light-tree-based mathematical formulation to provide optimal assignments of light-trees for Multicast Traffic grooming in order to maximize network throughput. Simulations show the validity of the formulation.
Ashok Kumar Pradhan - One of the best experts on this subject based on the ideXlab platform.
-
A heuristic approach based on dynamic Multicast Traffic grooming in WDM mesh networks
Journal of Optics, 2017Co-Authors: Ashok Kumar Pradhan, Saurabh Keshri, Tanmay DeAbstract:The dynamic Multicast Traffic grooming is an efficient way to minimize the utilization of network resources such as wavelengths, transmitters, receivers and splitters and minimizing the Traffic blocking probability. In this article, we initially formulate an Integer Linear Programming for minimizing the blocking probability associated with the network resources, then propose a heuristic algorithm for dynamic Multicast Traffic grooming problem to achieve our objective. We divide our problem into three sub-problems: (1) routing/provisioning of Multicast requests; (2) light-tree based logical topology design, and (3) Traffic grooming problem. In this approach, we will decide the appropriate grooming technique based on the ratio of number of wavelengths used in the networks to the number of transceivers and splitters. We use computer simulations to evaluate the performance of various policies used in this algorithm. Our simulation results demonstrate that our approach significantly reduces the blocking probability constraint by the network resources used in the network when compared with the other existing algorithms.
-
Resource efficient Multicast Traffic grooming in WDM mesh networks
Journal of High Speed Networks, 2016Co-Authors: Ashok Kumar Pradhan, Kunal Das, A. GhoshAbstract:In this paper, we have considered an optimal design and provisioning of WDM networks for the grooming of sub-wavelengths Traffic requests. As higher layer electronic ports, such as transceivers and optical splitters are dominant cost factors of an optical network, it is essential to reduce their numbers of use while grooming the Multicast Traffic requests into high bandwidth light-trees. This paper provides an optimal cost design of WDM networks with Multicast Traffic grooming under static Traffic demand. We develop a unified framework for the optimal provisioning of different practical scenarios of Multicast Traffic grooming in a static Traffic scenario. In this study, we design an Integer linear Programming (ILP) formulation for Multicast Traffic grooming to minimize the cost associated with the higher layer electronic ports such as transceivers, splitters and wavelengths, and simultaneously maximize the bandwidth utilization of the network. We propose a heuristic algorithm called Efficient Light-Tree based Multicast Traffic Grooming (ELT-MTG) algorithm to achieve scalability in large size optical networks. Simulations are conducted on several standard well-known WDM mesh networks to study the design cost (based on number of transceivers, optical splitters and wavelengths) used in the networks. The result, thus obtained by comparison, helped us to conclude that the proposed approach ELT-MTG gives better performance than well-known existing logical-first sequential routing with single-hop grooming (LFSEQSH) and logical-first sequential routing with multi-hop grooming (LFSEQMH) algorithms in a static Traffic environment.
-
Multicast Traffic grooming with survivability in WDM mesh networks
2015 2nd International Conference on Signal Processing and Integrated Networks (SPIN), 2015Co-Authors: Ashok Kumar Pradhan, Tanmay DeAbstract:Survivability of Traffic grooming problem for optical mesh networks is employed in WDM mesh networks. A typical connection request may require bandwidth capacity which is lesser than the wavelength channel capacity of an optical fiber network, and it may also require protection from link failures of the network, typically fiber cut. As higher layer electronic ports, such as transceivers and optical splitters are dominant cost factors of an optical network, it is essential to reduce their number of use when grooming the Multicast Traffic into high bandwidth light-trees. This paper, provides an near optimal cost design of WDM networks with survivable Multicast Traffic grooming under static Traffic demands. In this paper, we have proposed a heuristic approach called Multicast Traffic Grooming with Survivability (MTGS) at light-tree level for grooming a connection request with segment protection. In this segment protection scheme, backup paths use the network resources (such as transceivers, optical splitters and wavelengths), as long as their working paths are failed simultaneously. In our proposed approach, working paths and backup paths are groomed separately and protecting each specific link when two links failed simultaneously. The main objective of this approach is to minimize the cost of the network which is associated with network resources. We have compared our work with existing approach called logical-first sequential routing with single-hop grooming (LFSEQSH) and logical-first sequential routing with multi-hop grooming (LFSEQMH) algorithms. In the existing Multicast Traffic algorithms, we add survivability with Traffic grooming in static Traffic environment. The results, thus obtained by comparison depict that our proposed approach yields better performance in term of network cost than existing algorithms.
-
Design of light-tree based Multicast Traffic grooming in WDM mesh networks
Journal of Optics, 2014Co-Authors: Ashok Kumar Pradhan, Saurabh Araiyer, Tanmay DeAbstract:In this paper, we design an optimization problem for grooming of Multicast Traffic requests in WDM mesh networks. The objective is to minimize the network cost by minimizing the number of optical splitters and at the same time minimizing the total number of wavelengths used in the network. We propose a heuristic algorithm called Priority based Sub-Light Tree Grooming (PSLTG) to achieve scalability for larger networks. PSLTG tries to satisfy all Multicast requests by constructing sub-light trees. A mathematical formulation is derived to minimize the network cost associated with the number of optical splitters and number of wavelengths used in the networks. Simulations are conducted on several standard networks to compare the cost and required number of wavelengths used in the networks. The results thus obtained by comparison, helped us to conclude that the proposed approach PSLTG produces better performance than well known Sub-Light Tree Saturated Grooming (SLTSG) and Multicast Traffic Grooming (MTG) algorithms.
-
A Heuristic Approach for Multicast Traffic Grooming in Optical WDM Mesh Networks
International Journal of Computer Network and Information Security, 2013Co-Authors: Ashok Kumar Pradhan, Subhendu BaratAbstract:Abstra —Traffic grooming is being considered as a key functionality of WDM networks, in which, multiple low speed Traffic requests are groomed into a single high capacity wavelength channel. In this work, Multicast Traffic grooming problem is addressed to maximize the bandwidth utilization for a set of sessions in an optical WDM mesh topology. We propose a heuristic approach called Prioritized Multicast Traffic Grooming (PMTG) for constructing Multicast tree and a first fit algorithm for wavelength assignment. After successful grooming of Multicast requests, PMTG algorithm have successfully reduced the maximum number of wavelengths required in a link at the same time bandwidth utilization has greatly improved. We have simulated the heuristic approach PMTG with different network topologies and compared the performance with Multicast Traffic Grooming with Shortest Path (MTG-SP) algorithm. The simulation results show that the proposed heuristic algorithm produces better result than MTG-SP based algorithm.