energies-logo

Journal Browser

Journal Browser

Mixed-Integer Linear and Nonlinear Programming Methods for Energy Aware Traffic Control in Stationary Networks and Clouds

A special issue of Energies (ISSN 1996-1073). This special issue belongs to the section "C: Energy Economics and Policy".

Deadline for manuscript submissions: closed (31 March 2023) | Viewed by 11934

Special Issue Editor


E-Mail Website
Guest Editor
1. Faculty of Electronics and Information Technology, Warsaw University of Technology, 00-665 Warsaw, Poland
2. NASK National Research Institute, 01-045 Warsaw, Poland
Interests: optimal control; large scale systems; high performance computing; data networks management; decomposition and parallel implementation of optimization algorithms; cybersecurity

Special Issue Information

Dear Colleagues,

Methods of increasing the energy efficiency are becoming an important issue in networks. As observed, significant savings can be obtained by consolidating flows during periods and in areas of reduced traffic. The reasons for this are threefold: first, traffic load tends to follow periodic patterns; second, modern networks are somewhat overprovisioned (that is, there are many redundant devices and links that are underused); third, there are large reallocations of people and businesses, especially in times of global crises such as the pandemic and its aftermath. The idea is to temporarily shut down or put to sleep certain parts of a network or a cloud and to meet the demands of users through the rest of the system. The most effective solutions are network-wide and based on online optimization. Unfortunately, realistic, single-path models involve a big number of binary routing variables and lead to NP-hard problems that cannot be solved in an acceptable time. This is the reason behind the big amount of interest in the development of numerical algorithms which will enable getting an approximate solution to these problems in a possibly short time.

Dr. Andrzej Karbowski
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Energies is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • MILP and MINLP problems in energy-aware networks 
  • Energy-aware network control via mixed-integer optimization 
  • Mixed-integer multiobjective optimization in green core networks and clouds
  • Implementation of MILP and MINLP algorithms in software-defined networks 
  • MILP and MINLP problems in two-layer traffic control in green networks 
  • Optimization in integrated single-path routing and flow rate control in green networks 
  • Lagrangian relaxation in MINLP problems concerning green networks 
  • Dantzig–Wolfe decomposition in mixed-integer optimization problems concerning green networks 
  • Benders decomposition in mixed-integer linear and nonlinear optimization problems concerning green networks 
  • Heuristic methods to solve mixed-integer optimization problems in energy-aware networks

