The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Michel Fourneau: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tadeusz Czachórski, Jean-Michel Fourneau, Ferhan Pekergin
    Diffusion models to study nonstationary traffic and cell loss in ATM networks. [Citation Graph (0, 0)][DBLP]
    Modelling and Evaluation of ATM Networks, 1994, pp:347-364 [Conf]
  2. Jean-Michel Fourneau, H. Maisonniaux, Nihal Pekergin, Véronique Vèque
    Performance Evaluation of Buffer Policies with Stochastic Automata Networks. [Citation Graph (0, 0)][DBLP]
    Modelling and Evaluation of ATM Networks, 1993, pp:433-451 [Conf]
  3. Jean-Michel Fourneau, Nihal Pekergin, H. Taleb
    An application of stochastic ordering to the analysis of the push-out mechanism. [Citation Graph (0, 0)][DBLP]
    Modelling and Evaluation of ATM Networks, 1994, pp:227-244 [Conf]
  4. Jean-Michel Fourneau, Lynda Mokdad
    A Perturbation and Reduction Based Algorithm. [Citation Graph (0, 0)][DBLP]
    Computer Performance Evaluation (Tools), 1998, pp:142-153 [Conf]
  5. Jean-Michel Fourneau, Lynda Mokdad, Nihal Pekergin
    Bounding the Loss Rates in a Multistage ATM Switch. [Citation Graph (0, 0)][DBLP]
    Computer Performance Evaluation, 1997, pp:193-205 [Conf]
  6. Corentin Durbach, Jean-Michel Fourneau
    Performance Evaluation of a Dead Reckoning Mechanism. [Citation Graph (0, 0)][DBLP]
    DIS-RT, 1998, pp:23-0 [Conf]
  7. Ana Busic, Jean-Michel Fourneau
    Bounds for Point and Steady-State Availability: An Algorithmic Approach Based on Lumpability and Stochastic Ordering. [Citation Graph (0, 0)][DBLP]
    EPEW/WS-FM, 2005, pp:94-108 [Conf]
  8. Ana Busic, Jean-Michel Fourneau, Nihal Pekergin
    Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering. [Citation Graph (0, 0)][DBLP]
    EPEW, 2006, pp:196-210 [Conf]
  9. Jean-Michel Fourneau, Leïla Kloul
    A Precedence PEPA Model for Performance and Reliability Analysis. [Citation Graph (0, 0)][DBLP]
    EPEW, 2006, pp:1-15 [Conf]
  10. Dominique Barth, Pascal Berthomé, T. Czarchoski, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial
    A Mixed Deflection and Convergence Routing Algorithm: Design and Performance. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:767-774 [Conf]
  11. Jean-Michel Fourneau, Tadeusz Czachórski
    Transport Time Distribution for Deflection Routing on an Odd Torus. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:975-983 [Conf]
  12. Jean-Claude Bermond, Jean-Michel Fourneau
    Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1988, pp:187-190 [Conf]
  13. Tadeusz Czachórski, Jean-Michel Fourneau, Ferhan Pekergin
    Diffusion Model of the Push-out Buffer Management Policy. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1992, pp:252-261 [Conf]
  14. Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin
    Stochastic Bounds on Partial Ordering: Application to Memory Overflows Due to Bursty Arrivals. [Citation Graph (0, 0)][DBLP]
    ISCIS, 2005, pp:244-253 [Conf]
  15. Jean-Michel Fourneau, David Nott
    Mixed Routing for ROMEO Optical Burst. [Citation Graph (0, 0)][DBLP]
    ISCIS, 2004, pp:257-266 [Conf]
  16. Jean-Michel Fourneau, Franck Quessette
    Computing the Steady-State Distribution of G-networks with Synchronized Partial Flushing. [Citation Graph (0, 0)][DBLP]
    ISCIS, 2006, pp:887-896 [Conf]
  17. M. Benmammoun, Jean-Michel Fourneau, Nihal Pekergin, Alexis Troubnikoff
    An Algorithmic and Numerical Approach to Bound the Performance of High Speed Networks. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2002, pp:375-382 [Conf]
  18. Jean-Michel Fourneau, Mathieu Le Coz, Nihal Pekergin, Franck Quessette
    An open tool to compute stochastic bounds on steady-state distributions and rewards. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2003, pp:219-0 [Conf]
  19. Jean-Michel Fourneau, Erol Gelenbe, Rina Suros
    G-Networks with Multiple Class Negative and Positive Customers. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 1994, pp:30-34 [Conf]
  20. Jean-Michel Fourneau, Leïla Kloul, Franck Quessette
    Multiple Class G-Networks with Jumps back to Zero. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 1995, pp:28-32 [Conf]
  21. Jean-Michel Fourneau, Dominique Verchère
    G-Networks with Triggered Batch State-Dependent Movement. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 1995, pp:33-37 [Conf]
  22. Jean-Michel Fourneau, Nihal Pekergin
    An Algorithmic Approach to Stochastic Bounds. [Citation Graph (0, 0)][DBLP]
    Performance, 2002, pp:64-88 [Conf]
  23. Ana Busic, Mouad Ben Mamoun, Jean-Michel Fourneau
    Modeling Fiber Delay Loops in an All Optical Switch. [Citation Graph (0, 0)][DBLP]
    QEST, 2006, pp:93-102 [Conf]
  24. Jean-Michel Fourneau, Nihal Pekergin, Sana Younès
    Improving Stochastic Model Checking with Stochastic Bounds. [Citation Graph (0, 0)][DBLP]
    SAINT Workshops, 2005, pp:264-267 [Conf]
  25. Ana Busic, Jean-Michel Fourneau
    A Matrix Pattern Compliant Strong Stochastic Bound. [Citation Graph (0, 0)][DBLP]
    SAINT Workshops, 2005, pp:260-263 [Conf]
  26. Ireneusz Szczesniak, Jean-Michel Fourneau, Tadeusz Czachórski
    Preliminary Results of Packet Loss Analysis in Optical Packet-Switched Networks with Limited Deflection Routing. [Citation Graph (0, 0)][DBLP]
    SAINT Workshops, 2005, pp:296-299 [Conf]
  27. Erol Gelenbe, Peter G. Harrison, Edwige Pitel, Onno J. Boxma, Jean-Michel Fourneau
    G-Networks - New Queueing Models with Additional Control Capabilities (Panel). [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1995, pp:58-59 [Conf]
  28. Jean-Michel Fourneau, David Nott
    Convergence Routing under Bursty Traffic: Instability and an AIMD Controller. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:151, n:3, pp:97-109 [Journal]
  29. Jean-Claude Bermond, Jean-Michel Fourneau, Alain Jean-Marie
    Equivalence of Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:1, pp:45-50 [Journal]
  30. Brigitte Plateau, Jean-Michel Fourneau
    A Methodology for Solving Markov Models of Parallel Systems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:12, n:4, pp:370-387 [Journal]
  31. Erol Gelenbe, Jean-Michel Fourneau
    Random Neural Networks with Multiple Classes of Signals. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 1999, v:11, n:4, pp:953-963 [Journal]
  32. Jean-Michel Fourneau, Leïla Kloul, Franck Quessette
    Multiple class G-networks with iterated deletions. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2000, v:42, n:1, pp:1-20 [Journal]
  33. Jean-Michel Fourneau, Leïla Kloul, Fabrice Valois
    Performance modelling of hierarchical cellular networks using PEPA. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2002, v:50, n:2/3, pp:83-99 [Journal]
  34. Oleg Gusak, Tugrul Dayar, Jean-Michel Fourneau
    Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2003, v:53, n:1, pp:43-69 [Journal]
  35. Erol Gelenbe, Jean-Michel Fourneau
    G-networks with resets. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2002, v:49, n:1/4, pp:179-191 [Journal]
  36. Jean-Michel Fourneau, Erol Gelenbe
    G-networks with resets. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2001, v:29, n:3, pp:19-20 [Journal]
  37. Ana Busic, Jean-Michel Fourneau
    Bounding transient and steady-state dependability measures through algorithmic stochastic comparison. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2006, v:34, n:2, pp:11-12 [Journal]
  38. Jean-Claude Bermond, Jean-Michel Fourneau
    Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:2, pp:191-201 [Journal]
  39. Jean-Michel Fourneau, Erol Gelenbe, Rina Suros
    G-Networks with Multiple Classes of Negative and Positive Customers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:1, pp:141-156 [Journal]
  40. Oleg Gusak, Tugrul Dayar, Jean-Michel Fourneau
    Lumpable continuous-time stochastic automata networks. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:148, n:2, pp:436-451 [Journal]
  41. Jean-Michel Fourneau, Nihal Pekergin, Sana Younès
    Censoring Markov Chains and Stochastic Bounds. [Citation Graph (0, 0)][DBLP]
    EPEW, 2007, pp:213-227 [Conf]

  42. Stochastic Bounds for Loss Rates. [Citation Graph (, )][DBLP]


  43. Improving Time Parallel Simulation for Monotone Systems. [Citation Graph (, )][DBLP]


  44. Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach. [Citation Graph (, )][DBLP]


  45. Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations. [Citation Graph (, )][DBLP]


  46. Stochastic bounds for performance evaluation of web services. [Citation Graph (, )][DBLP]


  47. Analysis and Optimization of Aggregation in a Reconfigurable Optical ADD/DROP Multiplexer. [Citation Graph (, )][DBLP]


  48. CUT : Combining stochastic ordering and censoring to bound steady-state rewards and first passage time. [Citation Graph (, )][DBLP]


  49. Closed G-networks with Resets: product form solution. [Citation Graph (, )][DBLP]


  50. Discrete Time Markov Chains Competing over Resources: Product Form Steady-State Distribution. [Citation Graph (, )][DBLP]


  51. Perfect simulation and monotone stochastic bounds. [Citation Graph (, )][DBLP]


  52. Product form for stochastic automata networks. [Citation Graph (, )][DBLP]


  53. Discrete time stochastic automata networks: using structural properties and stochastic bounds to simplify the SAN. [Citation Graph (, )][DBLP]


  54. Level crossing ordering of Markov chains: computing end to end delays in an all optical network. [Citation Graph (, )][DBLP]


  55. Multiclass G-Networks of Processor Sharing Queues with Resets. [Citation Graph (, )][DBLP]


  56. Stochastic Automata Networks with Master/Slave Synchronization: Product Form and Tensor. [Citation Graph (, )][DBLP]


  57. Networks of Symmetric Multi-class Queues with Signals Changing Classes. [Citation Graph (, )][DBLP]


  58. Analyzing Weighted Round Robin policies with a stochastic comparison approach. [Citation Graph (, )][DBLP]


  59. A graph theoretical approach to equivalence of multistage interconnection networks. [Citation Graph (, )][DBLP]


  60. Modelling Grid5000 point availability with SAN. [Citation Graph (, )][DBLP]


  61. Diffusion Approximation Model of Multiserver Stations with Losses. [Citation Graph (, )][DBLP]


Search in 0.310secs, Finished in 0.314secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002