Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 1
items per page: 25 50 75
Sort by:
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