Demo Data from EDBT 2026 / reviewers in the wild / expert
Josée Mignault
dblp:88/1133
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2Systems, architecture and hardware · 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
2 papers |
Network measurement and analytics · 44% Network performance modeling · 33% Internet architecture and protocols · 13% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network measurement and analytics
traffic characterization |
0.0 | 1 | 1995 | On Characterizing an ATM Source via the Sustainable Cell Rate Traffic Descriptor · INFOCOM 1995 |
Network performance modeling › loss systems
blocking probability computation |
0.0 | 1 | 1993 | Blocking Evaluation for Networks with Reward Maximization Routing · INFOCOM 1993 |
Internet architecture and protocols
ATM networks |
0.0 | 1 | 1995 | On Characterizing an ATM Source via the Sustainable Cell Rate Traffic Descriptor · INFOCOM 1995 |
Routing and switching › adaptive routing
state-dependent routing |
0.0 | 1 | 1993 | Blocking Evaluation for Networks with Reward Maximization Routing · INFOCOM 1993 |
Methods — techniques the papers use, named apart from their topics
link independence assumption · 0.0fixed point equations · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Resource Allocation for Worst Case Traffic in ATM Networks
Annie Gravey, J. Boyer, K. Sevilla, Josée Mignault |
Perform. Evaluation | 4 |
| 1995 | On Characterizing an ATM Source via the Sustainable Cell Rate Traffic Descriptor
Fabrice Guillemin, Catherine Rosenberg, Josée Mignault |
INFOCOM | 3 |
| 1993 | Blocking Evaluation for Networks with Reward Maximization RoutingabstractA model for node-to-node blocking probability evaluation in loss networks with state-dependent routing minimizing the reward from carried calls is synthesized. The model is based on the link independence assumption and results in an extended set of fixed point equations solved by repeated substitutions. The policy maximizing the reward from the network and the network performance under this policy are evaluated at the same time. The extensive numerical study covers the issues of accuracy, convergence, and control of performance allocation among different call classes.> Zbigniew Dziong, Josée Mignault, Catherine Rosenberg |
INFOCOM | 2 |