Skip to Main content Skip to Navigation

Asymptotic Analysis of Congested Communication Networks

Abstract : This paper is devoted to the study of a routing problem in telecommunication networks, when the cost function is the average delay. We establish asymptotic expansions for the value function and solutions in the vicinity of a congested nominal problem. The study is strongly related to the one of a partial inverse barrier method for linear programming.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:11:10 PM
Last modification on : Wednesday, June 20, 2018 - 3:58:02 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:50:12 PM


  • HAL Id : inria-00073556, version 1



J. Frederic Bonnans, Mounir Haddou. Asymptotic Analysis of Congested Communication Networks. [Research Report] RR-3133, INRIA. 1997. ⟨inria-00073556⟩