Probabilistic QoS Guaranties and local scheduling studies in a Bluetooth piconet

To ensure efficient communication in Bluetooth networks, there must be a good design of intra and inter-piconet scheduling solutions. We present a mathematical model for performance evaluation of a Bluetooth piconet, based on the M/G/1 queue with batch arrivals and vacation times. We introduce a scheduling scheme that supports various traffics with QoS guaranties. We deal with two application constraints: the priority of a message and its end-to-end delivery deadline. We focus on two new local scheduling disciplines that we propose so far. The first is a combination of the class based priority queuing (PQ) and FIFO. The second is a combination of PQ and EDF. PQ is used between classes while FIFO and EDF are used within a class. We study these disciplines for providing Quality of Service (QoS) guarantees to various classes of soft real-time applications by using a probabilistic approach. Then we compute, for each discipline, the waiting time distribution to obtain the probability that the response time doesn't exceed a given deadline.