Using factorization in analyzing D‐BMAP/G/1 queues | Zendy

Ho Woo Lee | Zendy; Se Won Lee | Zendy; Jongwoo Jeon | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Using factorization in analyzing D‐BMAP/G/1 queues

Author(s) -

Ho Woo Lee,

Se Won Lee,

Jongwoo Jeon

Publication year - 2005

Publication title -

international journal of stochastic analysis

Language(s) - English

Resource type - Journals

eISSN - 2090-3340

pISSN - 2090-3332

DOI - 10.1155/jamsa.2005.119

Subject(s) - mathematics , queue , factorization , discrete time and continuous time , burke's theorem , idle , queueing theory , discrete mathematics , queue management system , algorithm , computer science , statistics , fork–join queue , computer network , operating system

We demonstrate how one can use the factorization property to derive the queue-length distributions of the discrete-time BMAP/G/1 queues with complex operational behavior during the idle period. The procedure demonstrated in this paper can be applied to the analysis of many other discrete-time BMAP/G/1 queues with more behavioral complexities

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research