Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  sectorized memory buffer
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
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.
EN
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.
EN
In the present paper, we concentrate on basic concepts connected with the theory of queueing systems with random volume customers and a sectorized unlimited memory buffer. In such systems, the arriving customers are additionally characterized by a non-negative random volume vector. The vector’s indications can be understood as the sizes of portions of information of a different type that are located in the sectors of memory space of the system during customers’ sojourn in it. This information does not change while a customer is present in the system. After service termination, information immediately leaves the buffer, releasing its resources. In analyzed models, the service time of a customer is assumed to be dependent on his volume vector characteristics, which has influence on the total volume vector distribution. We investigate three types of such queueing systems: the Erlang queueing system, the single-server queueing system with unlimited queue and the egalitarian processor sharing system. For these models, we obtain a joint distribution function of the total volume vector in terms of Laplace (or Laplace-Stieltjes) transforms and formulae for steady-state initial mixed moments of the analyzed random vector, in the case when the memory buffer is composed of two sectors. We also calculate these characteristics for some practical case in which the service time of a customer is proportional to the customer’s length (understood as the sum of the volume vector’s indications). Moreover, we present some numerical computations illustrating theoretical results.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.