Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 5
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

In the present paper, we investigate a multi-server Erlang queueing system with heterogeneous servers, non-homogeneous customers and limited memory space. The arriving customers appear according to a stationary Poisson process and are additionally characterized by some random volume. The service time of the customer depends on his volume and the joint distribution function of the customer volume and his service time can be different for different servers. The total customers volume is limited by some constant value. For the analyzed model, steady-state distribution of number of customers present in the system and loss probability are calculated. An analysis of some special cases and some numerical examples are attached as well.

Go to article

Authors and Affiliations

O. Tikhonenko
M. Ziółkowski
M. Kurkowski
Download PDF Download RIS Download Bibtex

Abstract

This article describes queueing systems and queueing networks which are successfully used for performance analysis of different systems such as computer, communications, transportation networks and manufacturing. It incorporates classical Markovian systems with exponential service times and a Poisson arrival process, and queueing systems with individual service. Oscillating queueing systems and queueing systems with Cox and Weibull service time distribution as examples of non-Markovian systems are studied. Jackson's, Kelly's and BCMP networks are also briefly characterized. The model of Fork-Join systems applied to parallel processing analysis and the FES approximation making possible of Fork-Join analysis is also presented. Various types of blocking representing the systems with limited resources are briefly described. In addition, examples of queueing theory applications are given. The application of closed BCMP networks in the health care area and performance evaluation of the information system is presented. In recent years the application of queueing systems and queueing networks to modelling of human performance arouses researchers' interest. Hence, in this paper an architecture called the Queueing Network-Model Human Processor is presented.

Go to article

Authors and Affiliations

B. Filipowicz
J. Kwiecień
Download PDF Download RIS Download Bibtex

Abstract

In the present paper, the model of multi–server queueing system with random volume customers, non–identical (heterogeneous) servers and a sectorized memory buffer has been investigated. In such system, the arriving customers deliver some portions of information of a different type which means that they are additionally characterized by some random volume vector. This multidimensional information is stored in some specific sectors of a limited memory buffer until customer ends his service. In analyzed model, the arrival flow is assumed to be Poissonian, customers’ service times are independent of their volume vectors and exponentially distributed but the service parameters may be different for every server. Obtained results include general formulae for the steady–state number of customers distribution and loss probability. Special cases analysis and some numerical computations are attached as well.
Go to article

Authors and Affiliations

Marcin Ziółkowski
1
ORCID: ORCID

  1. Institute of Information Technology, Warsaw University of Life Sciences – SGGW, Poland
Download PDF Download RIS Download Bibtex

Abstract

In the present paper, we analyze the model of a single–server queueing system with limited number of waiting positions, random volume customers and unlimited sectorized memory buffer. In such a system, the arriving customer is additionally characterized by a non– negative random volume vector whose indications usually represent the portions of unchanged information of a different type that are located in sectors of unlimited memory space dedicated for them during customer presence in the system. When the server ends the service of a customer, information immediately leaves the buffer, releasing resources of the proper sectors. We assume that in the investigated model, the service time of a customer is dependent on his volume vector characteristics. For such defined model, we obtain a general formula for steady–state joint distribution function of the total volume vector in terms of Laplace-Stieltjes transforms. We also present practical results for some special cases of the model together with formulae for steady–state initial moments of the analyzed random vector, in cases where the memory buffer is composed of at most two sectors. Some numerical computations illustrating obtained theoretical results are attached as well.
Go to article

Authors and Affiliations

Marcin Ziółkowski
1
ORCID: ORCID
Oleg Tikhonenko
2
ORCID: ORCID

  1. Institute of Information Technology, Warsaw University of Life Sciences – SGGW, Poland
  2. Institute of Computer Science, Cardinal Stefan Wyszynski University in Warsaw, Poland

This page uses 'cookies'. Learn more