This paper is devoted to the mathematical study of a routing problem in tel
ecommunication networks, when the cost function is the average delay of com
munications. We establish asymptotic expansions for the Value function and
solutions in the vicinity of a congested nominal problem. The study is stro
ngly related to the one of a partial inverse barrier method for linear prog
ramming.