1. G. Huiban. Le problème de la reconfiguration dans les réseaux WDM multifibres. PhD thesis, École doctorale STIC, Université de Nice-Sophia Antipolis, 2006.


2. M-E. Voge. Optimisation des réseaux de télécommunications: réseaux multicouches, tolérance aux pannes et surveillance de trafic. PhD thesis, École doctorale STIC, Université de Nice-Sophia Antipolis, November 17 2006.


3. J.-C. Bermond and D. Coudert. The CRC Handbook of Combinatorial Designs (2nd edition), chapter VI.27, Grooming. CRC Press, C.J. Colbourn and J.H. Dinitz edition, 2006.
   Note: To appear.


4. J.-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. Theoretical Computer Science, 2006.
   Note: To appear.


5. J.-C. Bermond and M.-L. Yu. Vertex disjoint routings of cycles over tori. Networks, 2006.
   Note: To appear. [POSTSCRIPT ]


6. Y. Brehon and D. Kofman. Optimal Virtual Topology Design using Bus-Label Switched Paths. JSAC-Multilayer Routing, 2006.
   Note: To appear. [PDF ]


7. D. Coudert, P. Datta, S. Pérennes, H. Rivano, and M-E. Voge. Shared Risk Resource Group: Complexity and Approximability issues. Parallel Processing Letters, 2006.
   Note: To appear.


8. C. Duhamel and P. Mahey. Multicommodity flow problems with a bounded number of paths : a flow deviation approach. Networks, 2006, to appear. [PDF ]


9. J.-C. Bermond, M. Cosnard, D. Coudert, and S. Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. In Proceedings of the Advanced International Conference on Telecommunications, AICT06, Guadeloupe, France, February 2006. [WWW ] [PDF ]


10. J.-C. Bermond, D. Coudert, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM ring networks. In IEEE/COST 293 annual conference on GRAphs and ALgorithms in communication networks, volume 3, pages 19--22, June 2006. [PDF ]


11. Y. Brehon and D. Kofman. Bus-Label Switched Paths, an approach to reduce the cost of multilayer networks. In IEEE International Conference on Communications (ICC), June 2006. [PDF ]


12. D. Coudert, S. Pérennes, H. Rivano, and M.-E. Voge. Shared Risk Resource Groups and Survivability in Multilayer Networks. In IEEE/COST 293 annual conference on GRAphs and ALgorithms in communication networks, volume 3, pages 235--238, June 2006.
    Note: Invited Paper. [PDF ]


13. J. Truffot, C. Duhamel, and Philippe Mahey. Bounding the number of lightpaths for robust LSP routing via a Branch-and-price technique. In NOW Conference, Saint-Rémy de Provence, 2006.
    Note: Extended version submitted to Networks.


14. M.-E. Voge. How to transform a multilayer network into a colored graph. In IEEE ICTON/COST 293 annual conference on GRAphs and ALgorithms in communication networks, Nottingham, June 2006. [WWW ] [PDF ]


15. M.-E. Voge. Graphes Colorés - Arbre Couvrant Coloré. In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06), Trégastel, pages 41--44, May 2006. [WWW ] [PDF ]


16. M. Diallo, P. Mahey, and J. Truffot. Minimisation d'arborescences couvrant un trafic MPLS avec reroutage sur chemins de backup. Technical report, LIMOS, 2006. [PDF ]


17. F. Ben Hfaiedh. Reconfiguration dans les réseaux WDM. Master's thesis, Master STIC 2 RSD, 2006.


18. I. Sau Valls. Minimizing the number of ADMs in WDM Optical Rings with Traffic Grooming. Master's thesis, Université Polytechnique de Barcelone, Espagne, 2006.


19. Jérôme Truffot and Christophe Duhamel. Multicommodity flow problems with a bounded number of paths : a flow deviation approach. Rapport de Recherche LIMOS RR-06-04, submitted to Discrete Optimization, 2006.

1. A. Jarry. Connexité dans les réseaux de télécommunications. PhD thesis, École doctorale STIC, Université de Nice-Sophia Antipolis, March 2005.


2. J.-C. Bermond, C. Colbourn, D. Coudert, G. Ge, A. Ling, and X. Muñoz. Traffic grooming in unidirectional WDM rings with grooming ratio C=6. SIAM Journal on Discrete Mathematics, 19(2):523--542, 2005. [POSTSCRIPT ]


3. S. Choplin, A. Jarry, and S. Pérennes. Virtual network embedding in the cycle. Discrete Applied Mathematics, 145(3):368--375, 2005.


