Abstract
In most queueing systems we find that the service disciplines are either FCFS or priority based when we have more than one class of packets. In the last chapter we dealt with the priority systems of queues already. However sometimes in telecommunications we have multiclass systems with FCFS or sometimes LCFS disciplines. In this chapter we deal with two classes of multiclass packets – the no priority case and the LCFS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alfa AS, Neuts MF (2004) Pair formation in a MAP with two event labels. Journal of Applied Probability 41(4):1124–1137
He QM (1998) Classification of Markov processes of matrix m/g/1 type with a tree structure and its applications to the map[k]/ph[k]/1 queue. Internal report, Dalhousie University
He QM, Alfa AS (2000) The discrete time MMAP[K]/PH[K]/1/LCFS-GPR queue and its variants. In: latouche G, Taylor P (eds) Advances in algorithmic Methods for Stochastic Models,, Notable Pub. Inc, pp 167–190
He QM, Neuts MF (1998) Markov arrival process with marked transitions. Stochastic Processes and Applications 74:37–52
Houdt BV, Blondia C (2004) The waiting time distribution of a type k customer in a discrete-time MMAP[K]/PH[K]/c (c=1,2) queue using QBDs. Stochastic Models 20(1):55–69
van Houdt B, Blondia C (2002) The delay distribution of a type k customer in a first-come-first-served MMAP[K]/PH[K]/1 queue. Journal of Applied Probability 39:213–223
Yeung RW, Alfa AS (1999) The quasi-birth-and-death type Markov chain with a tree structure. Stochastic Models 15:639–659
Yeung RW, Sengupta B (1994) Matrix product-form solutions for Markov chains with a tree structure. Adv Appl Probab 26:965–987
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this chapter
Cite this chapter
Alfa, A.S. (2016). Special Single Node Queueing Models. In: Applied Discrete-Time Queues. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-3420-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-4939-3420-1_10
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-3418-8
Online ISBN: 978-1-4939-3420-1
eBook Packages: EngineeringEngineering (R0)