Network programming methods for loss networks.

This paper describes how some of the insights available from the stochastic analysis of dynamic routing may be incorporated into the classical mathematical programming approach to the design of networks. In particular, we present the results of a number of numerical investigations into network archi...

Full description

Bibliographic Details
Published in:	IEEE Journal on selected areas in communications 13, 7 (1995).
Main Author:	Gibbens, R.J
Format:	Article
Language:	English
Subjects:	Markov decision processes. Asymmetric networks. Circuit-switched communication networks. Communication networks. Dynamic routing. Loss networks. Mathematical programming. Network flow optimization. Network programming methods. Networks design. Performance. Performance bounds. Sparsely connected networks. Stochastic analysis. Symmetric fully connected networks.