Fluid queues offer a natural framework for analyzing waiting times in a relay node of an ad hoc network. Because of the resource sharing policy applied, the input and output of these queues are coupled. More specifically, when there are n users who wish to transmit data through a specific node, each of them obtains a share 1/(n+W) of the service capacity to feed traffic into the queue of the node, whereas the remaining fraction W/(n+W) is used to serve the queue; here W>0 is a free design parameter. Assume now that jobs arrive at the relay node according to a Poisson process, and that they bring along exponentially distributed amounts of data. The case W=1 has been addressed before; the present paper focuses on the intrinsically harder case W>1, that is, policies that give more weight to serving the queue. Four performance metrics are considered: (i) the stationary workload of the queue, (ii) the queueing delay, that is, the delay of a “packet” (a fluid particle) that arrives at an arbitrary point in time, (iii) the flow transfer delay, (iv) the sojourn time, that is, the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. We explicitly compute the Laplace transforms of these random variables.
|Number of pages||25|
|Journal||Journal of applied mathematics and stochastic analysis|
|Publication status||Published - 2008|