We analyze the performance of E-limited scheduling in Bluetooth piconets under bursty traffic finite buffer case. We model joint probability distributions of uplink and downlink queues using the M [x]/G/1/K model with vacations and derive buffer blocking probabilities at slaves and at the master. We also derive access delays at slave uplink buffers. Analytical results are validated through simu...

We consider an Internet link carrying http-like traffic, i.e., transfers of finite volume files arriving at random time instants. These file transfers are controlled by an adaptive window protocol (AWP); an example of such a protocol is TCP. We provide analysis for the auto-covariance function of the AWP controlled traffic into the link’s buffer; this traffic, in general, cannot be represented ...

We consider a two-buffer fluid model with N ON-OFF inputs and threshold assistance, which is an extension of the same model with N = 1 in [18]. While the rates of change of both buffers are piecewise constant and dependent on the underlying Markovian phase of the model, the rates of change for Buffer 2 are also dependent on the specific level of Buffer 1. This is because both buffers share a fi...

In this paper, we present the throughput and delay performance of a busy tone based media access protocol in wireless networks with buffers at each node for queueing up messages. Partially connected static topologies with finite number of nodes that are globally synchronised to the slot duration are considered. Each node has unlimited buffer resources for transit messages and limited buffer cap...

In 2001, van Leeuwen and Wiedermann [1] have defined evolving interactive systems, in particular sequences of interactive finite automata with global states, to model infinite computations on an ever changing machine or system of machines. Modern computation does not just happen on an individual machine for a fixed time, but it goes on forever over an unbounded number of software and hardware c...