JOURNAL OF COMPUTING, VOLUME 3, ISSUE 9, SEPTEMBER 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING WWW.JOURNALOFCOMPUTING.

ORG

51

Performance Analysis of Routing and Wavelength Assignment Algorithms for Hybrid Multicast Networks
D.V.Pradeep Sankar and K.Muneeswaran
AbstractMost of the existing Routing and Wavelength Assignment algorithms consider only the routing and available wavelengths for unicast traffic, but those works not considering the multicast traffic that may be important constraint in many real-time multicast applications. In this paper, we consider the problem of routing connections with differentiated time constraints in wavelength-division multiplexing mesh networks. For this purpose, we propose the modified greedy techniques to reduce the call blocking. Experiments have been conducted using our Multicast Routing and Wavelength Assignment algorithm by constructing multiple spanning trees using Mayeda and Seshu algorithm and the call blocking probabilities for various network structures are reported. The performance results of the proposed method shows promising outcome of our algorithm. Index TermsGreedy Techniques, MRWA, RWA algorithms, WDM Networks.

same wavelength throughout the path and it may span 1 INTRODUCTION multiple fiber links. In the absence of wavelength converhough the wireless networking is the state of the art ters, a light-path would occupy the same wavelength on today, optical network technology holds the key to all fiber links through which it passes. The emergence of the next-generation networks, which provides low bit new network control and management solutions [2][3] in error rate and high capacity for the most of the backbone WDM networks will automate and facilitate the task of networks. The optical fibre bandwidth is further ex- provisioning new services as needs of new services arise. ploited by using Wavelength Division Multiplexing Automated service provisioning allows for faster provi(WDM) technique. In addition, the continual innovation sioning and thus enables the optical service providers of new architectures like CHEETAH [1] that can provide quickly and efficiently to build new types of services into high-speed, end-to-end circuit connectivity on a call-by- the optical infrastructure. The capability to offer different call basis in a packet-switched internet will further facili- services with ease helps the operators to accommodate tate the integration of WDM networks. In WDM the opti- the requirements of different types of clients efficiently, cal bandwidth is partitioned into large number of chan- which in turn provides opportunities for them to enhance nels of different wavelength, each channel works at its their operational revenue and profitability. In optical WDM network, the Routing and Wavepeak rate. length Assignment (RWA) problem is an important one. In general, optical networks support two degrees of service reliability: full protection in the presence of a sin- The RWA problem for unicast connections has been adgle fault in the network, and no protection at all. In recent dressed in many studies. A natural extension to the undevelopment trends leads gradually to the design of net- icast RWA problem is the Multicast Routing and Waveworks towards a unified solution that can support voice length Assignment (MRWA) problem. It is defined as the and data services, as well as a variety of novel multime- problem of finding a set of links and wavelengths to esdia applications. Multicast is a point to multipoint com- tablish the connection from source and destinations given munication in which the delivery of information to a a limited number of wavelengths and a set of multicast group of destinations simultaneously done by delivering calls. The objective of MRWA is to maximize the number the messages over each link of the network only once, of multicast calls admitted, and/or minimize the call creating copies only when the links to the multiple desti- blocking probability. Two connections requests can share nations split. Many research works are going on in the the same optical link, provided a different wavelength is field of WDM optical networks with traffic demands at used. The problem of routing and assignment in RWA the wavelength granularity that establishes light-path on can be either coupled or decoupled. In the dynamically operating WDM network, the fibre routes, by reserving one wavelength on each hop. A number of wavelengths on demand [9] and the statistics light-path is an optical path or data channel created between two nodes in the network and allocated with the of the service period can classify service requests. Different applications have different requirements regarding the handling of their traffic in the network. Applications D.V. Pradeep Sankar is with the P.S.R. Engineering College, Sivakasigenerate traffic at varying rates and generally require that 626140, Tamil Nadu, India. the network be able to carry traffic at the rate at which K. Muneeswaran is with the Mepco Schlenk Engineering College, Sivakasi, they generate it. In supporting various service provisionTamil Nadu, India ing requirements in a network, it is critical for the optical

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 9, SEPTEMBER 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING WWW.JOURNALOFCOMPUTING.ORG

