Interconnection networks, such as, shared bus and multistage interconnection networks (MINs) are very suitable for the design of shared memory multiprocessors. The existing analytical models of these networks are based on unrealistic synthetic workload for simplicity of the analyses. Also, they consider the networks in isolation without incorporating other architectural details of a multiproces...

We address the problem of deciding whether a given network is stable in the Adversarial Queueing Model when considering farthest-from-source (FFS) as the queueing policy to schedule the packets through its links. We show a characterisation of the networks which are stable under FFS in terms of a family of forbidden subgraphs. We show that the set of networks stable under FFS coincide with the s...

In this paper, we extend the work of Chen and Zhang (2000b) and establish a new sufficient condition for the existence of the (conventional) diffusion approximation for multiclass queueing networks under priority service disciplines. This sufficient condition relates to the weak stability of the fluid networks and the stability of the high priority classes of the fluid networks that correspond ...

This paper reviews the evolution of queueing networks software and its use in manufacturing. In particular, we will discuss two different groups of software tools. First, there are queueing networks software packages which require a good level of familiarity with the theory. In the other hand, there are some packages designed for manufacturing where the model development process is automated. I...

We present a new numerical method for the computation of the steady-state solution of Markov chains. Theoretical analyses show that the proposed method, with a contraction factor α, converges to the one-dimensional null space of singular linear systems of the form Ax = 0. Numerical experiments are used to illustrate the effectiveness of the proposed method, with applications to a class of inter...

Admission control in queueing networks is often based on partial information on the network state. This paper studies how the lack of state information affects performance by considering a simple model for admission control. The model is analyzed by studying a related censored process that has a matrix-geometric steady-state distribution. Numerical results show how partial information may cause...