Optimal routing by hose model with bound of link traffic

Oki, Eiji; Kitahara, Y.; Ouédraogo, Ihsen Aziz

doi:10.1049/iet-net.2012.0063

Cited by 6 publications

(4 citation statements)

References 10 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%

“…Ouédraogo and Oki 14 presented the G. HLT model on the basis of an developed form of the hose model 13 to minimize the PC in network. The traffic bounds in the G. HLT model are determined as bellow:…”

Section: Green Hlt Model Formulationmentioning

confidence: 99%

“…Our proposed robust optimization model can deal with total traffic fluctuation over the network using the ellipsoidal uncertainty, which is our goal of this research. 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. The previous studies consider traffic fluctuation locally, or there are some additional bound on the traffic demands.…”

Section: Assumption 2 It Holds Thatmentioning

confidence: 99%

See 2 more Smart Citations

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

Das

Takahashi

Oki

et al. 2019

Int J Communication

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%

Section: Green Hlt Model Formulationmentioning

confidence: 99%

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

View full text Add to dashboard Cite

show abstract

“…On other hand, path planning and routing optimisation are also addressed in many related fields such as robot systems (Lozano-Pérez and Wesley 1979;Bourbonnais, Bigras, and Bonev 2014), assembly planning (Yuan and Yang 2007), wireless mechatronic systems (Bezzo et al 2014) and traffic networks (Oki, Kitahara, and Ouédraogo 2012), most of which use Euclidean metric. Typically, in robot path planning field, one well-known method is the visibility graph (Lozano-Pérez and Wesley 1979), which can find the shortest collision-free path in Euclidean space by using a graph search algorithm (e.g.…”

Section: Introductionmentioning

confidence: 99%

A rectilinear pipe routing algorithm: Manhattan visibility graph

Liu

2015

International Journal of Computer Integrated Manufacturing

View full text Add to dashboard Cite

Pipe routing can be briefly formulated as seeking the shortest collision-free pipe paths while meeting certain engineering constraints. This article presents a new rectilinear pipe routing algorithm called Manhattan visibility graph (MVG) by extending the Visibility Graph method used for finding the shortest collision-free paths in Euclidean spaces to Manhattan spaces. Subsequently, the article proves that MVG can theoretically guarantee an optimal solution. Further, the article extends MVG algorithm to surface cases to meet requirements of routing pipes in aero-engine rotational spaces. Unlike previous graph methods that commonly yield more than n nodes (where n is the total number of terminals and obstacle vertices), MVG significantly reduces computation complexity because of containing only n nodes. Finally, numerical computations on a developed pipe routing system are performed to demonstrate the effectiveness and efficiency of the proposed method.

show abstract

Optimization approach to lower capacity requirements in backup networks

Ouédraogo

Oki

2016

2016 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR 2016)

View full text Add to dashboard Cite

Optimal routing by hose model with bound of link traffic

Cited by 6 publications

References 10 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 rectilinear pipe routing algorithm: Manhattan visibility graph

Optimization approach to lower capacity requirements in backup networks

Contact Info

Product

Resources

About