Optimal routing for minimizing the maximal link congestion

作     者：Hijazi Hassan, H. Klopfenstein, Olivier 

作者机构：Orange Labs 92130 Issy-les-Mx 38 rue du gl Leclerc France 

出 版 物：《Electronic Notes in Discrete Mathematics》 (Electron. Notes Discrete Math.)

年 卷 期：2010年第36卷第C期

页      面：1145-1152页

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：Congestion probability Integer nonlinear programming Multicommodity flow Network optimization 

摘      要：A lot of attention has been devoted to flow routing in networks by the past. Usually, each commodity to be routed is characterized by a single deterministic traffic value. However, many real-life application contexts require to consider stochastic flows. This is the case, for instance, in telecommunication networks. The current paper revisits usual network routing and dimensioning models, in considering that traffic amounts to be routed are random variables. This leads naturally to probabilistic constraints. Some mathematical properties of the stochastic models introduced are described. A special focus is made on the relations between these stochastic models and usual deterministic approaches. © 2010 Elsevier B.V.