Energy-Efficient Resource Allocation for Elastic Optical Networks using Convex Optimization

Energy-Efficient Resource Allocation for Elastic Optical Networks using Convex Optimization


We propose a two-stage algorithm for energy-efficient resource allocation constrained to QoS and physical requirements in OFDM-based EONs. The first stage deals with routing, grooming and traffic ordering and aims at minimizing amplifier power consumption and number of active transponders. We provide a heuristic procedure which yields an acceptable solution for the complex ILP formulation of the routing and grooming. In the second stage, we optimize transponder configuration including spectrum and transmit power parameters to minimize transponder power consumption. We show how QoS and transponder power consumption are represented by convex expressions and use the results to formulate a convex problem for configuring transponders in which transmit optical power is an optimization variable. Simulation results demonstrate that the power consumption is reduced by when the proposed routing and grooming algorithm is applied to European Cost239 network with aggregate traffic Tbps. It is shown that our convex formulation for transponder parameter assignment is considerably faster than its MINLP counterpart and its ability to optimize transmit optical power improves transponder power consumption by for aggregate traffic Tbps. Furthermore, we investigate the effect of adaptive modulation assignment and transponder capacity on inherent tradeoff between network CAPEX and OPEX.

  • {IEEEkeywords}

    Convex optimization, Green communication, Elastic optical networks, Resource allocation, Quality of service.

  • 1 Introduction


    Energy consumption of equipments in telecommunication networks has been recognized as one of major contributors in overall future energy consumption. Traditional fixed grid optical networks are not adaptive and therefore, they can not efficiently use system resources such as transmit optical power and spectrum to minimize network energy consumption. Elastic Optical Networks (EON) can provide an energy-efficient network configuration by adapting the allocated resources to the communication demands and physical conditions. It has been shown that the cost and energy savings of migration to an energy-efficient EON outweigh the added cost of the equipments [1]. Higher energy efficiency of Orthogonal Frequency Division Multiplex (OFDM)-based optical networks has been demonstrated in [2] while the outstanding features such as scalability, compatibaility and adaptation which nominate OFDM as the enabling technology of EONs have been reported in [3].

    Many variants of optimization formulations and algorithms have been proposed for resource assignment in optical networks [4, 5, 6, 7]. Optimized Routing and Wavelength Assignment (RWA) in nonlinear Wavelength Division Multiplex (WDM) networks has been studied in [8, 9, 10, 11] which is not applicable to EON with variable assignment of spectrum width and optical carrier frequencies. Some of the proposed solutions for resource allocation in EONs do not consider the Quality of Service (QoS) requirements in their optimization analysis [12, 7, 13] which is a necessary parameter for practical network planning. Some of the researchers have proposed a general nonlinear expression to include QoS requirement as a fundamental constraint of the resource assignment optimization problem [14, 15, 16, 17] but several of them have focused on energy-efficiency [18, 19]. Khodakarami et al. have proposed a Mixed-Integer NonLinear Program (MINLP) for energy-efficient resource allocation in EONs which is decomposed into three sub-problems with heuristic solutions [19]. Their general formulation selects the best configuration for transponders and grooming switches such that the total network power consumption is minimized. Although they consider QoS requirement, they do not take into account the transmit optical power as an optimization variable. Traffic grooming is employed to reuse active physical components in the network and thereby increase the energy efficiency [20, 19]. However, there is no comprehensive work that simultaneously considers traffic grooming along with adaptive assignment of spectrum and transmit power variables and investigates their effect on different network elements.

    A convex optimization is a type of mathematical optimization problems characterized by convex objective and constraint functions. Because of their desirable properties, convex optimization problems can be solved with a variety of efficient algorithms. There are software packages that can be used to solve large scale convex optimization problems [21, 22]. Using Geometric Programming (GP) convexification techniques, communication optimization problems can be converted to convex form to allow us to use fast and efficient convex optimizer software packages [17, 23].

    The introduction of OFDM-based EONs, as a promising solution for developing green core optical networks, has raised new networking challenges and increased resource provisioning complexity. This mandates designing efficient and fast algorithms to utilize network adaptation capabilities for reducing power consumption. In this paper, we consider the energy-efficient resource allocation in OFDM-based EONs and following the approach of [15, 19], we decompose it into two interconnected optimization sub-problems 1) Routing, Grooming and Ordering (RGO) 2) Transponder Parameter Assignment (TPA). RGO is responsible for routing the traffic along the best possible path while minimizing the number of assigned lightpaths and used transponders by aggregating traffic partitions into a traffic segment closer to the information bit rate of the optical transponders. It also defines the orders of traffic routes on each link. In TPA, transponder variables such as transmit optical power, modulation level, coding rate, number of sub-carriers and location of optical carrier frequency are optimally configured such that total transponder power consumption is minimized, QoS requirements are guaranteed and physical constraints are satisfied. We formulate RGO as an Integer Linear Program (ILP) and provide a heuristic approach which yields its near-optimum solution in a reasonable time. Long and high volume traffic requests are more susceptible to transmission impairments and have considerable power consumption and spectrum usage. In RGO, we mainly focus on such long and high volume traffic requests and groom them over shorter lightpaths to reduce their high amount of power consumption and spectrum usage. TPA is conventionally formulated as a complex MINLP which is an NP-hard problem. A key contribution of this paper is that we have proposed a method to covert the complex MINLP to a convex problem which can be solved with readily available convex optimization algorithms [22]. In the proposed convex formulation, joint optimization of power and spectrum variables are addressed. We consider Optical Signal to Noise Ratio (OSNR) as an indicator of QoS and show how the required levels of QoS can be expressed by a convex inequality constraint. We also provide a convex expression for power consumption of transponders. Simulation results show that the proposed convex formulation provides the same results as its MINLP counterpart but in a much shorter time. Simulation results also demonstrate that optimizing transmit optical power considerably improves the power consumption of different network elements compared to the fix assignment of the transmit optical power. As another result, we demonstrate that it is not required to have a complex transponder supporting high number of different modulation levels and coding rates. We also show that how transponder capacity affects the expected power saving of our proposed algorithm for RGO. Furthermore, we reveal the inherent tradeoff between CAPital EXpenditure (CAPEX) and OPerational EXpenditure (OPEX) as the transponder capacity increases and show that increasing transponder capacity increases CAPEX while results in lower amount of OPEX.

    The rest of the paper is organized as follows. System model is introduced in Section 2. In Sections 3, we propose our two-stage resource allocation algorithm. Section 4 is devoted to RGO sub-problem while in Section 5, we show how TPA sub-problem is formulated as a convex optimization problem. Simulation results are included in 6. Finally, we conclude the paper in Section 7.

    Notation. Optimization variables are shown in lower case letters. Bold letters are used to denote vectors and sets. We use calligraphic font to show constants. Functions are also shown by capital letters and their arguments are given by lower indexes. Optical fiber characterizing parameters are shown by their typical notations.

    2 System Model

    Consider an optical network and assume that and denote its sets of optical nodes and directional optical fiber links. Optical fiber begins at node , ends at node and has length . The optical fiber bandwidth is assumed to be gridless. is the set of traffic requests. Each traffic request originates from source node , terminates at destination node and has volume of bit per second. As shown in Fig. 3, each optical node has a bank of transmit and receive transponders and an electronic grooming switch. Input/output traffic requests and added/dropped traffics can be merged in grooming switch to reduce the unused capacity of transponders and number of active transponders[19]. There are at most pairs of transmit and receive transponders in each bank which are indexed by . shows the part of th traffic request that may be added at th transmit transponder of node , i.e. transmit transponder . Similarly, denotes the part of th traffic request that may be dropped at receive transponder . is a binary variable that shows if link is used for routing the traffics added by transmit transponder . Furthermore, binary variable shows that if the added traffic of transmit transponder is dropped at receive transponder . Each transmit transponder is given a contiguous spectrum bandwidth around optical carrier frequency . The assigned contiguous spectrum bandwidth includes OFDM sub-carriers with sub-carrier space of so, . To facilitate optical switching and remove the high cost of spectrum conversion [24], we assume that the assigned spectrum bandwidth to each transponder is continuous over its routed path. The added traffic of transponder passes equal-length fiber spans along its routed path and has shared fiber spans with transmit transponder . Each fiber span has fixed length and is equipped with its own optical amplifier to compensate for the attenuation. shows the set of transmit transponders that share optical fiber on their allocated routes. There are pre-defined modulation levels and coding rates where each pair of requires minimum OSNR to get a pre-Forward-Error-Correction (FEC) Bit-Error-Rate (BER) value of , as shown in Tab. 1 [15]. The optical transponder is given a modulation level and a coding rate and fills its assigned optical bandwidth with optical power . Transponders have maximum information bit rate and fill both of the polarizations with the same power. The configuration of each receive transponder is the same as its corresponding transmit transponder. According to filtering and switching constraints in optical nodes, we consider a guard band between any two adjacent spectrum bandwidths of a link.

    Table 1: Available modulation levels and coding rates along with their corresponding minimum required OSNR to achieve a pre-FEC BER values of .
    Figure 1: Optical node block diagram which has a bank of transmit and receive transponders and an electronic grooming switch.

    Transponders, grooming switches and optical amplifiers are the main sources of network power consumption [19, 12] so, total network power consumption is given by:


    where is total power consumption of each linked pair of transmit and receive transponders, is power consumption of grooming switch and shows the total power consumption of optical amplifiers over link . Considering the architecture of Fig. 2, can be calculated as follows:


    where and are transmit and receive transponder bias terms (which includes the power consumption of bit interleaver, laser, A/D converter, D/A converter, Mach–Zehnder modulator, serial/parallel, parallel/serial), and are the scaling coefficient of encoder and decoder power consumptions, denotes the power consumption for a two point FFT operation and is the power consumption scaling coefficient of the receiver DSP operations. The electronic grooming switch consumes per each switched bit [19]. Considering the total groomed traffic at node , we can write [19]:


    where is discrete impulse function. Each optical amplifier also needs input power, therefore the total power consumption of optical amplifiers over an active link is [19]:

    Figure 2: Block diagram of a pair of OFDM-based transmit and receive transponders.

    3 Resource Allocation Problem

    To have a green EON, we need a resource allocation algorithm to determine the values of system model variables such that the network consumes the minimum power while physical constrains are satisfied and desired levels of QoS (or equivalently desired levels of OSNR) are guaranteed. In general, such a problem is modeled as an optimization problem and it is shown to be NP-hard [15]. Therefore, we propose a two-stage algorithm in which the complex resource allocation problem is decomposed into two sub-problems which are named RGO and TPA. The pseudo code of this algorithm is shown in Alg. 1. Solving RGO sub-problem, the connection requests are routed, the grooming switches are configured and the order of traffics on links are determined. Transponder parameters such as transmit optical power, modulation level, coding rate, number of sub-carriers and optical carrier frequency are optimized during TPA sub-problem. The power consumption of optical amplifiers and grooming switches are respectively related to the traffic routes and configuration of the grooming switches which are mainly addressed in RGO sub-problem. On the other hand, total transponder power consumption are minimized by solving TPA sub-problem. Usually the search for a near optimal solution involves iterations between these two sub-problems. To save this iteration time, it is of great interest to hold the run time of each sub-problem at its minimum value.

    In the coming sections, we formulate RGO problem as an ILP and then provide a heuristic solution for it. We also introduce an MINLP formulation for TPA sub-problem and show how this complex formulation can be converted to a convex optimization problem.



    Algorithm 1 Resource Allocation Algorithm
    1:network topology, traffic matrix, link parameters, noise and nonlinearity parameters, transponder parameters
    2:routes, groomed traffics, number of subcarriers, optical carrier frequencies, modulation levels, coding rates, transmit optical powers
    4:Stage 1: Routing, Grooming, Ordering
    5:for all connection requests  do
    6:      while  do
    7:            add a new full load transmit transponder at node ;
    8:            add a new full load receive transponder at node ;
    9:            use shortest path for the added transponder pair;
    10:            ;
    11:      end while
    12:end for
    13:sort traffics decreasingly according to the product of shortest path length and rate;
    14:for all traffics  do
    15:      ;
    16:      ;
    17:      for all groom scenarios on th traffic shortest path do
    18:            ;
    19:            ;
    20:            if   then
    21:                 continue;
    22:            end if
    23:            if  then
    24:                 ;
    25:                 ;
    26:            end if
    27:      end for
    28:      groom th request to the scenario having MATC and MSPL;
    29:      update sub-paths traffic volumes;
    30:      remove the groomed path;
    31:end for
    32:assign transmit and receive transponder pairs to the remaining traffic requests;
    33:route the remaining connection requests over their shortest path;
    34:order all the assigned paths according to the product of shortest path length and rate;
    35:Stage 2: Transponder Parameter Assignment
    37:      use convex TPA to optimize transponder parameters;
    38:      ;
    39:      do
    40:            for all transmit transponders  do
    41:                 for all spectral efficiency values of Tab. 1 do
    42:                       if if falls in -neighborhood of  then
    43:                             round and fix to ;
    44:                             break;
    45:                       end if
    46:                 end for
    47:                 for all coding rate values of Tab. 1 do
    48:                       if if falls in -neighborhood of  then
    49:                             round and fix to ;
    50:                             break;
    51:                       end if
    52:                 end for
    53:            end for
    54:            ;
    55:      while there is no valid value in and
    56:      remove fixed values of and ;
    57:while there is an inacceptable value in and

    4 Routing, Grooming and Ordering Sub-Problem

    In this section, an ILP is formulated for routing and traffic grooming and then a heuristic approach is proposed to solve it.

    4.1 ILP Formulation

    Generally, traffic grooming aims at minimization of active transponders to save transponder power consumption while shortest path routing is usually used to minimize the length of routes and consequently the number of used optical amplifiers [19]. Routing and traffic grooming can be formulated as the following ILP:


    where is a large positive number. Each transmit transponder is assigned a route to its destination so, minimization of used link lengths automatically results in simultaneous shortest path routing and minimum number of active transponders. This is the main cost of the goal function. The second term of the goal function is a penalty term to prevent unnecessary add/drop of the traffic paths in grooming switches. Furthermore, we add another penalty term to incur a cost for transponders with unused remaining capacity and therefore, force the transponders to be fully utilized. Constraint (6) is KCL law for added, dropped, input, output and groomed traffic of th connection request at node . Constraints (7) and (8) hold the information bit rate of the transmit and receive transponders below their capacity. Constraint (9) states that all the traffics of a transmit transponder should be dropped at its assigned receive transponder. Constraint (10) specifies that if a transponder has no allocated route, it should be inactive. Finally, constraint (11) is the optical switching constraint which states that if a traffic arrives to a node, it should be dropped to a receive transponder or switched to a neighbor node. This optimization problem has integer variables and its number of constraints has the order of . Although the problem is ILP, its number of variables and constraints is very large for practical values of , and . Therefore, a heuristic approach is required to provide a fast-achievable near-optimum solution for routing and traffic grooming problem.

    4.2 Heuristic Solution

    Long and high volume traffic requests are more susceptible to amplifier noise and nonlinear interference effects and need low level modulations, low coding rates, high transmit optical powers and therefore consume a lot of power. If such traffics are groomed to short traffic segments, each segment can be routed using high modulation levels and coding rates and consequently consumes lower spectrum and power. Merging long and high volume traffics to existing short traffic requests also reduces the number of required transponders and assigned links by utilizing the unused remaining capacity of the transponders which is our goal in ILP of (5)-(11). It is conventionally stated that if the path length is reduced by a factor of , modulation level can be doubled [4]. This in turn reduces the assigned spectrum width by a factor of and results in lower transponder power consumption according to (2). Consider the sample scenario of Fig. 3 in which transmit transponders are shown by rectangles below the nodes. For each transponder, the used capacity is highlighted by dark color and the number below each transponder shows its destination node. Assume we should route an input traffic with rate from source to destination over its shortest path which is . There are four grooming scenarios over this path which are summerized in Tab. 2. Minimum Available Transponder Capacity (MATC) is defined as the remaining capacity of the transmit transponder that has the maximum load over sub-paths of the grooming scenario. For example in scenario , we should use transponder of node and transponder of node which both of them have remaining capacity of , therefore . Maximum Sub Path Length (MSPL) is the maximum length of the sub-paths along the grooming scenario. For example in scenario , the sub-path has the maximum length which is . As the value of MSPL decreases, there are more chances to partition the path to shortest sub-paths and save power. As reported in Tab. 2, has the minimum MSPL and its MATC is enough to accommodate the required load and therefore, it is our chosen grooming scenario. Note that at worst case the traffic is routed over its shortest path without grooming to sub-paths.

    During RGO stage of Alg. 1, traffic volumes are partitioned such that no traffic volume is greater than transponder capacity . Then, we choose partitioned traffic volumes with full load of and route them over their shortest paths. The remaining traffic volumes are descendingly sorted according to the product of traffic volume and shortest path length. Next, we groom the sorted traffics using the procedure explained above, as written in Alg. 1. Finally, we use the metric of rate-length product to order traffics over links as explained in [17].

    Figure 3: An example for traffic grooming.

    . Scenario Number Grooming Scenario MATC MSPL

    Table 2: Grooming scenarios for example of Fig. 3

    5 Transponder Parameter Assignment Sub-Problem

    In this section, we provide an MINLP formulation for TPA and then show how it can be converted to a convex optimization problem.

    5.1 Nonlinear Formulation

    A MINLP formulation for TPA is as follows [15]:


    where , , , and are variable vectors of transponder configuration parameters i.e. modulation level, number of sub-carriers, coding rate, transmit optical power and central frequency. The goal is to minimize the total transponder power consumption where is obtained using (2). Constraint (13) is the QoS constraint that forces , the OSNR of transponder , to be greater than its required minimum threshold . is a nonlinear function of , and [17, 16] while the value of are picked up from Tab. 1. Constraint (14) is nonoverlapping-guard constraint that prevents two transmit transponders share a same frequency spectrum. is a function that shows which transponder occupies -th spectrum bandwidth on link and its values are determined during ordering part of RGO sub-problem. Constraint (15) holds all assigned central frequencies within the acceptable range of the fiber spectrum and finaly the last constraint guarantees that the transponder can convey the input traffic rate . In fact, this MINLP is an extension of the formulation of [19] in which transmit optical powers also contribute to the optimization and QoS constraint is specified by the general and nonlinear expressions of [15].

    5.2 Convexification Technique

    Figure 4: 2D curve fitting for data samples given in Tab. 1.

    We first provide a generalized posynomial expression [21] for the optimization and then define a variable change to convexify the problem. A posynomial expression for OSNR has been proposed in [17]:


    where , , and . is the spontaneous emission factor, is the light frequency, is Planck’s constant, is attenuation coefficient, is dispersion factor and is nonlinear constant. Furthermore, is the distance between carrier frequencies and and equals to . Similar to [17], we use a posynomial curve fitting for date samples of Tab. 1:


    where , , . Fig. 4 shows data samples and the posynomial expression for data curve fitting.

    Following the same approach as [17], we arrive at this new representation of the optimization problem:


    Ignoring constraints (25), (26), (27) and the penalty term of the goal function (19), the above formulation is equivalent GP of the previous MINLP in which expressions (17) and (18) have been used for QoS constraint (20). Constraints (25) and (26) and the penalty term are added to guarantee the implicit equality of [17]. Constraint (25) is also needed to convert the generalized posynomial QoS constraint to a valid GP one, as explained in [21]. Now, consider the following variable change:


    If one applies this variable change, the new representation of the problem is convex. As an example for the goal function we have:


    Clearly, and are convex over while and are convex over . Consequently, function (29) which is a nonnegative weighted sum of convex functions is also convex. The same statement can be applied to show the convexity of the constraints under variable change of (5.2) (for some constraints, we need to apply an extra to both side of the inequality to have a convex constraint).

    The original MINLP has variables and at most constraints while its convex representation requires variables and at most . Also the new convex representation of the problem has more variables and constraints than its MINLP counterpart but it can be quickly solved using fast convex optimization algorithms. In the second stage of Alg. 1, a relaxed continuous version of the proposed mixed-integer convex formulation is iteratively optimized in a local loop [21]. At each epoch, the continuous convex optimization is solved and obtained values for relaxed integer variables (here, ’s and ’s) are rounded by precision . If none of the rounded variables is valid based on Tab. 1, the precision is increased by and the rounding is again applied. This process continues until at least one valid element is found for relaxed integer variables. Then, we fix the acceptable rounded values and solve the relaxed continuous convex problem again. The local loop continues until all the integer variables have valid and acceptable values. Note that the number of iterations in the heuristic algorithm is at most equal to the number of integer variables (here, at most ). The number of iterations is usually lower than its maximum. Furthermore, a simpler problem should be solved as the number of iteration increases because of fixing some of the integer variables during each loop.

    6 Numerical Results

    In this section, we use simulation results to demonstrate the performance of the proposed formulations and algorithms. The European Cost239 optical network is considered with the topology of Fig. 5 and the normalized traffic matrix given in Tab. 4. One can scale the normalized traffic values of Tab. 4 to get west Europe aggregate traffic value of EByte/month [25, 19]. The optical link parameters and other simulation constants are reported in Tab. 3. We use MATLAB software for programming and simulation [26]. YALMIP [27] and CVX [28] optimization applications are also used for modeling and solving the proposed optimization problems. Simulations run over a computer equipped with Intel Core i7-472HQ CPU and 8 GB of RAM.

    Figure 5: European Cost239 optical network with optical nodes and bi-directional links. Digits on each link shows its length in km.
    dB/km km THz 1/W/km GHz THz W W W W mW mW pJ/bit W
    Table 3: Simulation constant parameters.
    Table 4: European Cost239 optical network normalized traffic matrix.

    Fig. 6 compares total power consumption versus aggregate network traffic with and without traffic grooming procedure of Alg. 1. Clearly, traffic grooming reduces the consumed power and the amount of saved power is improved for higher aggregate traffic values where more traffic grooming scenarios are available. As an example, the power consumption is reduced by a factor of when aggregate traffic is about Tbps.

    Figure 6: Total power consumption versus aggregate traffic with and without applying Alg. 1 for traffic grooming.

    Alg. 1 partitions the input traffic streams according to the capacity of transponders and uses the proposed traffic grooming procedure to fill transponders with remaining unused capacity. We define Transponder Utilization Ratio (TUR) as the ratio of the aggregate traffic to the total capacity offered by all transponders. means that all the transponders work at full capacity. Traffic Grooming Ratio (TGR) is defined as the ratio of the number of unloaded transponders by traffic grooming to the number of unfilled transponders when no traffic grooming is applied. TGR shows how traffic grooming reduces the number of required transponders. Fig. 7 shows TUR and TGR versus transponder capacity . As increases, there are more transponders with unused remaining capacity that can be used for traffic grooming and therefore, TGR is improved. On the other hand, we need more traffic volumes to use full capacity of the transponders when is increased and therefore, TUR goes down. Higher values of TUR reduces the required CAPEX for network deployment while higher values of TGR reduces the power consumption and consequently reduces the OPEX. Fig. 7 shows that there is a tradeoff between TUR and TGR or equivalently CAPEX and OPEX for higher values of .

    Figure 7: Transponder utilization and traffic grooming ratios versus transponder capacity .

    Fig. 8 shows TGR versus aggregate network traffic for different values of transponder capacity. As the aggregate traffic increases, more traffics are groomed and we save more power due to unloaded transponders. The improvement is more for transponders with higher capacity. As an example, when the aggregate traffic is Tbps and increases from Gbps to Gbps, TGR is improved by a factor of .

    Figure 8: Traffic grooming ratio versus aggregate network traffic for different values of transponder capacity.

    Fig. 9 shows how our proposed TPA convex formulation runs faster than its MINLP counterpart. We use MINLP formulations of (12)-(16) as a test bench in which QoS constraint is replaced by the nonlinear and general expression of [15]. Results show that the convex formulation is much faster than the MINLP formulation. As an example, it can be about times faster at aggregate traffic of Tbps. Simulation results also show that for higher values of aggregate traffic, the nonlinear optimizer package may fail to provide a feasible solution while the convex optimizer software still yields a feasible solution in a reasonable run time.

    Figure 9: Run time in terms of aggregate traffic for MINLP and convex formulations of transponder parameter assignment problem.

    The effect of adaptive assignment of coding rate and modulation level on power consumption has been investigated in literature [19]. We also analyze this issue and evaluate the complexity of transponders. Fig. 10 shows total power consumption of different network elements in terms of the number of available modulation formats. The power consumption values are normalized to their corresponding values for the scenario with two available modulation formats . An interesting observation in Fig. 10 is that increasing the number of modulation levels decreases the power consumption of various network elements with the DSP power consumption showing the highest level of power reduction. Clearly, as the number of modulation levels increases, the amount of power consumption decreases but there is no considerable gain if the number of modulation levels be more than . On the other hand, increasing the number of modulation levels in a transponder may have an important effect on the complexity of the receiver architecture and its signal processing requirements. Therefore, one should choose the number of modulation levels in a transponder to have a balance between complexity (CAPEX) and power consumption (OPEX).

    Figure 10: Normalized total power consumption of different network elements in terms of the number of available modulation formats.

    The effect of adaptive assignment of coding rate and modulation level on power consumption has been studied in the literature. However, to the best of our knowledge, there is no comprehensive investigation for the effect of adaptive transmit optical power assignment on power consumption of different network elements. The total power consumption of different network elements in terms of aggregate traffic with and without adaptive transmit optical power assignment has been reported in Fig. 11. We have used the proposed expression of [29] for fixed assignment of transmit optical power. Clearly, for all the elements, the total power consumption is approximately a linear function of aggregate traffic but the slope of the lines are lower when transmit optical powers are adaptively assigned. As an example, adaptive transmit optical power assignment improves total transponder power consumption by a factor of for aggregate traffic of Tbps.

    Figure 11: Total power consumption of different network elements in terms of aggregate traffic with and without adaptive transmit optical power assignment.

    7 Conclusion

    Energy-efficient resource allocation and quality of service provisioning are two fundamental problems of green elastic optical networks that are conventionally formulated using complex mixed-integer nonlinear optimization problems. To address the complexity of the problem and provide a fast-achievable near-optimum solution, we propose a two-stage resource allocation algorithm in which the main problem is decomposed into two inter-connected sub-problems named routing, grooming and ordering, and transponder parameter assignment. We introduce a heuristic approach for routing, grooming and ordering sub-problem that determines traffic routes, active transponders and grooming switch configuration to reduce amplifier power consumption and number of active transponders. To have an efficient transponder parameter assignment, we formulate a convex optimization problem in which joint optimization of power and spectrum resources constrained to physical and quality of service requirements is addressed. We use geometric convexification techniques to provide convex expressions for transponder power consumption and optical signal to noise ratio as a metric of quality of service. The performance of the proposed resource allocation procedure is validated through simulation results. We demonstrate the improved performance of our presented routing and grooming procedure in terms of network power consumption, transponder utilization ratio and traffic grooming ratio. Furthermore, numerical outcomes show that the proposed convex formulation for configuring the transponders yields the same results in a considerable lower run time compared to its mixed-integer nonlinear counterpart. The improved effect of the joint optimization of power and spectrum variables on power consumption of different network elements is also demonstrated by simulation. According to the results, adaptive assignment of transmit optical power considerably reduces total transponder power consumption. Furthermore, we analyze the inherent trade-off between CAPEX and OPEX as the capacity and/or design complexity of the transponders change.


    1. E. Palkopoulou, M. Angelou, D. Klonidis, K. Christodoulopoulos, A. Klekamp, F. Buchali, E. Varvarigos, and I. Tomkos, “Quantifying spectrum, cost, and energy efficiency in fixed-grid and flex-grid networks [invited],” Journal of Optical Communications and Networking, vol. 4, no. 11, pp. B42–B51, 2012.
    2. A. Nag, T. Wang, and B. Mukherjee, “On spectrum-efficient green optical backbone networks,” in Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE.   IEEE, 2011, pp. 1–5.
    3. J. Armstrong, “Ofdm for optical communications,” Journal of lightwave technology, vol. 27, no. 3, pp. 189–204, 2009.
    4. B. C. Chatterjee, N. Sarma, and E. Oki, “Routing and spectrum allocation in elastic optical networks: A tutorial,” IEEE Communications Surveys & Tutorials, vol. 17, no. 3, pp. 1776–1800, 2015.
    5. F. S. Abkenar and A. G. Rahbar, “Study and analysis of routing and spectrum allocation (rsa) and routing, modulation and spectrum allocation (rmsa) algorithms in elastic optical networks (eons),” Optical Switching and Networking, vol. 23, pp. 5–39, 2017.
    6. N. Sambo, G. Meloni, F. Cugini, A. D’Errico, L. Potì, P. Iovanna, and P. Castoldi, “Routing code and spectrum assignment (rcsa) in elastic optical networks,” Journal of Lightwave Technology, vol. 33, no. 24, pp. 5114–5121, 2015.
    7. M. Hadi and M. R. Pakravan, “Improved routing and spectrum assignment formulations for optical ofdm networks,” pp. 1–6, 2016.
    8. I. Roberts, J. M. Kahn, and D. Boertjes, “Convex channel power optimization in nonlinear wdm systems using gaussian noise model,” Journal of Lightwave Technology, vol. 34, no. 13, pp. 3212–3222, 2016.
    9. D. J. Ives, P. Bayvel, and S. J. Savory, “Physical layer transmitter and routing optimization to maximize the traffic throughput of a nonlinear optical mesh network,” in Optical Network Design and Modeling, 2014 International Conference on.   IEEE, 2014, pp. 168–173.
    10. ——, “Adapting transmitter power and modulation format to improve optical network performance utilizing the gaussian noise model of nonlinear impairments,” Journal of Lightwave Technology, vol. 32, no. 21, pp. 3485–3494, 2014.
    11. ——, “Routing, modulation, spectrum and launch power assignment to maximize the traffic throughput of a nonlinear optical mesh network,” Photonic Network Communications, vol. 29, no. 3, pp. 244–256, 2015.
    12. A. Fallahpour, H. Beyranvand, and J. A. Salehi, “Energy-efficient manycast routing and spectrum assignment in elastic optical networks for cloud computing environment,” Journal of Lightwave Technology, vol. 33, no. 19, pp. 4008–4018, 2015.
    13. É. Archambault, N. Alloune, M. Furdek, Z. Xu, C. Tremblay, A. Muhammad, J. Chen, L. Wosinska, P. Littlewood, and M. P. Bélanger, “Routing and spectrum assignment in elastic filterless optical networks,” IEEE/ACM Transactions on Networking, vol. 24, no. 6, pp. 3578–3592, 2016.
    14. J. Zhao, H. Wymeersch, and E. Agrell, “Nonlinear impairment-aware static resource allocation in elastic optical networks,” Journal of Lightwave Technology, vol. 33, no. 22, pp. 4554–4564, 2015.
    15. L. Yan, E. Agrell, H. Wymeersch, and M. Brandt-Pearce, “Resource allocation for flexible-grid optical networks with nonlinear channel model [invited],” Journal of Optical Communications and Networking, vol. 7, no. 11, pp. B101–B108, 2015.
    16. L. Yan, E. Agrell, M. N. Dharmaweera, and H. WymeerschP, “Joint assignment of power, routing, and spectrum in static flexible-grid networks,” Journal of Lightwave Technology, no. 99, 2017.
    17. M. Hadi and M. R. Pakravan, “Resource allocation for elastic optical networks using geometric optimization,” arXiv preprint arXiv:1705.01191, 2017.
    18. H. Khodakarami, B. S. G. Pillai, and W. Shieh, “Quality of service provisioning and energy minimized scheduling in software defined flexible optical networks,” Journal of Optical Communications and Networking, vol. 8, no. 2, pp. 118–128, 2016.
    19. H. Khodakarami, B. S. G. Pillai, B. Sedighi, and W. Shieh, “Flexible optical networks: An energy efficiency perspective,” Journal of Lightwave Technology, vol. 32, no. 21, pp. 3356–3367, 2014.
    20. M. M. Hasan, F. Farahmand, J. P. Jue, and J. J. Rodrigues, “A study of energy-aware traffic grooming in optical networks: Static and dynamic cases,” IEEE Systems Journal, vol. 7, no. 1, pp. 161–173, 2013.
    21. S. Boyd, S.-J. Kim, L. Vandenberghe, and A. Hassibi, “A tutorial on geometric programming,” Optimization and engineering, vol. 8, no. 1, p. 67, 2007.
    22. S. Boyd and L. Vandenberghe, Convex optimization.   Cambridge university press, 2004.
    23. M. Chiang et al., “Geometric programming for communication systems,” Foundations and Trends® in Communications and Information Theory, vol. 2, no. 1–2, pp. 1–154, 2005.
    24. M. Hadi and M. R. Pakravan, “Spectrum-convertible bvwxc placement in ofdm-based elastic optical networks,” IEEE Photonics Journal, no. 99, pp. 1–7, 2017.
    25. A. Muhammad, G. Zervas, N. Amaya, D. Simeonidou, and R. Forchheimer, “Introducing flexible and synthetic optical networking: Planning and operation based on network function programmable roadms,” Journal of Optical Communications and Networking, vol. 6, no. 7, pp. 635–648, 2014.
    26. MathWorks Inc., “Matlab,”, 2017.
    27. J. Lofberg, “Yalmip: A toolbox for modeling and optimization in matlab,” in Computer Aided Control Systems Design, 2004 IEEE International Symposium on, 2005, pp. 284–289.
    28. M. Grant, S. Boyd, and Y. Ye, “Cvx: Matlab software for disciplined convex programming,” 2008.
    29. G. Gao, X. Chen, and W. Shieh, “Analytical expressions for nonlinear transmission performance of coherent optical ofdm systems with frequency guard band,” Journal of Lightwave Technology, vol. 30, no. 15, pp. 2447–2454, 2012.
    Comments 0
    Request Comment
    You are adding the first comment!
    How to quickly get a good reply:
    • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
    • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
    • Your comment should inspire ideas to flow and help the author improves the paper.

    The better we are at sharing our knowledge with each other, the faster we move forward.
    The feedback must be of minimum 40 characters and the title a minimum of 5 characters
    Add comment
    Loading ...
    This is a comment super asjknd jkasnjk adsnkj
    The feedback must be of minumum 40 characters
    The feedback must be of minumum 40 characters

    You are asking your first question!
    How to quickly get a good answer:
    • Keep your question short and to the point
    • Check for grammar or spelling errors.
    • Phrase it like a question
    Test description