4. Jean-Pierre Dussault, Oumar Gueye, and Philippe Mahey. Separable augmented lagrangian algorithm with multidimensional scaling for monotropic programming. Journal of Optimization Theory and Applications, 127:327--345, 2005.


5. M.C. Souza, P. Mahey, and B. Gendron. Global optimization of multicommodity flow problems with separable non convex costs. Mathematical Programming, 2005, en révision.


6. J.-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. In Proceedings of the 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), volume 3499 of Lecture Notes in Computer Science, pages 34--48, May 2005. Springer Verlag. [WWW ] [PDF ] [POSTSCRIPT ]


7. C. Chaudet, E. Fleury, I. Guérin-Lassous, H. Rivano, and M.-E. Voge. Optimal positioning of active and passive monitoring devices. In CoNEXT 2005, Toulouse, France, October 2005. [WWW ]


8. C. Chaudet, E. Fleury, I. Guérin-Lassous, H. Rivano, and M.-E. Voge. Surveillance passive dans l'Internet. In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), Presqu'île de Giens, pages 121--124, May 2005. [WWW ]


9. D. Coudert, S. Pérennes, Q.-C. Pham, and J.-S. Sereni. Rerouting requests in WDM networks. In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), Presqu'île de Giens, pages 17--20, May 2005. [WWW ] [PDF ]


10. J. Galtier, A. Laugier, and P. Pons. Algorithms to evaluate the reliability of a network. In The 5th International Workshop on Design of Reliable Communication Networks, pages 93--100, 2005. [WWW ]


11. G. Huiban and G. Robson Mateus. A multiobjective approach of the virtual topology design and routing problem in WDM networks. In ICT International Conference on Telecommunications, May 2005. IEEE. [WWW ]


12. G. Huiban and G. Robson Mateus. A MILP model for the reconfiguration problem in multi-fiber WDM networks. In SBRC Simpósio Brasileiro de Redes de Computadores, May 2005. [WWW ]


13. J.-F. Lalande, M. Syska, and Y. Verhoeven. Arrondi aléatoire et protection des réseaux WDM. In Ecole Polytechnique de l'Université de Tours, editor, ROADEF, number 6, Tours, France, pages 241--242, 2005. [WWW ] [PDF ] [POSTSCRIPT ]


14. S. Petat and M.-E. Voge. Groupage sur un chemin orienté. In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), Presqu'île de Giens, pages 21--24, May 2005. [WWW ]


15. J. Truffot and C. Duhamel. Flot maximum avec nombre de chemins borné. In Conférence ROADEF, Tours, 2005.


16. J. Truffot, C. Duhamel, and P. Mahey. Branch-and-price for the $k$-splittable flow problem. In INOC Conference, Lisbonne, Portugal, 2005.
    Note: Extended version submitted to Discrete Optimization.


17. J.-C. Bermond, M. Cosnard, D. Coudert, and S. Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. Research report, INRIA Research Report 5627 (.ps.gz) and I3S Research Report I3S/RR-2005-18-FR (.pdf), 2005. [WWW ] [PDF ] [POSTSCRIPT ]


18. D. Coudert, P. Datta, H. Rivano, and M.-E. Voge. Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks. Technical report, I3S Research Report I3S/RR-2005-37-FR, 2005. [PDF ]


19. C. Gomes and H. Rivano. WDM Mesh Networks with Dynamic Traffic. Research report, INRIA Research Report 5713, 2005. [WWW ] [PDF ] [POSTSCRIPT ]


20. G. Huiban and P. Datta. Virtual topology reconfiguration issues in evolution of WDM optical networks. Research report, INRIA Research Report 5711 and I3S Research Report I3S/RR-2005-29-FR, 2005. [WWW ] [PDF ] [POSTSCRIPT ]


21. G. Huiban and G. Robson Mateus. Optimization aspects of the reconfiguration problem in WDM networks. Research report, INRIA Research Report 5730 and I3S Research Report I3S/RR-2005-33-FR, 2005. [WWW ] [PDF ] [POSTSCRIPT ]


22. C. Lepelletier. Problèmes de charge et de longueur d'onde sur des réseaux tolérants des pannes. Mémoire de DEA, 3 mois, encadrants J.-C. Bermond and S. Bessy, DEA MDFI, Marseille, 2005.

1. S. Beker. Optimization Techniques for the Dimensioning and Reconfiguration of MPLS Networks. PhD thesis, Telecom Paris (ENST), Paris, France, April 2004.


2. J.-F. Lalande. Conception de réseaux de télécommunications : optimisation et expérimentations. PhD thesis, École doctorale STIC, Université de Nice-Sophia Antipolis, Décembre 2004. [PDF ] [POSTSCRIPT ]


