Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jean-Baptiste Lapeyrie

dblp:89/3912 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 50% Network performance modeling · 44% Internet architecture and protocols · 6%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › wireless personal area network › bluetooth network
bluetooth piconet
0.012003
FPQ : A Fair and Efficient Polling Algorithm with QoS Support for Bluetooth Piconet · INFOCOM 2003
Network performance modeling › queueing analysis
polling
0.012003
FPQ : A Fair and Efficient Polling Algorithm with QoS Support for Bluetooth Piconet · INFOCOM 2003
Wireless networking › scheduling
quality-of-service scheduling
0.012003
FPQ : A Fair and Efficient Polling Algorithm with QoS Support for Bluetooth Piconet · INFOCOM 2003
Network performance modeling › queueing and scheduling
queue scheduling
0.012003
FPQ : A Fair and Efficient Polling Algorithm with QoS Support for Bluetooth Piconet · INFOCOM 2003
Internet architecture and protocols › quality of service › performance guarantees
bandwidth and delay guarantees
0.012003
FPQ : A Fair and Efficient Polling Algorithm with QoS Support for Bluetooth Piconet · INFOCOM 2003
Wireless networking
medium access control
0.012003
FPQ : A Fair and Efficient Polling Algorithm with QoS Support for Bluetooth Piconet · INFOCOM 2003

Methods — techniques the papers use, named apart from their topics

simulation · 0.0deficit round robin · 0.0
YearPublicationVenuePosition
2003 FPQ : A Fair and Efficient Polling Algorithm with QoS Support for Bluetooth Piconet
abstract
Bluetooth is an emerging standard for short range, low cost, low power wireless access technology. The Bluetooth technology is just starting to appear on the market and there is an urgent need to enable new applications with real time constraints to run on top of Bluetooth devices. The Bluetooth Specification proposes a Round Robin scheduler as possible solution for scheduling the transmissions in a Bluetooth Piconet. However, this basic scheme performs badly under asymmetric traffic conditions. Recently, several polling schemes have been proposed to improve performance on asymmetric transmissions and to support bandwidth guarantee. However, there is no solution available to support both delay and bandwidth guarantees required by real time applications. In this paper, we present FPQ, a new polling algorithm for Bluetooth Piconet that supports both delay and bandwidth guarantees and aims to remain fair and efficient with asymmetric flow rates. We present an extensive set of simulations and provide performance comparisons with other polling algorithms. Our performance study indicates that FPQ, while supporting flow rate and maximum delay QoS requests, outperforms Deficit Round Robin in term of delays by at least 10% in all cases, sometimes by more than 30% to 50%. Moreover, FPQ was designed to take the specifics of Bluetooth into consideration, in particular the low complexity required for cheap implementation.
Jean-Baptiste Lapeyrie, Thierry Turletti
INFOCOM1