2014 26th International Teletraffic Congress (ITC) 2014
DOI: 10.1109/itc.2014.6932962
|View full text |Cite
|
Sign up to set email alerts
|

Combined calculation of optimal routing and bandwidth allocation in energy aware networks

Abstract: Efforts to reduce power consumption in telecommunication networks follow in two mutually related directions -design of a more efficient equipment and development of energy-aware network control strategies and protocols. The paper presents a formulation of two-criteria traffic engineering problem, which takes advantage of energy saving capabilities in software routers. The first optimization criterion is the energy consumption, and the second one is the quality of service and service sustainability. Models and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 14 publications
0
7
0
Order By: Relevance
“…The simplest approach is to extend the basic onoff model (1) by extra states and assuming a fixed power level P dk in each state [7]. Other authors [9], [13] propose a piecewise linear extension to 1.…”
Section: Layered Architecture Of Network Appliances -Basic Power Cons...mentioning
confidence: 99%
“…The simplest approach is to extend the basic onoff model (1) by extra states and assuming a fixed power level P dk in each state [7]. Other authors [9], [13] propose a piecewise linear extension to 1.…”
Section: Layered Architecture Of Network Appliances -Basic Power Cons...mentioning
confidence: 99%
“…A two-criteria optimal routing and bandwidth allocation problem, taking into account the energy component, for a completely different network and cost model than that of Section II was presented in [10].…”
Section: Problemmentioning
confidence: 99%
“…where b, τ are, respectively, Lipschitz constants of the function K (14) and the constraint function (2). Summing up, the iteration of the modified, based on augmented Lagrangian approach, algorithm will be as follows:…”
Section: Decomposition Scheme and The Algorithmmentioning
confidence: 99%
“…However, it seems that it would be more profitable, when we will treat TCP and IP layers together and maximize cross-layer utility at the timescale of route changes. The integrated routing and network flow control problem was first addressed by Wang, Li, Low and Doyle [1] and independently by Jaskóła and Malinowski [2]. Unfortunately, due to the nonconvexity of the constraints' functions, the algorithm based on the price method (Lagrangian relaxation) is numerically unstable.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation