Generalized Erlang problem for queueing systems with accumulation
| dc.contributor.author | Tikhonenko, Oleg | pl_PL |
| dc.date.accessioned | 2019-09-09T07:56:19Z | |
| dc.date.available | 2019-09-09T07:56:19Z | |
| dc.date.issued | 2003 | |
| dc.identifier.citation | Annales Academiae Paedagogicae Cracoviensis. 16, Studia Mathematica 3 (2003), s. [273]-278 | pl_PL |
| dc.identifier.uri | http://hdl.handle.net/11716/5766 | |
| dc.description.abstract | We consider a non-classical $M/G/n/0$ type queueing system with random volume demands. Each demand requires $m$ servers for its simultaneous service with probability $q_m, Σ^n_{m=1} q_m = 1$. Service time of the demand depends on the demand volume and $m$. The total volume of demands presenting in the system is restricted by memory volume V. For such system the stationary distribution of demands number and loss probability are determined. | en_EN |
| dc.language.iso | en | pl_PL |
| dc.title | Generalized Erlang problem for queueing systems with accumulation | en_EN |
| dc.type | Article | pl_PL |