On classical queueing networks

Seminarium: 
Teoria prawdopodobieństwa i modelowanie stochastyczne
Osoba referująca: 
Ryszard Szekli (Uniwersytet Wrocławski)
Data: 
czwartek, 19. Styczeń 2017 - 12:15
Sala: 
602
Opis: 

I will recall classical mathematical problems related to queueing networks, some classical results related to ergodicity of some related Markov processes, and will discuss questions on the speed of convergence to stationarity and ordering of networks.

The talk will be based on some papers with Hans Daduna or Pawel Lorek, including recent ones but also some older ones, for example:

Correlation formulas for Markovian network processes in a random environment. Adv. in Appl. Probab. 48 (2016)

Computable bounds on the spectral gap for unreliable Jackson networks. Adv. in Appl. Probab. 47 (2015)

Stochastic comparison of queueing networks. Queueing networks, 345–395, Internat. Ser. Oper. Res. Management Sci., 154, Springer, New York, 2011