Publications équipe EPRI - 2009 à 2012

  1. Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, Dominique Barth and Sandrine Vial. Indexing in-Network Trajectory Flows. The VLDB Journal - The International Journal on Very Large Data Bases 20(5):643-669, 2011. BibTeX

    @article{SZOB11,
    	author = "Sandu Popa, Iulian and Zeitouni, Karine and Oria, Vincent and Barth, Dominique and Vial, Sandrine",
    	title = "{Indexing in-Network Trajectory Flows}",
    	journal = "{The VLDB Journal - The International Journal on Very Large Data Bases}",
    	year = "{2011}",
    	volume = "{20}",
    	pages = "{643-669}",
    	number = "{5}",
    	owner = "MOIS",
    	timestamp = "2011.08.16"
    }
    
  2. Imene Kadi. Simulation et monotonie. Université de Versailles-Saint-Quentin en Yvelines, laboratoire PRISM, 2011. BibTeX

    @phdthesis{Kadi11,
    	author = "Kadi, Imene",
    	title = "{Simulation et monotonie}",
    	school = "{Université de Versailles-Saint-Quentin en Yvelines, laboratoire PRISM}",
    	year = "{2011}",
    	owner = "MOIS",
    	timestamp = "2012.02.22"
    }
    
  3. Jean-Michel Fourneau and Franck Quessette. Monotonicity and Efficient Computation of Bounds with Time Parallel Simulation. In 8th European Performance Engineering Workshop - EPEW 2011 6977. 2011, 57-71. BibTeX

    @inproceedings{FoQu11a,
    	author = "Fourneau, Jean-Michel and Quessette, Franck",
    	title = "{Monotonicity and Efficient Computation of Bounds with Time Parallel Simulation}",
    	booktitle = "{8th European Performance Engineering Workshop - EPEW 2011}",
    	year = "{2011}",
    	volume = "{6977}",
    	series = "{Lecture Notes in Computer Science (LNCS)}",
    	pages = "{57-71}",
    	address = "{Borrowdale, United-Kingdom}",
    	month = "{October 12-13}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2012.02.10"
    }
    
  4. Jean-Michel Fourneau and Franck Quessette. Monotone Queuing Networks and Time Parallel Simulation. In 18th International Conferene on Analytical and Stochastic Modeling Techniques and Aplications - ASMTA 2011. 2011, 204-218.
    Abstract We show how we can make more efficient the time parallel simulation of some queueing networks. We had previously introduced some improvements of two classical time parallel simulation approaches: the precomputation of states at specific time instants and the fix-up computations. We have proved that we can obtain more parallelism using monotonicity on input sequences or on the initial states of the simulation parts and obtain quickly a bound of the sample-path. Here we apply the fixed up computations approach to the time parallel simulation of queueing networks with general service times and complex routing disciplines. This approach is based on the theory of monotone models of simulation. We establish that our models are monotone and we show how we obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well. BibTeX

    @inproceedings{FoQu11,
    	author = "Fourneau, Jean-Michel and Quessette, Franck",
    	title = "{Monotone Queuing Networks and Time Parallel Simulation}",
    	booktitle = "{18th International Conferene on Analytical and Stochastic Modeling Techniques and Aplications - ASMTA 2011}",
    	year = "{2011}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{204-218}",
    	address = "{Venice, Italy}",
    	month = "{20-22 June}",
    	publisher = "{Springer}",
    	abstract = "We show how we can make more efficient the time parallel simulation of some queueing networks. We had previously introduced some improvements of two classical time parallel simulation approaches: the precomputation of states at specific time instants and the fix-up computations. We have proved that we can obtain more parallelism using monotonicity on input sequences or on the initial states of the simulation parts and obtain quickly a bound of the sample-path. Here we apply the fixed up computations approach to the time parallel simulation of queueing networks with general service times and complex routing disciplines. This approach is based on the theory of monotone models of simulation. We establish that our models are monotone and we show how we obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well.",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  5. Jean-Michel Fourneau, Imène Kadi and Franck Quessette. Time Parallel Simulation and hv-Monotonicity. In 26th International Symposium on Computer and Information Sciences. 2011, 201-207. BibTeX

    @inproceedings{FKQu11,
    	author = "Fourneau, Jean-Michel and Kadi, Imène and Quessette, Franck",
    	title = "{Time Parallel Simulation and hv-Monotonicity}",
    	booktitle = "{26th International Symposium on Computer and Information Sciences}",
    	year = "{2011}",
    	pages = "{201-207}",
    	address = "{London, United-Kingdom}",
    	month = "{26-28 September 2011}",
    	owner = "MOIS",
    	timestamp = "2011.11.28"
    }
    
  6. Jean-Michel Fourneau, Nora Izri and Dominique Verchere. A Tool to Model Traffic Aggregation in Networks of Reconfigurable Optical ADD/DROP Multiplexers vecos2011ROADM;pdf. In 5th International Workshop on Verification and Evaluation of Computer and Communication Systems, VECoS 2011. 2011. BibTeX

    @inproceedings{FIVe11,
    	author = "Fourneau, Jean-Michel and Izri, Nora and Verchere, Dominique",
    	title = "{A Tool to Model Traffic Aggregation in Networks of Reconfigurable Optical ADD/DROP Multiplexers vecos2011ROADM;pdf}",
    	booktitle = "{5th International Workshop on Verification and Evaluation of Computer and Communication Systems, VECoS 2011}",
    	year = "{2011}",
    	owner = "MOIS",
    	timestamp = "2012.11.08"
    }
    
  7. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. G-Networks with Synchronised Arrivals. Performance Evaluation 68(4):309-319, 2011. BibTeX

    @article{DFTr11b,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{G-Networks with Synchronised Arrivals}",
    	journal = "{Performance Evaluation}",
    	year = "{2011}",
    	volume = "{68}",
    	pages = "{309-319}",
    	number = "{4}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  8. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. Multi-class Network with Phase Type Service Time and Group Deletion Signal. In 8th European Performance Engineering Workshop - EPEW 2011 6977. 2011, 189-203. BibTeX

    @inproceedings{DFTr11a,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{Multi-class Network with Phase Type Service Time and Group Deletion Signal}",
    	booktitle = "{8th European Performance Engineering Workshop - EPEW 2011}",
    	year = "{2011}",
    	volume = "{6977}",
    	series = "{Lecture Notes in Computer Science (LNCS)}",
    	pages = "{189-203}",
    	address = "{Borrowdale, The English Lake District, Cumbria, Keswick, United-Kingdom}",
    	month = "{12th and 13th October 2011}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2011.08.18"
    }
    
  9. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. Multiple Class Symmetric G-networks with Phase Type Service Times. The Computer Journal 54(2):274-284, 2011. BibTeX

    @article{DFTr11,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{Multiple Class Symmetric G-networks with Phase Type Service Times}",
    	journal = "{The Computer Journal}",
    	year = "{2011}",
    	volume = "{54}",
    	pages = "{274-284}",
    	number = "{2}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  10. Ana Busic and Jean-Michel Fourneau. Iterative Component-Wise Bounds for the Steady-State Distribution of a Markov Chain. Numerical Linear Algebra with Applications 18(6):1031-1049, 2011. BibTeX

    @article{BuFo11,
    	author = "Busic, Ana and Fourneau, Jean-Michel",
    	title = "{Iterative Component-Wise Bounds for the Steady-State Distribution of a Markov Chain}",
    	journal = "{Numerical Linear Algebra with Applications}",
    	year = "{2011}",
    	volume = "{18}",
    	pages = "{1031-1049}",
    	number = "{6}",
    	comment = "John Wiley \& Sons, Ltd",
    	owner = "MOIS",
    	timestamp = "2011.12.13"
    }
    
  11. Dominique Barth, Samir Bellahsene and Leila Kloul. Mobility Prediction Using Mobile User Profiles. In 2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems - MASCOTS 2011. 2011, 286-294.
    Abstract In this paper we propose a new approach for mobility prediction. It is based on the notion of mobile-user profile which corresponds to frequent similar movements of a user. Such a profile is defined, in the neighbourhood graph of a cellular network, as a set of similar sequences of crossed cells from one source cell to one destination cell. We propose an algorithmic approach to identify such profiles from real cellular network datasets and we show how to use them for an efficient mobility prediction. Simulation results show that the global approach is significantly efficient in predicting both random and regular movements. BibTeX

    @inproceedings{BBKl11,
    	author = "Barth, Dominique and Bellahsene, Samir and Kloul, Leila",
    	title = "{Mobility Prediction Using Mobile User Profiles}",
    	booktitle = "{2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems - MASCOTS 2011}",
    	year = "{2011}",
    	pages = "{286-294}",
    	address = "{Raffles Hotel, Singapore}",
    	month = "{July 25 -27, 2011}",
    	abstract = "In this paper we propose a new approach for mobility prediction. It is based on the notion of mobile-user profile which corresponds to frequent similar movements of a user. Such a profile is defined, in the neighbourhood graph of a cellular network, as a set of similar sequences of crossed cells from one source cell to one destination cell. We propose an algorithmic approach to identify such profiles from real cellular network datasets and we show how to use them for an efficient mobility prediction. Simulation results show that the global approach is significantly efficient in predicting both random and regular movements.",
    	owner = "MOIS",
    	timestamp = "2011.11.30"
    }
    
  12. Gilles Dowek (ed.). Une introduction à la science informatique : pour les enseignants de la discipline informatique au lycée. CNDP-CRDP edition, series Repères pour Agir, SCérEN, 2011. BibTeX

    @book{ABB+11,
    	title = "{Une introduction à la science informatique : pour les enseignants de la discipline informatique au lycée}",
    	publisher = "{SCérEN}",
    	year = "{2011}",
    	editor = "Dowek, Gilles",
    	author = "Archambault, Jean-Pierre and Barcelli, Emmanuel and Boldo, Sylvie and Bouhineau, Denis and Cégielski, Patrick and Clausen, Thomas and Dowek, Gilles and Guessarian, Irène and Lopes, Stephane and Mounier, Laurent and Nguyen, Benjamin and Quessette, Franck and Rasse, Anne and Rozoy, Brigitte and Timsit, Claude and Viéville, Thierry and Vincent, Jean-Marc",
    	pages = "{375}",
    	series = "{Repères pour Agir}",
    	address = "{Paris}",
    	edition = "{CNDP-CRDP}",
    	owner = "MOIS",
    	timestamp = "2011.12.14"
    }
    

  1. Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, Dominique Barth and Sandrine Vial. Indexing in-Network Trajectory Flows. The VLDB Journal - The International Journal on Very Large Data Bases 20(5):643-669, 2011. BibTeX

    @article{SZOB11,
    	author = "Sandu Popa, Iulian and Zeitouni, Karine and Oria, Vincent and Barth, Dominique and Vial, Sandrine",
    	title = "{Indexing in-Network Trajectory Flows}",
    	journal = "{The VLDB Journal - The International Journal on Very Large Data Bases}",
    	year = "{2011}",
    	volume = "{20}",
    	pages = "{643-669}",
    	number = "{5}",
    	owner = "MOIS",
    	timestamp = "2011.08.16"
    }
    
  2. Imene Kadi. Simulation et monotonie. Université de Versailles-Saint-Quentin en Yvelines, laboratoire PRISM, 2011. BibTeX

    @phdthesis{Kadi11,
    	author = "Kadi, Imene",
    	title = "{Simulation et monotonie}",
    	school = "{Université de Versailles-Saint-Quentin en Yvelines, laboratoire PRISM}",
    	year = "{2011}",
    	owner = "MOIS",
    	timestamp = "2012.02.22"
    }
    
  3. Jean-Michel Fourneau and Franck Quessette. Monotonicity and Efficient Computation of Bounds with Time Parallel Simulation. In 8th European Performance Engineering Workshop - EPEW 2011 6977. 2011, 57-71. BibTeX

    @inproceedings{FoQu11a,
    	author = "Fourneau, Jean-Michel and Quessette, Franck",
    	title = "{Monotonicity and Efficient Computation of Bounds with Time Parallel Simulation}",
    	booktitle = "{8th European Performance Engineering Workshop - EPEW 2011}",
    	year = "{2011}",
    	volume = "{6977}",
    	series = "{Lecture Notes in Computer Science (LNCS)}",
    	pages = "{57-71}",
    	address = "{Borrowdale, United-Kingdom}",
    	month = "{October 12-13}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2012.02.10"
    }
    
  4. Jean-Michel Fourneau and Franck Quessette. Monotone Queuing Networks and Time Parallel Simulation. In 18th International Conferene on Analytical and Stochastic Modeling Techniques and Aplications - ASMTA 2011. 2011, 204-218.
    Abstract We show how we can make more efficient the time parallel simulation of some queueing networks. We had previously introduced some improvements of two classical time parallel simulation approaches: the precomputation of states at specific time instants and the fix-up computations. We have proved that we can obtain more parallelism using monotonicity on input sequences or on the initial states of the simulation parts and obtain quickly a bound of the sample-path. Here we apply the fixed up computations approach to the time parallel simulation of queueing networks with general service times and complex routing disciplines. This approach is based on the theory of monotone models of simulation. We establish that our models are monotone and we show how we obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well. BibTeX

    @inproceedings{FoQu11,
    	author = "Fourneau, Jean-Michel and Quessette, Franck",
    	title = "{Monotone Queuing Networks and Time Parallel Simulation}",
    	booktitle = "{18th International Conferene on Analytical and Stochastic Modeling Techniques and Aplications - ASMTA 2011}",
    	year = "{2011}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{204-218}",
    	address = "{Venice, Italy}",
    	month = "{20-22 June}",
    	publisher = "{Springer}",
    	abstract = "We show how we can make more efficient the time parallel simulation of some queueing networks. We had previously introduced some improvements of two classical time parallel simulation approaches: the precomputation of states at specific time instants and the fix-up computations. We have proved that we can obtain more parallelism using monotonicity on input sequences or on the initial states of the simulation parts and obtain quickly a bound of the sample-path. Here we apply the fixed up computations approach to the time parallel simulation of queueing networks with general service times and complex routing disciplines. This approach is based on the theory of monotone models of simulation. We establish that our models are monotone and we show how we obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well.",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  5. Jean-Michel Fourneau, Imène Kadi and Franck Quessette. Time Parallel Simulation and hv-Monotonicity. In 26th International Symposium on Computer and Information Sciences. 2011, 201-207. BibTeX

    @inproceedings{FKQu11,
    	author = "Fourneau, Jean-Michel and Kadi, Imène and Quessette, Franck",
    	title = "{Time Parallel Simulation and hv-Monotonicity}",
    	booktitle = "{26th International Symposium on Computer and Information Sciences}",
    	year = "{2011}",
    	pages = "{201-207}",
    	address = "{London, United-Kingdom}",
    	month = "{26-28 September 2011}",
    	owner = "MOIS",
    	timestamp = "2011.11.28"
    }
    
  6. Jean-Michel Fourneau, Nora Izri and Dominique Verchere. A Tool to Model Traffic Aggregation in Networks of Reconfigurable Optical ADD/DROP Multiplexers vecos2011ROADM;pdf. In 5th International Workshop on Verification and Evaluation of Computer and Communication Systems, VECoS 2011. 2011. BibTeX

    @inproceedings{FIVe11,
    	author = "Fourneau, Jean-Michel and Izri, Nora and Verchere, Dominique",
    	title = "{A Tool to Model Traffic Aggregation in Networks of Reconfigurable Optical ADD/DROP Multiplexers vecos2011ROADM;pdf}",
    	booktitle = "{5th International Workshop on Verification and Evaluation of Computer and Communication Systems, VECoS 2011}",
    	year = "{2011}",
    	owner = "MOIS",
    	timestamp = "2012.11.08"
    }
    
  7. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. G-Networks with Synchronised Arrivals. Performance Evaluation 68(4):309-319, 2011. BibTeX

    @article{DFTr11b,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{G-Networks with Synchronised Arrivals}",
    	journal = "{Performance Evaluation}",
    	year = "{2011}",
    	volume = "{68}",
    	pages = "{309-319}",
    	number = "{4}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  8. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. Multi-class Network with Phase Type Service Time and Group Deletion Signal. In 8th European Performance Engineering Workshop - EPEW 2011 6977. 2011, 189-203. BibTeX

    @inproceedings{DFTr11a,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{Multi-class Network with Phase Type Service Time and Group Deletion Signal}",
    	booktitle = "{8th European Performance Engineering Workshop - EPEW 2011}",
    	year = "{2011}",
    	volume = "{6977}",
    	series = "{Lecture Notes in Computer Science (LNCS)}",
    	pages = "{189-203}",
    	address = "{Borrowdale, The English Lake District, Cumbria, Keswick, United-Kingdom}",
    	month = "{12th and 13th October 2011}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2011.08.18"
    }
    
  9. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. Multiple Class Symmetric G-networks with Phase Type Service Times. The Computer Journal 54(2):274-284, 2011. BibTeX

    @article{DFTr11,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{Multiple Class Symmetric G-networks with Phase Type Service Times}",
    	journal = "{The Computer Journal}",
    	year = "{2011}",
    	volume = "{54}",
    	pages = "{274-284}",
    	number = "{2}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  10. Ana Busic and Jean-Michel Fourneau. Iterative Component-Wise Bounds for the Steady-State Distribution of a Markov Chain. Numerical Linear Algebra with Applications 18(6):1031-1049, 2011. BibTeX

    @article{BuFo11,
    	author = "Busic, Ana and Fourneau, Jean-Michel",
    	title = "{Iterative Component-Wise Bounds for the Steady-State Distribution of a Markov Chain}",
    	journal = "{Numerical Linear Algebra with Applications}",
    	year = "{2011}",
    	volume = "{18}",
    	pages = "{1031-1049}",
    	number = "{6}",
    	comment = "John Wiley \& Sons, Ltd",
    	owner = "MOIS",
    	timestamp = "2011.12.13"
    }
    
  11. Dominique Barth, Samir Bellahsene and Leila Kloul. Mobility Prediction Using Mobile User Profiles. In 2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems - MASCOTS 2011. 2011, 286-294.
    Abstract In this paper we propose a new approach for mobility prediction. It is based on the notion of mobile-user profile which corresponds to frequent similar movements of a user. Such a profile is defined, in the neighbourhood graph of a cellular network, as a set of similar sequences of crossed cells from one source cell to one destination cell. We propose an algorithmic approach to identify such profiles from real cellular network datasets and we show how to use them for an efficient mobility prediction. Simulation results show that the global approach is significantly efficient in predicting both random and regular movements. BibTeX

    @inproceedings{BBKl11,
    	author = "Barth, Dominique and Bellahsene, Samir and Kloul, Leila",
    	title = "{Mobility Prediction Using Mobile User Profiles}",
    	booktitle = "{2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems - MASCOTS 2011}",
    	year = "{2011}",
    	pages = "{286-294}",
    	address = "{Raffles Hotel, Singapore}",
    	month = "{July 25 -27, 2011}",
    	abstract = "In this paper we propose a new approach for mobility prediction. It is based on the notion of mobile-user profile which corresponds to frequent similar movements of a user. Such a profile is defined, in the neighbourhood graph of a cellular network, as a set of similar sequences of crossed cells from one source cell to one destination cell. We propose an algorithmic approach to identify such profiles from real cellular network datasets and we show how to use them for an efficient mobility prediction. Simulation results show that the global approach is significantly efficient in predicting both random and regular movements.",
    	owner = "MOIS",
    	timestamp = "2011.11.30"
    }
    
  12. Gilles Dowek (ed.). Une introduction à la science informatique : pour les enseignants de la discipline informatique au lycée. CNDP-CRDP edition, series Repères pour Agir, SCérEN, 2011. BibTeX

    @book{ABB+11,
    	title = "{Une introduction à la science informatique : pour les enseignants de la discipline informatique au lycée}",
    	publisher = "{SCérEN}",
    	year = "{2011}",
    	editor = "Dowek, Gilles",
    	author = "Archambault, Jean-Pierre and Barcelli, Emmanuel and Boldo, Sylvie and Bouhineau, Denis and Cégielski, Patrick and Clausen, Thomas and Dowek, Gilles and Guessarian, Irène and Lopes, Stephane and Mounier, Laurent and Nguyen, Benjamin and Quessette, Franck and Rasse, Anne and Rozoy, Brigitte and Timsit, Claude and Viéville, Thierry and Vincent, Jean-Marc",
    	pages = "{375}",
    	series = "{Repères pour Agir}",
    	address = "{Paris}",
    	edition = "{CNDP-CRDP}",
    	owner = "MOIS",
    	timestamp = "2011.12.14"
    }
    

  1. Franck Quessette, Sandrine Vial, Nicolas Peyret-Forcade, Dominique Barth, Francis Taulelle and Charlotte Martineau. 1D and 2D NMR as Graph Invariant of Zeolite Topologies. In Smarter Cristallography Conference. 2012. BibTeX

    @inproceedings{QVP+12,
    	author = "Quessette, Franck and Vial, Sandrine and Peyret-Forcade, Nicolas and Barth, Dominique and Taulelle, Francis and Martineau, Charlotte",
    	title = "{1D and 2D NMR as Graph Invariant of Zeolite Topologies}",
    	booktitle = "{Smarter Cristallography Conference}",
    	year = "{2012}",
    	owner = "MOIS",
    	timestamp = "2012.12.10"
    }
    
  2. Alexis Lamiable, Dominique Barth, Alain Denise, Franck Quessette, Sandrine Vial and Éric Westhof. Automated Prediction of Three-way Junction Topological Families in RNA Secondary Structures. Computational Biology and Chemistery 37:1-5, 2012. BibTeX

    @article{LBD+12,
    	author = "Lamiable, Alexis and Barth, Dominique and Denise, Alain and Quessette, Franck and Vial, Sandrine and Westhof, {\'E}ric",
    	title = "{Automated Prediction of Three-way Junction Topological Families in RNA Secondary Structures}",
    	journal = "{Computational Biology and Chemistery}",
    	year = "{2012}",
    	volume = "{37}",
    	pages = "{1-5}",
    	owner = "MOIS",
    	timestamp = "2012.10.02"
    }
    
  3. Mohamed Lamine Lamali, Dominique Barth and Johanne Cohen. Reputation-Aware Learning for SLA Negotiation. In Zdenek Becvar, Robert Bestak and Lucas Kencl (eds.). NETWORKINGS 2012 Workshops - International IFIP TC 6 Workshops, ETICS, HetsNets, and CompNets Held at NETWORKING 2012, Prague, Czech Republic, May 2012, Proceedings 7291. 2012, 80-88. BibTeX

    @inproceedings{LBCo12,
    	author = "Lamali, Mohamed Lamine and Barth, Dominique and Cohen, Johanne",
    	title = "{Reputation-Aware Learning for SLA Negotiation}",
    	booktitle = "{NETWORKINGS 2012 Workshops - International IFIP TC 6 Workshops, ETICS, HetsNets, and CompNets Held at NETWORKING 2012, Prague, Czech Republic, May 2012, Proceedings}",
    	year = "{2012}",
    	editor = "Becvar, Zdenek and Bestak, Robert and Kencl, Lucas",
    	volume = "{7291}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{80-88}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2012.11.08"
    }
    
  4. Fabrice Jossinet, Alexis Lamiable, Philippe Rinaudo, Liza Al-Shikhley, Franck Quessette, Sandrine Vial, Dominique Barth, Eric Westhof and Alain Denise. Graph Algorithms and Software Framework for Interactive RNA Structure Modelling. In JOBIM (JournÃ@es Ouvertes Biologie Informatique MathÃ@matiques]. 2012. BibTeX

    @inproceedings{JLR+12,
    	author = "Jossinet, Fabrice and Lamiable, Alexis and Rinaudo, Philippe and Al-Shikhley, Liza and Quessette, Franck and Vial, Sandrine and Barth, Dominique and Westhof, Eric and Denise, Alain",
    	title = "{Graph Algorithms and Software Framework for Interactive RNA Structure Modelling}",
    	booktitle = "{JOBIM (JournÃ@es Ouvertes Biologie Informatique MathÃ@matiques]}",
    	year = "{2012}",
    	owner = "MOIS",
    	timestamp = "2012.10.03"
    }
    
  5. Nora Izri. Evaluation de performances des réseaux tout optques à topologie en anneau. Université de Versailles-Saint-Quentin-en-Yvelines, laboratoire Prism, 2012. BibTeX

    @phdthesis{Izri12,
    	author = "Izri, Nora",
    	title = "{Evaluation de performances des réseaux tout optques à topologie en anneau}",
    	school = "{Université de Versailles-Saint-Quentin-en-Yvelines, laboratoire Prism}",
    	year = "{2012}",
    	owner = "MOIS",
    	timestamp = "2012.06.14"
    }
    
  6. Jean-Michel Fourneau. Product Form Solution for a Simple Control of the Power Consumption in a Service Center. In 27th International Symposium on Computer and information Sciences. 2012, 143-150. BibTeX

    @inproceedings{Four12,
    	author = "Fourneau, Jean-Michel",
    	title = "{Product Form Solution for a Simple Control of the Power Consumption in a Service Center}",
    	booktitle = "{27th International Symposium on Computer and information Sciences}",
    	year = "{2012}",
    	pages = "{143-150}",
    	owner = "MOIS",
    	timestamp = "2012.12.05"
    }
    
  7. Jean-Michel Fourneau and Franck Quessette. Some Improvements for the Computation of the Steady-State Distribution of a Markov Chain by Monotone Sequences of Vectors. In Jean-Marc Vincent (Eds.): Khalid Al-Begain Dieter Fiems (ed.). ASMTA 2012 Analytical and Stochastic Modeling Techniques and Applications - 19th International Conference, ASMTA 2012, Grenoble, France, June 4-6, 2012 7314. 2012, 178-192. BibTeX

    @inproceedings{FoQu12,
    	author = "Fourneau, Jean-Michel and Quessette, Franck",
    	title = "{Some Improvements for the Computation of the Steady-State Distribution of a Markov Chain by Monotone Sequences of Vectors}",
    	booktitle = "{ASMTA 2012 Analytical and Stochastic Modeling Techniques and Applications - 19th International Conference, ASMTA 2012, Grenoble, France, June 4-6, 2012}",
    	year = "{2012}",
    	editor = "Khalid Al-Begain, Dieter Fiems, Jean-Marc Vincent (Eds.):",
    	volume = "{7314}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{178-192}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2012.11.07"
    }
    
  8. Jean-Michel Fourneau and Izri Nora. Fixed-Mobile Convergence in an Optical Slot Switching Ring. In IEEE 27th International Symposium on Computer and Information Sciences, ISCIS 2012. 2012, 221-229. BibTeX

    @inproceedings{FoNo12,
    	author = "Fourneau, Jean-Michel and Nora, Izri",
    	title = "{Fixed-Mobile Convergence in an Optical Slot Switching Ring}",
    	booktitle = "{IEEE 27th International Symposium on Computer and Information Sciences, ISCIS 2012}",
    	year = "{2012}",
    	pages = "{221-229}",
    	owner = "MOIS",
    	timestamp = "2012.11.07"
    }
    
  9. Jean-Michel Fourneau, Farah Ait Salaht and Nihal Pekergin. Computing Entry-Wise Bounds of the Steady-State Distribution of a Set of Markov Chains. In 27th International Symposium on Computer and information Sciences. 2012, 115-122. BibTeX

    @inproceedings{FAPe12,
    	author = "Fourneau, Jean-Michel and Ait Salaht, Farah and Pekergin, Nihal",
    	title = "{Computing Entry-Wise Bounds of the Steady-State Distribution of a Set of Markov Chains}",
    	booktitle = "{27th International Symposium on Computer and information Sciences}",
    	year = "{2012}",
    	pages = "{115-122}",
    	owner = "MOIS",
    	timestamp = "2012.12.05"
    }
    
  10. Thu-Ha Dao-Thi and Jean-Michel Fourneau. Erratum: Multiple Class Symmetric G-Networks with Phase Type Service Times. The Computer Journal 55(5):577, 2012. BibTeX

    @article{DaFo12a,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel",
    	title = "{Erratum: Multiple Class Symmetric G-Networks with Phase Type Service Times}",
    	journal = "{The Computer Journal}",
    	year = "{2012}",
    	volume = "{55}",
    	pages = "{577}",
    	number = "{5}",
    	owner = "MOIS",
    	timestamp = "2012.11.07"
    }
    
  11. Thu-Ha Dao-Thi and Jean-Michel Fourneau. Markovian Queueing Network with Complex Synchronizations: Product form and Tensor. Performance Evaluation 69(3-4):164-186, 2012. BibTeX

    @article{DaFo12,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel",
    	title = "{Markovian Queueing Network with Complex Synchronizations: Product form and Tensor}",
    	journal = "{Performance Evaluation}",
    	year = "{2012}",
    	volume = "{69}",
    	pages = "{164-186}",
    	number = "{3-4}",
    	owner = "MOIS",
    	timestamp = "2012.11.07"
    }
    
  12. Ana Busic and Jean-Michel Fourneau. Monotonicity and Performance Evaluation: Applications to High Speed and Mobile Networks. Cluster Computing 15(4):401-414, 2012. BibTeX

    @article{BuFo12,
    	author = "Busic, Ana and Fourneau, Jean-Michel",
    	title = "{Monotonicity and Performance Evaluation: Applications to High Speed and Mobile Networks}",
    	journal = "{Cluster Computing}",
    	year = "{2012}",
    	volume = "{15}",
    	pages = "{401-414}",
    	number = "{4}",
    	owner = "MOIS",
    	timestamp = "2012.11.30"
    }
    
  13. Samir Bellahsene. {Prédiction de la mobilité pour la gestion des handovers dans les réseaux IP : modèles et algorithmes}. Université de Versailles Saint-Quentin en Yvelines, laboratoire Prism, 2012. BibTeX

    @phdthesis{Bella12,
    	author = "Bellahsene, Samir",
    	title = "{Pr{\'e}diction de la mobilité pour la gestion des handovers dans les réseaux IP : modèles et algorithmes}",
    	school = "{Université de Versailles Saint-Quentin en Yvelines, laboratoire Prism}",
    	year = "{2012}",
    	owner = "MOIS",
    	timestamp = "2012.07.03"
    }
    
  14. Dominique Barth, Boubkeur Boudaoud, François Couty, O David, Franck Quessette and Sandrine Vial. Map Generation for CO2 Cages. In IEEE 27th International Symposium on Computer and Information Science (ISCIS 2012). 2012, 503-510. BibTeX

    @inproceedings{BBC+12,
    	author = "Barth, Dominique and Boudaoud, Boubkeur and Couty, François and David, O. and Quessette, Franck and Vial, Sandrine",
    	title = "{Map Generation for CO2 Cages}",
    	booktitle = "{IEEE 27th International Symposium on Computer and Information Science (ISCIS 2012)}",
    	year = "{2012}",
    	pages = "{503-510}",
    	owner = "MOIS",
    	timestamp = "2012.10.03"
    }
    
  15. Dominique Barth, Samir Bellahsene and Leila Kloul. Combining Local and Global Profiles for Mobility Prediction in LTE Femtocells. In The 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems - MSWiM 2012. 2012, 333-342. BibTeX

    @inproceedings{BBK12,
    	author = "Barth, Dominique and Bellahsene, Samir and Kloul, Leila",
    	title = "{Combining Local and Global Profiles for Mobility Prediction in LTE Femtocells}",
    	booktitle = "{The 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems - MSWiM 2012}",
    	year = "{2012}",
    	pages = "{333-342}",
    	owner = "MOIS",
    	timestamp = "2012.11.30"
    }
    

  1. Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, Dominique Barth and Sandrine Vial. Indexing in-Network Trajectory Flows. The VLDB Journal - The International Journal on Very Large Data Bases 20(5):643-669, 2011. BibTeX

    @article{SZOB11,
    	author = "Sandu Popa, Iulian and Zeitouni, Karine and Oria, Vincent and Barth, Dominique and Vial, Sandrine",
    	title = "{Indexing in-Network Trajectory Flows}",
    	journal = "{The VLDB Journal - The International Journal on Very Large Data Bases}",
    	year = "{2011}",
    	volume = "{20}",
    	pages = "{643-669}",
    	number = "{5}",
    	owner = "MOIS",
    	timestamp = "2011.08.16"
    }
    
  2. Imene Kadi. Simulation et monotonie. Université de Versailles-Saint-Quentin en Yvelines, laboratoire PRISM, 2011. BibTeX

    @phdthesis{Kadi11,
    	author = "Kadi, Imene",
    	title = "{Simulation et monotonie}",
    	school = "{Université de Versailles-Saint-Quentin en Yvelines, laboratoire PRISM}",
    	year = "{2011}",
    	owner = "MOIS",
    	timestamp = "2012.02.22"
    }
    
  3. Jean-Michel Fourneau and Franck Quessette. Monotonicity and Efficient Computation of Bounds with Time Parallel Simulation. In 8th European Performance Engineering Workshop - EPEW 2011 6977. 2011, 57-71. BibTeX

    @inproceedings{FoQu11a,
    	author = "Fourneau, Jean-Michel and Quessette, Franck",
    	title = "{Monotonicity and Efficient Computation of Bounds with Time Parallel Simulation}",
    	booktitle = "{8th European Performance Engineering Workshop - EPEW 2011}",
    	year = "{2011}",
    	volume = "{6977}",
    	series = "{Lecture Notes in Computer Science (LNCS)}",
    	pages = "{57-71}",
    	address = "{Borrowdale, United-Kingdom}",
    	month = "{October 12-13}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2012.02.10"
    }
    
  4. Jean-Michel Fourneau and Franck Quessette. Monotone Queuing Networks and Time Parallel Simulation. In 18th International Conferene on Analytical and Stochastic Modeling Techniques and Aplications - ASMTA 2011. 2011, 204-218.
    Abstract We show how we can make more efficient the time parallel simulation of some queueing networks. We had previously introduced some improvements of two classical time parallel simulation approaches: the precomputation of states at specific time instants and the fix-up computations. We have proved that we can obtain more parallelism using monotonicity on input sequences or on the initial states of the simulation parts and obtain quickly a bound of the sample-path. Here we apply the fixed up computations approach to the time parallel simulation of queueing networks with general service times and complex routing disciplines. This approach is based on the theory of monotone models of simulation. We establish that our models are monotone and we show how we obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well. BibTeX

    @inproceedings{FoQu11,
    	author = "Fourneau, Jean-Michel and Quessette, Franck",
    	title = "{Monotone Queuing Networks and Time Parallel Simulation}",
    	booktitle = "{18th International Conferene on Analytical and Stochastic Modeling Techniques and Aplications - ASMTA 2011}",
    	year = "{2011}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{204-218}",
    	address = "{Venice, Italy}",
    	month = "{20-22 June}",
    	publisher = "{Springer}",
    	abstract = "We show how we can make more efficient the time parallel simulation of some queueing networks. We had previously introduced some improvements of two classical time parallel simulation approaches: the precomputation of states at specific time instants and the fix-up computations. We have proved that we can obtain more parallelism using monotonicity on input sequences or on the initial states of the simulation parts and obtain quickly a bound of the sample-path. Here we apply the fixed up computations approach to the time parallel simulation of queueing networks with general service times and complex routing disciplines. This approach is based on the theory of monotone models of simulation. We establish that our models are monotone and we show how we obtain proved upper or lower bounds of the sample-path of the simulation and bounds of some estimates as well.",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  5. Jean-Michel Fourneau, Imène Kadi and Franck Quessette. Time Parallel Simulation and hv-Monotonicity. In 26th International Symposium on Computer and Information Sciences. 2011, 201-207. BibTeX

    @inproceedings{FKQu11,
    	author = "Fourneau, Jean-Michel and Kadi, Imène and Quessette, Franck",
    	title = "{Time Parallel Simulation and hv-Monotonicity}",
    	booktitle = "{26th International Symposium on Computer and Information Sciences}",
    	year = "{2011}",
    	pages = "{201-207}",
    	address = "{London, United-Kingdom}",
    	month = "{26-28 September 2011}",
    	owner = "MOIS",
    	timestamp = "2011.11.28"
    }
    
  6. Jean-Michel Fourneau, Nora Izri and Dominique Verchere. A Tool to Model Traffic Aggregation in Networks of Reconfigurable Optical ADD/DROP Multiplexers vecos2011ROADM;pdf. In 5th International Workshop on Verification and Evaluation of Computer and Communication Systems, VECoS 2011. 2011. BibTeX

    @inproceedings{FIVe11,
    	author = "Fourneau, Jean-Michel and Izri, Nora and Verchere, Dominique",
    	title = "{A Tool to Model Traffic Aggregation in Networks of Reconfigurable Optical ADD/DROP Multiplexers vecos2011ROADM;pdf}",
    	booktitle = "{5th International Workshop on Verification and Evaluation of Computer and Communication Systems, VECoS 2011}",
    	year = "{2011}",
    	owner = "MOIS",
    	timestamp = "2012.11.08"
    }
    
  7. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. G-Networks with Synchronised Arrivals. Performance Evaluation 68(4):309-319, 2011. BibTeX

    @article{DFTr11b,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{G-Networks with Synchronised Arrivals}",
    	journal = "{Performance Evaluation}",
    	year = "{2011}",
    	volume = "{68}",
    	pages = "{309-319}",
    	number = "{4}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  8. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. Multi-class Network with Phase Type Service Time and Group Deletion Signal. In 8th European Performance Engineering Workshop - EPEW 2011 6977. 2011, 189-203. BibTeX

    @inproceedings{DFTr11a,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{Multi-class Network with Phase Type Service Time and Group Deletion Signal}",
    	booktitle = "{8th European Performance Engineering Workshop - EPEW 2011}",
    	year = "{2011}",
    	volume = "{6977}",
    	series = "{Lecture Notes in Computer Science (LNCS)}",
    	pages = "{189-203}",
    	address = "{Borrowdale, The English Lake District, Cumbria, Keswick, United-Kingdom}",
    	month = "{12th and 13th October 2011}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2011.08.18"
    }
    
  9. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. Multiple Class Symmetric G-networks with Phase Type Service Times. The Computer Journal 54(2):274-284, 2011. BibTeX

    @article{DFTr11,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{Multiple Class Symmetric G-networks with Phase Type Service Times}",
    	journal = "{The Computer Journal}",
    	year = "{2011}",
    	volume = "{54}",
    	pages = "{274-284}",
    	number = "{2}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  10. Ana Busic and Jean-Michel Fourneau. Iterative Component-Wise Bounds for the Steady-State Distribution of a Markov Chain. Numerical Linear Algebra with Applications 18(6):1031-1049, 2011. BibTeX

    @article{BuFo11,
    	author = "Busic, Ana and Fourneau, Jean-Michel",
    	title = "{Iterative Component-Wise Bounds for the Steady-State Distribution of a Markov Chain}",
    	journal = "{Numerical Linear Algebra with Applications}",
    	year = "{2011}",
    	volume = "{18}",
    	pages = "{1031-1049}",
    	number = "{6}",
    	comment = "John Wiley \& Sons, Ltd",
    	owner = "MOIS",
    	timestamp = "2011.12.13"
    }
    
  11. Dominique Barth, Samir Bellahsene and Leila Kloul. Mobility Prediction Using Mobile User Profiles. In 2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems - MASCOTS 2011. 2011, 286-294.
    Abstract In this paper we propose a new approach for mobility prediction. It is based on the notion of mobile-user profile which corresponds to frequent similar movements of a user. Such a profile is defined, in the neighbourhood graph of a cellular network, as a set of similar sequences of crossed cells from one source cell to one destination cell. We propose an algorithmic approach to identify such profiles from real cellular network datasets and we show how to use them for an efficient mobility prediction. Simulation results show that the global approach is significantly efficient in predicting both random and regular movements. BibTeX

    @inproceedings{BBKl11,
    	author = "Barth, Dominique and Bellahsene, Samir and Kloul, Leila",
    	title = "{Mobility Prediction Using Mobile User Profiles}",
    	booktitle = "{2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems - MASCOTS 2011}",
    	year = "{2011}",
    	pages = "{286-294}",
    	address = "{Raffles Hotel, Singapore}",
    	month = "{July 25 -27, 2011}",
    	abstract = "In this paper we propose a new approach for mobility prediction. It is based on the notion of mobile-user profile which corresponds to frequent similar movements of a user. Such a profile is defined, in the neighbourhood graph of a cellular network, as a set of similar sequences of crossed cells from one source cell to one destination cell. We propose an algorithmic approach to identify such profiles from real cellular network datasets and we show how to use them for an efficient mobility prediction. Simulation results show that the global approach is significantly efficient in predicting both random and regular movements.",
    	owner = "MOIS",
    	timestamp = "2011.11.30"
    }
    
  12. Gilles Dowek (ed.). Une introduction à la science informatique : pour les enseignants de la discipline informatique au lycée. CNDP-CRDP edition, series Repères pour Agir, SCérEN, 2011. BibTeX

    @book{ABB+11,
    	title = "{Une introduction à la science informatique : pour les enseignants de la discipline informatique au lycée}",
    	publisher = "{SCérEN}",
    	year = "{2011}",
    	editor = "Dowek, Gilles",
    	author = "Archambault, Jean-Pierre and Barcelli, Emmanuel and Boldo, Sylvie and Bouhineau, Denis and Cégielski, Patrick and Clausen, Thomas and Dowek, Gilles and Guessarian, Irène and Lopes, Stephane and Mounier, Laurent and Nguyen, Benjamin and Quessette, Franck and Rasse, Anne and Rozoy, Brigitte and Timsit, Claude and Viéville, Thierry and Vincent, Jean-Marc",
    	pages = "{375}",
    	series = "{Repères pour Agir}",
    	address = "{Paris}",
    	edition = "{CNDP-CRDP}",
    	owner = "MOIS",
    	timestamp = "2011.12.14"
    }
    

  1. Nora Izri, Jean-Michel Fourneau, Dana Marinca and Samir Tohme. {Impact de la Convergence Fixe-Mobile sur un réseau optique de collecte}. In 11èmes Journées Doctorales en Informatique et Réseaux - JDIR. 2010.
    Abstract {La fibre optique est un élément incontournable dans les réseaux de recherche actuels, puisqu'elle permet de combiner l'allocation dynamique des ressources aux hauts débits offerts. Pour cela, nous présentons un anneau optique où l'on permet la garantie de QoS (Quality of Service) au niveau des sous-longueurs d'onde. L'architecture est basée sur un mécanisme de réservations centralisé au niveau du hub. Ce dernier a la fonctionnalité d'ordonnanceur vu qu'il définit l'ensemble des rectangles de réservations pour un noeud, appelé "pattern". Deux types de trafic peuvent circuler dans ce réseau : le trafic provenant des réseaux fixes et le trafic provenant des réseaux mobiles. Dans ce papier, un concept de convergence fixe-mobile (CFM) au niveau de la couche physique dans un réseau de collecte tout optique est décrit. Une analyse des scénarii de CFM proposés a été faite. Nous étudions également l'attente des paquets avant leur insertion sur l'anneau optique en utilisant des PDUs (Physical Data Unit) de taille fixe, ainsi que le taux d'utilisation du container optique PDU par les paquets clients IP, ATM ou GSM. Nos résultats montrent que la répartition des slots dans la fenêtre a un impact sur le temps d'attente des paquets clients. D'autres part, le partage des containers optiques entre les CoS (Class of Service) quel que soit le type de réseau, a un effet majeur sur leur taux d'utilisation.} URL BibTeX

    @inproceedings{IFMT10,
    	author = "Izri, Nora and Fourneau, Jean-Michel and Marinca, Dana and Tohme, Samir",
    	title = "{Impact de la Convergence Fixe-Mobile sur un r{\'e}seau optique de collecte}",
    	booktitle = "{11èmes Journées Doctorales en Informatique et Réseaux - JDIR}",
    	year = "{2010}",
    	address = "{Sophia Antipolis, France}",
    	abstract = {{La fibre optique est un {\'e}l{\'e}ment incontournable dans les r{\'e}seaux de recherche actuels, puisqu'elle permet de combiner l'allocation dynamique des ressources aux hauts d{\'e}bits offerts. Pour cela, nous pr{\'e}sentons un anneau optique o{\`u} l'on permet la garantie de QoS (Quality of Service) au niveau des sous-longueurs d'onde. L'architecture est bas{\'e}e sur un m{\'e}canisme de r{\'e}servations centralis{\'e} au niveau du hub. Ce dernier a la fonctionnalit{\'e} d'ordonnanceur vu qu'il d{\'e}finit l'ensemble des rectangles de r{\'e}servations pour un noeud, appel{\'e} "pattern". Deux types de trafic peuvent circuler dans ce r{\'e}seau : le trafic provenant des r{\'e}seaux fixes et le trafic provenant des r{\'e}seaux mobiles. Dans ce papier, un concept de convergence fixe-mobile (CFM) au niveau de la couche physique dans un r{\'e}seau de collecte tout optique est d{\'e}crit. Une analyse des sc{\'e}narii de CFM propos{\'e}s a {\'e}t{\'e} faite. Nous {\'e}tudions {\'e}galement l'attente des paquets avant leur insertion sur l'anneau optique en utilisant des PDUs (Physical Data Unit) de taille fixe, ainsi que le taux d'utilisation du container optique PDU par les paquets clients IP, ATM ou GSM. Nos r{\'e}sultats montrent que la r{\'e}partition des slots dans la fen{\^e}tre a un impact sur le temps d'attente des paquets clients. D'autres part, le partage des containers optiques entre les CoS (Class of Service) quel que soit le type de r{\'e}seau, a un effet majeur sur leur taux d'utilisation.}},
    	affiliation = "Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM - CNRS : UMR8144 - Universit{\'e} de Versailles-Saint Quentin en Yvelines",
    	audience = "internationale",
    	file = "jdir2010IZRIvf.pdf:http\://hal.inria.fr/inria-00467940/PDF/jdir2010IZRIvf.pdf:PDF",
    	hal_id = "inria-00467940",
    	language = "Fran{\c c}ais",
    	owner = "MOIS",
    	timestamp = "2011.07.25",
    	url = "http://hal.inria.fr/inria-00467940/en/"
    }
    
  2. Jean-Michel Fourneau. Collaboration of Discrete-time Markov chains: Tensor and Product Form. Performance Evaluation 67(9):779-796, 2010. BibTeX

    @article{Four10,
    	author = "Fourneau, Jean-Michel",
    	title = "{Collaboration of Discrete-time Markov chains: Tensor and Product Form}",
    	journal = "{Performance Evaluation}",
    	year = "{2010}",
    	volume = "{67}",
    	pages = "{779-796}",
    	number = "{9}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  3. Jean-Michel Fourneau, Lynda Mokdad and Nihal Pekergin. Stochastic Bounds for Performance Evaluation of Web services. Concurrency and Computation: Practice and Experience 22(10):1286-1307, 2010. BibTeX

    @article{FMPe10,
    	author = "Fourneau, Jean-Michel and Mokdad, Lynda and Pekergin, Nihal",
    	title = "{Stochastic Bounds for Performance Evaluation of Web services}",
    	journal = "{Concurrency and Computation: Practice and Experience}",
    	year = "{2010}",
    	volume = "{22}",
    	pages = "{1286-1307}",
    	number = "{10}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  4. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. Networks of Symmetric Multi-class Queues with Signals Changing Classes. In Proceeding of the 17th International Conference on Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2010). 2010, 72-86. BibTeX

    @inproceedings{DFKa10,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{Networks of Symmetric Multi-class Queues with Signals Changing Classes}",
    	booktitle = "{Proceeding of the 17th International Conference on Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2010)}",
    	year = "{2010}",
    	pages = "{72-86}",
    	owner = "MOIS",
    	timestamp = "2011.08.22"
    }
    
  5. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. Multiple Class Symmetric G-Networks with Phase Type. In Erol Gelenbe, Ricardo Lent, Georgia Sakellari, Ahmet Sacan, Ismail Hakki Toroslu and Adnan Yazici (eds.). Computer and Information Sciences - Proceedings of the 25th International Symposium on Computer and Information Sciences, London, UK, September 22-24, 2010. Lecture Notes in Electrical Engineering 62 Springer 2010 62. 2010, 51-56. BibTeX

    @inproceedings{DFTr10,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{Multiple Class Symmetric G-Networks with Phase Type}",
    	booktitle = "Computer and Information Sciences - Proceedings of the 25th International Symposium on Computer and Information Sciences, London, UK, September 22-24, 2010. Lecture Notes in Electrical Engineering 62 Springer 2010",
    	year = "{2010}",
    	editor = "Gelenbe,Erol and Lent,Ricardo and Sakellari,Georgia and Sacan,Ahmet and Toroslu, Ismail Hakki and Yazici, Adnan",
    	volume = "{62}",
    	series = "{Lecture Notes in Electrical Engineering}",
    	pages = "{51-56}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2011.11.28"
    }
    
  6. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Imene Kadi. Monotone Time Parallele Simulation of a Web Server. In Proceedings of the 15th IEEE Symposium on Computers and Communications, ISCC 2010, Riccione, Italy, June 22-25, 2010. 2010, 1097-1102. BibTeX

    @inproceedings{DFK+10,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Kadi, Imene",
    	title = "{Monotone Time Parallele Simulation of a Web Server}",
    	booktitle = "{Proceedings of the 15th IEEE Symposium on Computers and Communications, ISCC 2010, Riccione, Italy, June 22-25, 2010}",
    	year = "{2010}",
    	pages = "{1097-1102}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  7. Thu-Ha Dao-Thi, Jean-Michel Fourneau and Minh-Anh Tran. G-networks with synchronised arrivals. Performance Evaluation In Press, Accepted Manuscript, 2010. BibTeX

    @article{DFT10,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel and Tran, Minh-Anh",
    	title = "{G-networks with synchronised arrivals}",
    	journal = "{Performance Evaluation}",
    	year = "{2010}",
    	volume = "{In Press, Accepted Manuscript}",
    	owner = "MOIS",
    	timestamp = "2012.06.26"
    }
    
  8. Hind Castel-Taleb, Jean-Michel Fourneau and Nihal Pekergin. Stochastic Comparisons Applied to G-Networks with Catastrophes. In Springer (ed.). Proceedings of the 25th International Symposium on Computer and Information Sciences (ISCIS 2010) 62. 2010, 57-60.
    Abstract We study the transient distribution of some G-networks of queues with customers and signals. After its service completion a customer moves to another queue and may become a signal. We consider catastrophes where the signal deletes all customers in a queue. Both networks with negative customers and with catastrophes belong to well known of Gelenbe's networks with product form steady-state distribution. As the transient distribution is impossible to obtain, we derive stochastic upper and lower bounds on the marginal distribution for each queue following Massey's approach. URL BibTeX

    @inproceedings{CFP+10,
    	author = "Castel-Taleb, Hind and Fourneau, Jean-Michel and Pekergin, Nihal",
    	title = "{Stochastic Comparisons Applied to G-Networks with Catastrophes}",
    	booktitle = "{Proceedings of the 25th International Symposium on Computer and Information Sciences (ISCIS 2010)}",
    	year = "{2010}",
    	editor = "{Springer}",
    	volume = "{62}",
    	pages = "{57-60}",
    	abstract = "{We study the transient distribution of some G-networks of queues with customers and signals. After its service completion a customer moves to another queue and may become a signal. We consider catastrophes where the signal deletes all customers in a queue. Both networks with negative customers and with catastrophes belong to well known of Gelenbe's networks with product form steady-state distribution. As the transient distribution is impossible to obtain, we derive stochastic upper and lower bounds on the marginal distribution for each queue following Massey's approach.}",
    	affiliation = "Services r{\'e}partis, Architectures, MOd{\'e}lisation, Validation, Administration des R{\'e}seaux - SAMOVAR - CNRS : UMR5157 - Institut T{\'e}l{\'e}com - T{\'e}l{\'e}com SudParis - Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM - CNRS : UMR8144 - Universit{\'e} de Versailles-Saint Quentin en Yvelines - Laboratoire d'Algorithmique Complexit{\'e} et Logique - LACL - CNRS : FRE2673 - Universit{\'e} Paris XII Val de Marne",
    	audience = "internationale",
    	hal_id = "hal-00545738",
    	language = "Anglais",
    	owner = "MOIS",
    	timestamp = "2011.07.25",
    	url = "http://hal-institut-telecom.archives-ouvertes.fr/hal-00545738/en/"
    }
    
  9. Christian Cadere, Nora Izri, Dominique Barth, Jean-Michel Fourneau, Dana Marinca and Sandrine Vial. Virtual circuit allocation with QoS garantees in the ECOFRAME optical ring. In 14th conference on Optical Network Design and Modeling (ONDM). 2010, 13-18. BibTeX

    @inproceedings{CIB+10,
    	author = "Cadere, Christian and Izri, Nora and Barth, Dominique and Fourneau, Jean-Michel and Marinca, Dana and Vial, Sandrine",
    	title = "{Virtual circuit allocation with QoS garantees in the ECOFRAME optical ring}",
    	booktitle = "{14th conference on Optical Network Design and Modeling (ONDM)}",
    	year = "{2010}",
    	pages = "{13-18}",
    	owner = "MOIS",
    	timestamp = "2011.07.29"
    }
    
  10. Ana Busic and Jean-Michel Fourneau. Iterative component-wise bounds for the steady-state distribution of a Markov chain. In 6th International Workshop on the Numerical Solution of Markov Chain, USA. 2010. BibTeX

    @inproceedings{BuFo10,
    	author = "Busic, Ana and Fourneau, Jean-Michel",
    	title = "{Iterative component-wise bounds for the steady-state distribution of a Markov chain}",
    	booktitle = "6th International Workshop on the Numerical Solution of Markov Chain, USA",
    	year = "{2010}",
    	owner = "MOIS",
    	timestamp = "2012.06.26"
    }
    
  11. Ana Busic, Hilal Djafri and Jean-Michel Fourneau. {Stochastic Bound for Censored Markov chain}. In 6th International Workshop on the Numerical Solution of Markov Chain, USA. 2010. BibTeX

    @inproceedings{BDFo10,
    	author = "Busic, Ana and Djafri, Hilal and Fourneau, Jean-Michel",
    	title = "{Stochastic Bound for Censored {M}arkov chain}",
    	booktitle = "{6th International Workshop on the Numerical Solution of Markov Chain, USA}",
    	year = "{2010}",
    	owner = "MOIS",
    	timestamp = "2012.06.26"
    }
    
  12. Ana Busic and Jean-Michel Fourneau. A Toolbox for Component-Wise Bounds for Steady-State Distribution of a DTMC. In QEST2010, Seventh International Conference on the Quantitative Evaluation of Systems, Williamsburg, Virginia, USA. 2010, 81-82. BibTeX

    @inproceedings{BuFo10a,
    	author = "Busic, Ana and Fourneau, Jean-Michel",
    	title = "{A Toolbox for Component-Wise Bounds for Steady-State Distribution of a DTMC}",
    	booktitle = "{QEST2010, Seventh International Conference on the Quantitative Evaluation of Systems, Williamsburg, Virginia, USA}",
    	year = "{2010}",
    	pages = "{81-82}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  13. Samir Bellahsene and Leila Kloul. A New Markov-Based Mobility Prediction Algorithm for Mobile Networks. In Alessandro Aldini, Marco Bernardo, Luciano Bononi and Vittorio Cortellessa (eds.). Computer Performance Engineering - 7th European Performance Engineering Workshop, EPEW 2010, Bertinoro, Italy, September 23-24, 2010. Proceedings 6342. 2010, 37-50. BibTeX

    @inproceedings{BeKl10,
    	author = "Bellahsene, Samir and Kloul, Leila",
    	title = "{A New Markov-Based Mobility Prediction Algorithm for Mobile Networks}",
    	booktitle = "{Computer Performance Engineering - 7th European Performance Engineering Workshop, EPEW 2010, Bertinoro, Italy, September 23-24, 2010. Proceedings}",
    	year = "{2010}",
    	editor = "Alessandro Aldini and Marco Bernardo and Luciano Bononi and Vittorio Cortellessa",
    	volume = "{6342}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{37-50}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2012.06.26"
    }
    
  14. Juliana Kuster Filipe Bowles and Leila Kloul. Synthesising PEPA nets from IODs for performance analysis. In Alan Adamson, Andre B Bondi, Carlos Juiz and Mark S Squillante (eds.). Proceedings of the first joint WOSP/SIPEW International Conference on Performance Engineering, San Jose, California, USA. 2010, 195-200. BibTeX

    @inproceedings{KBKl10,
    	author = "Kuster Filipe Bowles, Juliana and Kloul, Leila",
    	title = "{Synthesising PEPA nets from IODs for performance analysis}",
    	booktitle = "{Proceedings of the first joint WOSP/SIPEW International Conference on Performance Engineering, San Jose, California, USA}",
    	year = "{2010}",
    	editor = "Alan Adamson and Andre B. Bondi and Carlos Juiz and Mark S. Squillante",
    	pages = "{195-200}",
    	publisher = "{ACM}",
    	owner = "MOIS",
    	timestamp = "2012.06.26"
    }
    

  1. Juliana Kuster Filipe Bowles and Leila Kloul. Strongly Consistent Languages for Modelling Mobility. septembre 2009
    Abstract A seamless approach suitable for both design and analysis of mobile and distributed software systems is a challenge. The object-based Unified Modeling Language (UML) is a popular medium for effective design of most systems. PEPA nets are a recent performance modelling technique which offers capabilities for capturing notions such as location, synchronisation and message passing, and are thus suited for performance modelling of mobile and distributed software. In this paper, we provide a new constructive approach that links both models by deriving a PEPA net which realises the same language (legal set of traces) as a given Interaction Overview Diagram (IOD) in UML2. We prove that the languages are strongly consistent (equivalent) by establishing the one-to-one correspondence between the traces of the models. URL BibTeX

    @unpublished{BoKl09,
    	author = "Kuster Filipe Bowles, Juliana and Kloul, Leila",
    	title = "{Strongly Consistent Languages for Modelling Mobility}",
    	month = "{September}",
    	year = "{2009}",
    	abstract = "{A seamless approach suitable for both design and analysis of mobile and distributed software systems is a challenge. The object-based Unified Modeling Language (UML) is a popular medium for effective design of most systems. PEPA nets are a recent performance modelling technique which offers capabilities for capturing notions such as location, synchronisation and message passing, and are thus suited for performance modelling of mobile and distributed software. In this paper, we provide a new constructive approach that links both models by deriving a PEPA net which realises the same language (legal set of traces) as a given Interaction Overview Diagram (IOD) in UML2. We prove that the languages are strongly consistent (equivalent) by establishing the one-to-one correspondence between the traces of the models.}",
    	affiliation = "School of Computer Science - University of St-Andrews - Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM - CNRS : UMR8144 - Universit{\'e} de Versailles-Saint Quentin en Yvelines",
    	collaboration = "CNRS/Royal Society",
    	file = "report.pdf:http\://hal.archives-ouvertes.fr/hal-00419934/PDF/report.pdf:PDF",
    	hal_id = "hal-00419934",
    	keywords = "UML2 Interaction Diagrams, PEPA nets, Formal Transformation, Mobility, Performance Analysis",
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00419934/en/"
    }
    
  2. Nihal Pekergin and Sana Younes. Model Checking by Censoring Markov Chains and Stochastic Comparison. In Helene Waeselynck (ed.). Proceedings of the 12th European Workshop on Dependable Computing, EWDC 2009. 2009, 7 pages.
    Abstract We study how to combine the censoring technique for Markov chains and the strong stochastic comparison to perform model checking of discrete-time Markov chains. Our goal is to reduce the complexity of the model checking in order to be able to consider numerically intractable models. In model checking we do not need the exact values but we must decide if the required guarantees are satisfied or not. Thus bounding methods are suitable in this context : if the bounds meet the threshold we can decide for the satisfaction of the formula. In the case when it is not possible to decide the satisfaction of the underlying formula through the bounds, we can refine the bounds by considering a larger set of states. URL BibTeX

    @inproceedings{PeYo09,
    	author = "Pekergin, Nihal and Younes, Sana",
    	title = "{Model Checking by Censoring Markov Chains and Stochastic Comparison}",
    	booktitle = "{Proceedings of the 12th European Workshop on Dependable Computing, EWDC 2009}",
    	year = "{2009}",
    	editor = "Waeselynck, Helene",
    	pages = "{7 pages}",
    	address = "{Toulouse, France}",
    	month = "{} } # May # { {}",
    	abstract = "{We study how to combine the censoring technique for Markov chains and the strong stochastic comparison to perform model checking of discrete-time Markov chains. Our goal is to reduce the complexity of the model checking in order to be able to consider numerically intractable models. In model checking we do not need the exact values but we must decide if the required guarantees are satisfied or not. Thus bounding methods are suitable in this context : if the bounds meet the threshold we can decide for the satisfaction of the formula. In the case when it is not possible to decide the satisfaction of the underlying formula through the bounds, we can refine the bounds by considering a larger set of states.}",
    	affiliation = "Laboratoire d'Algorithmique Complexit{\'e} et Logique - LACL - CNRS : FRE2673 - Universit{\'e} Paris XII Val de Marne - Parall{\'e}lisme, R{\'e}seaux, Syst{\`e}mes d'information, Mod{\'e}lisation - PRISM - CNRS : UMR8144 - Universit{\'e} de Versailles-Saint Quentin en Yvelines",
    	audience = "internationale",
    	file = "_2.pdf:http\://hal.archives-ouvertes.fr/hal-00380667/PDF/FormalAnalysis\\_2.pdf:PDF",
    	hal_id = "hal-00380667",
    	language = "Anglais",
    	url = "http://hal.archives-ouvertes.fr/hal-00380667/en/"
    }
    
  3. David Nott. Modélisation et évaluation de performance des algorithmes liés au routage de paquets de taille fixe dans le réseau de coeur ROMéo. Laboratoire PRISM, Université de Versailles Saint-Quentin en Yvelines UFR des Sciences - bâtiment Descartes Laboratoire PRISM - 45 avenue des Etats-Unis 78035 Versailles cedex, 2009. BibTeX

    @phdthesis{Nott09,
    	author = "Nott, David",
    	title = "{Modélisation et évaluation de performance des algorithmes liés au routage de paquets de taille fixe dans le réseau de coeur ROMéo}",
    	school = "{Laboratoire PRISM}",
    	year = "{2009}",
    	address = "{Université de Versailles Saint-Quentin en Yvelines UFR des Sciences - bâtiment Descartes Laboratoire PRISM - 45 avenue des Etats-Unis 78035 Versailles cedex}",
    	month = "{décembre}",
    	owner = "MOIS",
    	timestamp = "2012.02.23"
    }
    
  4. Nora Izri. Etude Comparative d'approches de convergence fixe mobile dans un réseau tout optique. In AEP9 - 9ième Atelier d'Evaluation de Performances. 2009. BibTeX

    @inproceedings{IZRI09,
    	author = "Izri, Nora",
    	title = "{Etude Comparative d'approches de convergence fixe mobile dans un réseau tout optique}",
    	booktitle = "{AEP9 - 9ième Atelier d'Evaluation de Performances}",
    	year = "{2009}",
    	owner = "MOIS",
    	timestamp = "2012.11.08"
    }
    
  5. Jean-Michel Fourneau, Lynda Mokdad and Nihal Pekergin. Stochastic Bounds for Performance Evaluation of Web Services. In Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), July 5-8, Sousse, Tunisia. 2009, 7-12. BibTeX

    @inproceedings{FMPe09,
    	author = "Fourneau, Jean-Michel and Mokdad, Lynda and Pekergin, Nihal",
    	title = "{Stochastic Bounds for Performance Evaluation of Web Services}",
    	booktitle = "{Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), July 5-8, Sousse, Tunisia}",
    	year = "{2009}",
    	pages = "{7-12}",
    	address = "{Sousse, Tunisia}",
    	month = "{July 5 - 8}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  6. Jean-Michel Fourneau, Imene Kadi and Nihal Pekergin. Improving Time Parallel Simulation for Monotone Systems. In Wentong Cai Abdulmotaleb El-Saddik (Eds.) Stephen John Turner David Roberts (ed.). 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications, Singapore, 25-28 October 2009. 2009, 231-234. BibTeX

    @inproceedings{FKPe09,
    	author = "Fourneau, Jean-Michel and Kadi, Imene and Pekergin, Nihal",
    	title = "{Improving Time Parallel Simulation for Monotone Systems}",
    	booktitle = "{13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications, Singapore, 25-28 October 2009}",
    	year = "{2009}",
    	editor = "{Stephen John Turner, David Roberts, Wentong Cai, Abdulmotaleb El-Saddik (Eds.)}",
    	pages = "{231-234}",
    	publisher = "{IEEE Computer Society}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  7. Jean-Michel Fourneau, Nora Izri and Dominique Verchere. Analysis and Optimization of Aggregation in a Reconfigurable Optical ADD/DROP Multiplexer NEW2AN-Roadm.pdf. In Yevgeni Koucheryavy (Eds.) Sergey Balandin Dmitri Moltchanov (ed.). Smart Spaces and Next Generation Wired/Wireless Networking, 9th International Conference, NEW2AN 2009 and Second Conference on Smart Spaces, ruSMART 2009, St. Petersburg, Russia, September 15-18, 2009. Proceedings. 5764. 2009, 120-131. BibTeX

    @inproceedings{FIV+09,
    	author = "Fourneau, Jean-Michel and Izri, Nora and Verchere, Dominique",
    	title = "{Analysis and Optimization of Aggregation in a Reconfigurable Optical ADD/DROP Multiplexer NEW2AN-Roadm.pdf}",
    	booktitle = "{Smart Spaces and Next Generation Wired/Wireless Networking, 9th International Conference, NEW2AN 2009 and Second Conference on Smart Spaces, ruSMART 2009, St. Petersburg, Russia, September 15-18, 2009. Proceedings.}",
    	year = "{2009}",
    	editor = "{Sergey Balandin, Dmitri Moltchanov, Yevgeni Koucheryavy (Eds.)}",
    	volume = "{5764}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{120-131}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  8. Thu-Ha Dao-Thi and Jean-Michel Fourneau. Complex Synchronizations in Markovian Models: a Tensor-Based Proof of Product Form. In Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools. 2009, 50:1-50:10. BibTeX

    @inproceedings{DaFo09a,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel",
    	title = "{Complex Synchronizations in Markovian Models: a Tensor-Based Proof of Product Form}",
    	booktitle = "{Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools}",
    	year = "{2009}",
    	pages = "50:1-50:10",
    	owner = "MOIS",
    	timestamp = "2011.08.22"
    }
    
  9. Thu-Ha Dao-Thi and Jean-Michel Fourneau. Stochastic Automata Networks with Master/Slave Synchronization: Product Form and Tensor. In Khalid Al-Begain, Dieter Fiems and Gabor Horvath (eds.). Analytical and Stochastic Modeling Techniques and Applications, 16th International Conference, ASMTA 2009, Madrid, Spain, June 9-12, 2009 5513. 2009, 279-293. BibTeX

    @inproceedings{DaFo09,
    	author = "Dao-Thi, Thu-Ha and Fourneau, Jean-Michel",
    	title = "{Stochastic Automata Networks with Master/Slave Synchronization: Product Form and Tensor}",
    	booktitle = "{Analytical and Stochastic Modeling Techniques and Applications, 16th International Conference, ASMTA 2009, Madrid, Spain, June 9-12, 2009}",
    	year = "{2009}",
    	editor = "Al-Begain, Khalid and Fiems, Dieter and Horvath, Gabor",
    	volume = "{5513}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{279-293}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  10. Tadeusz Czachorski, Jean-Michel Fourneau, Tomasz Nycz and Nihal Pekergin. Diffusion Approximation Model of Multiserver Stations with Losses. Electronic Notes in Theoretical Computer Science 232:125-143, 2009. BibTeX

    @article{CFNP09,
    	author = "Czachorski, Tadeusz and Fourneau, Jean-Michel and Nycz, Tomasz and Pekergin, Nihal",
    	title = "{Diffusion Approximation Model of Multiserver Stations with Losses}",
    	journal = "{Electronic Notes in Theoretical Computer Science}",
    	year = "{2009}",
    	volume = "{232}",
    	pages = "{125-143}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  11. Leonardo Brenner, Paulo Fernandes, Jean-Michel Fourneau and Brigitte Plateau. Modelling Grid5000 Point Availability with SAN. Electronic Notes in Theoretical Computer Science 232:165-178, 2009. BibTeX

    @article{BFFP09,
    	author = "Brenner, Leonardo and Fernandes, Paulo and Fourneau, Jean-Michel and Plateau, Brigitte",
    	title = "{Modelling Grid5000 Point Availability with SAN}",
    	journal = "{Electronic Notes in Theoretical Computer Science}",
    	year = "{2009}",
    	volume = "{232}",
    	pages = "{165-178}",
    	owner = "MOIS",
    	timestamp = "2011.07.28"
    }
    
  12. Samir Bellahsene, Leila Kloul and Dominique Barth. A Hierarchical Prediction Model for two Nodes-Based IP Mobile Networks. In Proceedings of the 12th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2009. 2009, 173-180. BibTeX

    @inproceedings{BKBa09,
    	author = "Bellahsene, Samir and Kloul, Leila and Barth, Dominique",
    	title = "{A Hierarchical Prediction Model for two Nodes-Based IP Mobile Networks}",
    	booktitle = "{Proceedings of the 12th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2009}",
    	year = "{2009}",
    	pages = "{173-180}",
    	address = "{Tenerife, Canary Islands, Spain}",
    	month = "{October 26-30}",
    	owner = "MOIS",
    	timestamp = "2011.07.21"
    }
    

 Imprimer  E-mail

DMC Firewall is a Joomla Security extension!