2011 Fourth International Joint Conference on Computational Sciences and Optimization

Approximation Algorithms for Multicast Routing and Wavelength Assignment in Multi-hop Optical WDM Networks
Tianping Shuai, Wenbao Ai School of Sciences Beijing University of Posts and Telecommunications Beijing, China {shuaitp,wenbaoai}@gmail.com

AbstractExisting research has demonstrated that effective Routing and Wavelength Assignment (RWA) algorithm and wavelength conversion are two primary vehicles for improving the networks performance. In this paper, we consider the multicast routing and wavelength assignment problem(MC-RWA) in multi-hop optical WDM networks, where requests arrives one by one. Specially, we rst analyze this problem under the objective of minimizing maximum hops, an efcient MC-RWA algorithm was proposed in this case. But for minimizing the total number of wavelength conversions, the problem turns out to be NP-hard, hence we propose an efcient approximation MC-RWA algorithm. At last, combine the the two objectives, we propose a bi-factor approximation algorithm to minimize the total wavelength conversions and the maximum hops in the system simultaneously. Keywords-WDM network; multicast; routing and wavelength assignment; approximation algorithm

I. I NTRODUCTION Advances in electro-optic technologies have made optical networks a promising choice to meet the increasing demands for higher bandwidth and lower communication latency of high-performance computing and communication applications. Wavelength Division Multiplexing (WDM) [1], [2] is basically a frequency division multiplexing in the optical frequency domain, where on a single optical ber there are multiple communication channels at different wavelengths. Multicast in wavelength-routed WDM networks will become a preferred tool for the future due to its ability to support bandwidth intensive applications such as high denition television (HDTV), video conferencing and video on demand (VOD) [4]. However, many issues still have to be addressed in order for multicasting to operate efciently in the WDM network. One of the important issues is the multicast routing and wavelength assignment problem (MCRWA). This problem has been largely investigated over the past few years. Given a multicast communication request, the Multicast Routing and Wavelength assignment (MCRWA) problem is that of nding a set of optical links and wavelength on these links on which to establish the connection from the source node to all destination nodes. While unicast communication is a special case of multicast communication that there is only one destination node.
978-0-7695-4335-2/11 $26.00 2011 IEEE DOI 10.1109/CSO.2011.93 1291

There are basically two types of architectures of optical networks: single-hop systems and multi-hop systems. In single-hop systems [2], each pair of communication nodes has a logical channel congured and the same wavelength should be used throughout the channel of the route. There is no wavelength conversion in the intermediate nodes. In single-hop systems, a light-tree concept was proposed in [5] to support multicast request. In multi-hop systems [3], the channel of a pair of nodes can consist of several lightpath segments that may use different wavelengths. Wavelength conversion is needed at a node where the input and output bers of the channel use different wavelengths. Similarly, a semilight-tree is obtained by establishing and chaining several light-trees or lightpaths together to support an arrived multicast request. Related work. In the past, various MC-RWA problems have been investigated for both packet- and circuitswitched networks [3][5], [7], [11][13], [15]. It was studied in [3] concerns the design of multicastcapable optical switches. In [5], the concept of light-trees was introduced for multicast request in networks. The objectives of setting up the light-tees in [5] are to minimize the network wide hop distance and to minimize the total number of transceivers used in the network. In [4], an asymptotic upper bound on the number of wavelengths needed to support multicast capability was obtained by use some properties of expander graphs. In [8], Liang and Shen investigated the problem of nd minimum-cost in a model that associate with a specic cost for each wavelength on each link as well as a cost for conversions between wavelengths at intermediate nodes. In [5], Sahasrabuddhe and Mukherjee formulate the problem for multihop multicast routing in packet-switched networks as a mixedinteger linear programming problem. Ran Libeskind-Hadas et al [12] investigated multicast communication in circuitswitched multihop networks, they prove that the problem under their model is, in general, NP-complete and show that for any given multicast tree, the wavelength assignment problem can be solved in linear time. Very recently, G. Poo et al [16] model the WDM network as a collection of wavelength layers with sparse lightsplitting

