Dynamic routing at different layers in IP-over-WDM networks — Maximizing energy savings

Idzikowski, Filip; Orlowski, Sebastian; Raack, Christian; Woesner, Hagen; Wolisz, Adam

doi:10.1016/j.osn.2011.03.007

Cited by 64 publications

(75 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its goal is to minimize the capital expenditures for network equipment guaranteeing a routing for all considered (data) traffic demands. In the classical combinatorial network design problem integer capacities (corresponding to batches of bit rates, e. g., 40 Gbps) have to be installed on the network links at minimum cost such that all traffic demands can be realized by flow simultaneously without exceeding the link capacities. Given a single traffic matrix, this problem has been studied extensively in the literature, see [8,10,23,24,37,47,59] and the references therein.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Robust network design: Formulations, valid inequalities, and computations

2013

Self Cite

View full text Add to dashboard Cite

Traffic in communication networks fluctuates heavily over time. Thus, to avoid capacity bottlenecks, operators highly overestimate the traffic volume during network planning. In this paper we consider telecommunication network design under traffic uncertainty, adapting the robust optimization approach of [21]. We present three different mathematical formulations for this problem, provide valid inequalities, study the computational implications, and evaluate the realized robustness.To enhance the performance of the mixed-integer programming solver we derive robust cutset inequalities generalizing their deterministic counterparts. Instead of a single cutset inequality for every network cut, we derive multiple valid inequalities by exploiting the extra variables available in the robust formulations. We show that these inequalities define facets under certain conditions and that they completely describe a projection of the robust cutset polyhedron if the cutset consists of a single edge.For realistic networks and live traffic measurements we compare the formulations and report on the speed up by the valid inequalities. We study the "price of robustness" and evaluate the approach by analyzing the real network load. The results show that the robust optimization approach has the potential to support network planners better than present methods.

show abstract

Section: Introductionmentioning

confidence: 99%

“…In most approaches each demand is estimated in the design process, e.g., by using traffic measurements or population statistics [25,31,40,63,64]. To handle future changes in the traffic volume and distribution and to guarantee robust network designs, these values (and consequently capacities) are (highly) overestimated.…”

Section: Introductionmentioning

confidence: 99%

Robust network design: Formulations, valid inequalities, and computations

2013

Self Cite

View full text Add to dashboard Cite

show abstract

“…Since then, different works have tackled the problem of energy-efficient backbone networks (see [5,6] for detailed surveys). Table 1 provides an overview of different projects focussing partially or entirely on EA-ARSs.…”

Section: Related Workmentioning

confidence: 99%

TREND in energy-aware adaptive routing solutions

et al. 2013

Self Cite

View full text Add to dashboard Cite

Energy saving in telecommunications networks has become a well established topic in the research community. We look at the electrical and optical layers of IP-over-WDM networks, and present a list of evaluation criteria for the Energy-Aware Adaptive Routing Solutions (EA-ARSs) from the perspective of a network operator. Furthermore, we briefly explain the EA-ARSs originating from European Union's TREND, the FP7 Network of Excellence, show saving of energy consumed by Line Cards (LCs) on a reference scenario, and use the evaluation criteria to identify the next steps toward introduction of the EA-ARSs into real operation.

show abstract

“…We used the network architectures, cost, capacity, and traffic models described in Section 2 to parametrize integer programming models as in [4,9]. Models and solution methods are described in Appendix B in full detail.…”

Section: Computational Studymentioning

confidence: 99%

“…The number of flow-variables and constraints (3) can be reduced considerably by aggregating demands that have the same source node (or the same target node) -see for instance [9,19]. This aggregation is done for our computations.…”

Section: B Mathematical Modelmentioning

confidence: 99%

Optimal degree of optical circuit switching in IP-over-WDM networks

Menne

Raack

Wessäly

et al. 2012

2012 16th International Conference on Optical Network Design and Modelling (ONDM)

View full text Add to dashboard Cite

Abstract:In this paper, we study the influence of technology, traffic properties and price trends on optimized design of a reference IP-over-WDM network with rich underlying fiber topology. In each network node, we investigate the optimal degree of traffic switching in an optical (lambda) domain versus an electrical (packet) domain, also known as measure of node transparency. This measure is studied in connection to changes in traffic volume, demand affinity, optical circuit speeds and equipment cost. By applying variable design constraints, we assess the relative roles of the two distinct equipment groups, IP routers and optical cross-connects, with respect to resulting changes in cost-sensitive network architectures.

show abstract

Dynamic routing at different layers in IP-over-WDM networks — Maximizing energy savings

Cited by 64 publications

References 30 publications

Robust network design: Formulations, valid inequalities, and computations

Robust network design: Formulations, valid inequalities, and computations

TREND in energy-aware adaptive routing solutions

Optimal degree of optical circuit switching in IP-over-WDM networks

Contact Info

Product

Resources

About