Loss networks
A mathematical review paper is:

Loss networks .
Annals of Applied Probability, 1 (1991), 319378.
A more discursive paper, setting loss networks in a wider context, is:

Network routing .
Philosophical Transactions of the
Royal Society A337 (1991) 343367.

A refinement of the HuntKurtz theory of large loss networks, with an
application to virtual partitioning.
S. Zachary and I. Ziedins
Annals of Applied Probability 12 (2002), 122.

Distributed admission control.
F.P. Kelly, P.B. Key and S. Zachary
IEEE Journal on Selected Areas in Communications, 18 (2000) 26172628.

Network programming methods for loss networks.
R.J. Gibbens and F.P. Kelly
IEEE Journal on Selected Areas in Communications, 13 (1995), 11891198.

Loss networks under diverse routing: the symmetric star network.
P.J. Hunt
Advances in Applied Probability, 27 (1995) 255272.

Computational complexity of loss networks.
Graham Louth, Michael Mitzenmacher and Frank Kelly
Theoretical Computer Science 125 (1994) 4559.

Bounds on the performance of dynamic routing
for highly connected networks.
Mathematics of Operations Research 19 (1994) 120.

Routing and capacity allocation in networks with
trunk reservation.
Mathematics of Operations Research 15 (1990) 771793.

Limit theorems for loss networks with diverse routing.
I.B. Ziedins and F.P. Kelly
Advances in Applied Probability 21 (1989), 804830.
 On
critically loaded loss networks.
P.J. Hunt and F.P. Kelly
Advances in Applied Probability 21 (1989), 831841.

Routing in circuitswitched networks: optimization,
shadow prices and decentralization .
Advances in Applied Probability 20 (1988), 112144.

Onedimensional circuitswitched networks .
Annals of Probability 15 (1987) 11661179.

Blocking probabilities in large circuitswitched networks.
Advances in Applied Probability 18 (1986) 473505.

Stochastic models of computer communication systems.
Journal of the Royal Statistical Society (Series B) 47 (1985)
379395,
with Discussion 415428.
Frank Kelly
Statistical Laboratory,
University of Cambridge