Research Article | Open Access
Power-Aware Routing and Network Design with Bundled Links: Solutions and Analysis
The paper deeply analyzes a novel network-wide power management problem, called Power-Aware Routing and Network Design with Bundled Links (PARND-BL), which is able to take into account both the relationship between the power consumption and the traffic throughput of the nodes and to power off both the chassis and even the single Physical Interface Card (PIC) composing each link. The solutions of the PARND-BL model have been analyzed by taking into account different aspects associated with the actual applicability in real network scenarios: (i) the time for obtaining the solution, (ii) the deployed network topology and the resulting topology provided by the solution, (iii) the power behavior of the network elements, (iv) the traffic load, (v) the QoS requirement, and (vi) the number of paths to route each traffic demand. Among the most interesting and novel results, our analysis shows that the strategy of minimizing the number of powered-on network elements through the traffic consolidation does not always produce power savings, and the solution of this kind of problems, in some cases, can lead to spliting a single traffic demand into a high number of paths.
Energy saving is one of the most important challenges of the twenty-first century for environmental and economical reasons. From an environmental perspective, due to the lack of diffusion and efficiency of renewable energy, the reduction of power consumption is important because the production of energy is directly related to the emission of carbon dioxide (), the main reason of global warming. From an economical point of view, the incremental growth of the energy price and of the power demand of emerging countries makes energy saving a key issue to contain the increase of energy cost in various sectors (industrial, commercial, and residential). Furthermore, we are witnessing an explosive growth in the use of Information and Communication Technologies (ICTs) equipment that is rapidly becoming a major consumer of energy. Indeed, according to the SMART 2020 study , emissions from ICT are increasing at a rate of 6% per year, and with such a growth rate they could represent 12% of worldwide emissions by 2020.
In this scenario, the research community is studying a set of approaches for improving the energy efficiency of the future Internet. Detailed and up-to-date surveys on the different strategies for energy-efficient networking are presented in [2, 3]. These studies are based on the consideration that current networks are widely overprovisioned and network devices are not energy aware; that is, they always consume the same energy irrespective of their utilization. The relevance of these problems is further emphasized by the works of the Energy Management (EMAN) WG of IETF. The EMAN WG started with the basic objective of operating communication networks and other devices with a minimal amount of energy while still providing sufficient performance to meet service level objectives. The EMAN is defining the requirements for standard specifications in energy management, both monitoring functions and control functions . Network entities are subjected to energy management. Examples of these entities are a whole device or one component of a device, which is subject to individual energy monitoring, control, or both.
The research activities can be classified into two main areas: local strategy and network-wide strategy. In the first case, power saving functions are executed locally by an entity. The strategies consist in monitoring the entity usage and dynamically adapting its power consumption according to the required performance. As an example, the entity may switch to a sleep state when it is not in use or out of scheduled business hours [5–7]. Local management has the main advantage that the power savings are obtained by means of measured data based on local observations, without the interaction with other network entities. The corresponding solutions lead to the design of power-aware network elements. The network-wide policies aim to achieve further energy savings by means of strategies that exploit the power consumption features of power-aware network elements. They require the information on power consumption and network load acquired through monitoring and a network-wide energy management system.
Starting from the seminal work on power-efficient network devices presented in , many efforts have been recently devoted to define strategies for reducing the power consumption of the whole network infrastructure. As an example, in  the authors present ElasticTree, a method for reducing the energy consumption in data center networks. In , the authors compare three different approaches to power off the line cards by reconfiguring the routing at the IP and/or WDM layer. Another topic of network-wide power management addresses is the protocol issues in Internet Service Provider networks. In , the authors present an energy-aware traffic engineering technique that reduces the energy consumption by considering sleeping of links and nodes as well as link rate adaptation. In , the authors propose a traffic engineering mechanism that minimizes the number of active line cards (or their ports) and explore the implementation issues by assuming networks that run both OSPF-like protocol and MPLS. Finally, in  the authors propose a distributed algorithm to dynamically adapt the working state of links to the current traffic load. Their solution belongs to an OSPF-like protocol.
The contribution of this paper is focused on the network-wide power optimization in the backbone network. In particular, the paper investigates a very general network-wide power management (NWPM) problem, called Power Aware Routing and Network Design with Bundled Links (PARND-BL) , which is able to take into account both the constant and the variable terms of the power consumption of network equipment. In particular, PARND-BL is able to consider both the energy behavior of the route processor, that is, the relationship between the power consumption and the traffic throughput of the nodes, and to power off both the chassis and even the single PIC composing each link.
In the case of large network topologies, PARND-BL cannot be solved to optimality in an acceptable time, that is, few hours (see ). Therefore, we propose a heuristic named “Heuristic for PARND-BL” (HPARND-BL), whose solutions are capable of guaranteeing interesting power savings results. The well-known heuristic Fast Greedy Heuristic (FGH)  has been considered as the benchmark heuristic.
The performance analysis takes into account different actual network scenarios and diverse metrics, such as the number of powered-on network elements, the CPU time for solving the problem, and the number of paths per flow of the solution. To the best of our knowledge, none of the previous works presenting models for the minimization of the network power consumption has evaluated the actual applicability of the obtained solution in terms of number of paths used to route each single traffic demand. The relevance of this analysis consists in the fact that the solutions of the power reduction problems could entail a huge number of paths per traffic demand. The management of a high number of paths per traffic demand can be so expensive in terms of signaling to reduce the appeal deriving from the power savings. Finally, the extensive simulation analysis gives insights into the performance of the considered NWPM approaches under diverse network parameters, such as the power characterization of network devices, the traffic load, the network topology, and the QoS requirements.
The paper is structured as follows. Section 2 presents the NWPM in more detail. Section 3 reviews the main literature on the subject. Sections 4 and 5 introduce the power-aware problem formulation and the related proposed heuristic, respectively, that are the main focus of the paper. Section 6 addresses some implementation issues. Section 7 reports the network scenarios considered for the simulations. Sections 8 and 9 present the simulation settings and discuss the computational results. Finally, the conclusions are drawn in Section 10.
2. Network-Wide Power Management (NWPM)
Generally speaking, NWPM consists in finding the design and the routing strategies that minimize the overall power consumption of a network by taking into account the power behavior of the network elements and the traffic demand. Therefore, three critical issues can be devised in NWPM: the time horizon of the traffic demands, the power behavior of the network devices, and the protocol architecture.
2.1. Time Horizon of the Traffic Demands
Regarding this issue, we can observe that in actual deployments the traffic matrix presents significant changes mostly between two periods: peak and off-peak. Just relatively small variations are usually registered within each period (see Figure 1). Therefore, the time scale of the NWPM approaches could safely be based on peak and off-peak traffic periods only. In general, the choice of a smaller time scale implies the study of the trade-off between responsiveness to traffic variations and time to perform the algorithms and apply the obtained solution. In a deployment scenario, the network power consumption strategies could be recalculated following the slow and daily variation of traffic, that is, referring to time scale of 30 min. However, this approach leads to diverse reconfigurations per day. On the contrary, the choice of a time scale of 6/12 hours (with the coarse classification of peak and off-peak traffic periods) mitigates the eventual extra energy cost and additional latencies that devices may introduce when changing power state (e.g., energy spent to save/recover router state on/from disk, etc.). In conclusion, we assume that the duration of the two periods is day and night, respectively, and that the maximum acceptable time for computing an NWPM solution can be order of 6/12 hours.
2.2. Power Behavior of the Network Devices
The energy characterization of the network devices determines what can be exploited to minimize the overall network consumption. In this work, we have used a general power consumption model of a router, which is composed of three main components :(i)chassis; (ii)Physical Interface Cards (PICs); (iii)route processor.
The chassis can be powered off (i.e., it works in a low-power mode); hence, the power consumption can be assumed to be constant if the chassis is powered on and zero otherwise.
To model the power characteristics of the PICs, we have to dissect the communication process in more detail. The energy for transferring a bit from a node to , can be ascribed to various components, such as the power consumed by the transmitting PIC in and the receiving PIC in . To make the treatment easier (and without loss of generality), when dealing with the traffic sent from to we will associate all the power consumption and the related capacity with the PIC at node . Obviously, in the reverse direction, we will associate them with the PIC at node . It is worth noting that the network operators tend to deploy similar devices in their core networks. Thus, we can assume that the power consumption and the capacity of the PIC used to transmit along are equal to the ones of the PIC transmitting along . Similar to the chassis, the PICs can be powered off. Therefore, there is a constant, nonzero power consumption when the PIC is powered on, and a zero power consumption when the PIC is powered off.
Another aspect that will be included in the analysis is the fact that in modern core networks pairs of routers are typically connected by multiple PICs that form one logical bundled link . This technique is called link aggregation and is standardized by 802.1AX . Link aggregation is widely diffused because it allows to easily upgrade the link capacity by adding new PICs and reach link capacities bigger than those available even by using the fastest available technology. For example, a 40 bundled link may be set up with four OC-192 PICs having a capacity each. Therefore, in our model, we assumed that links are composed of multiple PICs and that each PIC of the bundled links can be independently powered off.
In the route processor, the power consumption generally depends on the traffic load of the router in a nonlinear way. In , the authors present several possible behaviors:(i)linear—switch architectures like Batcher, Crossbar, and Fully Connected; (ii)logarithmic—equipment implementing hibernation techniques; (iii)cubic—equipment that uses energy saving methods such as dynamic voltage and dynamic frequency scaling (DVS-DFS);(iv)on-off—almost the totality of current network equipment that consumes always the maximum power in every load condition.
2.3. Protocol Architecture
In modern broadband communication networks, in order to apply the calculated traffic engineering solution, we should refer to protocol architectures such as MPLS (Multiprotocol Label Switching) . In this architecture, the paths, denoted as Label Switched Paths (LSP), are created and managed by means of signalling protocols (such as RSVP-TE, Resource Reservation Protocol for Traffic Engineering ), and they support the traffic demand for a given pair of nodes.
A similar strategy can be implemented by means of emerging architecture paradigms such as the Software-Defined Networking (SDN).
For this reason, we propose a centralized architecture where a Network Control Unit (NCU) provides the LPSs (see Figure 2). Based on topology and traffic load information, the NCU selects the best routing and design strategy to reduce the overall network power consumption.
3. Related Work
We focus our attention on the network-wide power saving strategies, which are able to exploit the energetic characterization of the power-aware network devices. As presented in , the known strategies can be classified by taking into account the following four basic problems. (i)Power-Aware Routing (PAR). Given the traffic demands associated with the nodes, PAR consists in determining the traffic routing strategy that minimizes the overall power consumption of the network by taking into account only the power absorbed by the route processor. (ii)Power-Aware Network Design (PAND). Given the traffic demands associated with the nodes, PAND consists in determining the traffic routing strategy that minimizes the overall power consumption of the network just by powering off elements of the network. (iii)Power-Aware Routing and Network Design (PARND). Given the traffic demands associated with the nodes, PARND consists in determining the traffic routing strategy that minimizes the overall power consumption of the network by jointly considering the power absorbed by the route processor and the possibility of powering off the entire links and/or nodes. (iv)Power-Aware Routing and Network Design with Bundled Links (PARND-BL). This problem extends PARND by exploiting also the possibility to power off single PIC of bundled links.
A first set of activities has been aimed at defining models for the PAND problem. In particular,  presents at first some measurements of power consumption of networking devices and then evaluates the total network consumption of a certain topology given the power footprint of each element. A standard Capacitated Multicommodity Minimum Cost Flow formulation is proposed in  for finding the minimum set of network elements to be powered on in order to guarantee the required service. However, the complexity of the model grows very quickly with the number of devices, making it very expensive to solve even for small networks. In , the authors present the analysis of the strategies to concentrate network traffic on a minimal subset of network resources in order to power off nodes and links while still guaranteeing full connectivity and fulfilling the maximum link utilization constraints. In addition, by taking into account strict constraints on the computational time,  provides efficient heuristics to find an approximated solution in an acceptable time also for large network scenarios. A variation of this class of problems is presented in , which describes a simple heuristic, called Fast Greedy Heuristic (FGH), to power off links when bundles of physical cables are present. In , the authors present new heuristics for this problem; the main characteristic of the new approach is the ability of routing each traffic demand by using only a single path. Since this paper addresses the more general PARND-BL problem, that allows multiple paths for each traffic demand, we have selected the FGH heuristic as the benchmark for evaluating our approach.
A second set of works has been focused on the definition and the solution of the PAR problem. In , the authors presented a study on the reduction of the overall power consumption that can be achieved when the energy profiles of the network devices are taken into account during routing and traffic-engineering operations. They consider rough linear approximations of the power consumption of the devices, and then use a linear programming solver (i.e., CPLEX ). However, since the power consumption of energy-aware network devices is generally a nonlinear function of their workload, PAR is a non-linear multicommodity flow problem. Given this feature, the PAR problem should be modelled and solved by means of non-linear solvers such as Ipopt (Interior Point Optimizer) , a software package for large-scale non-linear optimization that implements an interior-point line-search filter method (as performed in this study, see Section 8). In , the authors have proposed a heuristic based on Dijkstra's algorithm and have deeply investigated the impact of the traffic load and the topology on the network performance.
A third set of works has been devoted to jointly consider the power aware routing and the network design problems (i.e., PARND). The problem is discussed in [30, 31] under different technology assumptions. Different from our work, the authors of  assume that nodes and even links have a linear energy behaviour; instead the authors of  assume that nodes and even links have a staircase energy behaviour. Also, in , the authors take into account one network topology only, thus neglecting the effect that different network scenarios may have on the quality of the solution. A heuristic to solve the PARND problem is proposed in , where the authors consider only the energy consumption of the links, which is again assumed to be linearly proportional to the traffic that flows through. The first preliminary ideas for modelling the non-linear behaviour of the routers, together with a heuristic algorithm, are suggested in , based on the indications in . Specifically, the proposed energy model is built from the sum of two constant addends associated with the power consumption of the chassis and the PICs and one variable (non-linear) element associated with the route processor.
On the other hand, to the best of our knowledge, none has deeply analyzed both the performance and the actual applicability of a general network-wide problem like PARND-BL, proposed in .
4. Problem Statement
Let us introduce the parameters and the notation used in the paper. The starting point of the analysis is a network modelled as a directed graph , where denotes the set of the vertices and is the set of the edges, which model the network nodes and links, respectively.
The following parameters are assumed to be given in order to characterize the power consumption of the network elements:(i) is the power consumption of a PIC that transmits traffic from node to node (i.e., a PIC of link ); (ii) is the power consumption concerning the chassis of the node ; (iii) is the power consumption concerning the route processing of the node at the traffic throughput ; as justified before, hereafter we shall assume that is a non-linear function.
Since each logical link is generally composed of a set of PICs, the overall power consumption for the traffic transmission on a link is equal to the number of powered-on PICs, in node connected to , multiplied by . Hence, the maximum power consumption associated with a directional link is given by , where is the number of deployed PICs forming the bundled link that connects to .
Concerning the traffic demand and the capacity of nodes and links, we define the following parameters:(i) is the set of the origin-destination pairs of the traffic matrix; (ii) is the traffic demand between the source node and the destination ; (iii) is the capacity of node ; (iv) is the capacity of each PIC which composes the link .
Three sets of variables are defined:(i) is the amount of flowing through the link ; (ii) is the number of powered-on PICs composing the link ; (iii) is set to 1 when the node is powered on and to 0 otherwise.
The traffic throughput of node can then be defined as the total flows entering plus the traffic originated from , according to the following formula:
For reducing the overall power consumption of a network with bundled links, we define the PARND-BL problem. This minimization problem considers both the possibility of routing the traffic demands by taking into account the relation between the power consumption of the route processor and the traffic load, and of powering off the nodes and the links, as well as even single PIC of bundled links.
The above introduced PARND-BL problem leads to a Mixed Integer Nonlinear Programming (MINLP) design and routing model, which can be formulated as follows: subject to the constraints
Equations (3) are the classical flow conservation constraints; instead (4) provide the definition of the flow variables. Equations (5) and (6) are the node and the link capacity constraints extended to power off nodes and PICs, respectively. Moreover, (7) affirm that if a node is powered off, then all its incident links must be powered off. Finally, the constraints (8) and (9) guarantee that nodes and even PICs of bundled links can be powered off.
5. Heuristics to Solve PARND-BL
For solving PARND-BL, we propose a new heuristic, called HPARND-BL, which is based on the Fast Greedy Heuristic (FGH) approach presented in  for solving a PAND problem. We recall that the PAND problem minimizes the function , subject to (3), (4), (5), (6), (7), (8), and (9), where is the maximum power consumption of node .
The FGH heuristic uses the Maximum Spare Capacity (MSC) problem as building block. Taking into account the notations introduced in the previous section, the MSC problem can be formulated as follows: subject to (3), (4), and where is the capacity of the link (in the case of a bundled link , where is the number of powered-on PICs). Obviously, (11) and (12) are the node and the link capacity constraints, respectively.
The initialization of the FGH heuristic consists in solving the MSC problem to obtain the flow assigned to each link. Then, for each link the maximal number of PICs is removed by taking into account that the link capacity constraints have to be still satisfied.
After the initialization, the link with the greatest spare capacity is identified; that is, FGH finds the for which where denotes the number of PICs remaining after the initialization. Then, FGH tries to remove one PIC (in each direction) from the link because after the removal, the excess traffic that needs to be rerouted is the smallest. With the PIC removed, FGH solves the MSC with the new link capacities to find the new distribution of the traffic. If the problem has a feasible solution, the PIC considered for removal is permanently removed; otherwise it is not removed and the corresponding link is marked as final; that is, no additional PICs will be removed from final edges (FEs). Then in the next iterations, the identification of the link with the greatest spare capacity is performed by ignoring all final links. The iterative procedure concludes when all links become final.
Focusing on the ability of powering off link/PICs, HPARND-BL mainly differs from FGH in two aspects: (i) at each iteration a PIC is removed if the overall power consumption is actually reduced, (ii) and the Power-Aware Routing (PAR) problem is used as a building block in place of MSC. Furthermore, HPARND-BL is able to power off nodes. Therefore, HPARND-BL can exploit the ability of the chassis to be powered off, and this is particularly relevant when the power consumption due to route processor is dependent on the node throughput. In this case, the power consumption due to route processor has to be explicitly addressed in the problem formulation, and just to power off links/PICs does not necessarily determine a reduction of the overall network consumption.
The considered PAR problem consists in determining the traffic routing strategy that permits to reduce the overall power consumption of the network by taking into account only the power consumption of the nodes concerning the route processor, that is, . It is formulated by means of the following non-linear multicommodity flow model: subject to (3), (4), (5), and (6).
PAR problem has been solved by means of Ipopt . This software implements an exact approach which considers the actual power consumption of the nodes (i.e., without performing a linear approximation of the non-linear curve).
In Algorithm 1, the lines enable HPARND-BL to power off nodes; lines have been obtained by modifying FGH, and their purpose is to try to power off single PIC. Similar to the strategy used by FGH to power off PICs, at each iteration of HPARND-BL, a transit node, , (i.e., a node if ) with the greatest spare capacity is temporally removed, it is marked as final vertex (FV), and PAR is solved by considering the new topology. If the problem has a feasible solution and the overall power consumption is actually reduced, the selected node is permanently removed; otherwise it is not removed. In the next iterations, the selected node is the one with the greatest spare capacity that is not included in the final vertices. The iterative procedure in lines 4–17 ends when all nodes become final vertices. The same behavior can be observed by considering the iterative component described by lines 18–31.
6. Implementation Issues
In the following section, we present some implementation issues to enhance the computational efficiency of the approach, to take into account the Quality of Service (QoS), and to evaluate the applicability of the proposed solutions in a real network scenario.
6.1. Flow Variable Modification
In order to reduce the computational effort, we indeed considered and implemented aggregated versions of the flow variables, where all the commodities having the same origin node are considered to be “the same kind of flow.”
We have modified the constraints (4) as follows: where is the set of sources of the traffic demand.
Consequently, the flow conservation constraints (3) have been opportunely modified:
These modifications reduce the number of the flow variables from to , where and are orders of and , respectively. These substitutions permit to decrease the running time of the solver.
6.2. Quality of Service (QoS)
In order to take into account the QoS in the considered problem, we have limited the link utilization by multiplying by a factor in the link capacity constraints (6) and (12). The value of , which represents the link utilization, has to be appropriately determined in order to guarantee the QoS (i.e., a limited delay). To this aim, we have modeled the transmission of the traffic on the link as a M/M/1 queue, where the service rate is the link capacity. By considering that the minimum link capacity of the network is (i.e., a link composed of a single PIC), the mean delay of a single hop can be estimated as .
6.3. Flow Decomposition
The solution of the PARND-BL formulation and the related heuristic provides the set of flow variables. Therefore, for providing the LSPs, as discussed in Section 2, the NCU has to decompose the flows into sets of paths between the origin-destination pairs.
Note that the splitting of a traffic demand into too much LSPs can deteriorate the performance of the networks, due to the overhead of the signalling protocols used to create and manage LSPs. Hence, the solution should limit to few units the number of paths used to support the traffic of each origin-destination pair [34–36].
The Multidestination Flow Decomposition Heuristic (MD-FDH) is a new heuristic for decomposing a flow (one-source multiple destinations) into a set of paths that is based on a heuristic proposed in .
After initializing the vector to zero for each destination node from the source node , the MD-FDH (see Algorithm 2) consists in defining the set of residual links, , selecting the destination node, , with the minimum traffic demand from to it, and calculating the shortest path, , from to in the residual topology, . Then, the is calculated as the minimum among the traffic demand, , and all the flow variables belonging to . Moreover, the values of and are coherently reduced, and the computed path is added to the . Finally, the is increased. The iterations continue until all the flow variables are equal to zero.
7. Simulation Scenario
The simulation analysis is devoted to evaluate the impact of the diverse parameters of the network scenario on the performance of the described solutions. In particular, we take into account the network topology, the energy behavior of the network equipment, the traffic load, and the QoS requirements.
7.1. Network Topology
The first scenario is an European core network topology obtained from the Simple Network Description Library ; in particular, we considered the file nobel-eu. The other network scenarios are backbone topologies obtained from the set of data collected during the Rocketfuel study . In particular, we considered the following topologies: Exodus (US), Ebone (EU), Abovenet (Australia), and Sprintlink (US), which correspond, respectively, to the datasets AS 3967, AS 1755, AS 6461, and AS 1239 of the Rocketfuel study. The last considered network scenario is a large Austrian core topology (ta2) taken from  and given by the Telekom Austria.
The nodes of all the tested networks are assumed to have the same energy behavior, and the links are supposed to be symmetric; that is, , , and . This last assumption implies that all the networks are indeed composed of undirected links, which are modelled in terms of two directed links, one for each direction.
Table 1 shows the statistics of the considered networks, that is, the number of the nodes (), the number of the undirected links (), and the number of the nodes connected to the rest of the network with a single undirected link (.).
7.2. Energy Characterization of the Network Devices
In all network scenarios, each node represents a core router. We assumed the use of the Juniper T1600 core router, which has a total throughput capacity of 1600 Gb/s and a maximum power consumption of 8352 W . Thus, all the nodes of the networks have the same energy behavior. For each link, we assumed to use multiple SONET/SDH OC768c/STM256 PICs. Each one has a payload bandwidth of and a power consumption of 65.7 W .
The results reported in  show that the power consumption of a chassis is equal to about 200 W for all classes of routers; thus, for each node , we set .
In summary, we have considered the following setting for the model parameters:(i) and , (ii) and , (iii), where is the maximum power consumption of node .
Concerning the power consumption component of the route processor, we focused our attention on a cubic curve and on a logarithmic curve (see Figure 3). In particular, the cubic curve models the energy behavior of network devices that use energy-saving techniques such as Dynamic Voltage and Dynamic Frequency Scaling (DVS-DFS), which permit energy consumption to scale with resource requirements. Instead, the logarithmic curve corresponds to the energy behavior of devices that implement hibernation techniques such as the low-power idle mechanism standardized by IEEE 802.3az, which is based on the idea that data have to be sent as fast as possible so that equipment can return quicker to the low-power idle state . Current routers do not implement such techniques and are very energy inefficient, but we assume that they could be implemented in the next-generation routers.
Based on the previously cited energy parameters of the routers, we have thus defined the power consumption concerning the route processing by considering cubic and logarithmic curves, respectively, as follows:
7.3. Traffic Load
In the case of the nobel-eu topology, the traffic matrix has been obtained from the data file “Nobel-2 directed graph” downloaded from . The file contains the undirected traffic demand between each couple of nodes of the considered network scenario. To obtain the directed traffic demands, we have randomly split the demand between the two directions. The total amount of traffic demand is 1898 Gb/s, distributed among the 756 origin-destination pairs (i.e., the pairs ). The mean traffic demand of a powered-on node toward all the other nodes is about .
To obtain the traffic matrix for the other topologies, we set the mean value of the traffic demand from to ; that is, , to . Then, each element of the matrix has been extracted from a uniform distribution: .
The choice of a traffic matrix where each node of the network is both source and destination of traffic would imply that only links (or PICs) could be powered off. To introduce the presence of transit nodes that can be powered off, for each network topology we have selected the of nodes with the highest degree and deleted the traffic demands from/to them. At the end of these procedures, for each network topology, we obtained the reference traffic matrix, that is, . To vary the traffic load, we multiplied the reference traffic matrix by a scalar .
7.4. Design of Link Capacity
The dataset used for the network topologies does not provide information on the capacity of the links and, in particular, on the number of PICs composing each link. Hence, the maximum number of PICs per link has been computed as follows: where denotes the total flow on link when the Shortest Path Routing (SPR) is applied, while is the overprovisioning factor (see ). In more details, for calculating the values , we assumed that, for each traffic demand of , a single shortest path from to is computed. The weight of each link is assumed to be equal to 1. Therefore, a minimal cardinality path has been computed for each origin-destination pair . For the tested symmetric networks, we set for each undirected link .
Table 2 shows the statistics about the number of PICs per link for the different topologies, that is, the maximum () and the average () numbers of PICs per link and the number of links composed of a single PIC (.).
7.5. QoS Requirements
Taking into account the formula of the mean delay of the M/M/1 model assumed in Section 6.2, and the value , the choice of leads to a mean delay of , which is widely sufficient to guarantee a low end-to-end delay.
8. Performance Analysis: Reference Scenario
The first set of simulations is devoted to the performance analysis of the PARND-BL model and of the proposed heuristic in a fixed configuration of network parameters. In particular, all results refer to a simulation scenario characterized by and .
The PARND-BL formulation has been solved by the mixed integer non-linear programming solver BONMIN 1.5.0  (only for small instances) or by means of a linear approximation by using the IBM ILOG CPLEX Optimization Studio V12.3 , whereas the solution of the PAR model has been calculated by using the Ipopt version 3.10.0 . The linear approximation consists in approximating the curves representing the power consumption of the route processing, that is, , via a piecewise linear function composed of 20 segments, as in . The points on the curves of Figure 3 represent the limits of each segment of the piecewise approximation. When possible, we also found the optimal solution of the non-linear PARND-BL model by using BONMIN 1.5.0. The results have shown that the difference (in terms of power consumption) between the solutions is order of . However, the computational time needed to BONMIN for determining the optimal solution is often two orders of magnitude higher than the time spent by CPLEX to calculate the solution of the linear approximation. Furthermore, in some cases, BONMIN produced no results after 160 hours of CPU time. As a consequence, in the remaining of the study, we shall consider only the linear approximation of PARND-BL.
The performance analysis has been carried out by taking into account the following indicators:(i)number of powered-on network elements; (ii)overall power consumption of the network; (iii)CPU time; (iv)number of flow paths per origin-destination pair.
It is relevant to note that, for a fair comparison, we considered FGH under the setting . All the approaches have been also compared to SPR that represents in fact the widely used approach in core networks, when no specific administrative or cost constraints are present.
8.1. Number of Powered-on Network Elements
The number of powered-on network elements (i.e., nodes, links, and PICs) obtained applying the considered approaches in the case of cubic and logarithmic is shown in Tables 3 and 4, respectively. The N/A (not available) value in the tables indicates that the optimal solution has not been obtained after 160 hours of CPU time; this situation has manifested in the case of large topologies, such as ta2. In this case, only the heuristics provided results. It is worth mentioning that, in the case of FGH, the solution is not affected by the . Thus, the results of FGH are only reported in Table 3, which refers to the cubic .
The results reported in Table 3 point out that the ability of powering off entire nodes is not well exploited by HPARND-BL. Only in the case of Abovenet and Sprintlink, the heuristic leads to power off a single node. With respect to this heuristic, the solution of PARND-BL model permits to power off two nodes in nobel-eu, whereas the further energy savings of one node are obtained in Ebone and Sprintlink. All approaches power off more than the of links; the maximum is obtained in the Abovenet topology, where the FGH strategy leads to power off about the of links. The comparison of the heuristics shows that in the case of small topologies, FGH provides lightly better performance than HPARND-BL. On the contrary, HPARND-BL produces better results in more complex network topologies. It is worth noting that the power consumption due to the route processor can be notable, as shown in the ta2 topology where HPARND-BL powers off less links and PICs than FGH but produces higher power savings (as discussed in the next subsection).
The comparison of the results shown in Tables 3 and 4 highlights that, in the case of logarithmic , the PARND-BL model and HPARND-BL power off a higher number of nodes and links with respect to the cubic case, whereas the number of powered-on PICs increases in each topology. This outcome emphasizes the ability of the PARND-BL model and HPARND-BL to take into account the power behavior of the route processor, which leads to obtaining solutions that are more energy efficient than those given by FGH.
Furthermore, in the case of cubic the PARND-BL approaches lead to network topologies with a few number of powered-off nodes and links, but with “thin” links (i.e., a high number of powered-off PICs per link). Instead, in the logarithmic case, they lead to topologies with more powered-off nodes and links but with “thick” links.
In order to evaluate the impact of the power consumption of the chassis on the performance, we carried out further simulations by setting . The results are summarized in Table 5. They point out that, in the cubic case (cub in the table), there are no significant changes in the medium-large topologies (such as Sprintlink or ta2), whereas in the case of small networks we can note a variation in the characteristics of the obtained solution. Indeed, we obtained solutions with an increase in the number of powered-off nodes and links, with “thick” links. This reaction is due to the fact that the high reduces the relevance of the term in the objective function (2). On the contrary, in the logarithmic case (log in the table), the increase of does not appreciably vary the results.
8.2. Overall Power Consumption of the Network
Table 6 summarizes the results of the overall network power consumption obtained by the diverse solutions in the cubic case. These results highlight that the power savings of the power-aware approaches with respect to SPR are very high and vary from the to the . Obviously the best performance is achieved by the optimal solution of the PARND-BL model (when available).
As shown in Table 6, for medium-large topology HPARND-BL generally provides a good approximation of the optimal solution of the PARND-BL model (when available) and it saves further of energy with respect to FGH in the ta2 topology. On the contrary, for some small topologies (i.e., Exodus and Ebone), FGH provides better performance than HPARND-BL.
In the case of the logarithmic , the results reported in Table 7 point out that the power savings with respect to SPR are lower (up to more than the ) than the cubic case, although the absolute energy savings (in W) are higher. Moreover, there is an increase of the power savings of PARND-BL model and of HPARND-BL with respect to FGH ( in nobel-eu). Furthermore, comparing the results given by the PARND-BL model and HPARND-BL, we infer that there is a slight worsening of the performance of HPARND-BL (when the optimal solution is available). These results can be explained by taking into account the results presented in the previous subsection; that is, the number of network elements that these approaches is able to power off.
The results obtained with are summarized in Table 8. In the case of the cubic (cub in the table), we can observe that the power savings of the PARND-BL model with respect to SPR are reduced; the power savings are order of . Furthermore, HPARND-BL outperforms FGH in the power saving. This behavior can be explained by taking into account that in this scenario the high value of (almost the half of ) reduces the range of variability of , and so the power savings that can be obtained by the first addendum of the objective function (2). A similar behavior can be observed with the logarithmic (log in the table), although in this case the loss in the power saving is lower with respect to the cubic case.
8.3. CPU Time
We evaluated the CPU times required by the different approaches for calculating the energy-aware solutions. The measured data have been collected referring to a 3.07 GHz Intel 4-Core i7 CPU (with hyperthreading enabled). The obtained results are summarized in Tables 9 and 10, which refer to the cubic and the logarithmic , respectively. In the case of small topologies, Table 9 shows that the solution of the PARND-BL model can be obtained in a time widely inside the required time scale; this result makes the utilization of the heuristics useless when the time scale for the network reconfiguration is order of few minutes. On the contrary, in the case of large topologies, such as Sprintlink or ta2, the CPU time becomes unacceptable (see Section 2). In these scenarios, the time required by the HPARND-BL for calculating a power-aware solution is into the time scale of few hours. This time is obviously longer than that shown by the FGH approach since the proposed HPARND-BL is more complex. However, this difference does not compromise the actual effectiveness of HPARND-BL.
Observing the results obtained for the logarithmic and shown in Table 10, we can notice that the times needed to optimally solve the PARND-BL model increase. In particular, even for small-medium topologies, such as nobel-eu and Sprintlink, the PARND-BL solution cannot be obtained in an acceptable CPU time. In these scenarios, HPARND-BL is profitable, since it provides a solution in acceptable CPU times, and it usually leads to lower power consumptions than FGH.
The analysis of the scenario with does not evidence relevant differences with respect to the case. Hence, the corresponding results are not reported.
8.4. Number of Paths per Traffic Demand
A relevant indicator to be considered in actual networks is the number of paths, which are used to support the computed multicommodity flows, as indicated in Section 6. The results of the analysis from this perspective are summarized in Tables 11 and 12, which refer to the cubic and the logarithmic , respectively. Table 11 shows that the number of paths is very low (i.e., 2 or 3) for the optimal solution of the PARND-BL model. On the contrary, the heuristic approaches may cause an increment of the number of paths (up to 10 in FGH). From this perspective, HPARND-BL generally exhibits better performance than FGH. These maximum values cannot be acceptable in an actual MPLS-based network architecture, although the average number of paths per flow is low.
In the case of a logarithmic , the results shown in Table 12 reveal a decrease of the average and the maximum number of paths per demand in the solution returned by HPARND-BL. This behavior can be explained by observing that in the cubic case the resulting power-aware routing strategy is to spread the load across the whole network, whereas in the logarithmic case the routing strategy is to concentrate the load in a small portion of the network, as it is easily deducible by the comparison of the results presented in Tables 3 and 4.
The results obtained with are summarized in Table 13. Such results indicate a decrease in the number of paths per demand for both the PARND-BL solutions and for both the cubic and the logarithmic . This behavior can be easily associated with the decrease of the number of powered-on links in the scenario .
9. Performance Analysis: Impact of Network Parameters
In this section, we report the results of the simulation study aimed at evaluating the behavior of the considered solutions under different traffic load conditions and QoS requirements. As described in Section 7.3, the variation of the traffic load has been obtained by multiplying the reference traffic matrix, , by a scalar . We considered the traffic conditions obtained by varying of in the range 0.7–2.0. The analysis concerning the QoS requirements was carried out by varying the maximum link utilization; the values of are variation of in the range 0.50–1.00. All simulation results refer to the cubic , since this represents the most critical scenario for the heuristics and the most interesting from the potential power saving perspective.
9.1. Impact of Traffic Load
The results of this analysis are summarized in Figure 4, which shows the network power consumption of the considered approaches as a function of . We report only the results obtained with the Ebone and the ta2 scenarios, which represent small-medium and large topologies, respectively; the results for the other considered topologies are similar and hence are omitted for the sake of brevity. In general, the results highlight an increment of the gap between the PARND-BL approaches and FGH in almost all the topologies when the traffic demand increases. For example, in the Ebone topology (see Figure 4(a)) the power savings of HPARND-BL with respect to FGH, which were negative at , are more than the at . Instead, in the ta2 topology (see Figure 4(b)), the power savings of HPARND-BL firstly increase and successively are quite stable, with a reduction of power consumption of about at . This trend is due to the ability of HPARND-BL to be aware of the power consumption of the route processor. Obviously, the optimal solution of the PARND-BL model is not reported because it has not been obtained after 160 hours of CPU time.
9.2. Impact of the Maximum Link Utilization
The results of the overall power consumption as a function of the maximum link utilization are summarized in Figure 5 for the Ebone and the ta2 topologies. The figure points out that the compared strategies have a similar behavior. In particular, in all cases we can observe a decrease in the power consumption as the maximum link utilization increases. This result can be easily explained by taking into account that the power-aware solutions try to optimize the utilization of the powered-on links/PICs. This action is performed while attempting to power off the network elements that actually lead to a reduction of the overall network power consumption without degrading the traffic transport service. The power saving of the PARND-BL approaches with respect to FGH just lightly increases when increases. For example, for the ta2 topology the power saving varies from to . Furthermore, the curves depicted in Figure 5 indicate the impact of the network greening on the QoS requirements. Indeed, referring to Figure 5(a), we can see that by allowing a maximum load of (corresponding to a mean delay of ns) with respect to ( ns), we can obtain power savings of about .
The paper deeply analyzed the PARND-BL problem, proposed the related heuristic HPARND-BL, and presented the performance evaluation carried out by taking into account diverse network parameters and metrics. The simulation results show that the power saving is more evident in the case of a cubic . In this case, the solutions of the PARND-BL model and HPARND-BL outperform FGH. Moreover, the power saving obtained with the PARND-BL approaches with respect to FGH increase in the case of a logarithmic .
The analysis of the results indicates that the energy saving depends on the network size (in terms of links and nodes). In the case of large topologies, the solution of the PARND-BL model and HPARND-BL provide the best results, whereas for small topologies, FGH permits to achieve interesting power savings, near to the optimal solution obtained by solving the PARND-BL model. Anyway, in these cases, the solution of PARND-BL is the more profitable; that is, it has highest energy savings and lowest CPU times.
The analysis of the number of powered-on network elements obtained by the diverse solutions highlights that in some cases the strategy of powering off the network elements is not always the best choice for saving network energy. As an example, by referring to the ta2 topology results shown in Tables 3 and 6, although the FGH solution produces the lowest number of powered-on links and PICs, the overall network power consumption is higher than in the solution computed by HPARND-BL. In general, FGH (and other similar approaches focused on powering off network elements) minimizes the number of powered-on network elements through the traffic consolidation, but this strategy is not always the best one. Indeed, depending on how the power consumption of the route processor varies with the node traffic throughput, in some cases the more efficient routing strategy can be the spreading of the traffic among the nodes, by avoiding powering off the maximum number of network elements. The introduction of in the objective function of the PARND-BL approaches permits to take into account this significant aspect and leads to having a solution that is able to adapt the NWPM strategy to the power behavior of the network devices. Indeed, the analysis of the solutions of the PARND-BL model showed that different energy behaviors of the route processor (logarithmic or cubic curves) lead to different routing strategies (traffic consolidation or load balancing) and consequently to diverse resulting topologies (low-meshed networks with high-capacity links or high-meshed networks with low-capacity links).
Furthermore, the paper presented the MD-FDH, a heuristic to decompose the single-source/multidestination flows into a minimal number of paths. The analysis of the obtained results points out that the optimal solution of the PARND-BL model leads to the split of a single traffic demand into a limited number of paths. Therefore, the solutions can be easily applied in an actual network. On the contrary, HPARND-BL splits some traffic demands into a number of paths that can be critical for an actual implementation. From this perspective, the worst case is represented by the FGH solutions. Furthermore, the results highlighted that in the case of a logarithmic , this problem becomes less evident.
Finally, the extensive simulation analysis carried out with different power characterizations of network devices, traffic load, network topology, and QoS requirements points out that the proposed HPARND-BL represents a profitable solution of the most general NWPM approach by producing significant power savings in all network scenarios.
Conflict of Interests
There is no conflict of interests between the authors and the mentioned commercial identities.
R. G. Garroppo and G. Nencioni have been supported by the Italian Ministry of Instruction, University and Research (MIUR) in the framework of the Project GreenNet (Greening the Network) under the FIRB "Future in Research" program, and of the project "GATECOM" under the PRIN 2009 program. M. G. Scutellà has been supported by MIUR under the PRIN 2009 research project “Approcci integrati per l’Ottimizzazione Discreta e Non Lineare”.
- Global e-Sustainibility Initiative (GeSI), “Smart 2020: Enabling the low carbon economy in the information age,” 2008.
- R. Bolla, R. Bruschi, F. Davoli, and F. Cucchietti, “Energy efficiency in the future internet: a survey of existing approaches and trends in energy-aware fixed network infrastructures,” IEEE Communications Surveys and Tutorials, vol. 13, no. 2, pp. 223–244, 2011.
- S. Zeadally, S. U. Khan, and N. Chilamkurti, “Energy-efficient networking: past, present, and future,” Journal of Supercomputing, pp. 1–26, 2011.
- J. Quittek, M. Chandramouli, R. Winter, T. Dietz, and B. Claise, “Requirements for energy management,” IETF, draft-ietf-eman-requirements-14, 2013.
- C. Gunaratne, K. Christensen, B. Nordman, and S. Suen, “Reducing the energy consumption of ethernet with adaptive link rate (ALR),” IEEE Transactions on Computers, vol. 57, no. 4, pp. 448–461, 2008.
- R. Hays, “Active/Idle Toggling with Low-Power Idle,” in IEEE 802. 3az Task Force Group Meeting, 2008, http://www.ieee802.org/3/az/public/jan08/hays_01_0108.pdf.
- L. Niccolini, G. Iannaccone, S. Ratnasamy, J. Chandrashekar, and L. Rizzo, “Building a power-proportional software router,” in Proceedings of the USENIX conference on Annual Technical Conference (USENIX ATC ’12), pp. 8–8, USENIX Association, Berkeley, Calif, USA, 2012.
- M. Gupta and S. Singh, “Greening of the internet,” in Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '03), pp. 19–26, 2003.
- B. Heller, S. Seetharaman, P. Mahadevan et al., “Elastictree: saving energy in data center networks,” in Proceedings of the 7th USENIX Symposium on Networked Systems Design and Implementation (NSDI '10), pp. 249–264, 2010.
- F. Idzikowski, S. Orlowski, C. Raack, H. Woesner, and A. Wolisz, “Dynamic routing at different layers in IP-over-WDM networks Maximizing energy savings,” Optical Switching and Networking, vol. 8, no. 3, pp. 181–200, 2011.
- N. Vasić and D. Kostić, “Energy-aware traffic engineering,” in Proceedings of the 1st International Conference on Energy-Efficient Computing andNetworkingn (e-Energy), pp. 169–178, 2010.
- M. Zhang, C. Yi, B. Liu, and B. Zhang, “GreenTE: power-aware traffic engineering,” in Proceedings of the 18th IEEE International Conference on Network Protocols (ICNP '10), pp. 21–30, Kyoto, Japan, October 2010.
- A. Bianzino, L. Chiaraviglio, and M. Mellia, “Distributed algorithms for green ip networks,” in Proceedings of 1st IEEE INFOCOM Workshop on Communications and Control for Sustainable Energy Systems (CCSES '12), pp. 121–126, 2012.
- R. Garroppo, S. Giordano, G. Nencioni, and M. G. Scutellà, “Mixed integer non-linear programming models for green network design,” Computersand Operations Research, vol. 40, no. 1, pp. 273–281, 2013.
- W. Fisher, M. Suchara, and J. Rexford, “Greening backbone networks: reducing energy consumption by shutting off cables in bundled links,” in Proceedings of the 1st ACM SIGCOMM workshop on Green Networking (Green Networking '10), pp. 29–34, August 2010.
- K. Thompson, G. J. Miller, and R. Wilder, “Wide-area internet traffic patterns and characteristics,” IEEE Network, vol. 11, no. 6, pp. 10–23, 1997.
- F. Idzikowski, “Power consumption of network elements in IP over WDM networks,” TKN Technical Report TKN-09-006, 2009.
- R. Doverspike, K. Ramakrishnan, and C. Chase, Structural Overview of ISP Networks, Guide to Reliable Internet Services and Applications, 2010.
- IEEE Computer Society, “IEEE Standard 802. 1AX: Link Aggregation,” 2008.
- J. C. Cardona Restrepo, C. G. Gruber, and C. M. MacHuca, “Energy profile aware routing,” in Proceedings of the IEEE International Conference on Communications Workshops (ICC '09), pp. 1–5, Dresden, Germany, June 2009.
- E. Rosen, A. Viswanathan, and R. Callon, Multiprotocol Label Switching Architecture, IETF, 2001.
- D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow, RFC, 3209: RSVP-TE: Extensions to RSVP for LSP Tunnels, IETF, 2001.
- J. Chabarek, J. Sommers, P. Barford, C. Estan, D. Tsiang, and S. Wright, “Power awareness in network design and routing,” in Proceedings of the 27th IEEE Communications Society Conference on Computer Communications (INFOCOM '08), pp. 457–465, Phoenix, Ariz, USA, April 2008.
- I. Ghamlouche, T. G. Crainic, and M. Gendreau, “Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design,” Operations Research, vol. 51, no. 4, pp. 655–674, 2003.
- L. Chiaraviglio, M. Mellia, and F. Neri, “Minimizing ISP network energy cost: formulation and solutions,” IEEE/ACM Transactions on Networking, vol. 20, no. 2, pp. 463–476, 2012.
- G. Lin, S. Soh, K.-W. Chin, and M. Lazarescu, “Efficient heuristics for energy-aware routing in networks with bundled links,” Computer Networks, vol. 57, no. 8, pp. 1774–1788, 2013.
- “IBM ILOG CPLEX Optimizer,” 2011, http://www.ibm.com/software/integration/optimization/cplex-optimizer/.
- “Ipopt: Interior Point OPTimizer,” 2011, https://projects.coin-or.org/Ipopt.
- R. G. Garroppo, S. Giordano, G. Nencioni, and M. Pagano, “Energy aware routing based on energy characterization of devices: solutions and analysis,” in Proceedings of the IEEE International Conference on Communications Workshops (ICC '11), Kyoto, Japan, June 2011.
- A. P. Bianzino, C. Chaudet, F. Larroca, D. Rossi, and J.-L. Rougier, “Energy-aware routing: a reality check,” in Proceedings of the IEEE Globecom Workshops (GC '10), pp. 1422–1427, Miami, Fla, USA, December 2010.
- E. Niewiadomska-Szynkiewicz, A. Sikora, P. Arabas, and J. Kolodziej, “Control system for reducing energy consumption in backbone computer network,” Concurrency and Computation: Practice and Experience, vol. 25, no. 12, pp. 1738–1754, 2013.
- S. Antonakopoulos, S. Fortune, and L. Zhang, “Power-aware routing with rate-adaptive network elements,” in Proceedings of the IEEE Globecom Workshops (GC '10), pp. 1428–1432, Miami, Fla, USA, December 2010.
- R. G. Garroppo, S. Giordano, G. Nencioni, and M. G. Scutellà, “Network power management: models and heuristic approaches,” in Proceedings of the 54th Annual IEEE Global Telecommunications Conference: “Energizing Global Communications” (GLOBECOM '11), Houston, Tex, USA, December 2011.
- R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1993.
- B. Vatinlen, F. Chauvet, P. Chrétienne, and P. Mahey, “Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths,” European Journal of Operational Research, vol. 185, no. 3, pp. 1390–1401, 2008.
- J. Truffot, C. Duhamel, and P. Mahey, “K-splittable delay constrained routing problem: a branch-and-price approach,” Networks, vol. 55, no. 1, pp. 33–45, 2010.
- “Simple Network Description Library (SNDlib),” 2011, http://sndlib.zib.de.
- “Rocketfuel: an ISP topology mapping engine,” 2011, http://www.cs.washington.edu/research/networking/rocketfuel.
- “Datasheet of Juniper T Series Core Routers,” 2011, https://www.juniper.net/us/en/local/pdf/datasheets/1000051-en.pdf.
- “T1600 Core Router PIC Guide,” http://www.juniper.net/techpubs/en_US/release-independent/junos/information-products/topic-collections/hardware/t-series/t1600/pics/t1600-pic.pdf.
- B. Zhai, D. Blaauw, D. Sylvester, and K. Flautner, “Theoretical and practical limits of dynamic voltage scaling,” in Proceedings of the 41st Design Automation Conference, pp. 868–873, June 2004.
- “BONMIN: Basic Open-source Non-linear Mixed INteger programming,” 2011, https://projects.coin-or.org/Bonmin.
Copyright © 2013 Rosario G. Garroppo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.