A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Asymptotic Analysis of Congested Communication Networks
2000
Mathematics of Operations Research
Preserved Fulltext
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. Mots-cl e : R eseaux de t el ecommunications, multi ots, d eveloppements asymptotiques, programmation lin eaire, analyse de perturbations,
doi:10.1287/moor.25.3.409.12214
fatcat:ga6y6k3g65fnhnmzd6epdl3tn4