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

Gilles Berger-Sabbatel

dblp:87/3424 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
0since 2021 · last 2004
—ORCID · none

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

Computer networks · 4 · 2 first-authorSystems, architecture and hardware · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 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 · 83% Network performance modeling · 17%

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

TopicWeightPapersLastEvidence papers
Wireless networking › medium access control › collision avoidance
CSMA/CA
0.012003
Performance anomaly of 802.11b · INFOCOM 2003
Wireless networking › WLAN
IEEE 802.11
0.012003
Performance anomaly of 802.11b · INFOCOM 2003
Wireless networking
medium access control
0.012003
Performance anomaly of 802.11b · INFOCOM 2003
Wireless networking › WLAN › wifi performance
performance anomaly
0.012003
Performance anomaly of 802.11b · INFOCOM 2003
Network performance modeling
throughput analysis
0.012003
Performance anomaly of 802.11b · INFOCOM 2003
Wireless networking
WLAN
0.012003
Performance anomaly of 802.11b · INFOCOM 2003

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

simulation · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
2004 Fairness and its impact on delay in 802.11 networks
abstract
We analyze in this paper the fairness of the 802.11 DCF (distributed coordination function) access method. Short-term fairness is an important property of a MAC layer for obtaining short delays. We show that contrary to the common wisdom, a 802.11 cell with two hosts does not exhibit short-term unfairness. We propose a new fairness index: the number of inter-transmissions that other hosts may perform between two transmissions of a given host. By means of this index, we analyze the fairness of 802.11 for the case of two hosts and derive the probability distribution of the number of inter-transmissions. Our results show that even on the short term time scale the 802.11 DCF access method provides fairness to competing hosts. When compared with slotted ALOHA, a multiple access randomized protocol with good fairness properties, 802.11 presents even better fairness. To validate the model, we compare the analytical results with experimental histograms obtained via simulations and measurements.
Gilles Berger-Sabbatel, Andrzej Duda, Olivier Gaudoin, Martin Heusse, Franck Rousseau
GLOBECOM1
2003 Bandwidth allocation for DiffServ based quality of service over 802.11
abstract
We propose to provide QoS differentiation at the IP level based on the DiffServ model over the standard distributed coordination function (DCF) method of 802.11. By constraining the output rate of each host in a cell via DiffServ scheduling and traffic shaping mechanisms, we can keep the 802.11 network in the state of nonsaturation so that the time-sensitive expedited forwarding (EF) class benefits from stable short delays. We analyze the performance of 802.11b to find how we should constrain the rate of DiffServ sources and present extensive measurements that show how the QoS differentiation is achieved.
Martin Heusse, Paul Starzetz, Franck Rousseau, Gilles Berger-Sabbatel, Andrzej Duda
GLOBECOM4
2003 Performance anomaly of 802.11b
abstract
The performance of the IEEE 802.11b wireless local area networks is analyzed. We have observed that when some mobile hosts use a lower bit rate than the others, the performance of all hosts is considerably degraded. Such a situation is a common case in wireless local area networks in which a host far away from an access point is subject to important signal fading and interference. To cope with this problem, the host changes its modulation type, which degrades its bit rate to some lower value. Typically, 802.11b products degrade the bit rate from 11 Mb/s to 5.5, 2, or 1 Mb/s when repeated unsuccessful frame transmissions are detected. In such a case, a host transmitting for example at 1 Mb/s reduces the throughput of all other hosts transmitting at 11 Mb/s to a low value below 1 Mb/s. The basic CSMA/CA channel access method is at the root of this anomaly: it guarantees an equal long term channel access probability to all hosts. When one host captures the channel for a long time because its bit rate is low, it penalizes other hosts that use the higher rate. We analyze the anomaly theoretically by deriving simple expressions for the useful throughput, validate them by means of simulation, and compare with several performance measurements.
Gilles Berger-Sabbatel, Franck Rousseau, Martin Heusse, Andrzej Duda
INFOCOM1
2003 Quality of Service and Mobility for the Wireless Internet
J. Antonio García-Macías, Franck Rousseau, Gilles Berger-Sabbatel, Leyla Toumi, Andrzej Duda
Wirel. Networks3
2001 Mobility Management for Providing QoS in Local Area Wireless Networks
abstract
International audience
J. Antonio García-Macías, Franck Rousseau, Gilles Berger-Sabbatel, Leyla Toumi, Andrzej Duda
DAIS3
1997 Hardware Solutions for Efficient Distributed Computing on ATM Networks
Gilles Berger-Sabbatel
Parallel Comput.1
1991 Prolog on a RISC: Implementation and evaluation
Gilles Berger-Sabbatel, Abderrazak Jemai
Microprocessing and Microprogramming1
1984 Unification for a Prolog Data Base Machine
Gilles Berger-Sabbatel, W. Dang, Jean-Christophe Ianeselli, Gia Toan Nguyen
ICLP1