Asymptotic analysis of congested communication networks
成果类型:
Article
署名作者:
Bonnans, JF; Haddou, M
署名单位:
Inria; Universite de Orleans
刊物名称:
MATHEMATICS OF OPERATIONS RESEARCH
ISSN/ISSBN:
0364-765X
DOI:
10.1287/moor.25.3.409.12214
发表日期:
2000
页码:
409-426
关键词:
barrier methods
convex
摘要:
This paper is devoted to the mathematical study of a routing problem in telecommunication networks, when the cost function is the average delay of communications. 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.