Showing 1 - 1 of 1
In this paper, we propose a max-flow-min-cost (MFMC) problem to obtain the upper bound of network capacity and develop an efficient packet routing strategy. The MFMC problem is formulated as two linear programs (LP). The optimal solutions of the two LPs are the upper bound of network capacity...
Persistent link: https://www.econbiz.de/10011059573