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

Romaric Guillier

dblp:91/3470 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1

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 · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking › medium access control › adaptive MAC
contention window adaptation
0.112005
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs · SIGCOMM 2005
Wireless networking
medium access control
0.112005
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs · SIGCOMM 2005
Wireless networking › link adaptation
rate adaptation
0.112005
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs · SIGCOMM 2005
Wireless networking › WLAN › IEEE 802.11 MAC
IEEE 802.11 DCF
0.012005
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs · SIGCOMM 2005

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

simulation · 0.1
YearPublicationVenuePosition
2008 Methodologies and Tools for Exploring Transport Protocols in the Context of High-Speed Networks
abstract
This PhD work aims at proposing a methodology and tools for the evaluation of transport protocols in the context of large scale computing environment based on high speed networks. The goal is to define and validate a benchmark for comparing different transport and congestion control approaches. Our contribution concerns the definition of metrics, scenarios, experiments and pilot demonstrations for high demanding distributed applications. After stating the problem of evaluating transport protocols in high speed networks, we present existing methodologies for this purpose. We introduce our proposal of a tool to help users performing network experiments. We illustrate our approach with a few examples of results obtained from experiments in our Grid'5000 testbed which complements other existing approaches.
Romaric Guillier, Pascale Vicat-Blanc Primet
CCGRID1
2005 Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs
abstract
We consider wireless LANs such as IEEE 802.11 operating in the unlicensed radio spectrum. While their nominal bit rates have increased considerably, the MAC layer remains practically unchanged despite much research effort spent on improving its performance. We observe that most proposals for tuning the access method focus on a single aspect and disregard others. Our objective is to define an access method optimized for throughput and fairness, able to dynamically adapt to physical channel conditions, to operate near optimum for a wide range of error rates, and to provide equal time shares when hosts use different bit rates.We propose a novel access method derived from 802.11 DCF [2] (Distributed Coordination Function) in which all hosts use similar values of the contention window CW to benefit from good short-term access fairness. We call our method Idle Sense, because each host observes the mean number of idle slots between transmission attempts to dynamically control its contention window. Unlike other proposals, Idle Sense enables each host to estimate its frame error rate, which can be used for switching to the right bit rate. We present simulations showing how the method leads to high throughput, low collision overhead, and low delay. The method also features fast reactivity and time-fair channel allocation.
Martin Heusse, Franck Rousseau, Romaric Guillier, Andrzej Duda
SIGCOMM3