Published Papers (6 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

20 pages, 563 KiB  
Article
Router Activation Heuristics for Energy-Saving ECMP and Valiant Routing in Data Center Networks
by Piotr Arabas, Tomasz Jóźwik and Ewa Niewiadomska-Szynkiewicz
Energies 2023, 16(10), 4136; https://doi.org/10.3390/en16104136 - 17 May 2023
Cited by 2 | Viewed by 1195
Abstract
This paper addresses the energy conservation problem in computing systems. The focus is on energy-efficient routing protocols. We formulated and solved a network-wide optimization problem for calculating energy-aware routing for the recommended network configuration. Considering the complexity of the mathematical models of data [...] Read more.
This paper addresses the energy conservation problem in computing systems. The focus is on energy-efficient routing protocols. We formulated and solved a network-wide optimization problem for calculating energy-aware routing for the recommended network configuration. Considering the complexity of the mathematical models of data center networks and the limitations of calculating routing by solving large-scale optimization problems, and methods described in the literature, we propose an alternative solution. We designed and developed several efficient heuristics for equal-cost multipath (ECMP) and Valiant routing that reduce the energy consumption in the computer network interconnecting computing servers. Implementing these heuristics enables the selection of routing paths and relay nodes based on current and predicted internal network load. The utility and efficiency of our methods were verified by simulation. The test cases were carried out on several synthetic network topologies, giving encouraging results. Similar results of using our efficient heuristic algorithm and solving the optimization task confirmed the usability and effectiveness of our solution. Thus, we produced well-justified recommendations for energy-aware computing system design to conclude the paper. Full article
Show Figures

Figure 1

28 pages, 2427 KiB  
Article
Decomposition Methods for the Network Optimization Problem of Simultaneous Routing and Bandwidth Allocation Based on Lagrangian Relaxation
by Ihnat Ruksha and Andrzej Karbowski
Energies 2022, 15(20), 7634; https://doi.org/10.3390/en15207634 - 16 Oct 2022
Cited by 1 | Viewed by 1442
Abstract
The main purpose of the work was examining various methods of decomposition of a network optimization problem of simultaneous routing and bandwidth allocation based on Lagrangian relaxation. The problem studied is an NP-hard mixed-integer nonlinear optimization problem. Multiple formulations of the optimization problem [...] Read more.
The main purpose of the work was examining various methods of decomposition of a network optimization problem of simultaneous routing and bandwidth allocation based on Lagrangian relaxation. The problem studied is an NP-hard mixed-integer nonlinear optimization problem. Multiple formulations of the optimization problem are proposed for the problem decomposition. The decomposition methods used several problem formulations and different choices of the dualized constraints. A simple gradient coordination algorithm, cutting-plane coordination algorithm, and their more sophisticated variants were used to solve dual problems. The performance of the proposed decomposition methods was compared to the commercial solver CPLEX and a heuristic algorithm. Full article
Show Figures

Figure 1

18 pages, 334 KiB  
Article
Generalized Benders Decomposition Method to Solve Big Mixed-Integer Nonlinear Optimization Problems with Convex Objective and Constraints Functions
by Andrzej Karbowski
Energies 2021, 14(20), 6503; https://doi.org/10.3390/en14206503 - 11 Oct 2021
Cited by 2 | Viewed by 2473
Abstract
The paper presents the Generalized Benders Decomposition (GBD) method, which is now one of the basic approaches to solve big mixed-integer nonlinear optimization problems. It concentrates on the basic formulation with convex objectives and constraints functions. Apart from the classical projection and representation [...] Read more.
The paper presents the Generalized Benders Decomposition (GBD) method, which is now one of the basic approaches to solve big mixed-integer nonlinear optimization problems. It concentrates on the basic formulation with convex objectives and constraints functions. Apart from the classical projection and representation theorems, a unified formulation of the master problem with nonlinear and linear cuts will be given. For the latter case the most effective and, at the same time, easy to implement computational algorithms will be pointed out. Full article
Show Figures

Figure 1

25 pages, 3307 KiB  
Article
Optimal Location-Allocation of Printing Devices for Energy Saving Using a Novel MILP Approach
by Przemysław Kaszyński, Pablo Benalcazar, Piotr Pałka, Roman Rój and Marcin Malec
Energies 2021, 14(19), 6353; https://doi.org/10.3390/en14196353 - 5 Oct 2021
Cited by 2 | Viewed by 2020
Abstract
In recent years, a growing number of enterprises have taken different steps to reduce the energy consumption and carbon emissions of information and communication technology (ICT) assets. Because of the expansion of digitalization and the need for rapid access to information, enterprises have [...] Read more.
In recent years, a growing number of enterprises have taken different steps to reduce the energy consumption and carbon emissions of information and communication technology (ICT) assets. Because of the expansion of digitalization and the need for rapid access to information, enterprises have been compelled to optimize the location and utilization of their ICT hardware. In this context, this paper presents a novel method based on a mixed-integer linear programming approach for optimizing the physical location and task allocation of printing devices in office floor plans considering the power usage of the ICT assets, the costs related to the purchase and service of the individual devices, operating costs, and distance between employees and printing devices. The applicability of the proposed model is illustrated using the case study of a company with 100 functional departments located in several office buildings across Poland. The results reveal that the model guarantees the execution of all printing tasks and satisfies the functionality requirements expressed by the users of the workstations. Moreover, the selection of more energy-efficient printing devices leads to a considerable reduction in electricity consumption, related not only to the direct operation of these devices but also to their modes of operation (work, idle, or sleep). Such results also bring tangible effects in reducing carbon dioxide emissions, which is particularly important for businesses operating in countries where fossil fuels still dominate the energy mix. Full article
Show Figures

Figure 1

17 pages, 362 KiB  
Article
Energy-Aware Activity Control for Wireless Sensing Infrastructure Using Periodic Communication and Mixed-Integer Programming
by Piotr Arabas, Andrzej Sikora and Wojciech Szynkiewicz
Energies 2021, 14(16), 4828; https://doi.org/10.3390/en14164828 - 7 Aug 2021
Cited by 2 | Viewed by 1463
Abstract
This paper addresses the energy conservation problem in wireless sensor networks, in which sensor data are aggregated into packages and then transmitted periodically to the base station according to an established schedule. We formulate two mixed integer programming problems, first for minimum total [...] Read more.
This paper addresses the energy conservation problem in wireless sensor networks, in which sensor data are aggregated into packages and then transmitted periodically to the base station according to an established schedule. We formulate two mixed integer programming problems, first for minimum total energy usage and second for min-max per node energy usage. We present two algorithms for slot allocation that exploit the periodic nature of the data collection process by allocating a subset of nodes to subsequent frames. A mixed-integer solver solves the resulting mathematical programming task. The performed numerical experiments show that the proposed approach is appropriate for relatively small networks when minimizing the total energy consumption problem. Hopefully, the problem may be solved for medium size networks when a maximum node energy consumption performance index is used. Full article
Show Figures

Graphical abstract

18 pages, 875 KiB  
Article
Optimal Charging Schedule Planning for Electric Buses Using Aggregated Day-Ahead Auction Bids
by Izabela Zoltowska and Jeremy Lin
Energies 2021, 14(16), 4727; https://doi.org/10.3390/en14164727 - 4 Aug 2021
Cited by 10 | Viewed by 1903
Abstract
This study aims to plan a cost-minimizing charging schedule for electric buses with fast charging stations. The paper conceptualizes the problem as a three-stage procedure, which is oriented around the participation of an electric bus aggregator in a day-ahead energy auction. First, the [...] Read more.
This study aims to plan a cost-minimizing charging schedule for electric buses with fast charging stations. The paper conceptualizes the problem as a three-stage procedure, which is oriented around the participation of an electric bus aggregator in a day-ahead energy auction. First, the aggregation stage determines the bid parameters of buses. With bid parameters, aggregated cost-minimizing charging plans are obtained in the second stage conceived as the hourly day-ahead auction. The disaggregation of hourly plans into feasible minutely charging schedules is the third stage. The main contribution is the formulation of mixed-integer linear programming aggregation models to determine charging availability expressed as minimum and maximum hourly energy requirements taking into account detailed, minutely characteristics and constraints of the charging equipment and the buses. No price forecasts are required, and the plans adjust to the wholesale prices of energy. Defining only a few aggregated bids parameters used in linear programming constraints and incorporating them into the auction model is another contributing factor of this paper, allowing the scheduling of storage-based participants economically. The proposed methodology has been verified on a recently published case study of a real-world bus service operated on the Ohio State University campus. We show that the auction-based charging of all 22 buses outperforms as-soon-as-possible schedules by 7% to even 28% of daily cost savings. Thanks to the aggregated bids, buses can flexibly shift charges between high- and low-price periods while preserving constraints of the charging equipment and timetables. Full article
Show Figures

Graphical abstract

Back to TopTop