This paper presents an application of queueing model for controlling queues in clustered computer networks by incorporating multiple servers in the system using multi-server queueing algorithm for the simulation. It has been shown through theory and experiment that as arrival rate increases in clustered computer networks, single server becomes inefficient and prone to instability, irrespective ...

An important class of discrete event systems, tandem queueing networks, are considered and formulated as mathematical programming problems where the constraints represent the system dynamics. The dual of the mathematical programming formulation is a network flow problem where the longest path equals the makespan of n jobs. This dual network provides an alternative proof of the reversibility pro...

PEPA Queues is a formalism that augments queueing networks with customers that have behavioural characteristics, as defined by PEPA components. PEPA Queues suffer from the traditional state-space explosion that affects both closed queueing networks and PEPA models. We discuss a possible solution to this with a continuous state-space approximation that allows us to derive an underlying mathemati...

We introduce a new method to investigate stability of work-conserving policies in multiclass queueing networks. The method decomposes feasible trajectories and uses linear programming to test stability. We show that this linear program is a necessary and sufficient condition for the stability of all work-conserving policies for multiclass fluid queueing networks with two stations. Furthermore, ...

The performance evaluation of many modern communication and manufacturing systems has been made possible by modeling them as queueing networks. Due to the limitations of exact algorithms to analyze general queueing networks, researchers have been focusing on developing approximations. Most of the approximations are lower order approximations in the sense that only a few parameters of the intera...

We consider a general class of closed product-form queueing networks, consisting single-server queues and infinite-server queues. Even if network is type, performance evaluation tends to be difficult due the potentially large state space dependence between individual To remedy this, we analyze model in Halfin–Whitt inspired scaling regime, where jointly blow up traffic loads all number customer...

In this paper we present a study of queueing delays experienced in Delay Tolerant Networks with topology based on deterministic contact plan schedules. We examine a generic scenario and propose a sampling procedure that extracts measurements of queueing rates and queue lengths. Sampling queueing information is transmitted to network nodes, which then form time series and can be used to forecast...