2 The classical networks 186 2.1 Main results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187 2.2 Stationarity and reversibility . . . . . . . . . . . . . . . . . . . . 191 2.3 Homogeneous nodes of Kelly type . . . . . . . . . . . . . . . . . . 195 2.4 Symmetric nodes . . . . . . . . . . . . . . . . . . . . . . . . . . . 200 2.5 Quasi-reversibility . . . . . . . . . . . . . . . ...

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...

We consider the problem of how best to assign the service capacity in a queueing network in order to minimise the expected delay under a cost constraint. We study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time dist...

In this paper, we introduce a new framework supporting the bottleneck analysis of closed, multiclass BCMP queueing networks with large population sizes. First, we provide a sufficient and necessary condition establishing the existence of a single bottleneck. Then, we derive the new framework proposing efficient algorithms for the identification of queueing networks bottlenecks by means of linea...

The topological network design of general service, finite waiting room, multi-server queueing networks is a complex optimization problem. Series, merge, and split topologies are examined using an approximation method to estimate the performance of these queueing networks and an iterative search methodology to find the optimal buffer allocation within the network. The coefficient of variation is...

We introduce a novel class of tandem queueing networks which arise in modeling the congestion behavior of wireless multi-hop networks with distributed medium access control. These models provide valuable insight in how the network performance in terms of throughput depends on the back-off mechanism that governs the competition among neighboring nodes for access to the medium. The models fall at...

Queueing Theory finds its applications in various versatile domains in modern world. We investigate yet another application of Queueing Theory In modeling of MANET. More specifically, we study the ‘Queueing Network Mobility Model’of Mobile Ad-Hoc Networks (MANET), its applications and limitations. Motivated by its simplicity and successful performance, we use Queueing Network Analyzer (QNA) to ...

We consider the problem of how best to assign the service effort in a queueing network in order to minimise the expected delay under a cost constraint. We shall study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time ...

Queueing theory offers a large variety of techniques that can be used in performance modelling of computer systems and data communication networks. The diversity of assumptions causes that the numerical results, obtained for the same system but by means of different techniques, can often be numerically very different. The project is aimed at finding common denominators for numerical results obt...