1. Anantharam, V., “A mean-field limit for a lattice caricature of dynamic routing in circuit switched networks”, Ann. Appl. Prob. 1, 481–503 (1991).
2. Crametz, J.P. Hunt, P.J., “A limit result respecting graph structure for a fully connected network with alternative routing”, Ann. Appl. Prob. 1, 436–444 (1991).
3. Dawson, D.A., Zheng, X., “Law of large numbers and central limit theorem for unbounded jump mean-field models”, Adv. Appl. Math. 12, 293–326, (1991).
4. Dobrushin, R.L., “Queuing networks—without explicit solutions and without computer simulation”, Keynote lecture, Conference on applied probability in engineering, computer and communication sciences INRIA-ORSA-TIMS-SMAI 1993, Paris, (1993).
5. Gibbens, R.J., Hunt, P.J., Kelly, F.P., “Bistability in communication networks”, in Disorder in Physical Systems, G.R. Grimmett and D.J.A. Welsh (eds.), Oxford Univ. Press, 113–128, (1990).