IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2012y2012i1n123808.html

Analysis of the M/M/N/N Queue with Two Types of Arrival Process: Applications to Future Mobile Radio Systems

Author

Listed:
  • Peter J. Smith
  • Abdulla Firag
  • Pawel A. Dmochowski
  • Mansoor Shafi

Abstract

The queueing system considered is essentially a M/M/N/N queue where two types of users compete for the N resources. The users may have different arrival and service rates and are denoted as primary or secondary users. The primary users have priority access to the resources, and three levels of priority are considered: perfect priority, partial priority, and no priority. This system models the recently developed cognitive radio concept, a methodology that has been proposed for future mobile radio systems. In this context, the primary users have certain rights to use the resources, whereas the secondary users must make opportunistic use of the resources without impacting too much on the performance of the primary users. For all priority settings, the mean number of primary and secondary users is derived as are the blocking probabilities for both users. When no priority is given to the primary user, the system collapses to a truncated form of two independent M/M/∞ queues. The product form solution for this special case is known, and, here, these results are given in a novel, compact form. In the case of nonzero priority, the dropping probability for the secondary users is also derived.

Suggested Citation

  • Peter J. Smith & Abdulla Firag & Pawel A. Dmochowski & Mansoor Shafi, 2012. "Analysis of the M/M/N/N Queue with Two Types of Arrival Process: Applications to Future Mobile Radio Systems," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
  • Handle: RePEc:wly:jnljam:v:2012:y:2012:i:1:n:123808
    DOI: 10.1155/2012/123808
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2012/123808
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2012/123808?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Alan Cobham, 1954. "Priority Assignment in Waiting Line Problems," Operations Research, INFORMS, vol. 2(1), pages 70-76, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hongsheng Yin & Honggang Qi & Jingwen Xu & Xin Huang & Anping He, 2014. "An Efficient Multitask Scheduling Model for Wireless Sensor Networks," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yaroslav Rosokha & Chen Wei, 2024. "Cooperation in Queueing Systems," Management Science, INFORMS, vol. 70(11), pages 7597-7616, November.
    2. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    3. Sheng Zhu & Xuege Han & Jinting Wang & Zhongbin Wang, 2026. "Performance evaluation and equilibrium strategies for a mixed priority queueing system," Queueing Systems: Theory and Applications, Springer, vol. 110(1), pages 1-32, March.
    4. Cors, Tobias & Fliedner, Malte & Haase, Knut & Vlćek, Tobias, 2025. "Simulative assessment of patrol car allocation and response time," European Journal of Operational Research, Elsevier, vol. 324(1), pages 290-307.
    5. Josef Zuk & David Kirszenblat, 2024. "Explicit results for the distributions of queue lengths for a non-preemptive two-level priority queue," Annals of Operations Research, Springer, vol. 341(2), pages 1223-1246, October.
    6. Mor Harchol-Balter & Takayuki Osogami & Alan Scheller-Wolf & Adam Wierman, 2005. "Multi-Server Queueing Systems with Multiple Priority Classes," Queueing Systems: Theory and Applications, Springer, vol. 51(3), pages 331-360, December.
    7. Tsiligianni, Christiana & Tsiligiannis, Aristeides & Tsiliyannis, Christos, 2023. "A stochastic inventory model of COVID-19 and robust, real-time identification of carriers at large and infection rate via asymptotic laws," European Journal of Operational Research, Elsevier, vol. 304(1), pages 42-56.
    8. G. M. Koole & B. F. Nielsen & T. B. Nielsen, 2012. "First in Line Waiting Times as a Tool for Analysing Queueing Systems," Operations Research, INFORMS, vol. 60(5), pages 1258-1266, October.
    9. Nilay Tan{i}k Argon & Serhan Ziya, 2009. "Priority Assignment Under Imperfect Information on Customer Type Identities," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 674-693, June.
    10. Haviv, Moshe & van der Wal, Jan, 2008. "Mean sojourn times for phase-type discriminatory processor sharing systems," European Journal of Operational Research, Elsevier, vol. 189(2), pages 375-386, September.
    11. Huiyin Ouyang & Nilay Taník Argon & Serhan Ziya, 2022. "Assigning Priorities (or Not) in Service Systems with Nonlinear Waiting Costs," Management Science, INFORMS, vol. 68(2), pages 1233-1255, February.
    12. Soroush Saghafian & Wallace J. Hopp & Mark P. Van Oyen & Jeffrey S. Desmond & Steven L. Kronick, 2014. "Complexity-Augmented Triage: A Tool for Improving Patient Safety and Operational Efficiency," Manufacturing & Service Operations Management, INFORMS, vol. 16(3), pages 329-345, July.
    13. Jori Selen & Brian Fralix, 2017. "Time-dependent analysis of an M / M / c preemptive priority system with two priority classes," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 379-415, December.
    14. Zaki, Ahmed S. & Cheng, Hsing Kenneth & Parker, Barnett R., 1997. "A Simulation Model for the Analysis and Management of An Emergency Service System," Socio-Economic Planning Sciences, Elsevier, vol. 31(3), pages 173-189, September.
    15. Divya Velayudhan Nair & Achyutha Krishnamoorthy & Agassi Melikov & Sevinj Aliyeva, 2021. "MMAP/(PH,PH)/1 Queue with Priority Loss through Feedback," Mathematics, MDPI, vol. 9(15), pages 1-26, July.
    16. Andrei Sleptchenko & M. Eric Johnson, 2015. "Maintaining Secure and Reliable Distributed Control Systems," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 103-117, February.
    17. Hideaki Takagi, 2016. "Waiting time in the M/M/ $$ m $$ m LCFS nonpreemptive priority queue with impatient customers," Annals of Operations Research, Springer, vol. 247(1), pages 257-289, December.
    18. van Vianen, L.A. & Gabor, A.F. & van Ommeren, J.C.W., 2014. "A simple derivation of the waiting time distributions in a non-preemptive M/M/c queue with priorities," ERIM Report Series Research in Management ERS-2014-016-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    19. Yang, Dong & Li, Chengkun & Wan, Yulai & Bai, Xiwen, 2025. "Internalizing congestion: the impact of market concentration and priority provision in global container ports," Transportation Research Part A: Policy and Practice, Elsevier, vol. 201(C).
    20. Sanjiv Kapoor & Junghwan Shin, 2020. "Price of Anarchy in Networks with Heterogeneous Latency Functions," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 755-773, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnljam:v:2012:y:2012:i:1:n:123808. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.