Simplified Analysis of Queueing Systems with Random Requirements

被引：4

作者：

Samouylov, Konstantin E. ^{[1
,2
]}

Gaidamaka, Yuliya V. ^{[1
,2
]}

Sopin, Eduard S. ^{[1
,2
]}

机构：

[1] RUDN Univ, Peoples Friendship Univ Russia, Miklukho Maklaya Str 6, Moscow 117198, Russia

[2] RAS, FRC CSC, Inst Informat Problems, Vavilova Str 44-2, Moscow 119333, Russia

来源：

STATISTICS AND SIMULATION, IWS 8 2015 | 2018年 / 231卷

基金：

俄罗斯科学基金会;

关键词：

Queuing system; Limited resources; Probabilistic characteristics; Insensitivity;

D O I：

10.1007/978-3-319-76035-3_27

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this work, a simplification approach for analysis of queueing systems with random requirements is proposed. The main point of the approach is to keep track of only total amount of occupied system resources. Therefore, we cannot know the exact amount of resources released by the departure of a customer, so we assume it a random variable with conditional cumulative distribution function depending on only number of customers in the system and total occupied resources at the moment just before the departure. In the chapter, we briefly describe the queuing system with random requirements, the simplification method and show that in case of Poisson arrival process simplified system has exactly the same stationary probability distribution as the original one.

引用

页码：381 / 390

页数：10

共 11 条

[1] Afanas'eva L. G., 1980, STOCHASTIC PROCESSES
[2] Korolyuk V. S, 1982, RENEWAL PROCESSES SY
[3] Naumov V, 2015, INT C ULTRA MOD TELE, P100, DOI 10.1109/ICUMT.2015.7382412
[4] Naumov V, 2014, P 7 INT C ULTR TEL C, P585
[5] Naumov V, 2015, P 9 INT WORKSH APPL, P36
[6] Naumov V. A, 2014, PFUR B SER INF MATH, V1, P58
[7] Prabhu N. U., 1965, QUEUES INVENTORIES S
[8] ROMM EL, 1971, AUTOMAT REM CONTR+, V32, P1000
[9] Sevastyanov B. A., 1957, Teoriya Veroyatn. i yeyo Primenen., V2, P106
[10] Tikhonenko O. M., 2005, PROBL INFORM TRANSM, V41, P77

← 1 2 →