52

service provider to categorize the call-level (subscriptionlevel) performance of their offered services for the purpose of properly managing the network and planning future service provisioning. Because of these motivations, in this paper we present an analytic performance evaluation of dynamic routing and wavelength assignment policies for WDM networks. The rest of this paper is organised as follows: A survey about the related work is given in Section II. Section III formally presents the network model under consideration with the proposed approach. Section IV explains the experimental setup and performance analysis. Section V concludes this paper.

tential paths in a network is known as network capacity.

3 PROPOSED WORK
3.1. Network Model: We represent the mesh WDM network under consideration by an undirected graph G(V , E ) , where V is the set of network nodes representing Optical cross-Connects (OXCs) and E is the set of network links representing optical fibers. Let n and m denote the number of nodes and links in the network, respectively. We assume that each link can only accommodate one optical fiber, which carries W wavelengths. Undirected means that each link in the physical topology is bidirectional. We further assume that a link fault disrupts connections in both directions of propagation. Each link (i, j) is characterized by the cost c(i, j) of providing one fiber on that link. Without loss of generality, the cost of a path P, say C(P), is the sum of the link cost of links along it. That is
C [P ] =
(i , j )P

2 BACKGROUND
Though many of the available literatures are based on the Routing and Wavelength Assignment (RWA) problem exists that use simulations, considerably less literature uses analytical approaches [4][19] for the performance evaluation. Due to the complex nature of the problem, analysis often becomes obdurate. This paper generalizes the scope of the analytic performance evaluation to the multi-class service provided by WDM networks. Calls that are classified by the number of wavelengths demanded per call and the multi-class WDM network or multi-rate circuit-switching networks are analysed in [20]. Our work differs from the previous work in the sense that we assume WDM networks without wavelength converters, so wavelength continuity constraint must be satisfied, unlike circuit-switching networks as in [20]. In [7], the class is based on using a certain route and having different arrival rates and service times in WDM networks. Our definition of class in the present paper is different in that it is characterized by distinct resource requirements i.e., number of wavelengths. In [21, 22] the admission control policies that discriminate different classes of connections by their blocking probabilities are discussed. The work proposed in [23] addresses the issue of providing different quality of service to the bursts of data belonging to different priority classes in a WDM optical burst switching networks. Connections are categorized based on their required degree of survivability i.e., the ratio between the number of connections surviving a failure and the number of connections active upon failure in [24,25]. Our proposed study focuses on a new category of objectives that considers the network state in order to minimize the call blocking probability. Given the current network state and a new arrival request, the aim of wavelength assignment is to minimize the call blocking probability and maximize the network capacity. Also it is clear that even with the accurate traffic matrix, it is NP-hard to minimize the call blocking probability [26]. As it is more difficult to get the accurate potential traffic matrix in reality, many researchers have proposed some approximate measurements for minimizing the call blocking probability. Some work on path capacity and network capacity [2729] has been done for unicast requests. The number of available wavelengths along a path is defined as path capacity, and the summation of path capacities for all po-

c(i, j )

(1)

We consider the connection to be defined by a triple (s, d, b) where s and d are the ingress and egress of the connection, respectively, b is the bandwidth (in number of wavelengths) required by the connection. In the work by H.Zang, J.P.Jue and B.Mukherjee [30], they consider the random wavelength assignment policy, i.e., wavelengths is assigned randomly from the set of available wavelengths on a given link. This assumption seems to make analysis more tractable than others do, and hence it is a good motivation for this challenging task of analytic performance evaluation.

