Advances in OptoElectronics

Volume 2016 (2016), Article ID 1978617, 6 pages

http://dx.doi.org/10.1155/2016/1978617

## A Grooming Nodes Optimal Allocation Method for Multicast in WDM Networks

School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China

Received 30 September 2015; Accepted 18 January 2016

Academic Editor: Vasily Spirin

Copyright © 2016 Chengying Wei et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The grooming node has the capability of grooming multicast traffic with the small granularity into established light at high cost of complexity and node architecture. In the paper, a grooming nodes optimal allocation (GNOA) method is proposed to optimize the allocation of the grooming nodes constraint by the blocking probability for multicast traffic in sparse WDM networks. In the proposed GNOA method, the location of each grooming node is determined by the SCLD strategy. The improved smallest cost largest degree (SCLD) strategy is designed to select the nongrooming nodes in the proposed GNOA method. The simulation results show that the proposed GNOA method can reduce the required number of grooming nodes and decrease the cost of constructing a network to guarantee a certain request blocking probability when the wavelengths per fiber and transmitter/receiver ports per node are sufficient for the optical multicast in WDM networks.

#### 1. Introduction

With the tremendous growth of the Internet, multicast applications, such as streamed video broadcasts, cloud computing, Internet of things, video conference, and IP based televisions, are attracting more and more people’s attention [1–3]. It is most likely that the traffic generated by these applications will be transported over WDM networks. The number of wavelength channels required and traffic blocking increase rapidly in the limited number of wavelength channels per fiber link in WDM networks. A wavelength channel can provide several Gbps bandwidths, but most multicast applications require only multiple subwavelength channels, such as OC-1 (51 Mb/s), OC-3, OC-12, and OC-48 [4, 5]. As the numbers of wavelengths in each link and the optical transceivers in each node are limited, it is impossible to establish end-to-end connection for each multicast traffic request. By enabling multiplexing or grooming of multiple request connections or flows to a shared wavelength channel, traffic grooming becomes the most important method to improve wavelength bandwidth utilization, optimize network throughput, and minimize network costs [6–8].

So far, most of the existing researches have assumed that all nodes in WDM networks are grooming nodes [6–9]. Due to the embedded O/E/O conversion and electronic signal processing capabilities, the cost of grooming node is far higher than the nongrooming node. 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 opaque grooming nodes placement in WDM networks for multicast traffic. And each node configured with grooming ability in the WDM backbone networks is of high cost and not realistic [10, 11]. Due to the fact, the nodes in WDM networks can be divided into two categories. One is the node with the grooming capability, called -node, which can perform the low-speed traffic exchange and add/drop traffic grooming. The other is ordinary nongrooming node, called -node, which can only switch the whole input traffic to the output port. The network, configured with -node and -node, is called sparse grooming networks [12, 13]. However, in sparse grooming networks, since the -node has no ability to groom the low-speed traffic, it would lead to the unreasonable use of network wavelength resource, and the network performance will ebb. So, how to choose grooming nodes as few as possible has a great practical significance and economic value for constructing a network [14, 15]. But there is only a very little literature on how to transmit the multicast traffic in sparse grooming WDM networks.

In the paper, the grooming nodes selection strategy, namely, SCLD strategy, is studied in Section 2, which comprehensively considers node degree and link cost in WDM networks. And we analyze how the multicast request is transported in sparse grooming WDM networks. In Section 3, the multicast grooming process is described in sparse WDM networks. In Section 4, based on the improved grooming nodes selection strategy, the grooming nodes optimal allocation (GNOA) method is proposed to optimize the number and placement of grooming nodes by the SCLD strategy in multicast sparse WDM networks.

#### 2. Smallest Cost Largest Degree (SCLD) Grooming Node Selection Strategy

In sparse grooming WDM networks, for the dynamic unicast traffic, the analysis model of network blocking probability is put forward to study the dynamic unicast traffic transmission performance [10, 11], which is shown as follows:where represents the blocking probability of request which passes transmission nodes on path . indicates the blocking probability of request when there is no grooming node on path . is the probability of path without grooming node, represents the blocking probability of request when the last node on path is a grooming node, and is the probability of which the last node on path is the grooming node.

For the dynamic multicast traffic, the number and position of grooming nodes have a similar great impact on network performance. We know that the node’s degree influences the node’s throughput and convergence capability in the network topology. Some methods are studied to select the grooming nodes, such as based on node degree (BOND) method, based on Educed Node Degree (BOEND) method, and Random Selection (RS) method [14]. For BOND selection criteria, a node with a higher degree of connectivity is more likely to be used during multicast tree construction for reaching each multicast destination. Each node is sorted according to its node degree. The basic idea of BOEND is to calculate the node’s educed degree, that is, the number of the nodes through each shortest path of any pair nodes. The large educed degree nodes with great probability of grooming traffic are selected as the grooming nodes in the BOEND method.

BOND and BOEND methods have the two same disadvantages. One is if some of nodes in network have the same degree, these methods cannot distinguish the priority from each node. The other is that these methods are proposed for unicast traffic grooming, which is not suitable for multicast traffic.

We study an improved BOEND method to improve the BOEND selection grooming node’s efficiency by calculating the shortest path cost. A node which uses a path that incurs a smaller total link cost to reach each multicast destination in WDM networks is more likely to be used frequently in building low cost multicast trees. For example, the link cost can be hop count, physical distance, link delay, link monetary cost, and so forth or a combination of the above costs. Whether this method is discriminative enough for selecting a node to be a -node depends on the cost metric(s) involved. In this paper, the cost of each node can be calculated as follows: where represents the path cost between node and node . The method selects nodes in increasing order of .

