2016
DOI: 10.7232/iems.2016.15.2.131
|View full text |Cite
|
Sign up to set email alerts
|

Queueing System Operating in Random Environment as a Model of a Cell Operation

Abstract: We consider a multi-server queueing system without buffer and with two types of customers as a model of operation of a mobile network cell. Customers arrive at the system in the marked Markovian arrival flow. The service times of customers are exponentially distributed with parameters depending on the type of customer. A part of the available servers is reserved exclusively for service of first type customers. Customers who do not receive service upon arrival, can make repeated attempts. The system operation i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…Subtract formula (4) to obtain a formula representing the difference between the product cost calculated after merging the activity cost driver k into m and the product cost before the merger [28], that is, the accuracy loss formula after the two activity cost drivers are combined:…”
Section: E Cost Control Methods Of Enterprise Value Chain Under the Background Of Green Economymentioning
confidence: 99%
“…Subtract formula (4) to obtain a formula representing the difference between the product cost calculated after merging the activity cost driver k into m and the product cost before the merger [28], that is, the accuracy loss formula after the two activity cost drivers are combined:…”
Section: E Cost Control Methods Of Enterprise Value Chain Under the Background Of Green Economymentioning
confidence: 99%
“…(1) (2) (3) (4) W is the average time a guest is staying in the system (the sum of the waiting time and the service time), L is the average number of guests in the entire system (total waiting or receiving service), Wq is the average time that one customer waits to receive service, Lq is the average number of guests waiting to receive service [7][8].…”
Section: Figure 1 Basic Queuing Modelmentioning
confidence: 99%
“…Whenever the states of a random environment are changed, the parameters of the arrival flow and retrying flow are changed as well. Here, we give some reviews about the random environment (see [9][10][11][12][13][14]). In the 1970s, Neuts introduced the Versatile Markovian Point Process (VMPP) as the Markovian arrival process.…”
Section: Introductionmentioning
confidence: 99%