3.2. Problem Statement: The problem is formally defined as follows. Assume that the potential traffic matrix P, containing a set of unicast and multicast requests. Recall that for a potential unicast request, its path capacity is defined as the number of available wavelengths along the path. The path capacity of a potential multicast request, however, has not been previously addressed. In this paper, we define the path capacity of a potential multicast request as follows. Suppose a multicast session has M destinations. For each path from the source to a destination, we can calculate its path capacity. The path capacity of the multicast is then defined as the summation of the path capacities for all the M paths. This definition comes from the fact that even if some destinations are blocked due to lack of wavelengths, other destinations can still receive the multicast information from the source. When we consider the effect of a wavelength assignment to a potential multicast request, we are interested in how many destinations in the multicast request may be potentially blocked due to the wavelength assignment. By this definition, we can simply consider a potential multicast request with M destinations as M independent unicasts and thus, replace the multicast request in P with M potential unicast requests. Therefore, in the following part of the paper, we just need to assume that P only contains unicast requests, since fiber in the path will be allocated the same wavelength not requiring

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 9, SEPTEMBER 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING WWW.JOURNALOFCOMPUTING.ORG

53

the converter. Spanning tree of a graph is a subset of n-1 edges that form a tree, where n is the number of edges. The spanning tree is constructed for the nodes in multicast operations. Two common graph operations which form the basis for all spanning tree algorithms are edge contraction and edge deletion. The first operation, edge contraction, consists of removing the contracted edge e = (u;v), and replacing the end points of the edge, u and v, with a single super vertex s. Each edge (u; x), which is incident with u, is replaced with an edge (s; x) which is incident with the super vertex s. Similarly, each edge incident with v is replaced with a corresponding edge incident with s. Since the contracted edge e is removed, it does not form a loop edge (s;s). If both u and v are adjacent to a vertex w, then the contracted graph contains two parallel edges, corresponding to the two original edges (u;w) and (v;w). The graph G with edge e contracted is denoted G e. The second operation, edge deletion, corresponds to the removal of an edge from the graph G. If e is the deleted edge, then G e = (V;E{e}) denotes the graph G with edge e removed. The addition of an edge to a graph or forest is also a common operation in spanning tree generation algorithms. The addition of an edge e to a graph G = (V; E) is represented by the notation G + e = (V; E+{e}). It is well known that if the connected graph G contains n vertices then each spanning tree of the graph contains exactly n-1 edges. The number of spanning trees of a graph G is denoted (G). If an edge e E(G) is included in every spanning tree of G, then e is a bridge. The removal of a bridge e from a connected graph G, results in a disconnected graph.

For each multicast spanning tree, let the new arrival multicast request be r={s,D,T}, where s is the multicast source, D the destination set, and T the multicast routing tree. Let (T) be a feasible wavelength assignment for r , and L(T,) the set of links in T which are assigned wavelength for r under wavelength assignment. Consider a potential path p, of which the available wavelength set is denoted by A(p). Then, define the path capacity decrease of p caused by wavelength as

Algorithm assignWaveGreedyStatic( ) { //Input: Graph V=(G,E) with wavelength capacity at each link, ={ 1, 2,., n} //Output: Path to reach all destinations with allotted wavelength on each link Initialization: ={1,2,,W} D={d1,d2,.,dn} Si is given for each i For each k { k=ck/nk } Sort k so that i1 i2. iW do { Choose ij to cover all destinations in Sij for k=2 to W Sik=Sik-Sij =-{ij} D=D-Sij } while (D0) }

(2) Hence, Wavelength Assignment for Maximizing Network Capacity (WA-MNC) for multicast is to choose *(T) such that *(T)pP B(p,) is minimized in all feasible wavelength assignments for T. Here the wavelength assignment problem for multicast in WDM all-optical networks is considered after the multicast routing tree is determined. It assumes there is no wavelength conversion available at any switching node. Wavelength conversion can reduce the call blocking probability. However, it also significantly increases the switching cost and complexity. The wavelength assignment problem for multicast in a WDM network without wavelength conversions is to assign a subset of available wavelengths in each link of the multicast tree to cover the multicast session. For each wavelength that is used in the wavelength assignment, a light-tree is formed from the root to a subset of destination nodes. In the earlier paper [30], they proposed two greedy algorithms to minimize the call blocking probability by maximizing the remaining network capacity after each wavelength assignment. In the proposed work, initially we form all spanning tree for a multicast operation and perform the wavelength assignment for all these trees and the call blocking probabilities for various network structures are reported. The performance results of the proposed method shows promising outcome as our algorithm searches for global minima while previous methods may be settling at local minima.

1, if A( p ) and L(T , ) p B ( p, ) = 0 , Otherwise

3.3. Procedure: In this section, the multicast wavelength assignment problem that maximizes the network capacity using greedy algorithms and our proposed methods are discussed. 3.3.1. Static Cost Greedy Algorithm (SCG) In SCG algorithm, the wavelength cost ratio for each wavelength is only computed once. Here, each destination simply chooses the wavelength which has the minimum wavelength cost ratio from its available wavelength set. The algorithm first computes the wavelength cost ratio for each wavelength. The wavelengths are then sorted in non decreasing order of their wavelength cost ratios. After that, assign the first wavelength to all the destinations that it can reach, then the second wavelength to all the destinations that it can reach and that have not already been assigned a wavelength earlier, and so on, until all destinations have been assigned a wavelength. The procedure for the wavelength is given in the following algo-

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 9, SEPTEMBER 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING WWW.JOURNALOFCOMPUTING.ORG

54

rithm, where ck is computed by counting the potential connections in P whose path capacity is decreased by 1 because k is used to cover destinations in S k .

3.3.2. Dynamic Cost Greedy Algorithm (DCG) Different from the SCG algorithm, the DCG algorithm updates the wavelength cost ratio after each wavelength is selected, resulting in a better estimate of the cost for each leftover wavelength. Specifically, let Sk be the set of destinations that can be covered by k. Then, the wavelength cost ratio for wavelength k is calculated based on the destinations in Sk, in the same way as the SCG algorithm. DCG algorithm first selects the wavelength with the minimum wavelength cost ratio to cover all possible destinations. Without loss of generality, assume wavelength 1 is selected. Then, it updates Sk to Sk= Sk S1 for k=2,3,..W. The wavelength cost ratio k for k=2,3,..W is recomputed based on the new Sk, and the wavelength with the new minimum wavelength cost ratio is selected. This process continues until all destinations are covered. The model of maximizing the network capacity was an approximation measurement of minimizing the call block probability. Here two concepts are introduced, path caAlgorithm assignWaveGreedyDCG { //Input: Graph V=(G,E) with wavelength capacity at each link, ={ 1, 2,., n} //Output: Path to reach all destinations with allotted wavelength on each link Initialization: ={1,2,,W} D={d1,d2,.,dn} Si is given for each i do { For k { //ck is computed by counting potential connections in P whose path capacity is decreased by 1 because k is used to cover destinations in Sk. k=ck/nk } Sort k so that i1 i2. iW Choose i1 to cover all destinations in Si1 For k=2 to W Sik=Sik-Si1 W=W-1 =-{i1} D=D-Si1 } while (D0) }

pacity and network capacity. Path capacity is defined as the number of available wavelengths along a path, and network capacity is defined as the summation of path capacities for all potential paths in a network. Both maximizing the minimum path capacity and maximizing the remaining network capacity can be used as the objective of wavelength assignment. Maximizing the remaining network capacity is equal to minimizing the network capacity decrease when assigning a wavelength for a new arrival request.

3.3.3. Mayeda-Seshu (MS) Algorithm This algorithm generated all spanning trees of a graph, without generating duplicates, by means of elementary tree transformations. The Mayeda and Seshu algorithm starts with a reference spanning tree, T, of G = (V;E). The graph G and the spanning tree T are global variables. The algorithm labels the edges in the reference tree E(T) = {e1; e2;:::;en1}, and labels the remaining edges E E(T) = {en; en+1 ;:::;em}. The edges in T are called reference edges. The reference spanning tree is the first spanning tree generated by the algorithm. Parameter min determines the set of edges, {emin ;:::;en1}, which may be removed from the current spanning tree T. On the original call to MS, the parameter min must be set to 1. During this first call, the algorithm removes edge e1 from the tree, and replaces it with each edge e0 E T which makes (T e1)+e0 a spanning tree of G. After forming the new tree (Te 1)+e0, MS generates all of the trees which include e0 but not e1 by the recursive call MS(2). After generating all trees which do not include edge e1, MS generates all trees which do include e1 by placing e1 back into the tree, and repeating the process for edges {e2;:::;en1}. If some edge ek cannot be replaced by any of the edges in the set {en;:::;em}, then ek is restored and the algorithm continues by trying to replace edge ek+1. The algorithm operates in O(nm) amortized time and requires O(nm) space. 3.4. Multicast Routing and Wavelength Assignment (MRWA) In our work, the wavelength assignment for multicast in WDM all-optical networks is considered. It focuses on a new category of objectives that takes the network state into consideration in order to minimize the call blocking probability. Given the current network state and a new arrival request, the aim of wavelength assignment for minimizing the call blocking probability is to assign wavelengths for the new arrival request so that the effect to the network is minimized after this assignment. This work also extends to find the best path to each destination which having low blocking probability. For that it makes use of all spanning tree algorithm to construct multiple spanning tree for the multicast tree. This algorithm dynamically calculates the Cost Coverage Ratio (CCR) for each spanning tree using the formula, cos t k CCR k = cov eragek (3)

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 9, SEPTEMBER 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING WWW.JOURNALOFCOMPUTING.ORG

55

Algorithm assignOptimalWavelength( ) { /*Input: Graph V=(G,E) with wavelength capacity at each link, ={ 1, 2,., n} Output: Optimum solution with allotted wavelength for the demand P = {P1, P2, Pi,Pn} //P -be the set of multiple paths corresponding to the destinations D={d1,d2,.,dr} T = {T1, T2, Tr,Tm} // T be the set of spanning trees created using all-spanning trees algorithm that covers all the destinations D Dk Destinations reachable using k W - maximum number of wavelength in each link */ CCRk - cost coverage ratio with k Init Wavelength() ; // = {1,2,,W} T = createSpanningTrees(G) For each Spanning Tree Tr { For each path Pi in Tr { For each wavelength k { costk = computeCost_ _ToDest(D) CCRk=costk/coveragek } sort (CCR) Choose CCRk of k Find Dk Find all D - Dk // using CCRk+1...CCRW P = P - Pi } } OptimumSolution = Optimum(CCR); // Finding optimum solution. }
where cost k is the decrease in path capacity because of assigning k and coveragek is the number of destionations covered by k with cost k .

Given a group of parameters (N,D,W,n), the algorithm is implemented as follows: 1. Randomly generate a network with N nodes. The out degree of each node i, denoted by Outi, is uniformly distributed in [1,D], i.e., randomly generating Outi links from node i to other nodes. For each link, let there be K available wavelengths, where K is uniformly distributed in [1,W]. 2. Then, randomly select one node as the source and other n nodes as destinations in the multicast session. The multicast tree is obtained by running the single-source shortest-path algorithm from the source to all destinations. Note that it may happen that not all destinations have a path from the source. In this case, discard this instance and regenerate another network topology. 3. Generate all possible spanning tree for the reference multicast tree. Though we have experiments with different configurations for each group of parameters, it is solved by the two proposed greedy algorithms respectively. Also the average network capacity decrease is reported for each individual multicast tree. We have shown a typical experimental setup as shown in figure 1.

4 EXPERIMENTAL SETUP AND RESULT ANALYSIS

4.1. Experimental Setup: The system design is based on the following simulation model. The main network parameters are given below: 1. The network size N 2. The maximum number of available wavelengths on each link W 3. The maximum outgoing degree D in each node 4. The number of destinations in the multicast session n.

4.2 Performance Analysis: Here the simulation of the two greedy algorithms is done using Visual C++ language. Consider a sample network which contains 6 numbers of nodes and the implementation of these two algorithms are explained in the following steps: Step 1: Create the experimental setup as shown in the figure 1. Step 2: Consider a multicast session with node 1 as source and other nodes as destinations. Step 3: Construct multiple spanning trees as shown in figure 2 and 3. Step 4: For each spanning trees construct the shortest path for reaching destinations. Step 5: For each path compute CCR k=ck/nk, where ck is the decrease in network capacity when k is used and nk is the number of destinations that can be reachable using particular k. Step 6: Find out the optimal spanning tree with reduced CCR.

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 9, SEPTEMBER 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING WWW.JOURNALOFCOMPUTING.ORG

56

1 1 1

1 1

2 3 2 2 3

3 2 3

4 4 2 4 5 3 4 5 5 4 5 5

6 6 6 6 6

(a) Spanning TreeII (b) Spanning Tree-III (c) Spanning TreeIV(d) Spanning Tree-V (e) Spanning Tree - VI Fig.3: Multiple spanning trees created for the reference tree in figure 2. Table 1: Network Capacity Decrease with various algorithms SpanSour SCG DCG MRWA ning ce Destinank ck CCR k nk ck CCR k nk ck CCR k Tree tions No. I 1 3 8 2.67 3 7 2.33 3 7 2.33 II 1 3 8 2.66 III 1 3 8 2.66 2, 3, 4, 5, 6 IV 1 2 5 2.5 V 1 4 9 2.25 VI 1 3 7 2.33 Based on this reference tree as shown in Figure 2, mul- which is commonly available on the entire path. There tiple trees are formed using the all spanning tree Mayeda- should be no wavelength conversion permissible on that Seshu Algorithm [31]. By using this algorithm initially path since it significantly increases the switching cost and remove one edge from the reference tree. In our example complexity. The value of nk will be calculated for each consider the removal of edge 1-2, it replaces another edge wavelength k for every destination. which should form a path to reach the node 2 in some c k = k (4) other way. Similarly the edges are removed one by one nk from the reference multicast tree and replaced by the best Next step is the calculation of the network capacity possible edge to form multiple multicast routing trees. Multiple spanning trees formed in the above step are decrease (ck) when wavelength k is assigned to all nk shown in Figure 3. These multiple trees are taken into destinations. Then calculate k which is the wavelength wavelength assignment process using our proposed algo- cost ratio for wavelength k using the formula. (4) rithm. Based on the value of k, the wavelengths are listed in The first step in effective wavelength assignment is the calculation of the number of destinations that can be ascending order. By taking the first wavelength s1 in the reachable (nk) using the particular wavelength i. Here list, all the nodes that can be reachable using s1 are sethere is no wavelength conversion available at any lected and marked as visited. Also Then the next waveswitching node and this wavelength continuity constraint length (s2) in the list is selected and all the unvisited is followed in this work. Hence the path from source to nodes that can be reachable using s2 are found out and destination should be allocated with the wavelength visited as marked. This process is repeated either until all
2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 9, SEPTEMBER 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING WWW.JOURNALOFCOMPUTING.ORG

57

the destination nodes are reached or tried with all the wavelengths in the list. As our approach is dynamic one, after identifying the destination that can be reachable using the first wavelength in the list, the process of calculating k is performed again and the list is sorted once again. In case of static one, the list is created only once and the wavelength are taken according to the order of the initial list. This process of wavelength assignment is repeated for all of the multicast trees and finds the total network capacity decrease in each case. The results are tabulated in Table 1. Total network capacity decrease in the sense is the decrease of capacity (i.e., how many future requests are unable to assign the wavelength) when assigning a particular wavelength to each destination. Based on the total network capacity decrease, which tree having lower value will be considered as the optimum route and that wavelength assignment will provide minimum call blocking probability. From the table, it is obvious that our proposed Multicast Routing and Wavelength Assignment (MRWA) algorithm performs well as it is searching for the better solution through more than one spanning tree. In general our MRWA algorithm is seeking for global minima while the other methods may be settling at local minima. From the Table 1 it is observed that the solution corresponding to spanning tree V is the optimal one.

[6] [7] [8] [9] [10] [11]

[12] [13] [14] [15] [16] [17]

5 CONCLUSION
As most of the existing Routing and Wavelength Assignment algorithms consider only the routing and available wavelengths for unicast traffic, but not considering for the multicast traffic case, this work gives due attention to include the multicast traffic with the aim of reducing call blocking probability. Our proposed Multicast Routing and Wavelength Assignment (MRWA) algorithm performs well as it is searching for the better solution through more than one spanning tree. In general our MRWA algorithm is seeking for optimum solution among all the spanning trees while the other methods may be settling at the first one. Our future work aims at setting an objective function for CCR with minimum computational complexity.
[18] [19]

[20]

[21]

[22]

REFERENCES
[1] M. Veeraraghavan, X. Zheng, H. Lee, M. Gardner, and W. Feng, CHEETAH: Circuit-switched high-speed end-to-end transport architecture, Proc. SPIE, vol. 5285, pp. 214225, 2003. E. Mannie et al., Generalized Multi-Protocol Label Switching (GMPLS) architecture, IETF, Internet Draft, draft-ietf-ccamp-gmplsarchitecture07.txt, May 2003. Management of optical networks and services: Feature topic, IEEE Commun. Mag., vol. 42, no. 1, Jan. 2004. A. Birman, Computing approximate blocking probabilities for a class of all-optical networks, IEEE J. Sel. Areas Commun., vol. 14, no. 5, pp. 852857, Jun. 1996. H. Harai, M. Murata, and H. Miyahara, Performance of alternate routing methods in all-optical switching network, in Proc. IEEE INFOCOM, 1997, vol. 2, pp. 516524. [23]

[2] [3] [4] [5]

[24] [25]

[26]

A. Sridharan and K. N. Sivarajan, Blocking in all-optical networks, IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 384397, Apr. 2004. S. Ramesh, G. N. Rouskas, and H. G. Perros, Computing blocking probabilities in multiclass wavelength-routing networks with multicast calls, IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 8996, Jan. 2002. R. A. Barry and P. A. Humblet, Models of blocking probability in alloptical networks with and without wavelength changers, IEEE J. Sel. Areas Commun., vol. 14, no. 6, pp. 867878, Jun. 1996. B. Ramamurthy and B. Mukherjee, Wavelength conversion in WDM networking, IEEE J. Sel. Areas Commun., vol. 16, no. 9, pp.10611073, Sep. 1996. R. Ramamurthy and B. Mukherjee, Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks, IEEE/ACM Trans. Networking, vol. 10, no. 3, pp. 351367, Jun. 2002. G. N. Rouskas, Y. Zhu, and H. G. Perros, A Path decomposition approach for computing blocking probabilities inwavelength-routing networks, IEEE/ACM Trans. Networking, vol. 8, no. 6, pp. 747762, Dec. 2000. G. N. Rouskas, Y. Zhu, and H. G. Perros, Blocking in wavelengthrouting networkspart I: The single-path case, in Proc. IEEE INFOCOM, 1999, pp. 321328. G. N. Rouskas, Y. Zhu, and H. G. Perros, Blocking in wavelengthrouting networksPart II: Mesh topologies, in Proc. 16th Int. Teletraffic Congr., Jun. 1999, pp. 13211330. R. Ramaswami and K. N. Sivarajan, Routing and wavelength assignment in all-optical networks, IEEE/ACM Trans. Networking, vol. 3, no. 10, pp. 489500, Oct. 1995. R. Ramaswami and K. N. Sivarajan, Optical Networks: A Practical Perspective. San Francisco, CA: Morgan Kaufman, 1998. M. Azizoglu, S. Subramanium, and A. Somani, All-optical networks with sparse wavelength conversion, IEEE/ACM Trans. Networking, vol. 4, no. 8, pp. 544557, Aug. 1996. T. Tripathi and K. N. Sivarajan, Computing approximate blocking probabilities for wavelength-routed all-optical networks with limitedwavelength conversion, IEEE J. Sel. Areas Commun., vol. 18, 10, no.10, pp. 21232129, Oct. 2000. J. Xiong, W. Gong, and C. Qiao, An effective method for blocking performance analysis of WDM all-optical networks, J. Lightw. Technol., vol. 21, no. 6, pp. 14211434, Jun. 2003. I. Cerutti, S. Pitchumani, and A. Fumagalli, Threshold-based blocking differentiation mechanism for networks with wavelength continuity constraint, in Proc. 2005 7th Int. Conf. Transparent Optical Networks, July 2005, vol. 1, pp. 179182. S.-P. Chung, A. Kashper, and K. W. Ross, Computing approximate blocking probabilities for large loss networks with state-dependent routing, IEEE/ACM Trans. Networking, vol. 1, no. 1, pp. 105115, Feb. 1993. I. Cerutti, S. Pitchumani, and A. Fumagalli, Threshold-based blocking differentiation mechanism for networks with wavelength continuity constraint, in Proc. 2005 7th Int. Conf. Transparent Optical Networks, July 2005, vol. 1, pp. 179182. Y. Chen, M. Hamdi, and D. H. K. Tsang, Proportional QoS over WDMnetworks: Blocking probability, in Proc. 6th IEEE Symp. Computers and Communications, Jul. 2001, pp. 210215. C. W. Tan, G. Mohan, and J. C.-S. Lui, Achieving multiclass service differentiation inWDMoptical burst switching networks: A probabilistic preemptive burst segmentation scheme, IEEE J. Sel. Areas Commun., vol. 24, no. 12, pp. 106119, Dec. 2006. N. Andriolli, A. Giorgetti, and L.Valcarenghi, Idle protection capacity reuse in multiclass optical networks, J. Lightw. Technol., vol. 25, no.5, pp. 11521162, May 2007. A. Sen, B. H. Shen, B. Hao, H. Jayakumar, and S. Bandyopadhyay, On a preemptive multiclass routing scheme with protection paths for WDM networks, in Proc. IEEE Int. Conf. Communications, 2003, pp.14171422. I. Chlamtac, A. Ganz, and G. Karmi, Lightpath communications: An approach to high bandwidth optical WANs, IEEE Trans. Commun., vol. 40, pp. 11711182, July 1992.

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 9, SEPTEMBER 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING WWW.JOURNALOFCOMPUTING.ORG

58

[27] S. Subramania and R. Barry, Wavelength assignment in fixed routing WDM networks, in Proc. IEEE Int. Conf. Communications, vol. 1, 1997, pp. 406410. [28] S. Xu, L. Li, S. Wang, and C. Chen, Wavelength assignment for dynamic traffic in WDM networks, Proc. IEEE Int. Conf. Networks, pp.375379, 2000. [29] X. Zhang and C. Qiao, Wavelength assignment for dynamic traffic in multi-fiber WDM networks, Proc. IEEE IC3N98, pp. 479485, 1998. [30] H. Zang, J. P. Jue, and B. Mukherjee, A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks, SPIE Opt. Netw. Mag., vol. 1, no. 1, Jan. 2000. [31] W.Mayeda, S.Seshu, Generation of trees without duplications. IEEE Trans. Circuit Theory CT-12 (1965) 181 185.

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617