In this paper, the state diagrams and steady-state balance equations for two kinds of open queuing network models are presented. The first model comprises a network of single queues with single servers, while the second model comprises multiple servers for single queues. State diagrams are drawn for (2,3) queuing networks with (i) single servers and (ii) multiple servers. Steady-state balance e...

The aim of this paper is to use a very simple queuing model to compare a number of models from the literature which have been used to replicate the statistical nature of internet traffic and, in particular, the long-range dependence of this traffic. The four models all have the form of discrete time Markov-modulated processes (two other models are introduced for comparison purposes). While it i...

In this paper provides the results of research on the development of the method of constructing a model of customs procedures in terms of the theory of queuing systems based on their description by means of functional modeling IDEF0. The technique is based on use of the integrated IDEF0 models and theory of queuing systems with the ability to transition from a description of the system in IDEF0...

Various interpretations of the term packet loss rate is investigated. We compare different ways of estimating packet loss rate from simulations and also examine the applicability of common well understood simple queuing models. We show that using these queuing models to successfully estimate packet loss rate in a network with TCP traffic requires care. A network with independent sources perform...

This paper suggests new queuing models, in the Markovian framework, which can tackle the presence of burstiness in the traffic and autocorrelations among the inter-arrival times of packets in the performance evaluation of next generation networks. These models are essentially based on certain generalizations of the Quasi Birth-Death (QBD) processes. Efficient steady state solution of these new ...

This paper describes a state space-based simulation method for queuing systems with attributed customers. The approach extends a previous version, which was designed for only one customer class, enabling the simulation of a larger group of queuing models. The work is motivated by the need for exact solutions for queuing systems where no analytical solution is available. In this paper, the origi...

Combining the study of queuing with inventory is very common and such systems are referred to as queuing-inventory in literature. These occur naturally practice have been studied extensively The considered literature generally include (s,S)-type. However, this paper we look at opportunistic-type replenishment which there an independent point process that used model events called opportunistic f...

In this paper we model, using the Queuing Theory, the situation in which the manager of some facilities wishes to maximize the profit generated by the same. The manager tries to attract customers and the effectiveness of his publicity politic is measured in the fraction of customers who renounce. In this paper, unlike the classic models, we consider that the service time of the only server of t...