E-limited scheduling in Bluetooth piconets: performance and admission control

Abstract

In this paper the queueing theoretic analysis of J. Misic and V.B. Misic (Feb. 2003) to the performance of the Bluetooth piconet in which the master polls its slaves using E-limited scheduling is extended. The results indicated that E-limited service is among the scheduling policies of choice for Bluetooth piconets. First, it offers lower delays than either limited or exhaustive service, under a wide range of traffic load. Second, it provides fairness by default, since the limit on the number of frames exchanged with any single slave prevents the slaves from monopolizing the network. Third, it does not require the master to know the status of slaves' uplink queues. The paper shows that the end-to-end packet delays can be minimized if the value of AI is chosen to be close to the mean size of the packet bursts coming from the slaves. Also, the derived quality-of-service parameters as the basis for two admission control schemes, based on queue stability and predefined mean access delay, respectively is used. Either of these schemes could be incorporated in the scatternet (piconet) formation algorithm.