A Green and Robust Optimization Strategy for Energy Saving Against Traffic Uncertainty

Ouédraogo, Ihsen Aziz; Oki, Eiji

doi:10.1109/jsac.2016.2545378

Cited by 11 publications

(12 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various optimization models to consider traffic uncertainty were presented in the literature, [13][14][15][16]18,[27][28][29][30][31] but none of the previous studies meets our requirement to consider the total traffic fluctuation over the network. Various optimization models to consider traffic uncertainty were presented in the literature, [13][14][15][16]18,[27][28][29][30][31] but none of the previous studies meets our requirement to consider the total traffic fluctuation over the network.…”

Section: Assumption 2 It Holds Thatmentioning

confidence: 99%

See 1 more Smart Citation

Approach to problem of minimizing network power consumption based on robust optimization

Das

Takahashi

Oki

et al. 2019

Int J Communication

Self Cite

View full text Add to dashboard Cite

In this paper, a green and robust optimization model is introduced to minimize network power consumption, which allows fluctuations of traffic demands between source-destination pairs in the network. Our model is based on the green hose model, where the traffic is bounded by just total outgoing and incoming amount at each node. In addition to the green hose model, we use the ellipsoidal uncertainty set to allow a different type of fluctuations in traffic demands. Here, the total amount of squared errors in traffic demands is bounded by a constant which controls the total admissible fluctuations over the network.Applying the conic duality, we formulate our model in the form of mixed-integer second order cone programming (MISOCP) problem. Furthermore, we establish a relationship between our model and the green hose model with bound of link traffic (HLT) model, an developed version of the hose model known as the HLT.Numerical results demonstrate that each of the MISOCP problems can be solved to its optimality in a reasonable time by a general MISOCP solver, and that the proposed model has different tendency in performance with the green hose and green HLT models. KEYWORDSgreen computing, mixed-integer second-order cone programming, power consumption, robust optimization, second-order cone programming, traffic-demand matrix Int J Commun Syst. 2019;32:e3891.wileyonlinelibrary.com/journal/dac

show abstract

Section: Assumption 2 It Holds Thatmentioning

confidence: 99%

“…The networks used in the experiments, demonstrated in Figure 1, are regular backbone networks used in 34 (Networks 1 and 2) and 14 (Networks 3 and 4). The networks used in the experiments, demonstrated in Figure 1, are regular backbone networks used in 34 (Networks 1 and 2) and 14 (Networks 3 and 4).…”

Section: Experiments Settingsmentioning

confidence: 99%

Approach to problem of minimizing network power consumption based on robust optimization

Das

Takahashi

Oki

et al. 2019

Int J Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…The basic form of the Node Balance model is the Hose model where it restricts traffic matrices to those that the total incoming/outgoing traffic to/from each node is not more than the highest visited traffic to/from that node during the past network operations. 25,33 This model has been later improved by proposing HSDT 34 and HLT 35 models. Note that in our study, these concepts will be extended to 3-SR in which OU(T) will refer to optimal 3-SR routing on traffic matrix T.…”

Section: Oblivious Routingmentioning

confidence: 99%

“…One way to do this is to use oblivious routing methods where it is assumed that the traffic matrix is not known. Hence, all the possible traffic matrices are considered in route computation . To the best of our knowledge, the paper of Bhatia et al is the only work that has proposed a robust algorithm for SR using the oblivious routing technique.…”

Section: Introductionmentioning

confidence: 99%

“…Hence, all the possible traffic matrices are considered in route computation. [28][29][30][31][32][33][34][35] To the best of our knowledge, the paper of Bhatia et al 36 is the only work that has proposed a robust algorithm for SR using the oblivious routing technique. They formulated this problem as an LP problem and focused on 2-SR where each logical path contains only two segments.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A semi‐oblivious approach for robust segment routing in software‐defined wide area networks

Roomi

Khorsandi

2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

In this paper, we have proposed a robust optimization for offline segment routing in software‐defined wide area networks combining traffic‐aware and traffic‐oblivious methods. Most prior works on segment routing assume accurate estimation of the traffic matrix, which is difficult to obtain due to the measurement costs and wide variations in traffic matrix over time. To deal with traffic uncertainties, an oblivious segment routing technique was previously developed. However, since all possible traffic fluctuations are considered, this leads to a considerable loss of routing performance in normal conditions. Since the traffic usually fluctuates around a normal pattern within a certain lower/upper bound, in this paper, we propose a semi‐oblivious segment routing method that optimizes routing for a predicted probable traffic matrix, while ensuring its robustness by guarantying the worst‐case performance under the fluctuations. Prior works also considered 2‐segment routing that is demonstrated to lead to routing deficiencies in some cases. We have extended the formulation to include 3‐Segment Routing (3‐SR) and using the strong duality theorem, the proposed semi‐oblivious 3‐SR method is formulated as a linear programming problem with an objective to maximize network throughput. We envision to apply this scheme in software‐defined networks where the controller is responsible to compute robust segment routing paths and to configure the edge routers accordingly. Simulation results show that the proposed method, while being robust to traffic fluctuations, significantly outperforms the traffic oblivious methods in normal network conditions and also achieves comparable performance to the models with known traffic matrix.

show abstract

Conic Programming Approach to Reduce Congestion Ratio in Communications Network

Das

Begum

Uddin

et al. 2020

Cyber Security and Computer Science

View full text Add to dashboard Cite

A Green and Robust Optimization Strategy for Energy Saving Against Traffic Uncertainty

Cited by 11 publications

References 38 publications

Approach to problem of minimizing network power consumption based on robust optimization

Approach to problem of minimizing network power consumption based on robust optimization

A semi‐oblivious approach for robust segment routing in software‐defined wide area networks

Conic Programming Approach to Reduce Congestion Ratio in Communications Network

Contact Info

Product

Resources

About