Abstract:
In a Wavelength Division Multiplexed (WDM) all-optical network having optical nodes linked together by optical fibers carrying communication channels of separate wave-lengths, a method is applied in order to extend the size of the all-optical network. According to the method, a model is set up for the all-optical network in which a wavelength graph containing vertices and edges represents the physical effects of the nodes and links. After identifying a set of demand, an objective function is calculated expressing the total routing cost and total signal power demand of the channels. The minimum of the objective function returns the signal powers for each channel to be tuned.

Description:
TECHNICAL FIELD 
       [0001]    The present invention relates to optical networks. In particular, the present invention is directed to a method and a node for defining signal power in a Wavelength Division Multiplexed (WDM) all-optical network. 
       BACKGROUND 
       [0002]    In fiber-optic communications, WDM is a technology which multiplexes multiple optical carrier signals on a single optical fiber by using different wavelengths (colours) of laser light to carry different signals. This allows for a multiplication in capacity, in addition to enabling bidirectional communications over one strand of fiber. A WDM system uses a multiplexer at the transmitter to join the signals together and a de-multiplexer at the receiver to split them apart. With the right type of fiber it is possible to have a device that does both simultaneously, and can function as a so called optical add-drop multiplexer (OADM). Older, or fixed, OADMs cannot configure capacity at a node. The technology called Reconfigurable Optical Add/Drop Multiplexer (ROADM) represents a real breakthrough for WDM networks providing the flexibility and functionality required in today&#39;s complex networking environment. In contrast to OADMs, ROADMs a low service providers to reconfigure add and drop capacity at a no node remotely, e.g. to define channels branching-off, reducing operating expenses by eliminating the time and complexity involved in manual reconfiguration. Furthermore, ROADMs allow the service provider to design an optical network once, and then never to have to worry about it again, regardless of how the network grows. The design phase in a ring topology ensures that any node can communicate with any other node using any wavelength. ROADM functionality is part of the solution for a deployable system, but in order to exploit the benefits of ROADM in metro WDM networks increased data management capabilities on individual wavelengths are also needed. (Metro network is WDM network. with a range of 40-500 kms). For instance, ROADM rings are very sensitive to topology changes, and need close monitoring and control of wavelength power to keep the system in balance. The real innovation lies in the system engineering related to the ROADM function, addressing per-wavelength power measurement and management, and per-wavelength, fault isolation. Almost every optical system vendor has ROADM with wavelength monitoring functions in commerce. 
         [0003]    The next step for fully reconfigurable WDM optical networks are the tunable Small Form-factor Pluggable (SFP), where the wavelength allocation is changed as the needs of the network change. The other innovations are the tunable dispersion compensation elements. These network elements are ready-made products and can be purchased nowadays. The evolution of the optical networks seems to tend towards a fully reconfigurable network where the control and management plane will have new functions such as determining the signal quality, tuning the wavelength frequency, setting dispersion compensation units and by using Variable Optical Attenuators (VOA) setting the channel powers. Of course the traditional functions such as routing will remain its main function. 
         [0004]    In an all-optical network the problem of routing and wavelength assignment (RWA) is critically important for increasing the efficiency of wavelength-routed. Given the physical network structure and the required connections, the RWA problem is to select a suitable path and wavelength among the many possible choices for each connection so that no two paths sharing a link are assigned to the same wavelength. 
         [0005]    Solutions are known for this type of technology like a non-disruptive lightpath routing described in patent application U.S. 2004/0109683 A1, that presents the possibility of modifying the routing lightpaths without interrupting service. 
         [0006]    Another solution is described in patent publication WO 2006/000510 A1 relating to optical path feasibility in an optical communication network presenting a signal quality calculation method based on physical impairments. 
         [0007]    In both publications mentioned above, the power of certain channels within a fiber is set uniformly to equal levels. This is one of the remaining effects of the point-point optical networks. Of course there is technical simplification using this kind of channel power allocation: Using the same channel powers the nonlinear effects will have the smallest impact onto the signal quality. 
         [0008]    This allocation schemes leads to the problem that in many cases where a channel is dedicated to a connection for a short distance due to the same channel powers the signal quality will be unnecessarily good i.e. the channel is over engineered 
         [0009]    Additionally, in patent specification U.S. Pat. No. 7,068,932 a method and system for automatic initialization of an optical network are provided. A network management system (NMS) performs remote determination of span losses and sets the operating points of network components. The initialization method comprises remotely and automatically setting target gains of optical amplifiers and signal power levels at transmitters and receivers to required operating values. The methods for initialization of the optical network of the embodiments include gain excursion minimization (GEM) for individual channels passing through amplifiers and/or pre-emphasis of the optical link, where channel powers at the transmitters are biased to compensate for the effects of optical amplifiers gain ripple. U.S. Pat. No. 7,068,932 does not describe a network-wide optimum taking into account of constrains of links and nodes in the network. 
         [0010]    As the size of the network that can be reached all-optically is a function of the signal power, it would be possible to use higher signal powers that would increase the size of the all optical networks, i.e. would decrease the numbers of optical-electrical-optical conversions without increased physical impairments. 
         [0011]    It is therefore seen to be desirable to construct a method for an all-optical network where it is allowed to tune the signal power of individual channels in order to achieve an increased size of the whole network in which the quality of signals remains within an acceptable level. 
       SUMMARY 
       [0012]    The present invention involves a method, node and an all-optical network, which solve the aforementioned problem that will become apparent from an understanding of the following description. 
         [0013]    According to the invention, the objective set was achieved by a method applied to a WDM all-optical network in which optical nodes are linked together by optical fibers carrying communication channels of separate wavelengths. In the first step a model is set up for the all-optical network. In the model a wavelength graph contains vertices and edges, a part of which represents switching function inside a node while other edges represent wavelengths of a physical link. Then an objective function is calculated expressing the total routing cost and total signal power demand of the channels. Looking for the minimum of the objective function, the signal powers for each channel are determined and tuned. 
         [0014]    In a possible embodiment, the objective function may be defined to return physical effects of both optical fibers and nodes as the function between maximum allowable distance and the signal power. The physical effect of a node may be defined to be equal to a certain length of an optical fiber, e.g. 90 kms. 
         [0015]    The objective function may be defined to use constants as input parameters, e.g. an upper limit of the total signal power in physical links, or linear relation between the input power of a demand and the maximum distance the signal is allowed to reach, or a parameter expressing the tradeoff between minimal total routing cost and minimal total signal power of the channels, or a constant for expressing a maximum allowable signal power for one channel. 
         [0016]    In another aspect, the present invention is directed to a node for signal power based routing in a WDM all-optical network. The node comprises VOAs which are adapted to tune individual signal powers of channels so that total routing cost and total signal power of the channels are minimized. The node may be an OXC or a ROADM. 
         [0017]    In yet another aspect, the present invention is directed to an all-optical network in which optical nodes are linked together by optical fibers carrying communication channels. At least a part of the optical nodes are adapted to tune signal power individually so that total routing cost and total signal power of the channels are minimized. 
         [0018]    The method of the invention may also be embodied in a computer program product and a memory coupled to the processor, wherein the memory is encoded with one or more programs that may perform the method based on the model. 
         [0019]    The most important advantage of the invention is a global optimum that provides a larger all-optical network with the same quality requirements of the traditional RWA routing allocation scheme. 
         [0020]    It is also advantageous that increasing the number of wavelengths the performance will improve. 
         [0021]    Another advantage is that it works reasonable faster, and it can also be considered as an Impairment Constraint Based Routing (ICBR) technology where the physical effects are taken into account while routing decisions are taken. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0022]    In the following, the essential features of the invention will be described in detail by an example for an embodiment illustrated by the figures of the attached drawing. In the drawing, 
           [0023]      FIG. 1A ,  1 B,  1 C and  1 D are illustrations for the basic concept of the invention in an all-optical network. 
           [0024]      FIG. 2  is a flowchart for illustrating method steps. 
           [0025]      FIG. 3  schematically illustrates a model for the method. 
           [0026]      FIG. 4  is a block diagram illustrating an OXC. 
           [0027]      FIG. 5  is a block diagram of a ROADM. 
       
    
    
     DETAILED DESCRIPTION 
       [0028]      FIG. 1A ,  1 B,  1 C and  1 D illustrate how the proposed algorithm gives obviously better results than the traditional RWA algorithms in an all-optical network. This is due to the additional degree of freedom namely, the possibility to tune the signal powers. For simplicity, let us consider a network with all-optical nodes “A”, “B”, “C”, “D”, “E” carrying two channels with wavelengths λ 1 , λ 2 . Assume, that in  FIG. 1A  the node “A” can only reach node “C” (solid lines) in the traditional routing schemes. Consider two demands between node “A” and “B”, and node “A” and “D”. In case of traditional routing schemes the demand between nodes “A” and “D” can not be established due to physical layer constraints, e.g. due to amplified spontaneous noise (dotted lines between node “C” and “D”). The demand between node “A” and “B” can be established but the signal quality would be unnecessary good, i.e. the connection is over-engineered. Using the proposed routing schemes according to  FIG. 1B , we can increase the signal power of channel λ 2  and in this way it is possible to establish a connection between node “A” and “D” (solid line with wavelength λ 2 ). Of course while increasing the signal power of channel λ 2  the signal power of channel λ 1  must be decreased, but this signal power is still enough to establish the connection between node “A” and “B”. 
         [0029]    In  FIG. 1C and 1D  a typical routing problem is depicted. We would like to establish a connection between node “A” and “C” (dashed lines). Consider that in the route “A”-“B”-“C” all the wavelengths are in use for other demands. The only solution remains using longer routes like “A”-“D”-“E”-“C”. Due to physical constraints this connection cannot be done (dotted lines). However, using the proposed routing schemes in  FIG. 1D , we can establish this connection (solid line with wavelength λ 2 ) by increasing the signal power of λ 2  between nodes “A”-“D”-“E”-“C” and decreasing the signal power of λ 1  between nodes “A”-“D”- “E”- “C” at the same time. 
         [0030]    In  FIG. 2 , method steps of the invention are illustrated. In the first step S 201  a model is set up in which a wavelength graph contains vertices and edges representing switching function inside a physical node and other edges represent wavelengths of a physical link. (The model will be described in detail in  FIG. 3 ). 
         [0031]    In the second step S 202  a calculation is carried out to set up an objective function expressing the total routing cost and total signal power demand of the channels. The following Integer Linear Programming (ILP) formulation to route the demands was used. 
       Constants: 
       [0032]        P   pl   max =4−20 dBm typically 14 dBm   (1)
 
         [0000]    Constant P pl   max  means the upper limit of the total power in physical link pl expressed in dBm. 
         [0000]      len ij    (2)
 
         [0000]    Constant len ij  is the length of the physical link used by the considered λ channel. 
         [0000]      len PhyNode= 90 km typically   (3)
 
         [0000]    Constant len PhyNode  corresponds to the length of a fiber that has the same impairments as the switching device induces along the path of the demand. 
         [0000]      L c =1200   (4)
 
         [0000]    Constant L c  is the factor of the linear relation between the input power of a demand (in mW) and the maximum distance the signal is allowed to reach. 
         [0000]      α=0, 5   (5)
 
         [0000]    Constant α expresses the tradeoff between optimization objectives: minimal routing cost or minimal power. 
         [0000]      s°, t°   (6)
 
         [0000]    Symbols s° and t° represent source and target of demand o. 
         [0000]    
       
         
           
             
               
                 
                   β 
                   = 
                   
                     
                       n 
                       W 
                     
                     · 
                     
                       P 
                       
                         pl 
                          
                         
                             
                         
                          
                         lin 
                       
                       max 
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
     
         [0033]    Constant β express the maximum allowable signal power for one channel in mW. Where n is between 1 and W, and W is the number of wavelengths in a fiber. For example in case n=2 the maximum allowed channel power would be the double of the cannel power obtained from the traditional allocation schemes. 
         [0000]      P pl   max   lin    (8)
 
         [0000]    Constant P pl   max   lin  means the upper limit of total power in physical link pl in mW. 
         [0034]    Variables: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       p 
                       o 
                     
                     ∈ 
                     
                       [ 
                       
                         0 
                         , 
                         
                           β 
                           
                             P 
                             
                               pl 
                                
                               
                                   
                               
                                
                               lin 
                             
                             max 
                           
                         
                       
                       ] 
                     
                   
                   , 
                   
                     ∀ 
                     
                       o 
                       ∈ 
                       O 
                     
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
         [0035]    Variable p° denotes the input power of demand o divided by P pl   max   lin . 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       p 
                       ij 
                       o 
                     
                     ∈ 
                     
                       [ 
                       
                         0 
                         , 
                         
                           β 
                           
                             P 
                             
                               pl 
                                
                               
                                   
                               
                                
                               lin 
                             
                             max 
                           
                         
                       
                       ] 
                     
                   
                   , 
                   
                     ∀ 
                     
                       
                         ( 
                         
                           i 
                           , 
                           j 
                         
                         ) 
                       
                       ∈ 
                       A 
                     
                   
                   , 
                   
                     ∀ 
                     
                       o 
                       ∈ 
                       O 
                     
                   
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
     
         [0036]    Variable p ij   o  means the power of demand o on edge (i, j) divided by P pl   max   lin . 
         [0000]        y   ij   o ∈{0, 1}, ∀( i, j )∈ A , ∀ o ∈ O    (11)
 
         [0000]    Variable y ij   o  indicates whether demand o uses edge (i, j) or not. 
       Constraints: 
       [0037]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           ∑ 
                           
                             ∀ 
                             
                               o 
                               ∈ 
                               O 
                             
                           
                         
                          
                         
                             
                         
                          
                         
                           
                             ∑ 
                             
                               ∀ 
                               
                                 
                                   ( 
                                   
                                     i 
                                     , 
                                     j 
                                   
                                   ) 
                                 
                                 pl 
                               
                             
                           
                            
                           
                             p 
                             ij 
                             o 
                           
                         
                       
                       ≤ 
                       1 
                     
                     , 
                     
                       ∀ 
                       
                         pl 
                         ∈ 
                         PhyLinks 
                       
                     
                   
                    
                   
                       
                   
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
             
               
                 
                   
                     
                       p 
                       ij 
                       o 
                     
                     ≤ 
                     
                       y 
                       ij 
                       o 
                     
                   
                   , 
                   
                     ∀ 
                     
                       
                         ( 
                         
                           i 
                           , 
                           j 
                         
                         ) 
                       
                       ∈ 
                       A 
                     
                   
                   , 
                   
                     ∀ 
                     
                       o 
                       ∈ 
                       O 
                     
                   
                 
               
               
                 
                   ( 
                   13 
                   ) 
                 
               
             
             
               
                 
                   
                     
                       
                         ∑ 
                         
                           ∀ 
                           
                             j 
                             ∈ 
                             
                               V 
                               
                                 → 
                                 i 
                               
                             
                           
                         
                       
                        
                       
                           
                       
                        
                       
                         p 
                         ji 
                         o 
                       
                     
                     - 
                     
                       
                         ∑ 
                         
                           ∀ 
                           
                             k 
                             ∈ 
                             
                               V 
                               
                                 i 
                                 → 
                               
                             
                           
                         
                       
                        
                       
                           
                       
                        
                       
                         p 
                         ik 
                         o 
                       
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                               
                             
                               - 
                               
                                 p 
                                 o 
                               
                             
                           
                         
                         
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 i 
                               
                               = 
                               
                                 s 
                                 o 
                               
                             
                              
                             
                                 
                             
                           
                         
                       
                       
                         
                           0 
                         
                         
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 i 
                               
                               ∉ 
                               
                                 { 
                                 
                                   
                                     s 
                                     o 
                                   
                                   , 
                                   
                                     t 
                                     o 
                                   
                                 
                                 } 
                               
                             
                             , 
                             
                               ∀ 
                               
                                 i 
                                 ∈ 
                                 V 
                               
                             
                             , 
                             
                               o 
                               ∈ 
                               O 
                             
                           
                         
                       
                       
                         
                           
                             + 
                             
                               p 
                               o 
                             
                           
                         
                         
                           
                             
                               if 
                                
                               
                                   
                               
                                
                               i 
                             
                             = 
                             
                               t 
                               o 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   14 
                   ) 
                 
               
             
             
               
                 
                   
                     
                       
                         ∑ 
                         
                           ∀ 
                           
                             j 
                             ∈ 
                             
                               V 
                               
                                 → 
                                 i 
                               
                             
                           
                         
                       
                        
                       
                           
                       
                        
                       
                         y 
                         ji 
                         o 
                       
                     
                     - 
                     
                       
                         ∑ 
                         
                           ∀ 
                           
                             k 
                             ∈ 
                             
                               V 
                               
                                 i 
                                 → 
                               
                             
                           
                         
                       
                        
                       
                           
                       
                        
                       
                         y 
                         ik 
                         o 
                       
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                               
                             
                               - 
                               1 
                             
                           
                         
                         
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 i 
                               
                               = 
                               
                                 s 
                                 o 
                               
                             
                              
                             
                                 
                             
                           
                         
                       
                       
                         
                           
                             
                                 
                             
                              
                             0 
                           
                         
                         
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 i 
                               
                               ∉ 
                               
                                 { 
                                 
                                   
                                     s 
                                     o 
                                   
                                   , 
                                   
                                     t 
                                     o 
                                   
                                 
                                 } 
                               
                             
                             , 
                             
                               ∀ 
                               
                                 i 
                                 ∈ 
                                 V 
                               
                             
                             , 
                             
                               o 
                               ∈ 
                               O 
                             
                           
                         
                       
                       
                         
                           
                             + 
                             1 
                           
                         
                         
                           
                             
                               if 
                                
                               
                                   
                               
                                
                               i 
                             
                             = 
                             
                               t 
                               o 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   15 
                   ) 
                 
               
             
             
               
                 
                   
                     
                       
                         ∑ 
                         
                           ∀ 
                           
                             o 
                             ∈ 
                             O 
                           
                         
                       
                        
                       
                         y 
                         ij 
                         o 
                       
                     
                     ≤ 
                     1 
                   
                   , 
                   
                     ∀ 
                     
                       
                         ( 
                         
                           i 
                           , 
                           j 
                         
                         ) 
                       
                       ∈ 
                       A 
                     
                   
                 
               
               
                 
                   ( 
                   16 
                   ) 
                 
               
             
             
               
                 
                   
                     
                       
                         
                           
                             ∑ 
                             
                               ∀ 
                               
                                 
                                   ( 
                                   
                                     i 
                                     , 
                                     j 
                                   
                                   ) 
                                 
                                 sw 
                               
                             
                           
                            
                           
                               
                           
                            
                           
                             
                               y 
                               ij 
                               o 
                             
                             · 
                             
                               len 
                               PhyNode 
                             
                           
                         
                         + 
                         
                           
                             ∑ 
                             
                               ∀ 
                               
                                 
                                   ( 
                                   
                                     i 
                                     , 
                                     j 
                                   
                                   ) 
                                 
                                 pl 
                               
                             
                           
                            
                           
                             
                               y 
                               ij 
                               o 
                             
                             · 
                             
                               len 
                               ij 
                             
                           
                         
                       
                       ≤ 
                       
                         L 
                          
                         
                           ( 
                           
                             p 
                             o 
                           
                           ) 
                         
                       
                     
                     = 
                     
                       
                         L 
                         c 
                       
                       · 
                       
                         p 
                         o 
                       
                       · 
                       
                         P 
                         
                           pl 
                            
                           
                               
                           
                            
                           lin 
                         
                         max 
                       
                     
                   
                   , 
                   
                     
 
                   
                    
                   
                     ∀ 
                     
                       o 
                       ∈ 
                       O 
                     
                   
                 
               
               
                 
                   ( 
                   17 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Objective function: 
         [0038]    Minimize 
         [0000]    
       
         
           
             
               α 
               · 
               
                 [ 
                 
                   
                     ∑ 
                     
                       ∀ 
                       
                         o 
                         ∈ 
                         O 
                       
                     
                   
                    
                   
                       
                   
                    
                   
                     
                       ∑ 
                       
                         
                           ( 
                           
                             i 
                             , 
                             j 
                           
                           ) 
                         
                         ∈ 
                         
                           A 
                           / 
                           
                             A 
                             sw 
                           
                         
                       
                     
                      
                     
                         
                     
                      
                     
                       y 
                       ij 
                       o 
                     
                   
                 
                 ] 
               
             
             + 
             
               
                 ( 
                 
                   1 
                   - 
                   α 
                 
                 ) 
               
               · 
               
                 [ 
                 
                   
                     ∑ 
                     
                       ∀ 
                       
                         o 
                         ∈ 
                         O 
                       
                     
                   
                    
                   
                     p 
                     o 
                   
                 
                 ] 
               
             
           
         
       
     
         [0000]    Constraint (12) explains that the sum power of demands traversing a physical link (fiber) cannot exceed the maximum allowed power of that link.
 
Constraint (13) indicates that if the power of demand o in edge (i,j) is larger then zero, then edge (i,j) is used by demand o.
 
Constraints (14) and (15) express the flow-conservation constraint of the power and of the y decision variables, respectively, for every demand.
 
Constraint (16) indicates that a given edge can be used by only one demand.
 
Constraint (17) indicates that the total length of demand o should be less than the distance allowed by the input power of demand o.
 
The objective function expresses that the sum of the used edges should be minimized together with the sum of input powers of demands. If we want to minimize the total cost of routing, constant cost factors should be assigned to each edge.
 
Constant α decides whether optimization emphasis is on minimal routing cost (α is close to 1) or on minimal input power (α is close to zero).
 
         [0039]    In the third step S 203 , the signal power of each channel is individually tuned so that the objective function is minimized. 
         [0040]    In  FIG. 3 , a part of the model of the network consisting of physical links  301  and physical devices (nodes)  302  is represented by a wavelength graph  300 . The wavelength graph  300  contains vertices V (only one is indicated) and edges A depicted by solid, dashed and dotted lines for each wavelength. (Three wavelengths are shown in this example). Symbol A sw  (only one is indicated) denotes the set of edges representing switching function inside the node  302 ; other edges A represent wavelengths of a physical link  301 . Arrows in some nodes  302  represent branch-off for certain channels. As it is clearly seen, the effect of physical nodes  302  and links  301  is represented by edges A, A sw  and vertices V in the model. 
         [0041]      FIG. 4  illustrates an OXC as a possible embodiment of an optical node  400  comprising de-multiplexers  411 ,  412 , . . . ,  41 k wavelength switches  421 ,  422 , . . . ,  42 k, Variable Optical Attenuators  431 ,  432 , . . . ,  43 k and multiplexers  441 ,  442 , . . . ,  44 k. The input of the de-multiplexers  411 ,  412 , . . . ,  41 k are optical fibers carrying channels of wavelengths λ 1 , λ 2 , . . . λ k . The output of the de-multiplexers  411 ,  412 , . . . ,  41 k are connected to the wavelength switches  421 ,  422 , . . . ,  42 k the outputs of which are linked to the Variable Optical Attenuators  431 ,  432 , . . . ,  43 k. The Variable Optical Attenuators  431 ,  432 , . . . ,  43 k are adapted to tune individual signal powers to meet minimal total routing cost and minimal total signal power of the channels according to the method described in  FIG. 2 . The tuned channels are multiplexed in multiplexers  441 ,  442 , . . . ,  44 k for the output of the node  400 . 
         [0042]      FIG. 5  illustrates an ROADM representing another possible embodiment of an optical node  500  comprising a de-multiplexer  510 , wavelength switches  521 ,  522 , . . . ,  52 k, Variable Optical Attenuators  531 ,  532 , . . . ,  53 k and a multiplexer  540 . The input of the de-multiplexer  510  are optical fibers carrying channels of wavelengths λ 1 , λ 2 , . . . λ k . The outputs of the de-multiplexer  510  are connected to the wavelength switches  521 ,  522 , . . . ,  52 k the outputs of which are linked to the Variable Optical Attenuators  531 ,  532 , . . . ,  53 k. The Variable Optical Attenuators  531 ,  532 , . . . ,  53 k are adapted to tune individual signal powers to meet minimal total routing cost and minimal total signal power of the channels according to the method described in  FIG. 2 . A part of the tuned channels are multiplexed in the multiplexer  540  for the output of the node  500 . There are added and dropped channels branching-off from the node  500 . The added channels are connected to the inputs of the wavelength switches  521 ,  522 , . . . ,  52 k, while the other part of the tuned channels constitutes the dropped channels. 
         [0043]    Those skilled in the art will appreciate that the method and model explained above may be implemented using software functioning in conjunction with a programmed microprocessor or a general-purpose computer. It will also be appreciated that while the current invention is primarily described in the form of a method, the invention may also be embodied in a computer program product and a memory coupled to the processor, wherein the memory is encoded with one or more programs that may perform the method disclosed in connection with  FIG. 2  and based on the model disclosed in connection with  FIG. 3 . 
         [0044]    Although the preferred embodiments of the present invention have been illustrated for OXC and ROADM, it is understood that the invention is not limited to these embodiments disclosed, but is capable of other type of optical nodes as set forth and defined by the following claims.