(LS) and wavelength conversion (WC) capabilities and then apply the degree constraint technique to solve the problem. I. Peng et al. in [15] proposed a systematic scheme of wavelength assignment for multicast in WDM network with sparse wavelength conversion nodes. K. Yong [17] and Q. Wu [18]study the multicast RWA with delay constraint in WDM networks with sparse wavelength conversions, for ofine and dynamic case, respectively. Our results. In this paper, we consider the multicast routing and wavelength assignment problem for a set of multicast requests in a multihop system where requests arrive over time. For each arrived multicast request, the problem is to nd a multicast route and assign a wavelength to each ber links on the route. The objective is to minimize the total number of wavelength conversions or the maximum number of hops or both simultaneously. For the rst case, we propose an efcient approximation MC-RWA algorithm based on group steiner tree. Similarly, for the second case, we propose a polynomial time optimal MC-RWA algorithm based on shortest path tree. At last, combine the above two objectives, we proposed a polynomial tiem approximation 2 MC-RWA algorithm with bi-factor (, 1 + 1 ). The rest of this paper is organized as follows. Section 2 gives the problem formulation and related work. Then a set of algorithms were proposed in Section 3. Finally, we conclude the paper in Section 4. II. A LGORITHMS DESIGN AND ANALYSIS A. Problem Formulation The optical WDM network can be modeled as a connected digraph = (, ), where is the set of nodes and the set of directed links, respectively. We assume that = (, ) is totally symmetric, that is, there is an arc (, ) from to iff there is an arc (, ) from to , and they holds same wavelength available set. Let = {1 , . . . , } be a set of wavelengths available for network and () be a set of wavelengths available for link (). A multicast communication request is denoted by an ordered pair (, ), where is the source, and {} is the set of destination nodes. We assume that multicast communication requests are made and released dynamically. Denition 1: A light-tree (, ) for a multicast request (, ) is a Steiner tree of to connect all nodes in {} and each link of are assigned a same wavelength. A semi-lighttree is established by chaining several light-trees together such that each source-destination pair is connected by a semi-ligthpath. Denition 2: Let (, ) be a directed graph and (, ) be a multicast request. A Multicast Routing and Wavelength Assignment( ) is to nd a semi-

lighttree for request (, ) such that each nodes of are connected to the source by a semi-lightpath. Denition 3: Let (, ) be an unicast request and (, ) be a semi-lightpath connect and , dene the hops (, ) of path (, ) be the number of wavelength conversions occurred on the path. Similarly, denoted (, ) be the minimum number of wavelength conversions used to establish optimal semi-lightpath for request (, ). Hence, (, ) = {((, ), ) }. Denition 4: Given a multicast request (, ) and a semi-lighttree (, ) for (, ), dene the hops of a semilighttree (, ) be the maximum hops between source and destination , that is, (, ) = {(, ) }, and the cost of a semi-lighttree (, ) for request (, ), denote it by ( (, )), be the number of wavelength conversions occurred on semi-lighttree (, ). Let ( ) be the total number of wavelength conversions occurred at node , then ( (, )) = ( ). In this paper, we consider the MC-RWA problem under the following objectives. 1. Minimize the maximum number of hops: Find a semilighttree to minimize the maximum number of hops, that is, to minimize (, ). 2. Minimize the total number of wavelength conversions: Find a semi-lighttree to minimize the total number of wavelength conversions, that is, to minimize ( (, )). 3. Minimize total wavelength conversions and maximum hops simultaneously: Find a semi-lighttree such that the total number of wavelength conversion and the maximum hops are minimized simultaneously. B. Minimize the maximum number of hops In this subsection, we consider how to design an efcient algorithm to minimize the maximum hops. We proposed an optimal polynomial time algorithm based on shortest path tree algorithm. The basic idea of the algorithm is rst to construct an auxiliary graph, then use Dijkstras algorithm to nd a minimum hops path between each pair of source and destinations. At last, we prune the obtained minimum hops path tree to maintain both tree structure and optimality of hops. In what follows, we rst introduce how to construct an auxiliary graph, the idea is similar to Liang [8]. Given a network (, ), we rst construct a directed multigraph = ( , ) as follows. Let = , for each directed link = (, ) , there are () parallel directed links from to in . Each such a link is associated with a distinct wavelength (). Let (, ) and (, ) be the set of incoming links and the set of outgoing links of in , respectively. Let ( , ) = (, ) () and ( , ) =

1292

