Analysis of the M/M/N/N queue with two types of arrival process: applications to future mobile radio systems (Q410867): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A generalization of the nielson-holder theorem about Γ(<i>z</i>) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Analysis of a non-preemptive priority multiserver queue / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2785491 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5423304 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3084090 / rank | |||
Normal rank |
Latest revision as of 00:50, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Analysis of the M/M/N/N queue with two types of arrival process: applications to future mobile radio systems |
scientific article |
Statements
Analysis of the M/M/N/N queue with two types of arrival process: applications to future mobile radio systems (English)
0 references
4 April 2012
0 references
Summary: 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/\(\infty\) 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.
0 references