RUS  ENG
Full version
JOURNALS // Izvestiya of Saratov University. Mathematics. Mechanics. Informatics

Izv. Saratov Univ. Math. Mech. Inform., 2013, Volume 13, Issue 2(1), Pages 111–117 (Mi isu404)

Analysis of closed unreliable queueing networks with batch movements of customers
I. E. Tananko, N. P. Fokina

References

1. Morrison J. A., “Two discrete-time queues in tandem”, IEEE Trans. Commun., 27:3 (1979), 563–573  crossref  zmath
2. Boxma O., Kelly F., Konheim A., “The product form for sojourn time distributions in cyclic exponential queues”, J. of ACM, 31 (1984), 128–133  crossref  mathscinet  zmath  isi
3. Neely M. J., “Exact queueing analysis of discrete time tandems with arbitrary arrival processes”, IEEE Proc. of the Intern. Conf. of Commun. (Paris, 20–24 June, 2004), 1–5  adsnasa
4. Pestien V., Ramakrishnan S., “Monotonicity and asymptotic queue-length distribution in discrete-time networks”, Queueing Systems, 40 (2002), 313–331  crossref  mathscinet  zmath  isi
5. Henderson W., Taylor P. G., “Product form in networks of queues with batch arrivals and batch services”, Queueing Systems, 6 (1990), 71–88  crossref  mathscinet
6. Henderson W., Taylor P. G., “Some new results on queueing networks with batch movement”, J. Appl. Prob., 28 (1991), 409–421  crossref  mathscinet  zmath  isi
7. Henderson W., Pearce C. E. M., Taylor P. G., van Djik N. M., “Closed queueing networks with batch services”, Queueing Systems, 6 (1990), 59–70  crossref  mathscinet  zmath
8. Henderson W., Northcote B. S., Taylor P. G., “Triggered batch movement in queueing networks”, Queueing Systems, 21 (1995), 125–141  crossref  mathscinet  zmath  isi
9. Woodward M. E., “Towards the accurate modelling of high-speed communication networks with product-form discrete-time networks of queues”, Computer Communications, 21 (1998), 1530–1543  crossref  isi
10. Mitrophanov Yu. I., Rogachko E. S., Stankevich E. P., “Analysis of heterogeneous queueing networks with batch movements of customers”, Izv. Sarat. Univ. (N.S.), Ser. Math. Mech. Inform., 11:3, pt. 1 (2011), 41–46  mathnet
11. Bakeva V., Kolev N., “Minimization of the blocking time of the unreliable $Geo/G_d/1$ queueing system”, Math. Commun., 4 (1999), 1–10  mathscinet  zmath
12. Liu Z., Gao S., “Reliability indices of a $Geo/G/1/1$ Erlang loss system with active breakdowns under Bernoulli schedule”, Intern. J. of Manag. Sci. and Eng. Manag., 5:6 (2010), 433–438
13. Malchin C., Daduna H., “Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model”, Queueing Systems, 65:4 (2010), 385–421  crossref  mathscinet  zmath  adsnasa  isi
14. Vinod B., Altiok T., “Approximating unreliable queueing networks under the assumption of exponentiality”, J. Opl. Res. Soc., 37:3 (1986), 309–316  crossref  zmath
15. Mitrophanov Yu. I., Rogachko E. S., Stankevich E. P., “A method for analysis of queueing networks with batch movements of customers”, Comp. Nauki i Inf. Tech., Mater. Mejdun. Nauch. Conf., Saratov, 2009, 142–145
16. Boucherie R. J., van Dijk N. M., “Product forms for queueing networks with state-dependent multiple job transitions”, Adv. Appl. Probab., 23:1 (1991), 152–187  crossref  mathscinet  zmath  isi


© Steklov Math. Inst. of RAS, 2026