Publications équipe ALCAAP - 2009 à 2012

  1. Herve Fournier, Daniele Gardy, Antoine Genitrini and Bernhard Gittenberger. The Fraction of Large Random Trees Representing a Given Boolean Function in Implicational Logic. Random Structures and Algorithms 40(3):317-349, mai 2012. BibTeX

    @article{FGGG12,
    	author = "Fournier, Herve and Gardy, Daniele and Genitrini, Antoine and Gittenberger, Bernhard",
    	title = "{The Fraction of Large Random Trees Representing a Given Boolean Function in Implicational Logic}",
    	journal = "{Random Structures and Algorithms}",
    	year = "{2012}",
    	volume = "{40}",
    	pages = "{317-349}",
    	number = "{3}",
    	month = "{May}",
    	owner = "MOIS",
    	timestamp = "2012.06.27"
    }
    
  2. Philippe Rinaudo, Yann Ponty, Dominique Barth and Alain Denise. Tree Decomposition and.. Number CoRR abs/1207.0216, 2012. BibTeX

    @techreport{RPB+12,
    	author = "Rinaudo, Philippe and Ponty, Yann and Barth, Dominique and Denise, Alain",
    	title = "{Tree Decomposition and.}",
    	year = "{2012}",
    	number = "{CoRR abs/1207.0216}",
    	owner = "MOIS",
    	timestamp = "2012.12.11"
    }
    
  3. Philippe Rinaudo, Yann Ponty, Dominique Barth and Alain Denise. Tree Decomposition and Parameterized Algorithms for RNA Structure-Sequence Alignment Including Tertiary Interactions and Pseudoknots. In Raphael Ben and Tang Jijun (eds.). WABI 2012 - 12th Workshop on Algorithms in Bioinformatics WABI'12 7534. 2012, 149-164. Extended Abstract. BibTeX

    @inproceedings{RPBD12,
    	author = "Rinaudo, Philippe and Ponty, Yann and Barth, Dominique and Denise, Alain",
    	title = "{Tree Decomposition and Parameterized Algorithms for RNA Structure-Sequence Alignment Including Tertiary Interactions and Pseudoknots}",
    	booktitle = "{WABI 2012 - 12th Workshop on Algorithms in Bioinformatics WABI'12}",
    	year = "{2012}",
    	editor = "Raphael Ben and Tang Jijun",
    	volume = "{7534}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{149-164}",
    	publisher = "{Springer Berlin / Heidelberg}",
    	note = "{Extended Abstract}",
    	owner = "MOIS",
    	timestamp = "2012.11.30"
    }
    
  4. Vincent Reinhard. Méthodes d'introduction de QoS dans un réseau optique à capacité surmultipliée. Université de Versailles Saint-Quentin en Yvelines, laboratoire Prism, 2012. BibTeX

    @phdthesis{Rein12,
    	author = "Reinhard, Vincent",
    	title = "{Méthodes d'introduction de QoS dans un réseau optique à capacité surmultipliée}",
    	school = "{Université de Versailles Saint-Quentin en Yvelines, laboratoire Prism}",
    	year = "{2012}",
    	owner = "MOIS",
    	timestamp = "2012.12.03"
    }
    
  5. Vincent Reinhard, Johanne Cohen, Joanna Tomasik, Dominique Barth and Marc-Antoine Weisser. Optimal Configuration of an Optical Network Providing Predefined Multicast Transmissions. Computer Networks 56(8):2097-2106, 2012. BibTeX

    @article{RCT+12,
    	author = "Reinhard, Vincent and Cohen, Johanne and Tomasik, Joanna and Barth, Dominique and Weisser, Marc-Antoine",
    	title = "{Optimal Configuration of an Optical Network Providing Predefined Multicast Transmissions}",
    	journal = "{Computer Networks}",
    	year = "{2012}",
    	volume = "{56}",
    	pages = "{2097-2106}",
    	number = "{8}",
    	owner = "MOIS",
    	timestamp = "2012.11.09"
    }
    
  6. Cesar Rego. Heuristic Search and Learning for Combinatorial Optimization. Thèse d'Habilitation, Université de Versailles-Saint-Quentin-en Yvelines, laboratoire Prism, 2012. BibTeX

    @phdthesis{Cesa12,
    	author = "Rego, Cesar",
    	title = "{Heuristic Search and Learning for Combinatorial Optimization}",
    	school = "{Université de Versailles-Saint-Quentin-en Yvelines, laboratoire Prism}",
    	year = "{2012}",
    	type = "{Thèse d'Habilitation}",
    	owner = "MOIS",
    	timestamp = "2012.12.03"
    }
    
  7. 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"
    }
    
  8. David Poulain, Joanna Tomasik and Marc-Antoine Weisser. Minimization of the Receiver Cost in an All-Optical Ring with a Limited Number of Wavelengths. In 27th International Symposium on Computer and information Sciences. 2012, 239-247. BibTeX

    @inproceedings{PTWe12,
    	author = "Poulain, David and Tomasik, Joanna and Weisser, Marc-Antoine",
    	title = "{Minimization of the Receiver Cost in an All-Optical Ring with a Limited Number of Wavelengths}",
    	booktitle = "{27th International Symposium on Computer and information Sciences}",
    	year = "{2012}",
    	pages = "{239-247}",
    	owner = "MOIS",
    	timestamp = "2012.12.05"
    }
    
  9. Dana Marinca, Ali Hamieh, Dominique Barth, Kinda Khawam, Danny De Vleeschauwer and Yannick Lelouédec. Cache Management Using Temporal Pattern Based Solicitation for Content Delivery. In 19th International Conference on Telecommunications - ICT 2012 - Jounieh, Lebanon, 23-25 April 2012. 2012, 1-6. BibTeX

    @inproceedings{MHB+12,
    	author = "Marinca, Dana and Hamieh, Ali and Barth, Dominique and Khawam, Kinda and De Vleeschauwer, Danny and Lelouédec, Yannick",
    	title = "{Cache Management Using Temporal Pattern Based Solicitation for Content Delivery}",
    	booktitle = "{19th International Conference on Telecommunications - ICT 2012 - Jounieh, Lebanon, 23-25 April 2012}",
    	year = "{2012}",
    	pages = "{1-6}",
    	owner = "MOIS",
    	timestamp = "2012.11.30"
    }
    
  10. Alexis Lamiable, Dominique Barth, Alain Denise, Franck Quessette, Sandrine Vial and Eric 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, Eric",
    	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"
    }
    
  11. Mohamed Lamine Lamali, Helia Pouyllau and Dominique Barth. Path Computation in Multi-Layer Multi-Domain Networks. In IFIP Networking 1. 2012, 421-433. BibTeX

    @inproceedings{LPBa12,
    	author = "Lamali, Mohamed Lamine and Pouyllau, Helia and Barth, Dominique",
    	title = "{Path Computation in Multi-Layer Multi-Domain Networks}",
    	booktitle = "{IFIP Networking}",
    	year = "{2012}",
    	volume = "{1}",
    	pages = "{421-433}",
    	address = "{Prague, Czech Republic}",
    	journal = "{Networking}",
    	owner = "MOIS",
    	timestamp = "2012.11.08"
    }
    
  12. Lamine Mohamed Lamali, Helia Pouyllau and Dominique Barth. SLA Negotiation: Experimental Observations on Learning Policies. In 6th International Conference on Performance Evaluation Methodologies and Tools - VALUETOOLS. 2012. BibTeX

    @inproceedings{LPBa12a,
    	author = "Lamali, Lamine Mohamed and Pouyllau, Helia and Barth, Dominique",
    	title = "{SLA Negotiation: Experimental Observations on Learning Policies}",
    	booktitle = "{6th International Conference on Performance Evaluation Methodologies and Tools - VALUETOOLS}",
    	year = "{2012}",
    	publisher = "{IEEE}",
    	owner = "MOIS",
    	timestamp = "2012.12.10"
    }
    
  13. Kinda Khawam, Johanne Cohen, Dana Marinca and Samir Tohme. Semi-Distributed Radio Resource Management for Elastic Traffic in a Hybrid Network. In 2012 IEEE Wireless Communications and Networking Conference, WCNC 2012, Paris, France, April 1-4, 2012. 2012, 2659-2664. BibTeX

    @inproceedings{KCMT12a,
    	author = "Khawam, Kinda and Cohen, Johanne and Marinca, Dana and Tohme, Samir",
    	title = "{Semi-Distributed Radio Resource Management for Elastic Traffic in a Hybrid Network}",
    	booktitle = "{2012 IEEE Wireless Communications and Networking Conference, WCNC 2012, Paris, France, April 1-4, 2012}",
    	year = "{2012}",
    	pages = "{2659-2664}",
    	publisher = "{IEEE}",
    	owner = "MOIS",
    	timestamp = "2012.11.09"
    }
    
  14. Kinda Khawam, Johanne Cohen, Dana Marinca and Samir Tohme. Elastic Game Based Radio Resource Management. In Proceedings of the 75th IEEE Vehicular Technology Conference, VTC Spring 2012, Yokohama, Japan, May 6-9, 2012. 2012, 1-5. BibTeX

    @inproceedings{KCMT12,
    	author = "Khawam, Kinda and Cohen, Johanne and Marinca, Dana and Tohme, Samir",
    	title = "{Elastic Game Based Radio Resource Management}",
    	booktitle = "{Proceedings of the 75th IEEE Vehicular Technology Conference, VTC Spring 2012, Yokohama, Japan, May 6-9, 2012}",
    	year = "{2012}",
    	pages = "{1-5}",
    	owner = "MOIS",
    	timestamp = "2012.11.09"
    }
    
  15. Jérémie Du Boisberranger, Daniele Gardy and Yann Ponty. The Weighted Words Collector. In {Colloque international \ em Analysis of Algorithms ( Aofa'12) }. 2012. BibTeX

    @inproceedings{DGP12,
    	author = "Du Boisberranger, Jérémie and Gardy, Daniele and Ponty, Yann",
    	title = "{The Weighted Words Collector}",
    	booktitle = "{Colloque international { \ em Analysis of Algorithms ( Aofa'12) } }",
    	year = "{2012}",
    	owner = "MOIS",
    	timestamp = "2012.10.05"
    }
    
  16. Pierre Coucheney, Patrick Maille and Bruno Tuffin. Comparison of Search Engines non-Neutral and Neutral Behaviors. In SIGMETRICS Performance Evaluation Review 40(2). 2012. BibTeX

    @inproceedings{CMTu12,
    	author = "Coucheney, Pierre and Maille, Patrick and Tuffin, Bruno",
    	title = "{Comparison of Search Engines non-Neutral and Neutral Behaviors}",
    	booktitle = "{SIGMETRICS Performance Evaluation Review}",
    	year = "{2012}",
    	volume = "{40}",
    	number = "{2}",
    	publisher = "{ACM}",
    	owner = "MOIS",
    	timestamp = "2012.12.11"
    }
    
  17. Johanne Cohen, Christoph Durr and Kim Thang Nguyen. Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games. Number CoRR abs/1202.4302, The Computing Research Repository (CoRR), 2012. BibTeX

    @techreport{CDNg12,
    	author = "Cohen, Johanne and Durr, Christoph and Nguyen, Kim Thang",
    	title = "{Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games}",
    	institution = "The Computing Research Repository (CoRR)",
    	year = "{2012}",
    	number = "{CoRR abs/1202.4302}",
    	owner = "MOIS",
    	timestamp = "2012.11.09"
    }
    
  18. Olivier Bournez and Johanne Cohen. Learning Equilibria in Games by Stochastic Distributed Algorithms. In 27th International Symposium on Computer and information Sciences. 2012, 31-38. BibTeX

    @inproceedings{BoCo12,
    	author = "Bournez, Olivier and Cohen, Johanne",
    	title = "{Learning Equilibria in Games by Stochastic Distributed Algorithms}",
    	booktitle = "{27th International Symposium on Computer and information Sciences}",
    	year = "{2012}",
    	series = "{Lecture Notes on Electrical Engineering}",
    	pages = "{31-38}",
    	publisher = "{Springer-Verlag}",
    	chapter = "{Learning Equilibria in Games by Stochastic Distributed Algorithms}",
    	owner = "MOIS",
    	timestamp = "2012.12.05"
    }
    
  19. Vincent Boudet, Johanne Cohen, Rodolphe Giroudeau and Jean-Claude König. Scheduling in the Presence of Processor Networks: Complexity and Approximation. RAIRO - Operations Research 46(1):1-22, 2012. BibTeX

    @article{BCGK12,
    	author = "Boudet, Vincent and Cohen, Johanne and Giroudeau, Rodolphe and König, Jean-Claude",
    	title = "{Scheduling in the Presence of Processor Networks: Complexity and Approximation}",
    	journal = "{RAIRO - Operations Research}",
    	year = "{2012}",
    	volume = "{46}",
    	pages = "{1-22}",
    	number = "{1}",
    	owner = "MOIS",
    	timestamp = "2012.11.09"
    }
    
  20. Olivier Bodini, Daniele Gardy and Olivier Roussel. Boys-and-girls Birthdays and Hadamard Products. Fundamenta Informaticae 117(1-4):85-101, 2012. BibTeX

    @article{BGR12,
    	author = "Bodini, Olivier and Gardy, Daniele and Roussel, Olivier",
    	title = "{Boys-and-girls Birthdays and Hadamard Products}",
    	journal = "{Fundamenta Informaticae}",
    	year = "{2012}",
    	volume = "{117}",
    	pages = "{85-101}",
    	number = "{1-4}",
    	owner = "MOIS",
    	timestamp = "2012.10.04"
    }
    
  21. Dominique Barth, Boubkeur Boudaoud and Thierry Mautor. La théorie des jeux pour l'établissement des contrats dans les réseaux interdomaines.. Number CoRR abs/1207.0216, 2012. BibTeX

    @techreport{BBMa12b,
    	author = "Barth, Dominique and Boudaoud, Boubkeur and Mautor, Thierry",
    	title = "{La théorie des jeux pour l'établissement des contrats dans les réseaux interdomaines.}",
    	year = "{2012}",
    	number = "{CoRR abs/1207.0216}",
    	owner = "MOIS",
    	timestamp = "2012.12.11"
    }
    
  22. Dominique Barth, Boubkeur Boudaoud and Thierry Mautor. Game Theroy for Contracts Establishment with Guaranteed QoS in the Inter-Domain Network. In International Conference on Communications and Information Technology, ICCIT-2012. 2012. BibTeX

    @inproceedings{BBMa12a,
    	author = "Barth, Dominique and Boudaoud, Boubkeur and Mautor, Thierry",
    	title = "{Game Theroy for Contracts Establishment with Guaranteed QoS in the Inter-Domain Network}",
    	booktitle = "{International Conference on Communications and Information Technology, ICCIT-2012}",
    	year = "{2012}",
    	owner = "MOIS",
    	timestamp = "2012.12.10"
    }
    
  23. Dominique Barth, Boubkeur Boudaoud and Thierry Mautor. {La théorie des jeux pour l'établissement des contrats dans les réseaux inter-domaines}. In {13^e congr\ `es annuel de la Société Française de la Recherche Opérationnelle et d'Aide à la Décision}. 2012. BibTeX

    @inproceedings{BBMa12,
    	author = "Barth, Dominique and Boudaoud, Boubkeur and Mautor, Thierry",
    	title = "{La th{\'e}orie des jeux pour l'établissement des contrats dans les r{\'e}seaux inter-domaines}",
    	booktitle = "{13^e congr{\ `e}s annuel de la Soci{\'e}t{\'e} Française de la Recherche Opérationnelle et d'Aide à la D{\'e}cision}",
    	year = "{2012}",
    	owner = "MOIS",
    	timestamp = "2012.12.10"
    }
    
  24. 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"
    }
    
  25. 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. Dominique Barth, Johanne Cohen, Loubna Echabbi and Hélène Le Cadre. Coalition Stability Under QoS Based-Market Segmentation. In Rajgopal Kannan Rahul Jain (ed.). Game Theory for Networks - 2nd International ICST Conference, GAMENETS 2011, Shanghai, China, April 16-18, 2011 75. 2012, 383-396. Revised Selected Papers. BibTeX

    @inproceedings{BCEL12,
    	author = "Barth, Dominique and Cohen, Johanne and Echabbi, Loubna and Le Cadre, Hélène",
    	title = "{Coalition Stability Under QoS Based-Market Segmentation}",
    	booktitle = "{Game Theory for Networks - 2nd International ICST Conference, GAMENETS 2011, Shanghai, China, April 16-18, 2011}",
    	year = "{2012}",
    	editor = "Rahul Jain, Rajgopal Kannan",
    	volume = "{75}",
    	series = "{Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering}",
    	pages = "{383-396}",
    	publisher = "{Springer}",
    	note = "{Revised Selected Papers}",
    	owner = "MOIS",
    	timestamp = "2012.11.09"
    }
    
  2. David Auger. Combinatorial Identification Problems and Graph powers. 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies 9(4):417-420, décembre 2011. BibTeX

    @article{Auge11,
    	author = "Auger, David",
    	title = "{Combinatorial Identification Problems and Graph powers}",
    	journal = "{4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies}",
    	year = "{2011}",
    	volume = "{9}",
    	pages = "{417-420}",
    	number = "{4}",
    	month = "{December}",
    	owner = "MOIS",
    	timestamp = "2012.02.10"
    }
    
  3. Jérémie Du Boisberranger, Daniele Gardy, Charlotte Truchet and Xavier Lorca. A Probabilistic Study of Bound Consistency for the Alldifferent Constraint. avril 2011.
    Abstract This paper introduces a mathematical model for bound consistency of the con- straint AllDifferent. It allows us to compute the probability that the filtering algorithm effectively removes at least one value in the variable domains. A complete study of the bound consistency properties is then proposed. It identifies several behaviors depending on some macroscopic quantities related to the variables and the domains. Finally, it is shown that the probability for an AllDifferent constraint to be bound consistent can be asymptotically estimated in constant time. The experiments illustrate that the precision is good enough for a practical use in constraint programming. URL BibTeX

    @techreport{DGTL11,
    	author = "Du Boisberranger, Jérémie and Gardy, Daniele and Truchet, Charlotte and Lorca, Xavier",
    	title = "{A Probabilistic Study of Bound Consistency for the Alldifferent Constraint}",
    	year = "{2011}",
    	month = "{April}",
    	abstract = "{This paper introduces a mathematical model for bound consistency of the con- straint AllDifferent. It allows us to compute the probability that the filtering algorithm effectively removes at least one value in the variable domains. A complete study of the bound consistency properties is then proposed. It identifies several behaviors depending on some macroscopic quantities related to the variables and the domains. Finally, it is shown that the probability for an AllDifferent constraint to be bound consistent can be asymptotically estimated in constant time. The experiments illustrate that the precision is good enough for a practical use in constraint programming.}",
    	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 - Laboratoire d'Informatique de Nantes Atlantique - LINA - CNRS : UMR6241 - Universit{\'e} de Nantes - Ecole des Mines de Nantes",
    	file = "probaAllDiff.pdf:http\://hal.archives-ouvertes.fr/hal-00588888/PDF/probaAllDiff.pdf:PDF",
    	hal_id = "hal-00588888",
    	keywords = "Constraint programming; Global constraints; Probability",
    	language = "Anglais",
    	owner = "MOIS",
    	timestamp = "2011.07.22",
    	url = "http://hal.archives-ouvertes.fr/hal-00588888/en/"
    }
    
  4. Johanne Cohen, Patrick Maille and Burkhard Stiller (eds.). Economics of Converged, Internet-Based Networks, 7th International Workshop on Internet Charging and Qos Technologies, ICQT 211. Springer edition, series Lecture Notes in Computer Science, volume 6995, Springer, 2011. BibTeX

    @book{CMSt11,
    	title = "{Economics of Converged, Internet-Based Networks, 7th International Workshop on Internet Charging and Qos Technologies, ICQT 211}",
    	publisher = "{Springer}",
    	year = "{2011}",
    	editor = "Cohen, Johanne and Maille, Patrick and Stiller, Burkhard",
    	volume = "{6995}",
    	series = "{Lecture Notes in Computer Science}",
    	address = "{Paris, France}",
    	edition = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2011.11.25"
    }
    
  5. 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"
    }
    
  6. Vincent Reinhard, Johanne Cohen, Joanna Tomasik, Dominique Barth and Marc-Antoine Weisser. Performance Improvement of an Optical Network Providing Services Based on Multicast. In Proceedings of the 26th International Symposium on Computer and Information Sciences. 2011, 239-246. BibTeX

    @inproceedings{RCT+11,
    	author = "Reinhard, Vincent and Cohen, Johanne and Tomasik, Joanna and Barth, Dominique and Weisser, Marc-Antoine",
    	title = "{Performance Improvement of an Optical Network Providing Services Based on Multicast}",
    	booktitle = "{Proceedings of the 26th International Symposium on Computer and Information Sciences}",
    	year = "{2011}",
    	pages = "{239-246}",
    	address = "{Londres, Royaume-Uni}",
    	month = "{26-28 September 2011}",
    	language = "Anglais"
    }
    
  7. Peter Reichl, Ivan Gojmerac, Dominique Barth, Mariem Krichen, Johanne Cohen, Olivier Marcé and Werner Wiedermann. Technico-Economics of Small Cell Networks: The AWARE project. In 5th International Conference on NETwork Games, COntrol and OPtimization, NetGCooP 2011, Paris, France, October 12-14, 2011. 2011, 1-6. BibTeX

    @inproceedings{RGB+12,
    	author = "Reichl, Peter and Gojmerac, Ivan and Barth, Dominique and Krichen, Mariem and Cohen, Johanne and Marcé, Olivier and Wiedermann, Werner",
    	title = "{Technico-Economics of Small Cell Networks: The AWARE project}",
    	booktitle = "{5th International Conference on NETwork Games, COntrol and OPtimization, NetGCooP 2011, Paris, France, October 12-14, 2011}",
    	year = "{2011}",
    	pages = "{1-6}",
    	owner = "MOIS",
    	timestamp = "2012.11.09"
    }
    
  8. David Poulain, Marc-Antoine Weisser, Joanna Tomasik and Dominique Barth. Optimal receiver cost and wavelength number minimization in all-optical ring networks. In Proceedings of the 11th International Conference on Telecommunications. 2011, 411-417.
    Abstract Reducing both power consumption and the ecological impact of networks has become a priority. Solutions which allow us to reduce these factors are based on all-optical technologies. All-optical rings are beginning to be deployed as metropolitan networks and new more energy efficient equipments are being proposed. We present one of these equipments and explain how to reduce the CAPEX of such networks by properly dimensioning them. Receivers located in nodes read information from wavelengths. We study a dimensioning problem which consists in minimizing the number of wavelengths and the total number of receivers in a ring for a given traffic matrix. We prove that this problem is NP-complete and propose a heuristic algorithm. The solution has been validated under realistic traffic conditions and achieved near-optimal results. The solution could be extended to wider networks if we consider working with multi-ring networks. URL BibTeX

    @inproceedings{PWTB11,
    	author = "Poulain, David and Weisser, Marc-Antoine and Tomasik, Joanna and Barth, Dominique",
    	title = "{Optimal receiver cost and wavelength number minimization in all-optical ring networks}",
    	booktitle = "{Proceedings of the 11th International Conference on Telecommunications}",
    	year = "{2011}",
    	pages = "{411-417}",
    	address = "{Graz, Autriche}",
    	month = "{June 15-17}",
    	abstract = "{Reducing both power consumption and the ecological impact of networks has become a priority. Solutions which allow us to reduce these factors are based on all-optical technologies. All-optical rings are beginning to be deployed as metropolitan networks and new more energy efficient equipments are being proposed. We present one of these equipments and explain how to reduce the CAPEX of such networks by properly dimensioning them. Receivers located in nodes read information from wavelengths. We study a dimensioning problem which consists in minimizing the number of wavelengths and the total number of receivers in a ring for a given traffic matrix. We prove that this problem is NP-complete and propose a heuristic algorithm. The solution has been validated under realistic traffic conditions and achieved near-optimal results. The solution could be extended to wider networks if we consider working with multi-ring networks.}",
    	affiliation = "SUPELEC-Campus Gif - SUPELEC - 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",
    	hal_id = "hal-00591503",
    	keywords = "optical rings, network dimensioning, optimization, NP-completeness",
    	language = "Anglais",
    	owner = "MOIS",
    	timestamp = "2011.07.22",
    	url = "http://hal-supelec.archives-ouvertes.fr/hal-00591503/en/"
    }
    
  9. Helene Le Cadre, Dominique Barth and Helia Pouyllau. QoS Commitment Between Vertically Integrated Autonomous Systems. European Journal of Operational Reserch 214(3):627-643, 2011. BibTeX

    @article{LBHe11,
    	author = "Le Cadre, Helene and Barth, Dominique and Pouyllau, Helia",
    	title = "{QoS Commitment Between Vertically Integrated Autonomous Systems}",
    	journal = "{European Journal of Operational Reserch}",
    	year = "{2011}",
    	volume = "{214}",
    	pages = "{627-643}",
    	number = "{3}",
    	owner = "MOIS",
    	timestamp = "2011.11.30"
    }
    
  10. Alexis Lamiable. Méthode de théorie des jeux pour la prédiction de la structure 3D de l'ARN. Université de Versailles-Saint-Quentin en Yvelines, laboratoire PRISM, 2011. BibTeX

    @phdthesis{Lami11,
    	author = "Lamiable, Alexis",
    	title = "{Méthode de théorie des jeux pour la prédiction de la structure 3D de l'ARN}",
    	school = "{Université de Versailles-Saint-Quentin en Yvelines, laboratoire PRISM}",
    	year = "{2011}",
    	owner = "MOIS",
    	timestamp = "2012.02.22"
    }
    
  11. Mariem Krichen, Johanne Cohen and Dominique Barth. File Transfer Application for Sharing Femto Access. In 26th International Symposium on Computer and Information Sciences- ISCIS 2011. 2011, 191-198. BibTeX

    @inproceedings{KCBa11a,
    	author = "Krichen, Mariem and Cohen, Johanne and Barth, Dominique",
    	title = "{File Transfer Application for Sharing Femto Access}",
    	booktitle = "{26th International Symposium on Computer and Information Sciences- ISCIS 2011}",
    	year = "{2011}",
    	pages = "{191-198}",
    	address = "{London, United-Kingdom}",
    	month = "{September, 26-28}",
    	owner = "MOIS",
    	timestamp = "2011.11.28"
    }
    
  12. Mariem Krichen, Johanne Cohen and Dominique Barth. File Transfer Application For Sharing Femto Access. Number 1104.5150, 2011. CoRR abs. BibTeX

    @techreport{KCBa11,
    	author = "Krichen, Mariem and Cohen, Johanne and Barth, Dominique",
    	title = "{File Transfer Application For Sharing Femto Access}",
    	year = "{2011}",
    	number = "{1104.5150}",
    	note = "{CoRR abs}",
    	owner = "MOIS",
    	timestamp = "2011.07.22"
    }
    
  13. Kinda Khawam, Marc Ibrahim, Johanne Cohen, Samer Lahoud and Samir Tohme. Individual vs. Global Radio Resource Management in a Hybrid Broadband Network. In IEEE International Conference on Communications - ICC2011. 2011, 1-6. BibTeX

    @inproceedings{KIC+11,
    	author = "Khawam, Kinda and Ibrahim, Marc and Cohen, Johanne and Lahoud, Samer and Tohme, Samir",
    	title = "{Individual vs. Global Radio Resource Management in a Hybrid Broadband Network}",
    	booktitle = "{IEEE International Conference on Communications - ICC2011}",
    	year = "{2011}",
    	pages = "{1-6}",
    	address = "{Kyoto, Japan}",
    	month = "{June 5-9}",
    	owner = "MOIS",
    	timestamp = "2011.12.13"
    }
    
  14. Hervé Fournier and Antoine Vigneron. Fitting a Step function to a Point Set. Algorithmica 60(1):95-109, 2011. BibTeX

    @article{FoVi11,
    	author = "Fournier, Hervé and Vigneron, Antoine",
    	title = "{Fitting a Step function to a Point Set}",
    	journal = "{Algorithmica}",
    	year = "{2011}",
    	volume = "{60}",
    	pages = "{95-109}",
    	number = "{1}",
    	owner = "MOIS",
    	timestamp = "2011.08.19"
    }
    
  15. Herve Fournier and Olivier Teytaud. Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns. Algorithmica 59(3):387-408, 2011. BibTeX

    @article{FoTe2011,
    	author = "Fournier, Herve and Teytaud, Olivier",
    	title = "{Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns}",
    	journal = "{Algorithmica}",
    	year = "{2011}",
    	volume = "{59}",
    	pages = "{387-408}",
    	number = "{3}",
    	owner = "MOIS",
    	timestamp = "2011.08.19"
    }
    
  16. Johanne Cohen, Christoph Durr and Nguyen Kim Thang. Non-clairvoyant Scheduling Games. CoRR abs 1101.1256, 2011. BibTeX

    @techreport{CDTh11,
    	author = "Cohen, Johanne and Durr, Christoph and Thang, Nguyen Kim",
    	title = "{Non-clairvoyant Scheduling Games}",
    	year = "{2011}",
    	type = "{CoRR abs}",
    	number = "{1101.1256}",
    	booktitle = "CoRR",
    	owner = "MOIS",
    	pages = "1101-1256",
    	timestamp = "2011.08.18"
    }
    
  17. Johanne Cohen, Christoph Durr and Kim Thang Nguyen. Non-clairvoyant Scheduling Games. Theory Computer System 49(1):3-23, 2011. BibTeX

    @article{CDNg11,
    	author = "Cohen, Johanne and Durr, Christoph and Nguyen, Kim Thang",
    	title = "{Non-clairvoyant Scheduling Games}",
    	journal = "{Theory Computer System}",
    	year = "{2011}",
    	volume = "{49}",
    	pages = "{3-23}",
    	number = "{1}",
    	owner = "MOIS",
    	timestamp = "2011.12.02"
    }
    
  18. Johanne Cohen and Sylvie Delaet. Stabilité des arbres des plus courts chemins en présence de concurrence . Technique et Science Informatiques 30/10:1167-1189, 2011. BibTeX

    @article{CoDe11,
    	author = "Cohen, Johanne and Delaet, Sylvie",
    	title = "{Stabilit\'e des arbres des plus courts chemins en pr\'esence de concurrence }",
    	journal = "{Technique et Science Informatiques}",
    	year = "{2011}",
    	volume = "{30/10}",
    	pages = "{1167-1189}",
    	owner = "MOIS",
    	timestamp = "2012.06.27"
    }
    
  19. Johanne Cohen, Daniel Cordeiro, Denis Trystam and Frédéric Wagner. Coordination Mechanisms for Selfish Multi-Organization Scheduling. In 18th International Conference on High Performance Computing, HiPC 2011, Bengaluru, India, December 18-21, 2011. 2011, 1-9. BibTeX

    @inproceedings{CCTW11a,
    	author = "Cohen, Johanne and Cordeiro, Daniel and Trystam, Denis and Wagner, Frédéric",
    	title = "{Coordination Mechanisms for Selfish Multi-Organization Scheduling}",
    	booktitle = "{18th International Conference on High Performance Computing, HiPC 2011, Bengaluru, India, December 18-21, 2011}",
    	year = "{2011}",
    	pages = "{1-9}",
    	owner = "MOIS",
    	timestamp = "2012.11.09"
    }
    
  20. Johanne Cohen, Daniel Cordeiro, Denis Trystam and Frédéric Wagner. Multi-organisation Scheduling Approximation Algorithms. Concurrency and Computation: Practice and Experience 23(17):2220-2234, 2011. BibTeX

    @article{CCTW11,
    	author = "Cohen, Johanne and Cordeiro, Daniel and Trystam, Denis and Wagner, Frédéric",
    	title = "{Multi-organisation Scheduling Approximation Algorithms}",
    	journal = "{Concurrency and Computation: Practice and Experience}",
    	year = "{2011}",
    	volume = "{23}",
    	pages = "{2220-2234}",
    	number = "{17}",
    	owner = "MOIS",
    	timestamp = "2011.11.28"
    }
    
  21. Johanne Cohen, Daniel Cordeiro, Denis Trystam and Frederic Wagner. Multi-Organisation Scheduling Approximation Algorithms. In Concurrency and Computation: Pratice and Experience 23(17). 2011, 2220-2234. BibTeX

    @inproceedings{CCTW12,
    	author = "Cohen, Johanne and Cordeiro, Daniel and Trystam, Denis and Wagner, Frederic",
    	title = "{Multi-Organisation Scheduling Approximation Algorithms}",
    	booktitle = "{Concurrency and Computation: Pratice and Experience}",
    	year = "{2011}",
    	volume = "{23}",
    	number = "{17}",
    	pages = "{2220-2234}",
    	owner = "MOIS",
    	timestamp = "2012.11.09"
    }
    
  22. Olivier Bournez, Jeremie Chalopin, Johanne Cohen, Xavier Koegler and Mikael Rabie. Asymetric Pavlovian Populations. CoRR abs 1109.4433, 2011. BibTeX

    @techreport{BCCKR+11a,
    	author = "Bournez, Olivier and Chalopin, Jeremie and Cohen, Johanne and Koegler, Xavier and Rabie, Mikael",
    	title = "{Asymetric Pavlovian Populations}",
    	year = "{2011}",
    	type = "{CoRR abs}",
    	number = "{1109.4433}",
    	owner = "MOIS",
    	timestamp = "2011.11.28"
    }
    
  23. Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler and Mikael Rabie. Computing with Pavlovian Populations. In OPODIS 2011 : 15th International Conference On Principles Of Distributed Systems. 2011, 409-420. BibTeX

    @inproceedings{BCCK+11,
    	author = "Bournez, Olivier and Chalopin, Jérémie and Cohen, Johanne and Koegler, Xavier and Rabie, Mikael",
    	title = "{Computing with Pavlovian Populations}",
    	booktitle = "{OPODIS 2011 : 15th International Conference On Principles Of Distributed Systems}",
    	year = "{2011}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{409-420}",
    	address = "{Toulouse, France}",
    	month = "{December 13-16}",
    	publisher = "{Springer}",
    	owner = "MOIS",
    	timestamp = "2012.02.10"
    }
    
  24. Olivier Bournez, Jeremie Chalopin, Johanne Cohen, Xavier Koeger and Mikael Rabbi. Asymetric Pavlovian Populations. In 15th International Conference on Principles of Distributed Systems (OPODIS). 2011. BibTeX

    @inproceedings{BCCKR+11,
    	author = "Bournez, Olivier and Chalopin, Jeremie and Cohen, Johanne and Koeger, Xavier and Rabbi, Mikael",
    	title = "{Asymetric Pavlovian Populations}",
    	booktitle = "{15th International Conference on Principles of Distributed Systems (OPODIS)}",
    	year = "{2011}",
    	series = "{Lecture Notes in Computer Science}",
    	owner = "MOIS",
    	timestamp = "2011.11.25"
    }
    
  25. Dominique Barth, Johanne Cohen, Patrick Maille and Helia Pouyllau. Competition Among Online-Gaming Service Providers. In 5th International Conference on NETwork Games, COntrol and OPtimization, NetGCooP 2011, Paris, France, October 12-14, 2011. 2011, 1-5. BibTeX

    @inproceedings{BCMP11,
    	author = "Barth, Dominique and Cohen, Johanne and Maille, Patrick and Pouyllau, Helia",
    	title = "{Competition Among Online-Gaming Service Providers}",
    	booktitle = "{5th International Conference on NETwork Games, COntrol and OPtimization, NetGCooP 2011, Paris, France, October 12-14, 2011}",
    	year = "{2011}",
    	pages = "{1-5}",
    	owner = "MOIS",
    	timestamp = "2012.11.09"
    }
    
  26. Dominique Barth, Boubkeur Boudaoud and Thierry Mautor. SLA Etablissement with Guaranteed QoS in the Interdomain Network: A Stock Model. CoRR abs/1112.1615, Université de Versailles-Saint-Quentin en Yvelines, laboratoire Prism, 2011. BibTeX

    @techreport{BBMa11,
    	author = "Barth, Dominique and Boudaoud, Boubkeur and Mautor, Thierry",
    	title = "{SLA Etablissement with Guaranteed QoS in the Interdomain Network: A Stock Model}",
    	institution = "{Université de Versailles-Saint-Quentin en Yvelines, laboratoire Prism}",
    	year = "{2011}",
    	type = "{CoRR abs/1112.1615}",
    	owner = "MOIS",
    	timestamp = "2012.02.10"
    }
    
  27. 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"
    }
    

  1. Daniele Gardy and Yann Ponty. Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models. In GASCOM'10. septembre 2010, 14.
    Abstract The present work analyzes the redundancy of sets of combinatorial objects produced by a weighted random generation algorithm proposed by Denise et al. This scheme associates weights to the terminals symbols of a weighted context-free grammar, extends this weight definition multiplicatively on words, and draws words of length $n$ with probability proportional their weight. We investigate the level of redundancy within a sample of $k$ word, the proportion of the total probability covered by $k$ words (coverage), the time (number of generations) of the first collision, and the time of the full collection. For these four questions, we use an analytic urn analogy to derive asymptotic estimates and/or polynomially computable exact forms. We illustrate these tools by an analysis of an RNA secondary structure statistical sampling algorithm introduced by Ding et al. URL BibTeX

    @inproceedings{GaPo10,
    	author = "Gardy, Daniele and Ponty, Yann",
    	title = "{Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models}",
    	booktitle = "{GASCOM'10}",
    	year = "{2010}",
    	pages = "{14}",
    	address = "{Montréal, Canada}",
    	month = "{September}",
    	abstract = "{The present work analyzes the redundancy of sets of combinatorial objects produced by a weighted random generation algorithm proposed by Denise et al. This scheme associates weights to the terminals symbols of a weighted context-free grammar, extends this weight definition multiplicatively on words, and draws words of length $n$ with probability proportional their weight. We investigate the level of redundancy within a sample of $k$ word, the proportion of the total probability covered by $k$ words (coverage), the time (number of generations) of the first collision, and the time of the full collection. For these four questions, we use an analytic urn analogy to derive asymptotic estimates and/or polynomially computable exact forms. We illustrate these tools by an analysis of an RNA secondary structure statistical sampling algorithm introduced by Ding et al.}",
    	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 - Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX - CNRS : UMR7161 - Polytechnique - X - AMIB - INRIA Saclay - Ile de France - INRIA - Polytechnique - X - CNRS : UMR7161 - Universit{\'e} Paris Sud - Paris XI - CNRS : UMR8623",
    	audience = "internationale",
    	file = "GASCOM-2010-Allocations.pdf:http\://hal.inria.fr/inria-00543150/PDF/GASCOM-2010-Allocations.pdf:PDF",
    	hal_id = "inria-00543150",
    	keywords = "Coupon collector; Birthday paradox; Random generation; Context-free languages",
    	language = "Anglais",
    	owner = "MOIS",
    	timestamp = "2011.07.25",
    	url = "http://hal.inria.fr/inria-00543150/en/"
    }
    
  2. Marc-Antoine Weisser, Joanna Tomasik and Dominique Barth. Exploiting the Inter-Domain Hierarchy for the QoS Network Management. In Intelligent Quality of Service Technologies and Network Management: Models for Enhancing Communication. IGI Global, 2010, pages 239-255.
    Abstract The Internet is an interconnection of multiple networks called domains. Inter-domain routing is ensured by BGP which preserves each domain's independence and announces routes arbitrarily chosen by domains. BGP messages carry no information concerning quality parameters of announced routes. The authors' goal is to provide domains with information regarding the congestion state of other domains without any changes in BGP. A domain, which is aware of heavily congested domains, can choose a bypass instead of a route exhibiting possible problems with QoS satisfaction. They propose a mechanism which sends alert messages in order to notify domains about the congestion state of other domains. The major difficulty consists in avoiding flooding the Internet with signaling messages. The authors' solution limits the number of alerts by taking advantage of the hierarchical structure of the Internet set by P2C and P2P relationships. Their algorithm is distributed and heuristic because it is a solution to an NP-complete and inapproximable problem. They prove these properties by reducing the Steiner problem in directed acyclic graphs to our problem of alert diffusion. The simulations show that our mechanism significantly diminishes the number of unavailable domains and routes compared to those obtained with BGP routing and with a theoretical centralized mechanism. URL BibTeX

    @incollection{WTBa10,
    	author = "Weisser, Marc-Antoine and Tomasik, Joanna and Barth, Dominique",
    	title = "{Exploiting the Inter-Domain Hierarchy for the QoS Network Management}",
    	booktitle = "{Intelligent Quality of Service Technologies and Network Management: Models for Enhancing Communication}",
    	publisher = "{IGI Global}",
    	year = "{2010}",
    	pages = "{239-255}",
    	abstract = "{The Internet is an interconnection of multiple networks called domains. Inter-domain routing is ensured by BGP which preserves each domain's independence and announces routes arbitrarily chosen by domains. BGP messages carry no information concerning quality parameters of announced routes. The authors' goal is to provide domains with information regarding the congestion state of other domains without any changes in BGP. A domain, which is aware of heavily congested domains, can choose a bypass instead of a route exhibiting possible problems with QoS satisfaction. They propose a mechanism which sends alert messages in order to notify domains about the congestion state of other domains. The major difficulty consists in avoiding flooding the Internet with signaling messages. The authors' solution limits the number of alerts by taking advantage of the hierarchical structure of the Internet set by P2C and P2P relationships. Their algorithm is distributed and heuristic because it is a solution to an NP-complete and inapproximable problem. They prove these properties by reducing the Steiner problem in directed acyclic graphs to our problem of alert diffusion. The simulations show that our mechanism significantly diminishes the number of unavailable domains and routes compared to those obtained with BGP routing and with a theoretical centralized mechanism.}",
    	affiliation = "SUPELEC-Campus Gif - SUPELEC - 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",
    	hal_id = "hal-00493849",
    	keywords = "networking ; telecommunications ; Internet hierarchy ; QoS ; traffic engineering ; r{\'e}seaux ; t{\'e}l{\'e}communication ; hi{\'e}rarchie de l'Internet ; ing{\'e}nierie de trafic",
    	language = "Anglais",
    	owner = "MOIS",
    	timestamp = "2011.07.25",
    	url = "http://hal-supelec.archives-ouvertes.fr/hal-00493849/en/"
    }
    
  3. Alexis Lamiable, Dominique Barth, Alain Denise, Franck Quessette and Sandrine Vial. 3D RNA Structure prediction: an algorithmic game-theory appoach. 2010. Poster at International Society for Computationnal Biology (ISCB) Student Concil. BibTeX

    @misc{LBD+10,
    	author = "Lamiable, Alexis and Barth, Dominique and Denise, Alain and Quessette, Franck and Vial, Sandrine",
    	title = "{3D RNA Structure prediction: an algorithmic game-theory appoach}",
    	year = "{2010}",
    	note = "{Poster at International Society for Computationnal Biology (ISCB) Student Concil}",
    	booktitle = "ISCB student council 2010",
    	owner = "MOIS",
    	timestamp = "2011.08.17"
    }
    
  4. Kinda Khawam, Marc Ibrahim, Johanne Cohen, Samer Lahoud and Samir Tohme. Individual vs. Global Radio Resource Management in a Hybrid Broadband Network. 2010.
    Abstract Nowadays, with the abundance of diverse air interfaces in the same operating area, advanced Radio Resource Management (RRM) is vital to take advantage of the available system resources. In such a scenario, a mobile user will be able to connect concurrently to different wireless access networks. In this paper, we consider the downlink of a hybrid network with two broadband Radio Access Technologies (RAT): WiMAX [1] and WiFi [2]. Two approaches are proposed to load balance the traffic of every user between the two available RATs: an individual approach where mobile users selfishly strive to improve their performance and a global approach where resource allocation is made in a way to satisfy all mobile users. We devise for the individual approach a fully distributed resource management scheme portrayed as a non-cooperative game. We characterize the Nash equilibriums of the proposed RRM game and put forward a decentralized algorithm based on replicator dynamics to achieve those equilibriums. In the global approach, resources are assigned by the system in order to enhance global performances. For the two approaches, we show that after convergence, each user is connected to a single RAT which avoids costly traffic splitting between available RATs. URL BibTeX

    @techreport{KIC+10,
    	author = "Khawam, Kinda and Ibrahim, Marc and Cohen, Johanne and Lahoud, Samer and Tohme, Samir",
    	title = "{Individual vs. Global Radio Resource Management in a Hybrid Broadband Network}",
    	year = "{2010}",
    	month = "{} } # Oct # { {}",
    	abstract = "{Nowadays, with the abundance of diverse air interfaces in the same operating area, advanced Radio Resource Management (RRM) is vital to take advantage of the available system resources. In such a scenario, a mobile user will be able to connect concurrently to different wireless access networks. In this paper, we consider the downlink of a hybrid network with two broadband Radio Access Technologies (RAT): WiMAX [1] and WiFi [2]. Two approaches are proposed to load balance the traffic of every user between the two available RATs: an individual approach where mobile users selfishly strive to improve their performance and a global approach where resource allocation is made in a way to satisfy all mobile users. We devise for the individual approach a fully distributed resource management scheme portrayed as a non-cooperative game. We characterize the Nash equilibriums of the proposed RRM game and put forward a decentralized algorithm based on replicator dynamics to achieve those equilibriums. In the global approach, resources are assigned by the system in order to enhance global performances. For the two approaches, we show that after convergence, each user is connected to a single RAT which avoids costly traffic splitting between available RATs.}",
    	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 - Ecole sup{\'e}rieure d'ing{\'e}nieurs de Beyrouth - ESIB - Universit{\'e} Saint-Joseph-Beyrouth - ATNET - IRISA - Universit{\'e} de Rennes I - Institut National des Sciences Appliqu{\'e}es de Rennes - {\'E}cole normale sup{\'e}rieure de Cachan - ENS Cachan - CNRS : UMR6074",
    	file = "PI-1956.pdf:http\://hal.inria.fr/inria-00528575/PDF/PI-1956.pdf:PDF",
    	hal_id = "inria-00528575",
    	keywords = "Non-cooperative game theory, non-linear optimisation, WiMAX, WiFi, 4G networks",
    	language = "Anglais",
    	owner = "MOIS",
    	pages = 9,
    	timestamp = "2011.07.25",
    	url = "http://hal.inria.fr/inria-00528575/en/"
    }
    
  5. Antoine Genitrini and Bernhard Gittenberger. No Shannon effect on probability distributions on Boolean functions induced by random expressions.. In Michael Drmota and Bernhard Gittenberger (eds.). Discrete Mathematics and Theoretical Computer Science. 2010, ONLINE http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAM0121. URL BibTeX

    @inproceedings{GeGi10,
    	author = "Genitrini, Antoine and Gittenberger, Bernhard",
    	title = "{No Shannon effect on probability distributions on Boolean functions induced by random expressions.}",
    	booktitle = "{Discrete Mathematics and Theoretical Computer Science}",
    	year = "{2010}",
    	editor = "Drmota, Michael and Gittenberger, Bernhard",
    	series = "{DMTCS Proceedings}",
    	pages = "{ONLINE http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAM0121}",
    	address = "{Vienna, Autriche}",
    	publisher = "{DMTCS}",
    	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 - Institut f{\"u}r Diskrete Mathematik und Geometrie - Technische Universit{\"a}t Wien},
    	audience = "internationale",
    	hal_id = "hal-00530503",
    	language = "Anglais",
    	owner = "MOIS",
    	timestamp = "2011.07.25",
    	url = "http://hal.archives-ouvertes.fr/hal-00530503/en/"
    }
    
  6. Daniele Gardy and Yann Ponty. Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models. CoRR abs 1012.1129, 2010. BibTeX

    @techreport{GaPo10a,
    	author = "Gardy, Daniele and Ponty, Yann",
    	title = "{Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models}",
    	year = "{2010}",
    	type = "{CoRR abs}",
    	number = "{1012.1129}",
    	owner = "MOIS",
    	timestamp = "2011.08.18"
    }
    
  7. Herve Fournier and Olivier Teytaud. Lower Bounds for Comparison Based Evolution Strategies using VC-dimension and Sign Patterns. Algorithmica, 2010.
    Abstract We derive lower bounds on the convergence rate of comparison based or selection based algorithms, improving existing results in the continuous setting, and extending them to non-trivial results in the discrete case. This is achieved by considering the VC-dimension of the level sets of the fitness functions; results are then obtained through the use of the shatter function lemma. In the special case of optimization of the sphere function, improved lower bounds are obtained by an argument based on the number of sign patterns. URL BibTeX

    @article{FoTe10,
    	author = "Fournier, Herve and Teytaud, Olivier",
    	title = "{Lower Bounds for Comparison Based Evolution Strategies using VC-dimension and Sign Patterns}",
    	journal = "{Algorithmica}",
    	year = "{2010}",
    	abstract = "{We derive lower bounds on the convergence rate of comparison based or selection based algorithms, improving existing results in the continuous setting, and extending them to non-trivial results in the discrete case. This is achieved by considering the VC-dimension of the level sets of the fitness functions; results are then obtained through the use of the shatter function lemma. In the special case of optimization of the sphere function, improved lower bounds are obtained by an argument based on the number of sign patterns.}",
    	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 - Laboratoire de Recherche en Informatique - LRI - CNRS : UMR8623 - Universit{\'e} Paris Sud - Paris XI - TAO - INRIA Saclay - Ile de France - INRIA - CNRS : UMR8623 - Universit{\'e} Paris Sud - Paris XI",
    	audience = "internationale",
    	file = "evolution.pdf:http\://hal.inria.fr/inria-00452791/PDF/evolution.pdf:PDF",
    	hal_id = "inria-00452791",
    	keywords = "Evolutionary Algorithms;Parallel Optimization;Comparison-based algorithms;VC-dimension;Sign patterns;Complexity",
    	language = "Anglais",
    	owner = "MOIS",
    	publisher = "Springer",
    	timestamp = "2011.07.25",
    	url = "http://hal.inria.fr/inria-00452791/en/"
    }
    
  8. Herve Fournier, Daniele Gardy, Antoine Genitrini and Marek Zaionc. Tautologies over Implication with negative literals. Mathematical Logic Quarterly 56(4):388- -396, 2010. URL BibTeX

    @article{FGGZ10,
    	author = "Fournier, Herve and Gardy, Daniele and Genitrini, Antoine and Zaionc, Marek",
    	title = "{Tautologies over Implication with negative literals}",
    	journal = "{Mathematical Logic Quarterly}",
    	year = "{2010}",
    	volume = "{56}",
    	pages = "{388- -396}",
    	number = "{4}",
    	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 - Theoretical Computer Science at Jagiellonian - Jagiellonian University",
    	audience = "internationale",
    	hal_id = "hal-00530496",
    	language = "Anglais",
    	owner = "MOIS",
    	timestamp = "2011.07.25",
    	url = "http://hal.archives-ouvertes.fr/hal-00530496/en/"
    }
    
  9. Johanne Cohen, Daniel Cordeiro, Denis Trystram and Frederic Wagner. Analysis of Multi-Organization Scheduling Algorithms. In Pasqua D'Ambra, Mario Rosario Guarracino and Domenico Talia (eds.). 16th International Euro-Par Conference Parallel Processing, Euro-Par 6272. 2010, 367–379.
    Abstract In this paper we consider the problem of scheduling on com- puting platforms composed of several independent organizations, known as the Multi-Organization Scheduling Problem (MOSP). Each organiza- tion provides both resources and tasks and follows its own objectives. We are interested in the best way to minimize the makespan on the entire platform when the organizations behave in a selfish way. We study the complexity of the MOSP problem with two different local objectives – makespan and average completion time – and show that MOSP is NP-Hard in both cases. We formally define a selfishness notion, by means of restrictions on the schedules. We prove that selfish behavior imposes a lower bound of 2 on the approximation ratio for the global makespan. We present various approximation algorithms of ratio 2 which validate selfishness restrictions. These algorithms are experimentally evaluated through simulation, exhibiting good average performances. URL BibTeX

    @inproceedings{CCTW10,
    	author = "Cohen, Johanne and Cordeiro, Daniel and Trystram, Denis and Wagner, Frederic",
    	title = "{Analysis of Multi-Organization Scheduling Algorithms}",
    	booktitle = "{16th International Euro-Par Conference Parallel Processing, Euro-Par}",
    	year = "{2010}",
    	editor = "Pasqua D'Ambra and Mario Rosario Guarracino and Domenico Talia",
    	volume = "{6272}",
    	series = "{Lecture Notes in Computer Science}",
    	pages = "{367--379}",
    	address = "{Ischia, Italie}",
    	publisher = "{Springer}",
    	abstract = "{In this paper we consider the problem of scheduling on com- puting platforms composed of several independent organizations, known as the Multi-Organization Scheduling Problem (MOSP). Each organiza- tion provides both resources and tasks and follows its own objectives. We are interested in the best way to minimize the makespan on the entire platform when the organizations behave in a selfish way. We study the complexity of the MOSP problem with two different local objectives -- makespan and average completion time -- and show that MOSP is NP-Hard in both cases. We formally define a selfishness notion, by means of restrictions on the schedules. We prove that selfish behavior imposes a lower bound of 2 on the approximation ratio for the global makespan. We present various approximation algorithms of ratio 2 which validate selfishness restrictions. These algorithms are experimentally evaluated through simulation, exhibiting good average performances.}",
    	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 - MOAIS - INRIA Grenoble Rh{\^o}ne-Alpes / LIG Laboratoire d'Informatique de Grenoble - INRIA - Universit{\'e} Joseph Fourier - Grenoble I - Institut National Polytechnique de Grenoble - INPG - Universit{\'e} Pierre Mend{\`e}s-France - Grenoble II - CNRS : UMR5217 - Laboratoire d'Informatique de Grenoble - LIG - CNRS : UMR5217 - INRIA - Universit{\'e} Pierre Mend{\`e}s-France - Grenoble II - Universit{\'e} Joseph Fourier - Grenoble I - Institut Polytechnique de Grenoble",
    	audience = "internationale",
    	file = "main.pdf:http\://hal.inria.fr/inria-00536510/PDF/main.pdf:PDF",
    	hal_id = "inria-00536510",
    	language = "Anglais",
    	owner = "MOIS",
    	timestamp = "2011.07.25",
    	url = "http://hal.inria.fr/inria-00536510/en/"
    }
    
  10. 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"
    }
    
  11. Olivier Bodini, Daniele Gardy and Olivier Roussel. Boys and Girls bithdays and Hadamard products. Poster – 7th international conference on Lattice paths, combinatorics, and applications, 2010. BibTeX

    @misc{BGRo10,
    	author = "Bodini, Olivier and Gardy, Daniele and Roussel, Olivier",
    	title = "{Boys and Girls bithdays and Hadamard products}",
    	howpublished = "{Poster -- 7th international conference on Lattice paths, combinatorics, and applications}",
    	year = "{2010}",
    	annote = "poster",
    	owner = "MOIS",
    	timestamp = "2012.06.26"
    }
    
  12. Olivier Bodini, Daniele Gardy and A Jacquot. Asymptotics and random sampling for formulae in intuitionist logical systems. In 7\ème conference GASCOM (Génération Aléatoire de Structures Combinatoires). 2010. BibTeX

    @inproceedings{BGJa10,
    	author = "Bodini, Olivier and Gardy, Daniele and Jacquot, A",
    	title = "{Asymptotics and random sampling for formulae in intuitionist logical systems}",
    	booktitle = "{7\ème conference GASCOM (G\'en\'eration Al\'eatoire de Structures Combinatoires)}",
    	year = "{2010}",
    	owner = "MOIS",
    	timestamp = "2012.06.26"
    }
    
  13. Dominique Barth, Thierry Mautor and Daniel Villa-Monteiro. Search of the best alliance composition in an interdomain network. In EURO XXIV, 24th European Conference on Operational Research. 2010. BibTeX

    @inproceedings{BMVi10,
    	author = "Barth, Dominique and Mautor, Thierry and Villa-Monteiro, Daniel",
    	title = "{Search of the best alliance composition in an interdomain network}",
    	booktitle = "EURO XXIV, 24th European Conference on Operational Research",
    	year = "{2010}",
    	owner = "MOIS",
    	timestamp = "2012.06.26"
    }
    
  14. Dominique Barth, Christian Cadere, Dominique Verchere and Sandrine Vial. Graph Embedding to Allocate Network Resources for Service Composition. In IEEE International Conference on Communications (ICC). 2010. BibTeX

    @conference{BCVS10,
    	author = "Barth, Dominique and Cadere, Christian and Verchere, Dominique and Vial, Sandrine",
    	title = "{Graph Embedding to Allocate Network Resources for Service Composition}",
    	booktitle = "{IEEE International Conference on Communications (ICC)}",
    	year = "{2010}",
    	owner = "MOIS",
    	timestamp = "2011.08.17"
    }
    
  15. Johanne Cohen and Sylvie Delaet. Stabilité des arbres des plus courts chemins en présence de concurrence. Technique et Science Informatiques, 0. BibTeX

    @article{CoDe10,
    	author = "Cohen, Johanne and Delaet, Sylvie",
    	title = "{Stabilit\'e des arbres des plus courts chemins en pr\'esence de concurrence}",
    	journal = "Technique et Science Informatiques",
    	year = "A para{\^i}tre",
    	owner = "MOIS",
    	timestamp = "2012.06.27"
    }
    

  1. Dominique Barth, Johanne Cohen, Olivier Bournez and Octave Boussaton. Distributed Learning of Equilibria in a Routing Game. Parallel Processing Letters 19(2):189-204, 2009.
    Abstract We focus on the problem of learning equilibria in a particular routing game similar to the Wardrop traffic model. We describe a routing game played by a large number of players and present a distributed learning algorithm that we prove to converge weakly to equilibria for the system. The proof of convergence is based on a differential equation governing the global evolution of the system that is inferred from all the local evolutions of the agents in play. We prove that the differential equation converges with the help of Lyapunov techniques. URL, DOI BibTeX

    @article{BCBB09,
    	author = "Barth, Dominique and Cohen, Johanne and Bournez, Olivier and Boussaton, Octave",
    	title = "{Distributed Learning of Equilibria in a Routing Game}",
    	journal = "Parallel Processing Letters",
    	year = "{2009}",
    	volume = "{19}",
    	pages = "{189-204}",
    	number = "{2}",
    	month = "{} } # Jun # { {}",
    	abstract = "{We focus on the problem of learning equilibria in a particular routing game similar to the Wardrop traffic model. We describe a routing game played by a large number of players and present a distributed learning algorithm that we prove to converge weakly to equilibria for the system. The proof of convergence is based on a differential equation governing the global evolution of the system that is inferred from all the local evolutions of the agents in play. We prove that the differential equation converges with the help of Lyapunov techniques.}",
    	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 - Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX - CNRS : UMR7161 - Polytechnique - X - CARTE - INRIA Lorraine - LORIA - CNRS : UMR7503 - INRIA - Universit{\'e} Henri Poincar{\'e} - Nancy I - Universit{\'e} Nancy II - Institut National Polytechnique de Lorraine",
    	audience = "internationale",
    	doi = "10.1142/S012962640900016X",
    	hal_id = "inria-00432310",
    	keywords = "learning algorithm; Nash equilibria; weak convergence; Lyapunov stability; routing game",
    	language = "Anglais",
    	publisher = "World Scientific",
    	url = "http://hal.inria.fr/inria-00432310/en/"
    }
    
  2. Dominique Barth, Christian Cadere, Jean-Michel Fourneau, Nora Izri, Dana Marinca and Sandrine Vial. The Impact of the Scheduler on Waiting Time to Access an Optical Ring. In International Conference on Photonics in Switching, 2009. IEEE PS '09. 2009, 1-2. BibTeX

    @conference{BCF+09,
    	author = "Barth, Dominique and Cadere, Christian and Fourneau, Jean-Michel and Izri, Nora and Marinca, Dana and Vial, Sandrine",
    	title = "{The Impact of the Scheduler on Waiting Time to Access an Optical Ring}",
    	booktitle = "{International Conference on Photonics in Switching, 2009. IEEE PS '09}",
    	year = "{2009}",
    	pages = "{1-2}",
    	address = "{Pisa, Italy}",
    	month = "{15-19 September}",
    	owner = "MOIS",
    	timestamp = "2011.08.17"
    }
    
  3. Dominique Barth, Olivier Bournez, Octave Boussaton and Johanne Cohen. {Apprentissage distribué d'états stables pour le routage}. In {congr{è}s de la Soci{é}t{é} Fran\c caise de Recherche Op{é}rationnelle et d'Aide à la D{é}cision (ROADEF'09)}. 2009. URL BibTeX

    @inproceedings{BBBC09a,
    	author = "Barth, Dominique and Bournez, Olivier and Boussaton, Octave and Cohen, Johanne",
    	title = "{Apprentissage distribu{\'e} d'{\'e}tats stables pour le routage}",
    	booktitle = "{congr{{\`e}}s de la Soci{{\'e}}t{{\'e}} Fran{\c c}aise de Recherche Op{{\'e}}rationnelle et d'Aide {\`a} la D{{\'e}}cision (ROADEF'09)}",
    	year = "{2009}",
    	address = "{Nancy, France}",
    	month = "{} } # Feb. # { {}",
    	affiliation = "Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX - CNRS : UMR7161 - Polytechnique - X - 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 = "nationale",
    	hal_id = "inria-00430134",
    	language = "Fran{\c c}ais",
    	url = "http://hal.inria.fr/inria-00430134/en/"
    }
    
  4. Dominique Barth, Olivier Bournez, Octave Boussaton and Johanne Cohen. A Dynamic Approach for Load Balancing. In The Third International Workshop on Game Theory in Communication Networks - GAMECOMM 2009. 2009.
    Abstract We study how to reach a Nash equilibrium in a load balanc- ing scenario where each task is managed by a selfish agent and attempts to migrate to a machine which will minimize its cost. The cost of a machine is a function of the load on it. The load on a machine is the sum of the weights of the jobs running on it. We prove that Nash equilibria can be learned on that games with incomplete information, using some Lyapunov techniques. URL BibTeX

    @inproceedings{BBBC09,
    	author = "Barth, Dominique and Bournez, Olivier and Boussaton, Octave and Cohen, Johanne",
    	title = "{A Dynamic Approach for Load Balancing}",
    	booktitle = "{The Third International Workshop on Game Theory in Communication Networks - GAMECOMM 2009}",
    	year = "{2009}",
    	address = "{Pise, Italie}",
    	month = "{} } # Oct # { {}",
    	abstract = "{We study how to reach a Nash equilibrium in a load balanc- ing scenario where each task is managed by a selfish agent and attempts to migrate to a machine which will minimize its cost. The cost of a machine is a function of the load on it. The load on a machine is the sum of the weights of the jobs running on it. We prove that Nash equilibria can be learned on that games with incomplete information, using some Lyapunov techniques.}",
    	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 - Laboratoire d'informatique de l'{\'e}cole polytechnique - LIX - CNRS : UMR7161 - Polytechnique - X - CARTE - INRIA Lorraine - LORIA - CNRS : UMR7503 - INRIA - Universit{\'e} Henri Poincar{\'e} - Nancy I - Universit{\'e} Nancy II - Institut National Polytechnique de Lorraine",
    	audience = "internationale",
    	file = "gamecomm.pdf:http\://hal.inria.fr/inria-00435160/PDF/gamecomm.pdf:PDF",
    	hal_id = "inria-00435160",
    	language = "Anglais",
    	url = "http://hal.inria.fr/inria-00435160/en/"
    }
    
  5. Dominique Barth, Pascal Berthome, Dominique Chiaroni, Jean-Michel Fourneau, Christian Laforest and Sandrine Vial. Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks. Journal of Optical Communications and Networking 1(3):222-234, 2009.
    Abstract We present two routing algorithms based on deflection and convergence which are able to provide high bandwidth and an ending guarantee for the end to end delay in a core network. We study the performance of these routing techniques using simulations and we prove the bounds on the delay. We also give some insight to the implementation of such algorithms in a core router. URL, DOI BibTeX

    @article{BBC+09,
    	author = "Barth, Dominique and Berthome, Pascal and Chiaroni, Dominique and Fourneau, Jean-Michel and Laforest, Christian and Vial, Sandrine",
    	title = "{Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks}",
    	journal = "{Journal of Optical Communications and Networking}",
    	year = "{2009}",
    	volume = "{1}",
    	pages = "{222-234}",
    	number = "{3}",
    	abstract = "{We present two routing algorithms based on deflection and convergence which are able to provide high bandwidth and an ending guarantee for the end to end delay in a core network. We study the performance of these routing techniques using simulations and we prove the bounds on the delay. We also give some insight to the implementation of such algorithms in a core router.}",
    	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 - Laboratoire d'Informatique Fondamentale d'Orl{\'e}ans - LIFO - Universit{\'e} d'Orl{\'e}ans : EA4022 - Ecole Nationale Sup{\'e}rieure d'Ing{\'e}nieurs de Bourges - Alcatel Lucent Bell Labs - ALCATEL - Laboratoire d'Informatique, de Mod{\'e}lisation et d'optimisation des Syst{\`e}mes - LIMOS - CNRS : UMR6158 - Universit{\'e} d'Auvergne - Clermont-Ferrand I - Universit{\'e} Blaise Pascal - Clermont-Ferrand II - Institut Fran{\c c}ais de M{\'e}canique Avanc{\'e}e",
    	audience = "internationale",
    	doi = "10.1364/JOCN.1.000222",
    	hal_id = "hal-00460085",
    	keywords = "All-optical networks; assignment and routing algorithms; packet-switched networks",
    	language = "Anglais",
    	owner = "MOIS",
    	timestamp = "2011.07.28",
    	url = "http://hal.archives-ouvertes.fr/hal-00460085/en/"
    }
    

 Imprimer  E-mail

DMC Firewall is developed by Dean Marshall Consultancy Ltd