| 2009 |
|---|
| 57 | EE | Tadeusz Czachórski,
Jean-Michel Fourneau,
Tomasz Nycz,
Ferhan Pekergin:
Diffusion Approximation Model of Multiserver Stations with Losses.
Electr. Notes Theor. Comput. Sci. 232: 125-143 (2009) |
| 56 | EE | Leonardo Brenner,
Paulo Fernandes,
Jean-Michel Fourneau,
Brigitte Plateau:
Modelling Grid5000 point availability with SAN.
Electr. Notes Theor. Comput. Sci. 232: 165-178 (2009) |
| 2008 |
|---|
| 55 | EE | Jean-Michel Fourneau:
Multiclass G-Networks of Processor Sharing Queues with Resets.
ASMTA 2008: 221-233 |
| 54 | EE | Jean-Michel Fourneau:
Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations.
EPEW 2008: 110-124 |
| 53 | EE | Ana Busic,
Jean-Michel Fourneau:
Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach.
EPEW 2008: 227-241 |
| 52 | EE | Jean-Michel Fourneau:
Discrete Time Markov Chains Competing over Resources: Product Form Steady-State Distribution.
QEST 2008: 147-156 |
| 51 | EE | Mouad Ben Mamoun,
Jean-Michel Fourneau,
Nihal Pekergin:
Analyzing Weighted Round Robin policies with a stochastic comparison approach.
Computers & OR 35(8): 2420-2431 (2008) |
| 50 | EE | Jean-Michel Fourneau,
Brigitte Plateau,
William J. Stewart:
An algebraic condition for product form in stochastic automata networks without synchronizations.
Perform. Eval. 65(11-12): 854-868 (2008) |
| 2007 |
|---|
| 49 | EE | Jean-Michel Fourneau,
Lynda Mokdad,
Nihal Pekergin,
Samir Youcef:
Stochastic Bounds for Loss Rates.
AICT 2007: 9 |
| 48 | EE | Jean-Michel Fourneau,
Nihal Pekergin,
Sana Younès:
Censoring Markov Chains and Stochastic Bounds.
EPEW 2007: 213-227 |
| 47 | EE | Jean-Michel Fourneau,
Nihal Pekergin,
Sana Younès:
CUT : Combining stochastic ordering and censoring to bound steady-state rewards and first passage time.
QEST 2007: 211-212 |
| 46 | EE | Jean-Michel Fourneau:
Closed G-networks with Resets: product form solution.
QEST 2007: 287-296 |
| 45 | EE | Jean-Michel Fourneau,
Brigitte Plateau,
William J. Stewart:
Product form for stochastic automata networks.
VALUETOOLS 2007: 32 |
| 44 | EE | Ana Busic,
Tadeusz Czachórski,
Jean-Michel Fourneau,
Krzysztof Grochla:
Level crossing ordering of Markov chains: computing end to end delays in an all optical network.
VALUETOOLS 2007: 46 |
| 43 | EE | Jean-Michel Fourneau,
I. Kadi,
Nihal Pekergin,
Jérôme Vienne,
Jean-Marc Vincent:
Perfect simulation and monotone stochastic bounds.
VALUETOOLS 2007: 65 |
| 42 | EE | Jean-Michel Fourneau:
Discrete time stochastic automata networks: using structural properties and stochastic bounds to simplify the SAN.
VALUETOOLS 2007: 84 |
| 2006 |
|---|
| 41 | EE | Jean-Michel Fourneau,
Leïla Kloul:
A Precedence PEPA Model for Performance and Reliability Analysis.
EPEW 2006: 1-15 |
| 40 | EE | Ana Busic,
Jean-Michel Fourneau,
Nihal Pekergin:
Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering.
EPEW 2006: 196-210 |
| 39 | EE | Jean-Michel Fourneau,
Franck Quessette:
Computing the Steady-State Distribution of G-networks with Synchronized Partial Flushing.
ISCIS 2006: 887-896 |
| 38 | EE | Ana Busic,
Mouad Ben Mamoun,
Jean-Michel Fourneau:
Modeling Fiber Delay Loops in an All Optical Switch.
QEST 2006: 93-102 |
| 37 | EE | Jean-Michel Fourneau,
David Nott:
Convergence Routing under Bursty Traffic: Instability and an AIMD Controller.
Electr. Notes Theor. Comput. Sci. 151(3): 97-109 (2006) |
| 36 | EE | Ana Busic,
Jean-Michel Fourneau:
Bounding transient and steady-state dependability measures through algorithmic stochastic comparison.
SIGMETRICS Performance Evaluation Review 34(2): 11-12 (2006) |
| 2005 |
|---|
| 35 | EE | Ana Busic,
Jean-Michel Fourneau:
Bounds for Point and Steady-State Availability: An Algorithmic Approach Based on Lumpability and Stochastic Ordering.
EPEW/WS-FM 2005: 94-108 |
| 34 | EE | Jean-Michel Fourneau,
Tadeusz Czachórski:
Transport Time Distribution for Deflection Routing on an Odd Torus.
Euro-Par 2005: 975-983 |
| 33 | EE | Hind Castel-Taleb,
Jean-Michel Fourneau,
Nihal Pekergin:
Stochastic Bounds on Partial Ordering: Application to Memory Overflows Due to Bursty Arrivals.
ISCIS 2005: 244-253 |
| 32 | EE | Ana Busic,
Jean-Michel Fourneau:
A Matrix Pattern Compliant Strong Stochastic Bound.
SAINT Workshops 2005: 260-263 |
| 31 | EE | Jean-Michel Fourneau,
Nihal Pekergin,
Sana Younès:
Improving Stochastic Model Checking with Stochastic Bounds.
SAINT Workshops 2005: 264-267 |
| 30 | EE | Ireneusz Szczesniak,
Jean-Michel Fourneau,
Tadeusz Czachórski:
Preliminary Results of Packet Loss Analysis in Optical Packet-Switched Networks with Limited Deflection Routing.
SAINT Workshops 2005: 296-299 |
| 2004 |
|---|
| 29 | EE | Jean-Michel Fourneau,
David Nott:
Mixed Routing for ROMEO Optical Burst.
ISCIS 2004: 257-266 |
| 2003 |
|---|
| 28 | EE | Jean-Michel Fourneau,
Mathieu Le Coz,
Nihal Pekergin,
Franck Quessette:
An open tool to compute stochastic bounds on steady-state distributions and rewards.
MASCOTS 2003: 219- |
| 27 | EE | Oleg Gusak,
Tugrul Dayar,
Jean-Michel Fourneau:
Lumpable continuous-time stochastic automata networks.
European Journal of Operational Research 148(2): 436-451 (2003) |
| 26 | EE | Oleg Gusak,
Tugrul Dayar,
Jean-Michel Fourneau:
Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks.
Perform. Eval. 53(1): 43-69 (2003) |
| 2002 |
|---|
| 25 | EE | Dominique Barth,
Pascal Berthomé,
T. Czarchoski,
Jean-Michel Fourneau,
Christian Laforest,
Sandrine Vial:
A Mixed Deflection and Convergence Routing Algorithm: Design and Performance.
Euro-Par 2002: 767-774 |
| 24 | EE | M. Benmammoun,
Jean-Michel Fourneau,
Nihal Pekergin,
Alexis Troubnikoff:
An Algorithmic and Numerical Approach to Bound the Performance of High Speed Networks.
MASCOTS 2002: 375-382 |
| 23 | EE | Jean-Michel Fourneau,
Nihal Pekergin:
An Algorithmic Approach to Stochastic Bounds.
Performance 2002: 64-88 |
| 22 | | Erol Gelenbe,
Jean-Michel Fourneau:
G-networks with resets.
Perform. Eval. 49(1/4): 179-191 (2002) |
| 21 | | Jean-Michel Fourneau,
Leïla Kloul,
Fabrice Valois:
Performance modelling of hierarchical cellular networks using PEPA.
Perform. Eval. 50(2/3): 83-99 (2002) |
| 2001 |
|---|
| 20 | EE | Jean-Michel Fourneau,
Erol Gelenbe:
G-networks with resets.
SIGMETRICS Performance Evaluation Review 29(3): 19-20 (2001) |
| 2000 |
|---|
| 19 | | Jean-Michel Fourneau,
Leïla Kloul,
Franck Quessette:
Multiple class G-networks with iterated deletions.
Perform. Eval. 42(1): 1-20 (2000) |
| 1999 |
|---|
| 18 | | Erol Gelenbe,
Jean-Michel Fourneau:
Random Neural Networks with Multiple Classes of Signals.
Neural Computation 11(4): 953-963 (1999) |
| 1998 |
|---|
| 17 | EE | Jean-Michel Fourneau,
Lynda Mokdad:
A Perturbation and Reduction Based Algorithm.
Computer Performance Evaluation (Tools) 1998: 142-153 |
| 16 | EE | Corentin Durbach,
Jean-Michel Fourneau:
Performance Evaluation of a Dead Reckoning Mechanism.
DIS-RT 1998: 23- |
| 1997 |
|---|
| 15 | | Jean-Michel Fourneau,
Lynda Mokdad,
Nihal Pekergin:
Bounding the Loss Rates in a Multistage ATM Switch.
Computer Performance Evaluation 1997: 193-205 |
| 1996 |
|---|
| 14 | EE | Jean-Michel Fourneau,
Erol Gelenbe,
Rina Suros:
G-Networks with Multiple Classes of Negative and Positive Customers.
Theor. Comput. Sci. 155(1): 141-156 (1996) |
| 1995 |
|---|
| 13 | | Jean-Michel Fourneau,
Leïla Kloul,
Franck Quessette:
Multiple Class G-Networks with Jumps back to Zero.
MASCOTS 1995: 28-32 |
| 12 | | Jean-Michel Fourneau,
Dominique Verchère:
G-Networks with Triggered Batch State-Dependent Movement.
MASCOTS 1995: 33-37 |
| 11 | | Erol Gelenbe,
Peter G. Harrison,
Edwige Pitel,
Onno J. Boxma,
Jean-Michel Fourneau:
G-Networks - New Queueing Models with Additional Control Capabilities (Panel).
SIGMETRICS 1995: 58-59 |
| 1994 |
|---|
| 10 | | Jean-Michel Fourneau,
Erol Gelenbe,
Rina Suros:
G-Networks with Multiple Class Negative and Positive Customers.
MASCOTS 1994: 30-34 |
| 9 | | Jean-Michel Fourneau,
Nihal Pekergin,
H. Taleb:
An application of stochastic ordering to the analysis of the push-out mechanism.
Modelling and Evaluation of ATM Networks 1994: 227-244 |
| 8 | | Tadeusz Czachórski,
Jean-Michel Fourneau,
Ferhan Pekergin:
Diffusion models to study nonstationary traffic and cell loss in ATM networks.
Modelling and Evaluation of ATM Networks 1994: 347-364 |
| 1993 |
|---|
| 7 | | Jean-Michel Fourneau,
H. Maisonniaux,
Nihal Pekergin,
Véronique Vèque:
Performance Evaluation of Buffer Policies with Stochastic Automata Networks.
Modelling and Evaluation of ATM Networks 1993: 433-451 |
| 1992 |
|---|
| 6 | | Tadeusz Czachórski,
Jean-Michel Fourneau,
Ferhan Pekergin:
Diffusion Model of the Push-out Buffer Management Policy.
INFOCOM 1992: 252-261 |
| 1991 |
|---|
| 5 | | Brigitte Plateau,
Jean-Michel Fourneau:
A Methodology for Solving Markov Models of Parallel Systems.
J. Parallel Distrib. Comput. 12(4): 370-387 (1991) |
| 1989 |
|---|
| 4 | EE | Jean Claude Bermaud,
Jean-Michel Fourneau,
Alain Jean-Marie:
A graph theoretical approach to equivalence of multistage interconnection networks.
Discrete Applied Mathematics 22(3): 201-214 (1989) |
| 3 | | Jean-Claude Bermond,
Jean-Michel Fourneau:
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks.
Theor. Comput. Sci. 64(2): 191-201 (1989) |
| 1988 |
|---|
| 2 | | Jean-Claude Bermond,
Jean-Michel Fourneau:
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks.
ICPP (1) 1988: 187-190 |
| 1987 |
|---|
| 1 | | Jean-Claude Bermond,
Jean-Michel Fourneau,
Alain Jean-Marie:
Equivalence of Multistage Interconnection Networks.
Inf. Process. Lett. 26(1): 45-50 (1987) |