3. J.-C. Bermond, C.J. Colbourn, A. Ling, and M.-L. Yu. Grooming in unidirectional rings : $K_4 -e$ designs. Discrete Mathematics, Lindner's Volume, 284(1-3):57--62, 2004. [POSTSCRIPT ]


4. S. Beker, N. Puech, and V. Friderikos. A Tabu Search Heuristic for the Off-Line MPLS Reduced Complexity Layout Design Problem. In IFIP-TC6 Networking Conference, volume 3042 of Lecture Notes in Computer Science, Athens, Grece, pages 514-525, May 2004. Springer Verlag.


5. F. Chauvet, P. Chrétienne, P. Mahey, and B. Vatinlen. Decomposing a flow into a minimal set of paths. In $4^{ ext{{\`e}me}}$ conférence Francoro, Fribourg, Suisse, pages 19, August 2004.
   Note: Extended version sumitted to EJOR.


6. F. Chauvet, P. Chrétienne, P. Mahey, and B. Vatinlen. Decomposing a flow into a minimal set of paths. In Francoro, Fribourg, Suisse, 2004.
   Note: Extended version to appear in EJOR.


7. C. Duhamel and P. Mahey. Multicommodity flow problems with a bounded number of paths : a flow deviation approach. In Optimization Conference, Lisbonne, Portugal, 2004.


8. A. Ferreira and A. Jarry. Complexity of Minimum Spanning Tree in Evolving Graphs and the Minimum-Energy Broadcast Routing Problem. In Proceedings of WiOpt'04 -- Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks, Cambridge, March 2004.
   Keywords: dynamic networks, evolving graphs, paths, energy.


9. A. Jarry and A. Laugier. On the minimum number edges of two-connected graphs with given diameter. In GT04, Paris, France, July 2004.


10. A. Jarry and Z. Lotker. Connectivity in Evolving Graph with Geometric Properties. In Dial MPOMC 2004 The Second ACM/SIGMOBILE Annual International Joint Workshop on Foundations of Mobile Computing, 2004.


11. A. Jarry. Integral Symmetric 2-Commodity Flows. In Proceedings of STACS'04, Montpellier, March 2004.


12. J. Truffot, C. Duhamel, and P. Mahey. Le problème de flot maximal avec contrainte sur le nombre de chemins. In $4^{ ext{{\`e}me}}$ conférence Francoro, Fribourg, Suisse, pages 43, August 2004.


13. B. Bachelet, P. Mahey, and J. Truffot. Modélisation des problèmes de routage dans les réseaux GMPLS. Technical report RR/04-24, LIMOS, 2004. [PDF ]


14. C. Duhamel, P. Mahey, and J. Truffot. Minimal congestion, approximation algorithms and the flow deviation method with a bounded number of paths. Technical report RR/04-15, LIMOS, 2004.


15. J.P. Dussault, O. Gueye, and P. Mahey. Separable augmented lagrangian algorithm with multidimensional scaling for monotropic programming. Technical report RR/04-12, LIMOS, 2004.
    Note: En révision pour le Journal of Optimization.


16. J-F. Lalande, Y. Verhoeven, and M. Syska. Mascopt - A Network Optimization Library: Graph Manipulation. Technical report RT-0293, INRIA Sophia Antipolis, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, April 2004.
    Note: Http://www-sop.inria.fr/mascotte/mascopt.


17. P. Mahey and M.C. Souza. Solving multicommodity flow problems with piecewise convex costs. Technical report, LIMOS, 2004.
    Note: Soumis à Mathematical Programming.


18. L. Braud. Groupage de trafic sur le chemin. Rapport de stage de Magistère d'Informatique, 2 mois, encadrant D. Coudert, ENS Lyon, 2004. [PDF ]


19. A. Davert. Reroutage incrémental sur réseau optique. Rapport de stage de DEA RSD, 4 mois, encadrant D. Coudert, Université de Nice Sophia-Antipolis, 2004. [PDF ]


20. C. Mosse. Implémentation d'algorithmes pour les réseaux optiques WDM. Rapport de fin d'études d'Elève Ingénieur Maître, 4 mois, encadrants D. Coudert et M. Syska, IUP GMI d'Avignon, 2004. [PDF ]


21. Q. C. Pham. Etude d'un problème algorithmique intervenant dans la reconfiguration des réseaux WDM. Rapport de stage de Magistère d'Informatique, 2 mois, encadrants D. Coudert et S. Pérennes, ENS Paris, 2004. [POSTSCRIPT ]

1. H. Rivano. Algorithmique et télécommunications : coloration et multiflot approchés et applications aux réseaux d'infrastructure. PhD thesis, Université de Nice-Sophia Antipolis, November 2003.


2. D. Coudert and X. Muñoz. Recent Research Developments in Optics, 3, chapter 37, Graph Theory and Traffic Grooming in WDM Rings, pages 759--778. Research Signpost. Kerala, India, 2003.
   Note: ISBN: 81-271-0028-5. [PDF ] [POSTSCRIPT ]


3. J.-C. Bermond and S. Ceroi. Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. Networks, 41(2):83--86, 2003. [POSTSCRIPT ]


4. J.-C. Bermond, D. Coudert, and M-L. Yu. On DRC-Covering of $K_n$ by cycles. Journal of Combinatorial Designs, 11(3):100--112, 2003. [PDF ] [POSTSCRIPT ]


5. B. Bui-Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(2):267--285, April 2003.


6. A. Ferreira, S. Pérennes, A. W. Richa, H. Rivano, and N. Stier. Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. Telecommunication Systems, 24(2):123--138, October 2003.


7. S. Beker, D. Kofman, and N. Puech. Off-Line Reduced Complexity Layout Design for MPLS Networks. In Proceedings of IPOM, pages 99-105, 2003. IEEE.


8. S. Beker, D. Kofman, and N. Puech. Off-line MPLS layout design and reconfiguration: Reducing complexity under dynamic traffic conditions. In Proceedings INOC, pages 61-66, 2003.


9. J-C. Bermond and D. Coudert. Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory. In IEEE ICC, volume 2, Anchorage, Alaska, pages 1402--1406, May 2003.
   Note: ON07-3. [PDF ] [POSTSCRIPT ]


10. J.-C. Bermond, D. Coudert, and X. Muñoz. Traffic grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case. In ONDM 03, 7th IFIP Working Conference on Optical Network Design and Modelling, pages 1135--1153, 3-5 February 2003. [PDF ] [POSTSCRIPT ]


11. M. Bouklit, D. Coudert, J.-F. Lalande, C. Paul, and H. Rivano. Approximate multicommodity flow for WDM networks design. In J. Sibeyn, editor, SIROCCO 10, number 17 of Proceedings in Informatics, Umea, Sweden, pages 43--56, June 2003. Carleton Scientific. [PDF ] [POSTSCRIPT ]


12. M. Bouklit, D. Coudert, J.-F. Lalande, and H. Rivano. Approximation combinatoire de multiflot fractionnaire : améliorations. In AlgoTel'03, Banyuls-sur-mer, France, May 2003. INRIA. [PDF ] [POSTSCRIPT ]


13. D. Coudert, H. Rivano, and X. Roche. A combinatorial approximation algorithm for the multicommodity flow problem. In K. Jansen and R. Solis-Oba, editors, WAOA 03, number 2909 of Lecture Notes in Computer Science, Budapest, Hungary, pages 256--259, September 2003. Springer-Verlag. [PDF ] [POSTSCRIPT ]


14. A. Jarry and A. Laugier. Graphes 2-connexes à diamètre donné. In ROADEF 2003, number 5 of Proceedings in Informatics, Avignon, France, pages 102--104, June 2003. Université d'Avignon et des Pays de Vaucluse.


15. J.-F. Lalande, S. Pérennes, and M. Syska. Groupage dans les réseaux dorsaux WDM. In ROADEF 2003, number 5 of Proceedings in Informatics, Avignon, France, pages 254--255, June 2003. Université d'Avignon et des Pays de Vaucluse.


16. A. Laugier and S. Petat. Network Design and b-matching. In Proc. of International Network Optimization Conference, pages 374--379, 2003.


17. O. de Rivoyre. Optimisation du groupage dans les réseaux de télécommunication. Rapport de DEA RSD, 5 mois, encadrants J.-C. Bermond et M. Syska, Université de Nice Sophia-Antipolis, 2003.


18. X. Roche. Approximation du multiflot fractionnaire. Rapport de Magistère d'Informatique, 5 semaines, encadrants D. Coudert et H. Rivano, ENS Lyon, 2003.


19. M.-E. Voge. Conception de réseaux SDH en anneaux. Rapport de DEA ROCO, 4 mois, encadrants M.Burlet et A.Laugier, INP Grenoble, 2003.

1. M. Diallo, C. Duhamel, P. Mahey, and J. Truffot. Rapport LIMOS/PRESTO mi-parcours, Annexes techniques. [PDF ]


2. S. Beker, R. Casellas, and D. Kofman. Optimization Techniques for the Dimensioning and Reconfiguration of MPLS Networks.
   Note: To be submitted to a journal.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html