In view of above shortcomings, smallest cost largest degree (SCLD) grooming node selection strategy is proposed in the paper for multicast traffic grooming, which integrated the BOND, improved BOEND, and RS criteria. The SCLD strategy employs the improved BOEND strategy firstly to select the lowest cost grooming nodes. If nodes selection fails or there have been several nodes with same cost and they are difficult to distinguish priority, then the BOND criteria are used to select the other grooming nodes in the SCLD strategy. If there also are some candidate nodes having the same degree, the RS criteria are applied to randomly select the grooming node.

#### 3. Multicast Traffic Grooming in Sparse Networks

Unicast traffic grooming is widely studied in the recent years [12, 13]. But the multicast traffic grooming is quite different from the unicast traffic grooming. Five basic grooming methods are widely used, which are shown as follows.

*Single-Hop Grooming*. Groom the new traffic request onto an existing light-tree with only one hop.

*Multihop Grooming*. Groom the new traffic request onto multiple existing light-trees with not more than two hops.

*Mixed Grooming*. Set up a new light path from the source node of request to the source node of an existing light-tree, using the existing light-tree and the new light path to complete the request transfer.

*Expand Light-Tree*. Extend an existing light-tree to reach all the destination nodes of the multicast. Here, the source node of new request is the same as the source node of existing light-tree.

*Establish a New Light-Tree*. Establish a new light-tree directly between the source node of request and each destination of the request.

For these methods are based on full grooming networks for the multicast request, the method in sparse WDM networks is different. The reason is that the -node only has the optical wavelength switch module without electronic grooming module. For example, if the source node of an existing light-tree for one multicast request is the -node, then this light-tree cannot be used as the first light-tree found by multihop grooming method and also cannot be used as the existing light-tree found by mixed grooming method or expand light-tree method. The light-tree may only be used by single-hop grooming. Therefore, they need to meet some constraints for traffic routing and grooming in sparse WDM networks.

According to the grooming capability of the new arrival traffic request’s source node, the new traffic request obeys the following conditions and steps to complete the transmission.

(1) If the new request source node is the -node, the grooming process is as follows. Firstly, we check whether the* single-hop grooming* method can groom the request; if it cannot, then we check whether the* mixed grooming* method can groom the request; if it cannot, we try to establish a new light-tree to transport the request.

(2) If the new request source node is the -node, the grooming process is as follows. Firstly, we check whether the* single-hop grooming* method can groom the request; if it cannot, then we check whether the* multihop grooming* method can groom the request; if it cannot also, we check whether the* mixed grooming method* can groom the request; if it cannot, we check whether the* expand light-tree method* can groom the request; if it still cannot, we try to establish a new light-tree for transporting the request.

During the multicast grooming, the above grooming methods must meet above conditions defined. In the* multihop grooming method*, the source node of the first light-tree which has the same destinations as the new request must have the grooming capabilities; that is to say, the source node is a -node. In the* mixed grooming method*, the existing light-tree must have the same destination nodes as the new request, and the source node of this light-tree must have the grooming capabilities, and the optical transceiver in source node must be available. In the* expand light-tree method*, the extended branch node must be -node; otherwise, it cannot be expanded. In the* establish a new light-tree method*, the source node must consume a transmitter, and each destination consumes a receiver, so the operation must ensure that the new light-tree source and destination nodes have available transceiver and the wavelength channels are available.

#### 4. Grooming Nodes Optimal Allocation Method

Due to limited performance improvement for all network nodes configured as the -nodes with high cost, how to allocate grooming nodes as few as possible has a great practical significance and economic value for WDM networks. Based on the heuristic algorithm, a grooming nodes optimal allocation (GNOA) method is proposed to optimize the multicast traffic grooming. By setting a network request blocking probability deterioration ratio , the algorithm tries to increase -nodes as many as possible in WDM networks and check if the network’s blocking probability exceeds the blocking probability deterioration value.

*Input*. Given a network topology with nodes and fiber links, the number of transceivers at each node meets Rx = 3Tx, where Rx is number of optical receivers and Tx is number of transmitters. And, for the multicast, Rx is three times Tx. is the number of wavelength channels per fiber, is the capacity of each wavelength channel, is the value of blocking probability deterioration ratio, and is the total number of the connection requests generated in the simulation.

*Output*. The optimization set of -nodes is the output.

The step of GNOA method is described as follows.

*Step 1. *For input network topology, set . Assume all nodes in the network are -nodes; we calculate the network’s request blocking probability and denote it as .

*Step 2. *Calculate the nodes’ degree and educed nodes degree. SCLD strategy is used to sort the nodes’ selection descending order. According to blocking probability deterioration ratio, we calculate network deterioration blocking probability .

*Step 3. *Add th -node to the network continuously. Then the network becomes a sparse network. We use the multicast traffic grooming method introduced in part 3 to complete the new request transmission. Calculate the network practical blocking probability denoted as and then compare if . If not, go to Step 5.

*Step 4. *, if ; go to Step 3; else end the algorithm and output set of -nodes.

*Step 5. *If is greater than the deterioration blocking probability , we delete the last -node (th) in the network and output the network and the set of -nodes.

#### 5. Simulation and Analysis

The proposed GNOA method performance is simulated in the NSFNet network, which consists of 14 nodes and 21 bidirectional physical links. Each link cost is shown in Figure 1. We set . The default assumptions and parameters are used for the simulation environment.