1. F. Baccelli, A.M. Makowski, A. Shwartz, Simple Computable Bounds and Approximations for the Fork-Join Queue in: T. Hasegawa, H. Takagi, Y. Takahashi (eds.), Computer Networking and Performance Evaluation North-Holland, Amsterdam- New York — Oxford 1986
2. U. N. Bhat, Finite Capacity Assembly-like Queues Queueing Systems 1 (1986), 85–101
3. J.L Carroll, A. van de Liefvoort, L. Lipsky, Solutions of M/G/1//N-type Loops with Extensions to M/G/1 and GI/M/1 Queues Oper. Res. 30 (1982), 490–514
4. S.D. Hohl, P.J. Kühn, Approximate Analysis of Row and Cycle Times in Queueing Networks in: L.F.M. de Moraes, E. de Souza e Silva, LF.G. Soares (eds.), Dafa Communications and their Performance, 471–485 North-Holland, Amsterdam- New York — Oxford 1988
5. U. Körner, H.G. Perros, S. Fdida, G. Shapiro, End to End Delays in a Catenet Environment in: L.F.M. de Moraes, E. de Souza e Silva, L.F.G. Soares (eds.), Data Communications and their Performance, 441–452 North-Holland, Amsterdam- New York — Oxford 1988