Publications équipe EPRI - 2011

  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"
    }
    

 Imprimer 

DMC Firewall is a Joomla Security extension!