![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Jean-Michel Fourneau
Person information
- affiliation: Versailles Saint-Quentin-en-Yvelines University, France
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j42]Ana Busic, Josu Doncel
, Jean-Michel Fourneau:
Dynamic load balancing in energy packet networks. Perform. Evaluation 165: 102414 (2024) - 2023
- [j41]Mi Chen
, Lynda Mokdad
, Jalel Ben-Othman
, Jean-Michel Fourneau
:
Dynamic Parameter Allocation With Reinforcement Learning for LoRaWAN. IEEE Internet Things J. 10(12): 10250-10265 (2023) - [c111]Ana Busic, Jean-Michel Fourneau:
Stochastic Matching Model with Returning Items. EPEW 2023: 186-200 - [c110]Mi Chen, Lynda Mokdad, Jalel Ben-Othman, Jean-Michel Fourneau:
Probabilistic Model Checking for Unconfirmed Transmission in LoRaWAN on the MAC Layer. GLOBECOM 2023: 2457-2462 - 2022
- [j40]Arnaud Cadas, Josu Doncel, Jean-Michel Fourneau, Ana Busic
:
Flexibility can Hurt Dynamic Matching System Performance. SIGMETRICS Perform. Evaluation Rev. 49(3): 37-42 (2022) - [c109]Ana Busic, Arnaud Cadas, Josu Doncel, Jean-Michel Fourneau:
Product Form Solution for the Steady-State Distribution of a Markov Chain Associated with a General Matching Model with Self-loops. EPEW 2022: 71-85 - [c108]Mi Chen
, Lynda Mokdad, Jalel Ben-Othman, Jean-Michel Fourneau:
LoRaLOFT-A Local Outlier Factor-based Malicious Nodes detection Method on MAC Layer for LoRaWAN. GLOBECOM 2022: 2026-2031 - [c107]Mi Chen
, Lynda Mokdad, Cedric Charmois, Jalel Ben-Othman, Jean-Michel Fourneau:
An MDP model-based initial strategy prediction method for LoRaWAN. ICC 2022: 4836-4841 - 2021
- [j39]Sébastien Samain, Josu Doncel
, Ana Busic
, Jean-Michel Fourneau:
Multiclass Energy Packet Networks with finite capacity energy queues. Perform. Evaluation 152: 102228 (2021) - [j38]Lynda Mokdad, Jean-Michel Fourneau, Abdelkrim Abdelli
, Jalel Ben-Othman:
Performance evaluation of a solution for composite service selection problem with multiple consumers. Simul. Model. Pract. Theory 109: 102271 (2021) - [c106]Jean-Michel Fourneau, Edouard Longueville, Yann Ben Maissa, Loubna Echabbi, Houda Lotfi:
Computing Bounds for Delay in a Stochastic Network. EPEW 2021: 131-147 - [c105]Youssef Ait El Mahjoub
, Jean-Michel Fourneau, Hind Castel-Taleb:
Performance Evaluation and Energy Consumption for DVFS Processor. EPEW 2021: 165-180 - [c104]Mi Chen
, Lynda Mokdad, Jalel Ben-Othman, Jean-Michel Fourneau:
STEPS - Score Table based Evaluation and Parameters Surfing approach of LoRaWAN. GLOBECOM 2021: 1-6 - [c103]Mi Chen
, Lynda Mokdad, Jalel Ben-Othman, Jean-Michel Fourneau:
MULANE - A Lightweight Extendable Agent-oriented LoRaWAN Simulator with GUI. ISCC 2021: 1-6 - [c102]Jean-Michel Fourneau:
Modeling sensor networks with ON-OFF energy harvesting using Energy Packets. ISCC 2021: 1-6 - 2020
- [j37]Jean-Michel Fourneau:
Modeling Green Data-Centers and Jobs Balancing with Energy Packet Networks and Interrupted Poisson Energy Arrivals. SN Comput. Sci. 1(1): 28:1-28:6 (2020) - [c101]Youssef Ait El Mahjoub
, Jean-Michel Fourneau, Hind Castel-Taleb:
Energy Packet Networks with general service time distribution. MASCOTS 2020: 1-8 - [c100]Jean-Michel Fourneau, Nihal Pekergin, Sovanna Tan:
Stochastic Bounds For Some Stochastic Optimisation Problems. VALUETOOLS 2020: 112-119 - [c99]Sébastien Samain, Josu Doncel, Ana Busic
, Jean-Michel Fourneau:
Energy Packet Networks with Finite Capacity Energy Queues. VALUETOOLS 2020: 142-149 - [i1]Arnaud Cadas, Josu Doncel, Jean-Michel Fourneau, Ana Busic:
Flexibility can hurt dynamic matching system performance. CoRR abs/2009.10009 (2020)
2010 – 2019
- 2019
- [c98]Youssef Ait El Mahjoub
, Jean-Michel Fourneau, Hind Castel-Taleb:
Analysis of Energy Consumption in Cloud Center with Tasks Migrations. CN 2019: 301-315 - [c97]Lynda Mokdad, Jean-Michel Fourneau, Abdelkrim Abdelli
:
Performance Evaluation of the QoS Aware Web Service Composition with Communities of Consumers. GLOBECOM 2019: 1-6 - [c96]Josu Doncel, Jean-Michel Fourneau:
Balancing Energy Consumption and Losses with Energy Packet Network Models. ICFC 2019: 59-68 - [c95]Loubna Echabbi, Jean-Michel Fourneau, Oussama Gacem, Houda Lotfi, Nihal Pekergin:
Stochastic Bounds for the Max Flow in a Network with Discrete Random Capacities. PASM 2019: 77-105 - [c94]Youssef Ait El Mahjoub
, Jean-Michel Fourneau, Hind Castel-Taleb:
A numerical approach of the analysis of optical container filling. VALUETOOLS 2019: 159-162 - 2018
- [c93]Jean-Michel Fourneau:
Mean Value Analysis of Closed G-Networks with Signals. EPEW 2018: 46-61 - [c92]Youssef Ait El Mahjoub
, Hind Castel-Taleb, Jean-Michel Fourneau:
Performance and energy efficiency analysis in NGREEN optical network. WiMob 2018: 1-9 - 2017
- [j36]Jean-Michel Fourneau, Erol Gelenbe:
G-Networks with Adders. Future Internet 9(3): 34 (2017) - [j35]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Minh-Anh Tran:
Whittle-networks with signals. Perform. Evaluation 109: 8-22 (2017) - [j34]Andrea Marin, Simonetta Balsamo, Jean-Michel Fourneau:
LB-networks: A model for dynamic load balancing in queueing networks. Perform. Evaluation 115: 38-53 (2017) - [c91]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic Bounds for Switched Bernoulli Batch Arrivals Observed Through Measurements. ASMTA 2017: 1-15 - [c90]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Minh-Anh Tran:
Whittle networks with resets. VALUETOOLS 2017: 28-35 - [c89]Jean-Michel Fourneau, Lynda Mokdad, Jalel Ben-Othman, Abdelkrim Abdelli
:
Admission Control Based on WRR in WiMAX Networks. WCNC 2017: 1-6 - [c88]Mohamed Amine Kafi, Jalel Ben-Othman, Lynda Mokdad, Jean-Michel Fourneau, Nadjib Badache:
REFIACC Scheme Evaluation Using Analytical Modeling. WCNC 2017: 1-6 - [c87]Johanne Cohen, A. Fauquette, Jean-Michel Fourneau, G. C. Noukela, Nihal Pekergin:
Convex Stochastic Bounds and Stochastic Optimisation on Graphs. PASM 2017: 23-44 - 2016
- [j33]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Performance Analysis of a Queue by Combining Stochastic Bounds, Real Traffic Traces and Histograms. Comput. J. 59(12): 1817-1830 (2016) - [j32]Marziyeh Bayati, Mohammed Dahmoune, Jean-Michel Fourneau, Nihal Pekergin, Dimitrios Vekris:
A tool based on traffic traces and stochastic monotonicity to analyze data centers and their energy consumption. EAI Endorsed Trans. Energy Web 3(10): e3 (2016) - [c86]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic Bounds and Histograms for Active Queues Management and Networks Analysis. ASMTA 2016: 1-16 - [c85]Nihal Pekergin, Sovanna Tan, Jean-Michel Fourneau:
Quantitative Attack Tree Analysis: Stochastic Bounds and Numerical Analysis. GraMSec@CSF 2016: 119-133 - [c84]Jean-Michel Fourneau, Katinka Wolter:
Some Applications of Multiple Classes G-Networks with Restart. ISCIS 2016: 126-133 - [c83]Jean-Michel Fourneau, Youssef Ait El Mahjoub
, Franck Quessette, Dimitris Vekris:
XBorne 2016: A Brief Introduction. ISCIS 2016: 134-141 - [c82]Jean-Michel Fourneau, Andrea Marin, Simonetta Balsamo:
Modeling Energy Packets Networks in the Presence of Failures. MASCOTS 2016: 144-153 - [c81]Jean-Michel Fourneau, Nihal Pekergin:
Dynamic Fault Trees with Rejuvenation: Numerical Analysis and Stochastic Bounds. PASM 2016: 27-47 - 2015
- [c80]Jean-Michel Fourneau, Katinka Wolter:
Mixed Networks with Multiple Classes of Customers and Restart. ASMTA 2015: 73-86 - [c79]Jaroslaw Bylina, Jean-Michel Fourneau, Marek Karwacki, Nihal Pekergin, Franck Quessette:
Stochastic Bounds for Markov Chains with the Use of GPU. CN 2015: 357-370 - [c78]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Thierry Mautor, Nihal Pekergin:
Smoothing the Input Process in a Batch Queue. ISCIS 2015: 223-232 - [c77]Jean-Michel Fourneau:
Discrete Time Stochastic Automata Network with Steady-State Product Form Distribution. ISCIS 2015: 241-250 - [c76]Jean-Michel Fourneau:
Computing stochastic bounds of network distributions of time before failure. RNDM@WMNC 2015: 142-148 - [c75]Jean-Michel Fourneau, Nihal Pekergin:
A Numerical Analysis of Dynamic Fault Trees Based on Stochastic Bounds. QEST 2015: 176-191 - 2014
- [j31]Jean-Michel Fourneau, Nora Izri, Dominique Verchère:
Managing energy in a network of reconfigurable optical add/drop multiplexers. Int. J. Crit. Comput. Based Syst. 5(1/2): 127-147 (2014) - [c74]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Franck Quessette:
Time-Parallel Simulation for Stochastic Automata Networks and Stochastic Process Algebra. ASMTA 2014: 140-154 - [c73]Loubna Echabbi, Jean-Michel Fourneau, Franck Quessette:
Efficient Packet Selection for Deflection Routing. CN 2014: 1-13 - [c72]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Nihal Pekergin, Franck Quessette:
Time Parallel Simulation for Dynamic Fault Trees. ISCIS 2014: 337-344 - 2013
- [c71]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic Bounds and Histograms for Network Performance Analysis. EPEW 2013: 13-27 - [c70]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
A Bounding Histogram Approach for Network Performance Analysis. HPCC/EUC 2013: 458-465 - [c69]Farah Aït-Salaht, Jean-Michel Fourneau, Nihal Pekergin:
Computing Bounds of the MTTF for a Set of Markov Chains. ISCIS 2013: 67-76 - [c68]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Minh-Anh Tran:
Networks of Order Independent Queues with Signals. MASCOTS 2013: 131-140 - [c67]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Minh-Anh Tran:
Network of queues with inert customers and signals. VALUETOOLS 2013: 155-164 - [c66]Jean-Michel Fourneau, Katinka Wolter, Philipp Reinecke, Tilman Krauß, Alexandra Danilkina:
Multiple class G-networks with restart. ICPE 2013: 39-50 - 2012
- [j30]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Minh-Anh Tran:
Erratum: Multiple Class Symmetric G-networks with Phase Type Service Times. Comput. J. 55(5): 577 (2012) - [j29]Ana Busic
, Jean-Michel Fourneau:
Monotonicity and performance evaluation: applications to high speed and mobile networks. Clust. Comput. 15(4): 401-414 (2012) - [j28]Thu-Ha Dao-Thi, Jean-Michel Fourneau:
Markovian queueing network with complex synchronizations: Product form and tensor. Perform. Evaluation 69(3-4): 164-186 (2012) - [c65]Jean-Michel Fourneau, Franck Quessette:
Some Improvements for the Computation of the Steady-State Distribution of a Markov Chain by Monotone Sequences of Vectors. ASMTA 2012: 178-192 - [c64]Ana Busic
, Hilal Djafri, Jean-Michel Fourneau:
Bounded state space truncation and Censored Markov chains. CDC 2012: 5828-5833 - [c63]Jean-Michel Fourneau, Franck Quessette:
Tradeoff between Accuracy and Efficiency in the Time-Parallel Simulation of Monotone Systems. EPEW/UKPEW 2012: 80-95 - [c62]Farah Aït-Salaht, Jean-Michel Fourneau, Nihal Pekergin:
Computing Entry-Wise Bounds of the Steady-State Distribution of a Set of Markov Chains. ISCIS 2012: 115-122 - [c61]Jean-Michel Fourneau:
Product Form Solution for a Simple Control of the Power Consumption in a Service Center. ISCIS 2012: 143-150 - [c60]Jean-Michel Fourneau, Nora Izri:
Fixed-Mobile Convergence in an Optical Slot Switching Ring. ISCIS 2012: 221-229 - [c59]Farah Aït-Salaht, Johanne Cohen, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Accuracy vs. complexity: The stochastic bound approach. WODES 2012: 343-348 - 2011
- [j27]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Minh-Anh Tran:
Multiple Class Symmetric G-networks with Phase Type Service Times. Comput. J. 54(2): 274-284 (2011) - [j26]Ana Busic
, Jean-Michel Fourneau:
Iterative component-wise bounds for the steady-state distribution of a Markov chain. Numer. Linear Algebra Appl. 18(6): 1031-1049 (2011) - [j25]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Minh-Anh Tran:
G-networks with synchronised arrivals. Perform. Evaluation 68(4): 309-319 (2011) - [c58]Jean-Michel Fourneau, Franck Quessette:
Monotone Queuing Networks and Time Parallel Simulation. ASMTA 2011: 204-218 - [c57]Jean-Michel Fourneau, Franck Quessette:
Monotonicity and Efficient Computation of Bounds with Time Parallel Simulation. EPEW 2011: 57-71 - [c56]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Minh-Anh Tran:
Multi-class Network with Phase Type Service Time and Group Deletion Signal. EPEW 2011: 189-203 - [c55]Jean-Michel Fourneau, Imène Kadi, Franck Quessette:
Time Parallel Simulation and hv-Monotonicity. ISCIS 2011: 201-207 - 2010
- [j24]Jean-Michel Fourneau, Lynda Mokdad, Nihal Pekergin:
Stochastic bounds for performance evaluation of Web services. Concurr. Comput. Pract. Exp. 22(10): 1286-1307 (2010) - [j23]Jean-Michel Fourneau:
Collaboration of discrete-time Markov chains: Tensor and product form. Perform. Evaluation 67(9): 779-796 (2010) - [c54]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Minh-Anh Tran:
Networks of Symmetric Multi-class Queues with Signals Changing Classes. ASMTA 2010: 72-86 - [c53]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Imène Kadi:
Monotone time parallel simulation of a Web server. ISCC 2010: 1097-1102 - [c52]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Minh-Anh Tran:
Multiple Class Symmetric G-networks with Phase Type. ISCIS 2010: 51-56 - [c51]Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic comparisons applied to G-Networks with catastrophes. ISCIS 2010: 57-60 - [c50]Ana Busic
, Jean-Michel Fourneau:
A Toolbox for Component-Wise Bounds for Steady-State Distribution of a DTMC. QEST 2010: 81-82
2000 – 2009
- 2009
- [j22]Dominique Barth, Pascal Berthomé, Dominique Chiaroni, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial:
Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks. JOCN 1(3): 222-234 (2009) - [c49]Thu-Ha Dao-Thi, Jean-Michel Fourneau:
Stochastic Automata Networks with Master/Slave Synchronization: Product Form and Tensor. ASMTA 2009: 279-293 - [c48]Jean-Michel Fourneau, Imène Kadi, Nihal Pekergin:
Improving Time Parallel Simulation for Monotone Systems. DS-RT 2009: 231-234 - [c47]Jean-Michel Fourneau, Lynda Mokdad, Nihal Pekergin:
Stochastic bounds for performance evaluation of web services. ISCC 2009: 7-12 - [c46]Jean-Michel Fourneau, Nora Izri, Dominique Verchère:
Analysis and Optimization of Aggregation in a Reconfigurable Optical ADD/DROP Multiplexer. NEW2AN 2009: 120-131 - [c45]Thu-Ha Dao-Thi, Jean-Michel Fourneau:
Complex synchronizations in Markovian models: a tensor-based proof of product form. VALUETOOLS 2009: 50 - 2008
- [j21]Mouad Ben Mamoun, Jean-Michel Fourneau, Nihal Pekergin:
Analyzing Weighted Round Robin policies with a stochastic comparison approach. Comput. Oper. Res. 35(8): 2420-2431 (2008) - [j20]Jean-Michel Fourneau, Brigitte Plateau, William J. Stewart:
An algebraic condition for product form in stochastic automata networks without synchronizations. Perform. Evaluation 65(11-12): 854-868 (2008) - [j19]Ireneusz Szczesniak, Tadeusz Czachórski
, Jean-Michel Fourneau:
Packet loss analysis in optical packet-switched networks with limited deflection routing. Photonic Netw. Commun. 16(3): 253-261 (2008) - [c44]Jean-Michel Fourneau:
Multiclass G-Networks of Processor Sharing Queues with Resets. ASMTA 2008: 221-233 - [c43]Jean-Michel Fourneau:
Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations. EPEW 2008: 110-124 - [c42]Ana Busic
, Jean-Michel Fourneau:
Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach. EPEW 2008: 227-241 - [c41]Jean-Michel Fourneau:
Discrete Time Markov Chains Competing over Resources: Product Form Steady-State Distribution. QEST 2008: 147-156 - [c40]Tadeusz Czachórski
, Jean-Michel Fourneau, Tomasz Nycz, Ferhan Pekergin:
Diffusion Approximation Model of Multiserver Stations with Losses. PASM@EPEW 2008: 125-143 - [c39]Leonardo Brenner, Paulo Fernandes
, Jean-Michel Fourneau, Brigitte Plateau:
Modelling Grid5000 point availability with SAN. PASM@EPEW 2008: 165-178 - 2007
- [c38]Jean-Michel Fourneau, Lynda Mokdad, Nihal Pekergin, Samir Youcef:
Stochastic Bounds for Loss Rates. AICT 2007: 9 - [c37]Jean-Michel Fourneau, Nihal Pekergin, Sana Younès:
Censoring Markov Chains and Stochastic Bounds. EPEW 2007: 213-227 - [c36]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 - [c35]Jean-Michel Fourneau:
Closed G-networks with Resets: product form solution. QEST 2007: 287-296 - [c34]Jean-Michel Fourneau, Brigitte Plateau, William J. Stewart:
Product form for stochastic automata networks. VALUETOOLS 2007: 32 - [c33]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 - [c32]Jean-Michel Fourneau, Imène Kadi, Nihal Pekergin, Jérôme Vienne, Jean-Marc Vincent:
Perfect simulation and monotone stochastic bounds. VALUETOOLS 2007: 65 - [c31]Jean-Michel Fourneau:
Discrete time stochastic automata networks: using structural properties and stochastic bounds to simplify the SAN. VALUETOOLS 2007: 84 - 2006
- [j18]Ana Busic
, Jean-Michel Fourneau:
Bounding transient and steady-state dependability measures through algorithmic stochastic comparison. SIGMETRICS Perform. Evaluation Rev. 34(2): 11-12 (2006) - [c30]Jean-Michel Fourneau, Leïla Kloul:
A Precedence PEPA Model for Performance and Reliability Analysis. EPEW 2006: 1-15 - [c29]Ana Busic
, Jean-Michel Fourneau, Nihal Pekergin:
Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering. EPEW 2006: 196-210 - [c28]Jean-Michel Fourneau, Franck Quessette:
Computing the Steady-State Distribution of G-networks with Synchronized Partial Flushing. ISCIS 2006: 887-896 - [c27]Ana Busic
, Jean-Michel Fourneau, David J. Nott:
Deflection Routing on a Torus Is Monotone. POSTA 2006: 161-168 - [c26]Ana Busic
, Mouad Ben Mamoun, Jean-Michel Fourneau:
Modeling Fiber Delay Loops in an All Optical Switch. QEST 2006: 93-102 - 2005
- [c25]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 - [c24]Jean-Michel Fourneau, Tadeusz Czachórski:
Transport Time Distribution for Deflection Routing on an Odd Torus. Euro-Par 2005: 975-983 - [c23]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 - [c22]Ana Busic
, Jean-Michel Fourneau:
A Matrix Pattern Compliant Strong Stochastic Bound. SAINT Workshops 2005: 260-263 - [c21]Jean-Michel Fourneau, Nihal Pekergin, Sana Younès:
Improving Stochastic Model Checking with Stochastic Bounds. SAINT Workshops 2005: 264-267 - [c20]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 - [c19]Jean-Michel Fourneau, David J. Nott:
Convergence Routing under Bursty Traffic: Instability and an AIMD Controller. PASM@FM 2005: 97-109 - 2004
- [j17]Jean-Michel Fourneau, Erol Gelenbe:
Flow equivalence and stochastic equivalence in G-networks. Comput. Manag. Sci. 1(2): 179-192 (2004) - [c18]Jean-Michel Fourneau, David J. Nott:
Mixed Routing for ROMEO Optical Burst. ISCIS 2004: 257-266 - 2003
- [j16]Oleg Gusak, Tugrul Dayar
, Jean-Michel Fourneau:
Lumpable continuous-time stochastic automata networks. Eur. J. Oper. Res. 148(2): 436-451 (2003) - [j15]Oleg Gusak, Tugrul Dayar
, Jean-Michel Fourneau:
Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks. Perform. Evaluation 53(1): 43-69 (2003) - [j14]Tugrul Dayar
, Jean-Michel Fourneau, Nihal Pekergin:
Transforming stochastic matrices for stochastic comparison with the st-order. RAIRO Oper. Res. 37(2): 85-97 (2003) - [c17]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- - 2002
- [j13]Erol Gelenbe, Jean-Michel Fourneau:
G-networks with resets. Perform. Evaluation 49(1/4): 179-191 (2002) - [j12]Jean-Michel Fourneau, Leïla Kloul, Fabrice Valois:
Performance modelling of hierarchical cellular networks using PEPA. Perform. Evaluation 50(2/3): 83-99 (2002) - [c16]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 - [c15]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 - [c14]Jean-Michel Fourneau, Nihal Pekergin:
An Algorithmic Approach to Stochastic Bounds. Performance 2002: 64-88 - 2001
- [j11]Oleg Gusak, Tugrul Dayar
, Jean-Michel Fourneau:
Stochastic Automata Networks and Near Complete Decomposability. SIAM J. Matrix Anal. Appl. 23(2): 581-599 (2001) - [j10]Jean-Michel Fourneau, Erol Gelenbe:
G-networks with resets. SIGMETRICS Perform. Evaluation Rev. 29(3): 19-20 (2001) - 2000
- [j9]Jean-Michel Fourneau, Leïla Kloul, Dominique Verchère:
Multiple class G-networks with list-oriented deletions. Eur. J. Oper. Res. 126(2): 250-272 (2000) - [j8]Jean-Michel Fourneau, Leïla Kloul, Franck Quessette:
Multiple class G-networks with iterated deletions. Perform. Evaluation 42(1): 1-20 (2000) - [j7]Jean-Michel Fourneau, Dominique Verchère:
G-Réseaux dans un environnement aléatoire. RAIRO Oper. Res. 34(4): 427-448 (2000)
1990 – 1999
- 1999
- [j6]Erol Gelenbe
, Jean-Michel Fourneau:
Random Neural Networks with Multiple Classes of Signals. Neural Comput. 11(4): 953-963 (1999) - 1998
- [c13]Jean-Michel Fourneau, Lynda Mokdad:
A Perturbation and Reduction Based Algorithm. Computer Performance Evaluation (Tools) 1998: 142-153 - [c12]Corentin Durbach, Jean-Michel Fourneau:
Performance Evaluation of a Dead Reckoning Mechanism. DIS-RT 1998: 23- - 1997
- [c11]Jean-Michel Fourneau, Lynda Mokdad, Nihal Pekergin:
Bounding the Loss Rates in a Multistage ATM Switch. Computer Performance Evaluation 1997: 193-205 - 1996
- [j5]Jean-Michel Fourneau, Erol Gelenbe
, Rina Surós:
G-Networks with Multiple Classes of Negative and Positive Customers. Theor. Comput. Sci. 155(1): 141-156 (1996) - [c10]Jean-Michel Fourneau, Nihal Pekergin, H. Taleb:
Stochastic Bounds and Q0S Application To The Loss Rates in ATM Networks. ESM 1996: 861-866 - 1995
- [c9]Jean-Michel Fourneau, Leïla Kloul, Franck Quessette:
Multiple Class G-Networks with Jumps back to Zero. MASCOTS 1995: 28-32 - [c8]Jean-Michel Fourneau, Dominique Verchère:
G-Networks with Triggered Batch State-Dependent Movement. MASCOTS 1995: 33-37 - [c7]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
- [c6]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 - [c5]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 - [c4]Jean-Michel Fourneau, Erol Gelenbe, Rina Surós:
G-Networks with Multiple Class Negative and Positive Customers. MASCOTS 1994: 30-34 - 1993
- [c3]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
- [c2]Tadeusz Czachórski
, Jean-Michel Fourneau, Ferhan Pekergin:
Diffusion Model of the Push-out Buffer Management Policy. INFOCOM 1992: 252-261 - [p1]Jean-Michel Fourneau, Erol Gelenbe:
Multiple class G-Networks. Computer Science and Operations Research 1992: 149-157 - 1991
- [j4]Brigitte Plateau, Jean-Michel Fourneau:
A Methodology for Solving Markov Models of Parallel Systems. J. Parallel Distributed Comput. 12(4): 370-387 (1991)
1980 – 1989
- 1989
- [j3]Jean-Claude Bermaud, Jean-Michel Fourneau, Alain Jean-Marie:
A graph theoretical approach to equivalence of multistage interconnection networks. Discret. Appl. Math. 22(3): 201-214 (1989) - [j2]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
- [c1]Jean-Claude Bermond, Jean-Michel Fourneau:
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. ICPP (1) 1988: 187-190 - 1987
- [j1]Jean-Claude Bermond, Jean-Michel Fourneau, Alain Jean-Marie:
Equivalence of Multistage Interconnection Networks. Inf. Process. Lett. 26(1): 45-50 (1987)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint