Polling Best Effort Traffic in Bluetooth

Authors:
Rachid Ait Yaiz;Geert Heijenk
Affiliations:
Department of Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands E-mail: yaiz@cs.utwente.nl;Department of Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands E-mail: heijenk@cs.utwente.nl and Ericsson EuroLab Netherlands, P.O.Box 645, ...
Venue:
Wireless Personal Communications: An International Journal
Year:
2002

Citing 3
Cited 4

Performance evaluation of scheduling algorithms for Bluetooth

Broadband communications
Analysis of ISP IP/ATM network traffic measurements

ACM SIGMETRICS Performance Evaluation Review
Wireless access to internet via Bluetooth: performance evaluation of the EDC scheduling algorithm

WMI '01 Proceedings of the first workshop on Wireless mobile internet

Providing QoS in Bluetooth

Cluster Computing
A two-queue polling model with two priority levels in the first queue

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Bluetooth scatternet formation: A survey

Ad Hoc Networks
A Two-Queue Polling Model with Two Priority Levels in the First Queue

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bluetooth [1] is a wireless access technology where polling is used to sharebandwidth among the nodes. We have introduced a new poller named PredictiveFair Poller (PFP) in [2, 3]. In this paper we explain the operation of thePredictive Fair Poller and compare it with the conventional Round Robin pollerand the Fair Exhaustive Poller (FEP) [4] for two Best Effort trafficscenarios. We show through simulations that the Predictive Fair Poller is ableto divide bandwidth in a fair and efficient manner.