Publications dans des revues

Revues Internationales

  • 2014
    • A. Busic et J.M. Fourneau. Stochastic bounds with a low rank decomposition Stochastic Models, V30, N4, pp 494-520.
    • J.M. Fourneau, N Izri et D. Verchere. Managing energy in a network of reconfigurable optical add/drop multiplexers IJCCBS, V 5, N 1/2, p 127-147.
  • 2012
    • Thu-Ha Dao-Thi, J.M. Fourneau. Markovian queueing network with complex synchronizations: Product form and tensor Performance Evaluation, V 69, 2012, p 164-186
    • A. Busic et J.M. Fourneau. Monotonicity and performance evaluation: applications to high speed and mobile networks Cluster Computing, V15, N4, pp 401-414, 2012
  • 2011
    • Thu-Ha Dao-Thi, J.M. Fourneau et Minh-Anh Tran. Multiple Class Symmetric G-networks with Phase Type Service Times The Computer Journal, 2011, V 54, N2, pp 274-284,
    • Thu-Ha Dao-Thi, J.M. Fourneau et Minh-Anh Tran. G-networks with synchronised arrivals Performance Evaluation, V 68, N4, pp 309-319, 2011
    • A. Busic et J.M. Fourneau. Iterative component-wise bounds for the steady-state distribution of a Markov chain Numerical Linear Algebra with Applications, Wiley, vol 18, N 6, pp 1031-1049, 2011
  • 2010
    • J.M. Fourneau, L. Mokdad et N. Pekergin. Stochastic bounds for performance evaluation of Web services Concurrency and Computation: Practice and Experience, V 22, N 10, 2010, pp 1286-1307
    • J.M. Fourneau. Collaboration of discrete-time Markov chains: Tensor and product form Perform. Eval., V67, N 9, 2010, pp 779-796
  • 2009
    • D. Barth, P. Berthome, D. Chiaroni, J.M. Fourneau C. Laforest, S. Vial. Mixing convergence and deflection strategies for packet routing in all optical networks Journ. of Optical Communications and Networking, V1, N3, pp 222-234, 2009
  • 2008
    • Mouad Ben Mamoun and Jean-Michel Fourneau and Nihal Pekergin. Analyzing Weighted Round Robin policies with a Stochastic Comparison Approach Computers and Operation Research, V35, N8, p 2420-2431.
    • Ireneusz Szczesniak and Tadeusz Czachorski and Jean-Michel Fourneau. Packet Loss Analysis in Optical Packet-Switched Networks with Limited Deflection Routing Photonic Network Communications, V16, p 253-261.
  • 2004
    • J.M. Fourneau, M Le Coz and F. Quessette Algorithms for an irreducible and lumpable strong stochastic bound, version preliminaire dans Numerical Solution for Markov Chains, 2003, Urbanna Champaign, USA.
    • J.M. Fourneau and E. Gelenbe. Flow Equivalence and Stochastic Equivalence in G-Networks. Computational Management Science, V1, N2, pp 179--192, 2004.
  • 2003
    • T. Dayar and J.M. Fourneau and N. Pekergin. Transforming stochastic matrices for stochastic comparison with the st-order RAIRO-RO, V 37, 2003, pp 85-97.
    • T. Dayar and O. Gusak and J.M. Fourneau. Stochastic Automata Networks and Near Complete Decomposability SIAM Journal on Matrix Analysis and Applications, Vol 23, pp 581-599.
    • T. Dayar and O. Gusak and J.M. Fourneau. Lumpable continuous-time SAN. European Journal on Operation Research, V148, N2, July 2003, pp 436-451.
    • T. Dayar and O. Gusak and J.M. Fourneau. Iterative disaggregation for a class of lumpable discrete-time SAN. Performance Evaluation, Juin 2003.
  • 2002
    • J.M. Fourneau and L. Kloul and F. Valois. Performance Modelling of Hierarchical Networks using PEPA. Performance Evaluation, Elsevier, V50, 2002, pp 83-99, version courte presente sous le meme titre dans 7th Int. Conference on Process Algebra and Performance Modelling, Espagne, 1999.
    • J.M. Fourneau and L. Mokdad and N. Pekergin. Computing the bounds on the loss rates Yugoslav Journal of Operations Reserach, volume 12, pp 167-184, Dec. 2002.
    • J.M. Fourneau and E. Gelenbe. G-Networks with Resets Performance Evaluation, 2002, V49, pp 179--191.
  • 2000
    • J.M. Fourneau and L. Kloul and F. Quessette. Multiple Class Generalized Networks with iterated deletions. Performance Evaluation, Elsevier, V42, pp 1-20, 2000.
    • J.M. Fourneau and L. Kloul and D. Verchere. Multiple Class G-Networks with list oriented deletions. European Journal on Operation Research, V 126, pp 250-272, 2000?
    • J.M. Fourneau and D. Verchere. G-reseaux dans un environnement aleatoire. RAIRO-RO, V 34, pp 427-448, 2000.
  • 1999
    • E. Gelenbe and J.M. Fourneau. Random neural networks with multiple classes of signals. Neural Computation, V11, p 953-963, 1999.
  • 1998
    • J.M. Fourneau and N. Pekergin and D. Verchere. Reseaux generalises multiclasses avec synchronisations cycliques. RAIRO-RO, V32, N3, 1998, pp 353-372.
  • 1996
    • E. Gelenbe and J.M. Fourneau and R. Suros. G-networks with multiple class negative and positive customers. Theor. Comp. Sci. 155, serie B, pp 141-156, une version courte a ete publie sous le meme titre dans : Proceedings of the 2nd IEEE International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (Mascots'94) Durham, USA, February 1994, IEEE (Ed.), pp30-34.
  • 1995
    • T. Czachorski and J.M. Fourneau and F. Pekergin. The dynamics of cell flow and cell losses in ATM networks modelled by a diffusion process. in Comptes Rendus de l'Academie des Sciences Polonaise, 1995, V43, N4, pp 537-548.
  • 1993
    • T. Czachorski and J.M. Fourneau and F. Pekergin. Diffusion Model of an ATM Network Node. in Comptes Rendus de l'Academie des Sciences Polonaise, 1993.
  • 1992
    • E. Gelenbe and J.M. Fourneau. Random neural networks with multiple class of signals. Neural Networks, Advances and Applications, Vol 2, North Holland, 1992.
  • 1991
    • B. Plateau and J.M. Fourneau. Solving complex markov models of parallel systems. Journal on Parallel and Distributed Computing, 1991, Vol 12, N4, P370-387.
  • 1990
    • J.C. Bermond and J.M. Fourneau. Independent Connection : an easy characterization of Baseline-equivalent networks. Theoretical Computer Science, Mai 1990, (une version plus courte est publiee sous le meme titre dans les actes du congres Int. Conf. Parallel Processing, Illinois 1988).
  • 1989
    • J.C. Bermond and J.M. Fourneau and A. Jean-Marie. A graph theoretical approach to equivalence of multistage interconnection networks. Discrete Applied Mathematics, 1989.
  • 1987
    • J.C. Bermond and J.M. Fourneau and A. Jean-Marie. Topological equivalence of multistage interconnection networks. Information Processing Letter, Sept. 87.

Chapitre de livre

    • J.M. Fourneau and B. Plateau and I. Sbeity and W.J. Stewart. SANs and Lumpable Stochastic Bounds: Bounding Availability, in Computer System. Network Performance and Quality of Service, Editeur Imperial College Press, 2006.
    • J.M. Fourneau and N. Pekergin. A Brief Introduction to an algorithmic approach for strong stochastic bounds. Proceedings of the First Workshop on New Trends in Modeling, Quantitative Methods and Measurements, Zakopane, June 2004, pp 57--74.
    • J.M. Fourneau and N. Pekergin. An algorithmic approach to stochastic bounds. LNCS 2459, Performance evaluation of complex systems: Techniques and Tools, 2002, pp 64--88.

Revues Electroniques

  • 2009
    • T. Czachorski, J.M. Fourneau T. Nycz et F. Pekergin. Diffusion Approximation Model of Multiserver Stations with Losses. Electr. Notes Theor. Comput. Sci., V 232, 2009, p 125-143.
    • L. Brenner, P. Fernandes, J.M. Fourneau et B. Plateau. Modelling Grid5000 point availability with SAN. Electr. Notes Theor. Comput. Sci., V 232, 2009, p 165-178.
  • 2006
    • Jean-Michel Fourneau and David Nott. Convergence Routing under Bursty Traffic: Instability and an AIMD Controller. Electr. Notes Theor. Comput. Sci., V151, N3, 2006, p 97-109.
    • Ana Busic and Jean-Michel Fourneau. Bounding transient and steady-state dependability measures through algorithmic stochastic comparison. SIGMETRICS Performance Evaluation Review, V34,N2,2006, p11-12.

Revues Nationales

  • 2004
    • T. Czachorski and J.M. Fourneau. Performance Evaluation of an optimal deflection routing algorithm on an Odd Torus. Archiwum Informatyki Teoretycznej I Stosowanej, Tom 16, pp 255-277, 2004, version courte présentée dans Proceedings of the Second International Working Conference on Performance Modeling and Evaluation of Heterogeneous Networks, HET-NETÕs 2004 (Ilkley, July 2004).
  • 2002
    • J.M. Fourneau. Domino Synchronization: product form solution for SANs. Studia Informatica, V23, N4(51), pp 173--190.
  • 2001
    • O. Abuamsha and J.M. Fourneau and N. Pekergin. Bornes stochastiques pour les taux de pertes dans un tampon memoire ATM. Calculateurs Paralleles, Reseaux et Systemes Repartis, V13, N6, 2001, pp 533-555.
    • T. Czachorski, and S. Nowak and J.M. Fourneau. Simulation-based performance evaluation of routing in all-optical networks. (en polonais), Studia Informatica, 2001, V22, N1.
  • 1999
    • T. Czachorski, and J.M. Fourneau and L. Kloul. Diffusion method applied to a Handoff Queuing scheme. (en polonais), Archiwum Informatyki Teoretycznej I Stosowanej, Tom 11, pp 25-39, 1999.
  • 1997
    • T. Czachorski, and T. Atmaca and B. Jouaber and J.M. Fourneau and L. Kloul and F. Pekergin. Queueing Packages in network nodes - diffusion models. (en polonais), (en polonais), Gliwice, Pologne, 1997.
    • T. Czachorski, and T. Atmaca and J.M. Fourneau and F. Pekergin. The dynamics of flows in a network, some control schemes and their diffusion models. (en polonais), Gliwice, Pologne, 1997.
  • 1995
    • T. Czachorski and J.M. Fourneau and L. Kloul. Diffusion models of Flow synchronization in ATM networks. Archiwum Informatyki Teoretycznej I Stosowanej, Tom 8, N1-2, pp 13-32, 1996. Une version courte a ete presentee sous le titre "Diffusion approximation to study the flow synchronization in ATM networks" dans Proceedings of the 3nd IFIP TC6/WG6.4 Workshop on Performance Analysis of ATM Networks Bradford, UK, July 1995.
  • 1994
    • Jean-Michel Fourneau and N. Pekergin, and V. Veque, and L. Kloul, and F. Quessette. Modelling Buffer Admission Mechanisms using Stochastic Automata Networks. Annales des Telecoms, numero special ATM-CESAME, Vol. 49, No5-6, Mai-Juin 1994, pp337-349.