() be the set of wavelengths on the incoming links and the outgoing links of respectively. We then construct a directed bipartite graph = ( , , , 1 ) for each node as follows. For each wavelength ( , ), there is a corresponding node in , and for each wavelength ( , ), there is a corresponding node in . There is a directed link = (, ) from to iff one of the following conditions holds: (i) = , in this case, we assign a weight 1 () = 0 to . (ii) = and the wavelength conversion from to at is allowed. Then we assign a weight 1 () = 1 to . Thirdly, we construct an auxiliary directed weight graph 2 ) from and { , } as follows. = ( , , Denote 0 = ( , ), let (, ) be any link with wavelength , Suppose and are the corresponding nodes of and in and respectively. Then ( , ) and its weight is 2 ( , ) = 0. Let be the set of the links of obtained from by the above transformation. For each = , there is an edge weight (, ) = 0 (, ) 2 , a and assign to (, ). Let = 2 {(, ) } and = 0 , where (, ) = 0, . Then the auxiliary graph is completed. The following is the detail of Algorithm A.
(, )

the tree structure. Otherwise, we consider the last common node , use the method of Case1.2 to modify one of the semi-lightpath. Theorem 1.Algorithm A is correct and returns a minimum maximum hops tree in time ( 2 2 + + 2 ( )). proof: By the above description, it is easy to see that the algorithm will output an optimal multicast tree. Clearly, construct a auxiliary graph in Step 0 can be done in time ( 2 + ). From the book by Cormen et al. [21] (see p.530), a shortest path between any two nodes in a graph can be computed in ( ( ) + ) time if the Fibonacci heap technique is employed. At last, prune procedure can be implemented in time ( ). Notice that the algorithm actually constructs a minimum maximum hops tree rooted at the source node . Hence, our algorithm can be implemented in time ( 2 2 + + 2 ( )) and output an optimal multicast tree. C. Minimize the total number of wavelength conversions In the following subsection, we consider how to design an efcient algorithm to minimize the total number of wavelength conversions. We proposed a polynomial time approximation algorithm based on group Steiner tree. The basic idea of the algorithm is rst to construct an auxiliary graph, and then use group Steiner tree algorithm to produce a Steiner tree of source and destinations. At last, we prune the obtained Steiner tree to maintain tree structure in original graph such that each destination node is connected to source node by a semi-lightpath. The auxiliary graph is constructed as follows, for each edge = (, ) , substitute it by () edges {( , )}. Then, we have vertex set
= { , = (, ) , ()}

A LGORITHM A Input: Network (, ), multicast request (, ). Output: A multicast tree . Step 0. Construct an auxiliary graph by the above method. Step 1. Use Dijkstras algorithm to nd a minimum hops path between source and each destination in . Step 2. Integrate all those semi-lightpaths found by step of . 1., form a subgraph by Prune Step 3. Pruning the abundant links of procedure to maintain the tree structure.

edge set =
{( , )

P RUNE PROCEDURE Search the graph by DFS. Suppose there are two minimum hops path (, 1 ) and (, 2 ) which hold some common nodes in . Case 1. Only one common node . Let (, ) bethe path corresponding to (, ), = 1, 2. Case 1.1. (1 (, )) > (2 (, )), then replace the path (, 1 ) by (, 1 ) = 2 (, ) (, 1 ). Case 1.2. (1 (, )) = (2 (, )) but ( (, 1 )) > ( (, 2 )), then substitute (, 2 ) by (, 2 ) = 1 (, ) (, 2 ). Case 2. More than one common nodes. We rst try to nd a common node that holds the condition of Case 1.1 and use the previous method to prune the path to maintain

= (, ), = (, ) , () ( )} (), ( ), convert with }.

{( , )

()}

