125 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
Robust Energy Management for Green and Survivable IP Networks
Despite the growing necessity to make Internet greener, it is worth pointing
out that energy-aware strategies to minimize network energy consumption must
not undermine the normal network operation. In particular, two very important
issues that may limit the application of green networking techniques concern,
respectively, network survivability, i.e. the network capability to react to
device failures, and robustness to traffic variations. We propose novel
modelling techniques to minimize the daily energy consumption of IP networks,
while explicitly guaranteeing, in addition to typical QoS requirements, both
network survivability and robustness to traffic variations. The impact of such
limitations on final network consumption is exhaustively investigated. Daily
traffic variations are modelled by dividing a single day into multiple time
intervals (multi-period problem), and network consumption is reduced by putting
to sleep idle line cards and chassis. To preserve network resiliency we
consider two different protection schemes, i.e. dedicated and shared
protection, according to which a backup path is assigned to each demand and a
certain amount of spare capacity has to be available on each link. Robustness
to traffic variations is provided by means of a specific modelling framework
that allows to tune the conservatism degree of the solutions and to take into
account load variations of different magnitude. Furthermore, we impose some
inter-period constraints necessary to guarantee network stability and preserve
the device lifetime. Both exact and heuristic methods are proposed.
Experimentations carried out with realistic networks operated with flow-based
routing protocols (i.e. MPLS) show that significant savings, up to 30%, can be
achieved also when both survivability and robustness are fully guaranteed
Estratégias de planeamento multi-período em redes de trasporte óticas
Mestrado em Engenharia Eletrónica e TelecomunicaçõesOs operadores de telecomunicações, encaram um grande desafio que é o
aumento de tráfego de internet, este desafio acarreta a necessidade de en-
contrar soluções para o planeamento escalável dos elementos que compõe a
rede de transporte ótica. Posto isto nesta tese são estudados mecanismos
de otimização em redes de transporte óticas, direcionados para o dimen-
sionamento dos nós ao longo de vários períodos. São desenvolvidos, em
Matlab, dois algoritmos baseados em modelos distintos (ILP e heurística),
com o objetivo de fornecer a solução ótima e quase-ótima no que toca ao
número de módulos linha e módulos cliente essenciais na aferição do custo de
investimento (CapEx) e custo de operação (OpEx) em redes de transporte
óticas. Além disso é incorporado aos algoritmos um aumento progressivo de
tráfego na rede ao longo de vários períodos de tempo. No final é comparada
a eficiência da performance dos dois algoritmos aplicando-os a uma rede de
transporte ótica realista.Telecommunication operators face a major challenge of increasing internet
tra c, this challenge entails the need to nd solutions for scalable planning
of the elements which compose the optical network. In this thesis there
are studies about optimization mechanisms in optical transport networks,
targeting node dimensioning of di erent optical networks over several periods.
Two algorithms are developed in Matlab, based on distinct models
(ILP and heuristics), with the objective of providing the optimum solution
concerning the number of line and client modules, which are essential to assesse
the capital expenditures (CapEx) and operation expenditures (OpEx)
in optical networks. Moreover is incorporated into the algorithms a progressive
increase of network tra c over several periods of time. At the end
the performance of the two algorithms is compared by applying them to a
realistic transport network
Models for planning the evolution of local telecommunication networks
Includes bibliographical references.Research initiated through a grant from GTE Laboratories, Inc. Supported in part by an AT&T research award. Supported in part by the Systems Theory and Operations Research Program of the National Science Foundation. ECS-8316224 Supported in part by ONR. N0000-14-86-0689A. Balakrishnan ... [et al.]
Models for planning the evolution of local telecommunication networks
Includes bibliographical references.Research initiated through a grant from GTE Laboratories, Inc. Supported in part by an AT&T research award. Supported in part by the Systems Theory and Operations Research Program of the National Science Foundation. ECS-8316224 Supported in part by ONR. N0000-14-86-0689A. Balakrishnan ... [et al.]
Distributed Power Generation Scheduling, Modelling and Expansion Planning
Distributed generation is becoming more important in electrical power systems due to the decentralization of energy production. Within this new paradigm, new approaches for the operation and planning of distributed power generation are yet to be explored. This book deals with distributed energy resources, such as renewable-based distributed generators and energy storage units, among others, considering their operation, scheduling, and planning. Moreover, other interesting aspects such as demand response, electric vehicles, aggregators, and microgrid are also analyzed. All these aspects constitute a new paradigm that is explored in this Special Issue
Capacity expansion in contemporary telecommunication networks
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2007.Includes bibliographical references (p. 155-160).We study three capacity expansion problems in contemporary long distance telecommunication networks. The first two problems, motivated by a major long distance provider, address capacity expansion in national hybrid long distance telecommunication networks that use both the traditional TDM technology and more recent VoIP technology to transport voice calls. While network capacity expansion in general is known to be hard to approximate, we exploit the unique requirements associated with hybrid networks to develop compact models and algorithms with strong performance guarantees for these problems. For a single period single facility capacity expansion problem in a hybrid network, using a decomposition approach we design a (2 + E)-factor approximation algorithm. Generalizing this idea, we propose a Decentralized Routing Scheme that can be used to design approximation algorithms for many variations of hybrid network capacity expansion. For the Survivable Capacity Expansion Problem in hybrid networks, in which we are required to install enough capacity to be able to support all demands even if a single link fails, we propose a compact integer program model. We show that this problem is APX-Hard, and present two heuristics with constant worst case performance guarantees. Finally, we consider the capacity planning problem when peak demands occurring at different times can share network capacity. We propose a general model for capturing time variation of demand, and establish a necessary and sufficient condition for a capacity plan to be feasible. Using a cutting plane approach, we develop a heuristic procedure. Computational experiments on real and random instances show that the proposed procedure performs well, producing solutions within 12% of optimality on average for the instances tested. The tests also highlight the significant savings potential that might be obtained by capacity planning with time sharing.by Raghavendran Sivaraman.Ph.D
Nodal distribution strategies for designing an overlay network for long-term growth
Scope and Method of Study:This research looked at nodal distribution design issues associated with building an overlay network on top of an existing legacy network with overlay network switches and links not necessarily matching the switch and link locations of the underlying network. A mathematical model with two basic components, switch costs and link costs, was developed for defining the total cost of a network overlay. The nature of the underlying legacy topology determines the dominant factor, link or switch costs to the total cost function as well as the unit cost for switches and links.Findings and Conclusions:The three design heuristics presented first, locate overlay switches at nodes in the center of the legacy network as opposed to the periphery; second, locate overlay switches at legacy nodes with high connectivity; and third, locate overlay switches at legacy nodes with high traffic flow demands, can be used to help point to the direction of keeping costs under control when design changes are required. Applying the concept of efficient frontiers to the world of network design and building a suite of best designs gives the network designer greater insight into how to design the best network in the face of changing real-world constraints. For the cost model and the case studies evaluated using the design strategies in this study, distributed approaches generally tend to be a good choice when the link costs dominate the total cost function because total path distances and therefore link costs need to be minimized in preference over switch costs. A distributed overlay tends to have lower link costs because there is usually a greater probability that total path distances can be minimized because of greater connectivity. More connections set up the potential for more traffic flow path choices allowing each traffic flow to be sent along shorter paths. In legacy network topology designs that have many nodes with high connectivity, the overlay link costs can be relatively similar between designs and the switch costs can have a large impact upon total cost
- …