In this paper, we consider a discrete-time multiserver queueing system with infinite buffer size, geometric service times and a FCFS (first-come-first-served) queueing discipline. A relationship between the probability distributions of the system contents and the packet delay is established. The relationship is general in the sense that it doesn’t require knowledge of the exact nature of the ar...

In this paper we analyze a single removable and unreliable server in the N policy M/G/1 queueing system in which the server breaks down according to a Poisson process and the repair time obeys an arbitrary distribution. The method of maximum entropy is used to develop the approximate steady-state probability distributions of the queue length in the M/G(G)/1 queueing system, where the second and...

In large-scale wireless sensor networks (WSNs), when the consumption of hardware is limited, how to maximize the performance has become the research focus for improving transmission quality of service (QoS) of WSNs in recent years. This paper presents a new evaluation method for packet buffer capacity of nodes using queueing network model, whose packet buffer capacity is analyzed for each type ...

In service processes, as found in the telecommunications, financial, or healthcare sector, customers compete for the scarce capacity of service providers. For such processes, performance analysis is important and it often targets the time that customers are delayed prior to service. However, this wait time cannot be fully explained by the load imposed on service providers. Indeed, it also depen...

In modern networks serving real systems, there are a wide of variety of classes of messages. This results in the need for more sophisticated queueing policies. The desired queueing disciplines are expected to be able to consider all variables which are needed to handle messages appropriately. These variables include: diierent required service times, source traac chacteristics and quality of ser...

Network calculus is a theory dealing with queueing type problems encountered in computer networks, with particular focus on quality of service guarantee analysis. Queueing theory is the mathematical study of queues, proven to be applicable to a wide area of problems, generally concerning about the (average) quantities in an equilibrium state. Since both network calculus and queueing theory are ...

queueing is a package that solves and provides the main performance measures for both basic Markovian queueing models and single and multiclass product-form queueing networks. It can be used both in education and for professional purposes. It provides an intuitive, straightforward way to build queueing models using S3 methods. The package solves Markovian models of the form M/M/c/K/M/FCFS, open...

We present an open queueing network for analysing multi-layered window flow control mechanisms consisting of different subnetworks. The number of customers in each subnetwork is controlled bya semaphore queue. The queueing network is analysed approximately using decomposition and aggregation. The approximation was validated against exact numerical and simulation data, and it was found to have a...

The modern queueing theory is one of the powerful tools for a quantitative and qualitative analysis of communication systems, computer networks, transportation systems, and many other technical systems. In this paper, we deal with approximations of multiphase queueing systems (tandem queues, queues in series). Multiphase queueing systems are of special interest both in theory and in practical a...

This note presents a concurrent estimation technique that broadens the set of queueing systems where concurrent estimation techniques are applicable. Our technique utilizes a proportional relation and concurrently estimates performance measures with respect to various buffer capacity values in a queueing system. Our technique applies to a queueing system that characterizes a router/switch in pa...