|
|||||
|
|
A parallel optimal routing algorithm |
|
| Authors: | Cassilda Ribeiro and Didier El Baz |
| Affiliation: | LAAS du CNRS, 7, avenue du Colonel Roche, 31077, Toulouse Cedex, France |
| Abstract: | In this paper we propose a new approach for solving optimal routing problems in packet-switched networks, a particular class of multicommodity convex network flow problems. The method developed here is designed to obtain a good rate of convergence while maintaining algorithmic simplicity and making effective use of parallel computing facilities. |
| Keywords: | Packet-switched networks nonlinear programming multicommodity problems dual method |
| 本文献已被 ScienceDirect 等数据库收录！ | |