Sojourn time approximations in a two-node queueing network

被引：0

作者：

Boxma, OJ ^{[1
]}

van der Mei, RD ^{[1
]}

Resing, JAC ^{[1
]}

van Wingerden, KMC ^{[1
]}

机构：

[1] Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands

来源：

Performance Challenges for Efficient Next Generation Networks, Vols 6A-6C | 2005年 / 6A-6C卷

关键词：

D O I：

暂无

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

We develop a method for approximating sojourn time distributions in open queueing networks. The work is motivated by the performance analysis of distributed information systems, where transactions are handled by iterative server and database actions. In this paper we restrict ourselves to a system with one server and a single database, modelled as an open two-node queueing network with a processor sharing node and a first-come first-served node. Extensive numerical results are presented for approximations of the mean sojourn time. The accuracy of the approximations is validated with simulations.

引用

下载

页码：1123 / 1133

页数：11

共 50 条

[21] Fluid and diffusion approximations of a two-station mixed queueing network
Math Oper Res, 2 (321-354):
[22] Sojourn time analysis of a queueing system with two-phase service and server vacations
Katayama, Tsuyoshi
Kobayashi, Kaori
NAVAL RESEARCH LOGISTICS, 2007, 54 (01) : 59 - 65
[23] ERGODIC PROPERTIES OF QUEUEING SYSTEMS WITH BOUNDED SOJOURN TIME
AFANASEVA, LG
MARTYNOV, AV
THEORY OF PROBILITY AND ITS APPLICATIONS,USSR, 1969, 14 (01): : 105 - +
[24] About the Sojourn Time Process in Multiphase Queueing Systems
S. Minkevičius
S. Steišūnas
Methodology and Computing in Applied Probability, 2006, 8 : 293 - 302
[25] Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers
Foley, RD
Park, BC
OPERATIONS RESEARCH LETTERS, 2002, 30 (01) : 19 - 24
[26] Pure threshold strategies for a two-node tandem network under partial information
D'Auria, Bernardo
Kanta, Spyridoula
OPERATIONS RESEARCH LETTERS, 2015, 43 (05) : 467 - 470
[27] Upper bound for the decay rate of the joint queue-length distribution in a two-node Markovian queueing system
Katou, Ken'ichi
Makimoto, Naoki
Takahashi, Yukio
QUEUEING SYSTEMS, 2008, 58 (03) : 161 - 189
[28] Upper bound for the decay rate of the marginal queue-length distribution in a two-node Markovian queueing system
Katu, K
Makimoto, N
Takahashi, Y
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2004, 47 (04) : 314 - 338
[29] Upper bound for the decay rate of the joint queue-length distribution in a two-node Markovian queueing system
Ken’ichi Katou
Naoki Makimoto
Yukio Takahashi
Queueing Systems, 2008, 58 : 161 - 189
[30] Queueing Systems with Demands of Random Space Requirement and Limited Queueing or Sojourn Time
Tikhonenko, Oleg
Zajac, Pawel
COMPUTER NETWORKS (CN 2017), 2017, 718 : 380 - 391

← 1 2 3 4 5 →