Response time density is obtained in a tandem pair of Markovian queues with both batch arrivals and departures. The method uses conditional forward reversed node sojourn times derives the Laplace transform response probability function case that sizes are finite. result derived by generating takes into account path not overtake-free sense tagged task being tracked affected later at second queue...

We present an update formula that allows the expression of the deviation matrix of a continuous-time Markov process with denumerable state space having generator matrix Q∗ through a continuous-time Markov process with generator matrix Q. We show that under suitable stability conditions the algorithm converges at a geometric rate. By applying the concept to three different examples, namely, the ...

It is shown that a Markovian queue, with bulk arrivals and departures having any probability mass functions for their batch sizes, has geometrically distributed queue length at equilibrium (when this exists) provided there is an additional special bulk arrival stream, with particular rate and batch size distribution, when the server is idle. It is shown that the time-averaged input rate of the ...

We model an ATM virtual circuit as a tandem queueing system. At each queue, transmission of the virtual circuit traac is interrupted by cross traf-c, causing the scattering and coalescing of cells. We study this phenomenon using entropy as a traf-c descriptor. We compute the entropy of traac streams produced in simulation, via an estimation technique based on the Lempel-Ziv universal data compr...

Tandem systems are seen in many places and at various hierarchical levels in highspeed communication networks, from router architectures to protocol stacks. If the traffic fed into the system is generated by independent or weakly dependent sources and the smallest relevant time scale is not too fine, the central limit theorem suggests that the input traffic is (close to) Gaussian. This paper co...

In this paper we investigate the performances of the EFCI-based (Explicit Forward Congestion Indication) and ER-based (Explicit Rate) algorithms for the rate-based flow control of the ABR (Available Bit Rate) traffic in an ATM network. We consider the case of two switches in tandem. We present several definitions of bottleneck, and provide conditions that determine whether the first, the second...

We study a single-router Network-on-Chip modelled as a tandem queueing network. The first node is a geo/D/1 queue (K fixed) representing a network interface, and the second node is a ./G/1 queue representing the packet switch. If K > 1 we have train arrivals at the second node. If K = 1 the arrival process of the second node reduces to a Bernoulli process. In the latter case, routers have been ...

Most research in the area of packet-radio networks has been confined to one-hop hearing topologies. This paper investigates tandem networks which are multihop networks. We assume that the nodes of the tandem have infinite buffers and they share a common radio channel for transmission of data packets. We also assume that each node transmits whenever it has a packet ready for transmission. We tre...

We study a blood testing procedure for detecting viruses like HIV, HBV and HCV. In this procedure, blood samples go through two screening steps. The first test is ELISA (antibody Enzyme Linked Immuno-Sorbent Assay). The portions of blood which are found not contaminated in this first phase are tested in groups through PCR (Polymerase Chain Reaction). The ELISA test is less sensitive than the PC...