{( , ) = (, ), = (, ) ,

assign a weight to each edge as follows,

( , ) = ( , ) = 0, ( , ) = 1.

Let

= (, ), ()} ( ) = {

Then, the problem converts to nd a minimum group steiner tree of { ( ) {} } on graph . At last we prune the obtained tree to be a semi-lighttree. A LGORITHM B

1293

Step 1. Construct auxiliary graph as above. Step 2. Find a group steiner tree of {} in . Step 3. Prune the steiner tree to a feasible multicast tree for multicast request (, ). Theorem 2 Algorithm B can output a feasible multicast routing tree in time ( 2 2 ) and the performance bound is at most ( ). Proof: By the above description, construct an auxiliary graph can be done in time ( 2 + ). From the book by Hwang et al. [22], nd an approximate group steiner tree of vertex set takes ( 2 ) time whose cost is at most ( ) times that of an optimal steiner tree. At last prune procedure can be implemented in time ( ). Notice that the algorithm actually constructs a multicast tree rooted at the source node . So, our algorithm can be implemented in time ( 2 2 ). D. Minimum total wavelength conversions and maximum hops simultaneously In this subsection, we consider how to nd a for a multicast request (, ) to meet both minimum maximum hops and minimum total wavelength conversions. Note that the minimum total wavelength conversions problem we discussed in previous section is NP-hard. So wed like to nd a multicast tree approximately to achieve the two goals. Let (, ) be a network, we use distance (, ) to denote the minimum number of hops of any semi-ligthpath between and in . Denition 5: . For 1 and 1, a multicast tree of multicast request (, ) of meeting the following two requirements is called an (, ) (Light Approximate Minimum Hops Tree). (1) For every , (, ) ((, )) (2) ( ) . That is, the total number wavelength conversions of is at most times the total number of wavelength conversions of the optimal multicast tree. Next we consider how to design an algorithm to achieve the both objective approximately. Suppose a minimum maximum hops tree and a minimum total wavelength conversions tree of multicast request (, ) is obtained by some algorithm, then for any given > 1, we design a polynomial time algorithm which returns a 2 (, 1 + 1 ) . The basic idea of the algorithm is to traverse the minimum total wavelength conversion tree and maintaining a tree structure all the time. At each time, we check the vertex which it is encountered to ensure that the hops requirement for that vertex is met in the current tree. If the requirement is not met, the shortest hops semi-lightpath between the vertex and the source was added into the current tree, some links and nodes will discarded to ensure a tree structure.

After all vertices have been checked and path added as necessary , the remaining tree is the desired (, ) . The algorithm rst to determine the number of hops between source and other vertices in , the algorithm maintains a hops estimate ( ) for each vertex . This hops estimate, which is an upper bound on the true hops in the current tree, is used in deciding whether to add a path to the vertex and prune the obtained current tree. The following is the detail of the algorithm. A LGORITHM TO FIND - ( , , , ) Input: Multicast tree and , Multicast request (, ), > 1. 2 Output: An (, 1 + 1 ) tree. Step 1. Initialization For non-source node , let [ ] ;[] 0. modify [ ], and parent [ ] of , if [ ] > [] + 1 then [ ] [], if [ ] > [] and no wavelength conversion on (, ) at node , then [ ] [], else [ ] [] + 1. Step 2. Traverse DFS(u): Traverse the subtree of whose root is , relax links as they are traversed,add a semilightpath to tree as it needed. if [] > (, ) then relax the links on the path from source to in tree : if [ ] > (, ), then add path ( ()), relax ( ( ), ); for each son of , relax (, ): if [ ] > [] + 1, then [ ] [] + 1, [ ] . run traverse DFS(v) and relax (, ). step 3. Use same method in Algo. A to prune current tree.
2 Next we show that our algorithm returns a (, 1 + 1) in polynomial time. Let be the output tree. Lemma 3 The hops between and in is at most times the optimal maximum hops. Proof: When a vertex is visited, if ( ) > ((, )), then add-path is called, after that which ( ) equals the ( ). In any case, after is visited, ( ) is at most times the optimal hops, and subsequently never increase. On termination it bounds the hops in . Theorem 4 The number of wavelength conversions of 2 is at most 1 + 1 times the minimum total wavelength conversions. Proof: Let 1 , 2 , . . . , be the vertices that caused minimum hops paths to be added during the traversal, in the order they were encountered. When the minimum hops path from to , ( 1) was added, the net hops of the added path was at most (, ). Since is totally symmetric digraph, we have ( ) (, 1 )+ (1 , )+1. The minimum hops path to was added because

1294

 (, ) < ( ). Combine those inequalities, we have (, ) ( ) 1 (, 1 ) + (1 , ) sum all the above inequalities, we have (, ) ( (, 1 ) + (1 , )) Hence, ( 1)
=1 =1 =1

[7] I. Chlamtac, A. Farag , T. Zhang, Lightpath(Wavelength)Routing in Large WDM Networks. IEEE J. Select. Areas. Commun. vol 14, no. 5, pp. 909-913. 1996. [8] W. Liang and H. Shen, Multicasting and Broadcasting in lLarge WDM Networks, In Proc. 12-th Int. Parallel Processing Symp. (IPPS/SPDP). Orlando, FL, 1998. pp. 516-523. [9] H. Shen, F. Chin, and Y. Pan, Efcient Fault-tolerent Routing in Multihop Optical WDM Networks. IEEE Trans. Parallel. DistSyst. vol. 10. pp. 1012-1025, Otc, 1999. [10] S. B. Tand , I. S.Meditch, Supporting Multipoint Connections in Multihop WDM Optical Networks. J. High-speed Networks, vol. 4. no. 2. pp. 169-188. 1995.

(, )

=1

(1 , )

=1

So we have, (, ) and

2 1 ( ) =1

( ) ( ) + We are done.

(, ) (1 +

2 1 ) ( )

[11] S. B. Tridandapan and B. Mukherjee, Channel Sharing in Multihop WDM Lightwave Networks: Realization and Performance of Multicast Trafc. IEEE J. Select. Areas. Commun. vol. 15. pp. 488-500. Apr. 1997. [12] R. Libesklad-hadas, and R. Melhem, Multicast Routing and Wavelength Assignment in Multihop Optical Networks. IEEE/ACM Trans. Networking, vol. 10. no. 5. Oct. 2002. [13] H. Shen, Y. Pan, J. Sum, S. Horiguchi, Multicasting in Multihop Optical WDM Networks with Limited Wavelength Conversion. IEICE Trans. INF& SYST. vol. E86-D, no.1,2003. [14] H. Shen, J. Sum, G. H. Young, and S. Horiguchi, Efcient Algorithms for On-line Communication in WDM networks. In Proc. Intern. Conf. on. Parallel. and Distributed Processing Techniques and Applications, Las Vegas, USA, 2000. [15] I-Hsuan Peng, Y.-W. Chen, and H.-R. Peng. A Systematic Wavelength Assign Algorithm for Multicast in WDM Networks with Sparse Conversion Nodes. In JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 25, pp.559574, 2009. [16] Gee-Swee Poo, Aijun Ding, Layered-routing approach for solving multicast routing and wavelength assignment problem In Photon Netw Commun (2007) vol13, pp.123C137, 2007. [17] Keen-Mun Yong, Tee-Hiang Cheng, and Gee-Swee, Poo Dynamic Multicast Routing and Wavelength Assignment with Minimal Conversions in Delay-Constrained WDM Networks ICCCN2009, pp.1-6. [18] Qiwu Wu, Xianwei Zhou, Jianping Wang, Zhizhong Yin, and Lin Lin, Multicast routing and wavelength assignment with delay constraint in WDM networks with sparse wavelength conversions In Photon Netw Commun vol 19, pp.144-154, 2010. [19] W. Liang and X. Shen, Improved Lightpath (Wavelength) Routing in Large WDM Networks IEEE Trans. Commun. vol. 48, no. 8. pp. 1571-1579, Sept. 2000. [20] S. Khuller, B. Raghavachari, and N. Young, Balancing Minimum Spanning Trees and Shortest-Path Tress, Algorithmica, vol. 14. pp. 305-321. 1995. [21] T.H. Cormen et al. Introduction rithms.Cambridge,MA. MIT Press,1989. to Algo-

III. CONCLUSION In this paper, we discussed the MC-RWA problem for minimize the total wavelength conversions and minimize the maximum hops respectively. A polynomial time approximation and optimal algorithm was proposed for each objectives. We then consider to minimize the two objectives simultaneously. The future work is to design more efcient algorithm and combine the optimization of optical splitters. ACKNOWLEDGMENT This work was supported in part by Natural Science Foundation of China(Grant No.11001030,10726058, 10971017,71072157); Open Fund of Key Laboratory of Information Photonics and Optical Communications (Beijing University of Posts and Telecommunications), Ministry of Education; Chinese Universities Scientic Fund(BUPT2009RC0706); and NCET-08-0740. R EFERENCES
[1] D. Banerjee and B. Mukherjee. A Practical Approach for Routing and Wavelength Assignment in Large Wavelengthrouted Optical Networks. IEEE. J. Select. Areas Commun., Vol 14 pp. 903-908. 1996. [2] B. Mukherjee, WDM-based Local Lightwave Networks, Part I:Single-hop systems. IEEE Network, Vol 6, pp. 12-27, 1992. [3] B. Mukherjee, WDM-based Local Lightwave Networks, Part II:Multihop systems. IEEE Network, Vol.6, pp. 20-32, 1992. [4] R. K. Pankaj, Wavelength Requirements for Multicasting in All-optical Networks, IEEE/ACM Trans. Networking, vol 7. pp. 414-424. 1999. [5] L. H. Sahasrabuddhe and B. Mukherjee. Light-tree:Optical Multicasting for Improved Performance in Wavelength-routed Networks, IEEE Commun. Mag. vol 17. pp. 67-73. 1999. [6] B. Mukherjee, Optical Communication Newyork:McGraw-Hill, 1997. Netwroks.

[22] F.H. Hwang, D.S. Richards and P. Winter, The Steiner Tree Problem, Annals of Discrete Mathematics 53(1992).

1295