54 research outputs found
Energy management in communication networks: a journey through modelling and optimization glasses
The widespread proliferation of Internet and wireless applications has
produced a significant increase of ICT energy footprint. As a response, in the
last five years, significant efforts have been undertaken to include
energy-awareness into network management. Several green networking frameworks
have been proposed by carefully managing the network routing and the power
state of network devices.
Even though approaches proposed differ based on network technologies and
sleep modes of nodes and interfaces, they all aim at tailoring the active
network resources to the varying traffic needs in order to minimize energy
consumption. From a modeling point of view, this has several commonalities with
classical network design and routing problems, even if with different
objectives and in a dynamic context.
With most researchers focused on addressing the complex and crucial
technological aspects of green networking schemes, there has been so far little
attention on understanding the modeling similarities and differences of
proposed solutions. This paper fills the gap surveying the literature with
optimization modeling glasses, following a tutorial approach that guides
through the different components of the models with a unified symbolism. A
detailed classification of the previous work based on the modeling issues
included is also proposed
A Practical Approach to Trac Engineering using an Unsplittable Multicommodity Flow Problem with QoS Constraints, Journal of Telecommunications and Information Technology, 2016, nr 3
The paper presents a practical approach to calculating intra-domain paths within a domain of a content-aware network (CAN) that uses source routing. This approach was used in the prototype CAN constructed as a part of the Future Internet Engineering project outcome. The calculated paths must satisfy demands for capacity (capacity for a single connection and for aggregate connections using the given path are considered distinctly) and for a number of path-additive measures like delay, loss ratio. We state a suitable variant of QoS-aware unsplittable multicommodity ow problem and present the solving algorithm. The algorithm answers to the needs of its immediate application in the constructed system: a quick return within a short and fairly predictable time, simplicity and modi ability, good behavior in the absence of a feasible solution (returning approximately-feasible solutions, showing how to modify demands to retain feasibility). On the other hand, a certain level of overdimensioning of the network is explored, unlike in a typical optimization algorithm. The algorithm is a mixture of: (i) shortest path techniques, (ii) simpli ed reference-level multicriteria techniques and parametric analysis applied to aggregate the QoS criteria (iii) penalty and mutation techniques to handle the common constraints. Numerical experiments assessing various aspects of the algorithm behavior are given
Telecommunications Networks
This book guides readers through the basics of rapidly emerging networks to more advanced concepts and future expectations of Telecommunications Networks. It identifies and examines the most pressing research issues in Telecommunications and it contains chapters written by leading researchers, academics and industry professionals. Telecommunications Networks - Current Status and Future Trends covers surveys of recent publications that investigate key areas of interest such as: IMS, eTOM, 3G/4G, optimization problems, modeling, simulation, quality of service, etc. This book, that is suitable for both PhD and master students, is organized into six sections: New Generation Networks, Quality of Services, Sensor Networks, Telecommunications, Traffic Engineering and Routing
Fair Resource Allocation in Macroscopic Evacuation Planning Using Mathematical Programming: Modeling and Optimization
Evacuation is essential in the case of natural and manmade disasters such as hurricanes, nuclear disasters, fire accidents, and terrorism epidemics. Random evacuation plans can increase risks and incur more losses. Hence, numerous simulation and mathematical programming models have been developed over the past few decades to help transportation planners make decisions to reduce costs and protect lives. However, the dynamic transportation process is inherently complex. Thus, modeling this process can be challenging and computationally demanding. The objective of this dissertation is to build a balanced model that reflects the realism of the dynamic transportation process and still be computationally tractable to be implemented in reality by the decision-makers. On the other hand, the users of the transportation network require reasonable travel time within the network to reach their destinations.
This dissertation introduces a novel framework in the fields of fairness in network optimization and evacuation to provide better insight into the evacuation process and assist with decision making. The user of the transportation network is a critical element in this research. Thus, fairness and efficiency are the two primary objectives addressed in the work by considering the limited capacity of roads of the transportation network. Specifically, an approximation approach to the max-min fairness (MMF) problem is presented that provides lower computational time and high-quality output compared to the original algorithm. In addition, a new algorithm is developed to find the MMF resource allocation output in nonconvex structure problems. MMF is the fairness policy used in this research since it considers fairness and efficiency and gives priority to fairness. In addition, a new dynamic evacuation modeling approach is introduced that is capable of reporting more information about the evacuees compared to the conventional evacuation models such as their travel time, evacuation time, and departure time. Thus, the contribution of this dissertation is in the two areas of fairness and evacuation.
The first part of the contribution of this dissertation is in the field of fairness. The objective in MMF is to allocate resources fairly among multiple demands given limited resources while utilizing the resources for higher efficiency. Fairness and efficiency are contradicting objectives, so they are translated into a bi-objective mathematical programming model and solved using the ϵ-constraint method, introduced by Vira and Haimes (1983). Although the solution is an approximation to the MMF, the model produces quality solutions, when ϵ is properly selected, in less computational time compared to the progressive-filling algorithm (PFA). In addition, a new algorithm is developed in this research called the θ progressive-filling algorithm that finds the MMF in resource allocation for general problems and works on problems with the nonconvex structure problems.
The second part of the contribution is in evacuation modeling. The common dynamic evacuation models lack a piece of essential information for achieving fairness, which is the time each evacuee or group of evacuees spend in the network. Most evacuation models compute the total time for all evacuees to move from the endangered zone to the safe destination. Lack of information about the users of the transportation network is the motivation to develop a new optimization model that reports more information about the users of the network. The model finds the travel time, evacuation time, departure time, and the route selected for each group of evacuees. Given that the travel time function is a non-linear convex function of the traffic volume, the function is linearized through a piecewise linear approximation. The developed model is a mixed-integer linear programming (MILP) model with high complexity. Hence, the model is not capable of solving large scale problems. The complexity of the model was reduced by introducing a linear programming (LP) version of the full model. The complexity is significantly reduced while maintaining the exact output.
In addition, the new θ-progressive-filling algorithm was implemented on the evacuation model to find a fair and efficient evacuation plan. The algorithm is also used to identify the optimal routes in the transportation network. Moreover, the robustness of the evacuation model was tested against demand uncertainty to observe the model behavior when the demand is uncertain. Finally, the robustness of the model is tested when the traffic flow is uncontrolled. In this case, the model's only decision is to distribute the evacuees on routes and has no control over the departure time
Recommended from our members
Network Game Theory Models of Services and Quality Competition with Applications to Future Internet Architectures and Supply Chains
The Internet has transformed the way in which we conduct business and perform economic and financial transactions. One key challenge of the Internet is the inefficiency of the mechanisms by which technology is deployed and the business and economic models surrounding these processes (Wolf et al. (2014)). Equilibrium models for the Internet generally assume basic economic relationships. However, in new paradigms for the Internet and in supply chain networks, price is not the only factor; quality of service (QoS) is also of increasing importance.
Supply chains networks, which give us the means to manufacture products and deliver them to points of demand across the globe, are also under many pressures to offer differentiated products and services (Nagurney (2014)). It is well-known today that success is determined by how well the entire supply chain performs, rather than the performance of its individual entities.
This dissertation contributes to the analysis, design, and management of the future Internet and supply chain networks with a focus on price and quality competition in service-oriented networks.
Specifically, I focus on economic models for the Internet of the future by developing both a basic and a general network economic game theory model of a quality-based service-oriented Internet to study competition among service providers. To study and analyze the underlying dynamics of the various economic decision-makers, subsequently, I develop a dynamic network economic model of a service-oriented Internet with price and quality competition using projected dynamical systems theory. Then, to assess the prices for various contract durations at the demand markets, I consider a game theory model of a service-oriented Internet in which the network providers compete in usage service rates, quality levels, and duration-based contracts. Finally, I construct a model that captures the competition among manufacturers and freight service providers in a supply chain network. This model is the first one in the literature that handles both price and quality competition with multiple modes of shipment from both equilibrium and dynamic perspectives.
For each model, I derive the governing equilibrium conditions and provide the equivalent variational inequality formulations. In order to illustrate the modeling framework and the algorithm, I present computed solutions to several numerical examples for each model as well as sensitivity analysis results.
This dissertation is heavily based on the following papers: Saberi, Nagurney, and Wolf (2014), Nagurney et al. (2014a), Nagurney et al. (2015b), and Nagurney et al. (2015a) as well as additional results and conclusions
Satellite Network, Design, Optimization, and Management
We introduce several network design and planning problems that arise in the context of commercial satellite networks. At the heart of most of these problems we deal with a traffic routing problem over an extended planning horizon. In satellite networks route changes are associated with significant monetary penalties that are usually in the form of discounts (up to 40%) offered by the satellite provider to the customer that is affected. The notion of these rerouting penalties requires the network planners to consider management problems over multiple time periods and introduces novel challenges that have not been considered previously in the literature.
Specifically, we introduce a multiperiod traffic routing problem and a multiperiod network design problem that incorporate rerouting penalties. For both of these problems we present novel path-based reformulations and develop branch-and-price-and-cut approaches to solve them. The pricing problems in both cases present new challenges and we develop special purpose approaches that can deal with them. We also show how these results can be extended to deal with traffic routing and network design decisions in other settings with much more general rerouting penalties. Our computational work demonstrates the benefits of using the branch-and-price-and-cut procedure developed that can deal with the multiperiod nature of the problem as opposed to straightforward, myopic period-by-period optimization approaches.
In order to deal with cases in which future demand is not known with certainty we present the stochastic version of the multiperiod traffic routing problem and formulate it as a stochastic multistage recourse problem with integer variables at all stages. We demonstrate how an appropriate path-based reformulation and an associated branch-and-price-and-cut approach can solve this problem and other more general multistage stochastic integer multicommodity flow problems.
Finally, we motivate the notion of reload costs that refer to variable (i.e., per unit of flow) costs for the usage of pairs of edges, as opposed to single edges. We highlight the practical and theoretical significance of these cost structures and present two extended graphs that allow us to easily capture these costs and generate strong formulations
- …