Probabilistic QoS Guarantees, Downlink and Uplink Scheduling Studies in a Bluetooth Piconet

We address analytic performance evaluation of a bluetooth piconet by considering the M/G/1 queue with batch arrivals and vacation times. We present a probabilistic approach to support diverse traffics with QoS guarantees. We consider mainly two constraints: the packet deadline and its priority. We focus on two new scheduling techniques that we have proposed in our previous works. The first technique combines FIFO and the class based priority queuing (PQ) while the second combines EDF (Earliest deadline First) and PQ. We focus our interest to providing Quality of Service (QoS) guarantees to various classes of soft real-time applications by using a probabilistic approach. Here, we compute the end-to-end delay distribution composed by the uplink and downlink waiting times. The end-to-end delay is used to obtain the probability that the response time doesn´t exceed a given deadline. Then, we propose a probabilistic admission control procedure for real time flows. We validated the obtained theoretical results through simulations using an extension of the network simulator NS2 called Bluehoc.