| | |||
Distrinet: a Mininet implementation for the Cloud | Design of robust programmable networks with bandwidth-optimal failure recovery scheme | Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter. | ||
G. Di Lena, A. Tomassilli, D. Saucez, F. Giroire, T. Turletti, and C. Lac. | A. Tomassilli, G. Di Lena, F. Giroire, I. Tahiri, D. Saucez, S. Perennes, T. Turletti, R. Sadykov, F. Vanderbeck, and C. Lac. | T. Trolliet, N. Cohen, F. Giroire, L. Hogie, S. Pérennes. | ||
In ACM SIGCOMM Computer Communication Review (CCR), Jan. 2021. | In Elsevier Computer Networks, 2021. | In Proceedings of the International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2020), Madrid, Spain, Dec 2020. | ||
| | |||
When Network Matters: Data Center Scheduling with Network Tasks | Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints | On the Complexity of Compressing two-dimensional routing tables with order | ||
F. Giroire, N. Huin, A. Tomassilli, S. Perennes. | A. Tomassilli, F. Giroire, N. Huin, S. Perennes. | F. Giroire, F. Havet, and J. Moulierac. | ||
In Proceedings of IEEE International Conference on Computer Communications (INFOCOM), Paris, France, April 2019. | In Proceedings of IEEE International Conference on Computer Communications (INFOCOM), Honolulu, Hawai, US, April 2018. | In Algorithmica, vol. 80, no. 1, pp. 209-233, jan 2018. |
[GHPT19] | When Network Matters: Data Center Scheduling with Network Tasks |
F. Giroire, N. Huin, A. Tomassilli, S. Perennes. | |
Accepted for publication in Proceedings of IEEE International Conference on Computer Communications (INFOCOM), Paris, France, April 2019. | |
(pdf) | |
[TGHP18] | Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints |
A. Tomassilli, F. Giroire, N. Huin, S. Perennes. | |
Accepted for publication in Proceedings of IEEE International Conference on Computer Communications (INFOCOM), Honolulu, Hawai, US, April 2018. | |
(pdf) |
[HJG18] | Optimization of Network Service Chain Provisioning. |
N. Huin, B. Jaumard, F. Giroire. | |
In IEEE/ACM Transactions on Networking (ToN), vol. 26, nb. 3, pp. 1320-1333, 2018. | |
(pdf) |
[GHM18] | On the Complexity of Compressing two-dimensional routing tables with order. |
F. Giroire, F. Havet, and J. Moulierac. | |
In Algorithmica, vol. 80, no. 1, pp. 209-233, jan 2018. | |
(pdf) |
[RHC+17] | Minnie: An SDN world with few compressed forwarding rules. |
M. Rifai, N. Huin, C. Caillouet, F. Giroire, D. Lopez, J. Moulierac, G. Urvoy-Keller. | |
In Computer Networks, vol. 121, pp. 185-207, 2017. | |
(pdf) |
[CGM+14] | To Satisfy Impatient Web surfers is Hard |
F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse. | |
In Journal of Theoretical Computer Science, vol. 526, pp. 1-17, 2014. | |
(pdf) |
[GCT+09] | Exploiting Temporal Persistence to Detect Covert Botnet Channels |
F. Giroire, J. Chandrashekar, N. Taft, E. Schooler and K. Papagiannaki. | |
In the proceedings of The 12th International Symposium on Recent Advances in Intrusion Detection (RAID'09), Saint-Malo, September 2009. | |
(pdf) | |
[DGMP09] | Analysis of Failure Correlation in Peer-to-Peer Storage Systems |
O. Dalle, F. Giroire, J. Monteiro, S. Perennes. | |
In the proceedings of the 9th International Conference on Peer to Peer Computing (P2P'09), Seattle US, September 2009. | |
(pdf) |
[Gir09] | Order Statistics and Estimating Cardinalities of Massive Data Sets. |
F. Giroire. | |
In Discrete Applied Mathematics, 157(2):406-427, 2009 | |
(pdf) |
[GNTD03] | Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection. |
F. Giroire, A. Nucci, N. Taft, C. Diot. | |
In Proceedings of IEEE INFOCOM, San Francisco, USA, april 2003. | |
(pdf) |
[Gir18] | Optimization of Network Infrastructures, 2018. |
(pdf, in French. More information here.) |
[Gir06] | Networks, algorithmics and analytic combinatorics of very large data sets, 2006. |
(pdf, in French) |
[TDG+21] | Design of robust programmable networks with bandwidth-optimal failure recovery scheme. |
A. Tomassilli, G. Di Lena, F. Giroire, I. Tahiri, D. Saucez, S. Perennes, T. Turletti, R. Sadykov, F. Vanderbeck, and C. Lac. | |
In Elsevier Computer Networks, 2021. | |
(pdf) |
[DTS+21] | Distrinet: a Mininet Implementation for the Cloud. |
G. Di Lena, A. Tomassilli, D. Saucez, F. Giroire, T. Turletti, and C. Lac. | |
In ACM SIGCOMM Computer Communication Review (CCR), Jan. 2021. | |
(pdf) | |
[GTTM21] | Don't Interrupt Me When You Reconfigure my Service Function Chains. |
A. Gausseran, A. Tomassilli, F. Giroire, and J. Moulierac. | |
In Computer Communications, 2021. | |
[CGR19] | Efficient Data Collection and Tracking with Flying Drones. |
C. Caillouet, F. Giroire, and T. Razafindralambo. | |
In Ad Hoc Networks Journal, vol. 89, pp. 35-46, 2019. | |
(pdf) |
[HJG18] | Optimization of Network Service Chain Provisioning. |
N. Huin, B. Jaumard, F. Giroire. | |
In IEEE/ACM Transactions on Networking (ToN), vol. 26, nb. 3, pp. 1320-1333, 2018. | |
(pdf) |
[GHM18] | On the Complexity of Compressing two-dimensional routing tables with order. |
F. Giroire F. Havet, and J. Moulierac. | |
In Algorithmica, vol. 80, no. 1, pp. 209-233, jan 2018. | |
(pdf) |
[HRG+18] | Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks. |
N. Huin, M. Rifai, F. Giroire, D. Lopez Pacheco, G. Urvoy- Keller, and J. Moulierac. | |
In IEEE Transactions on Green Communications and Networking, vol. 2, nb. 4, pp. 1128-1139, 2018. | |
(pdf) |
[GPT18] | Grid spanners with low forwarding index for energy efficient networks. |
F. Giroire, S. Perennes and I. Tahiri | |
In Discrete Applied Mathematics, 246, 99-107, 2018. | |
(pdf) |
[HGMP18] | Energy-aware Routing in Software-Defined Network using Compression. |
N. Huin, F. Giroire, J. Moulierac, and K. T. Phan | |
In Computer Journal, vol. 61, iss. 10, pp. 1537-1556, 2018. | |
(pdf) |
[THFJ18] | Energy-Efficient Service Function Chain Provisioning. |
A. Tomassilli, N. Huin, F. Giroire, and B. Jaumard | |
In IEEE/OSA Journal of Optical Communications and Networking, vol. 10, no. 3, pp. 114-124, mar 2018. | |
(pdf) |
[GM18] | Analysis of the failure tolerance of linear access networks. |
F. Giroire, J.-C. Maureira. | |
In IEEE Transactions on Intelligent Transport Systems, vol. 19, no. 4, p. 1166-1175, 2018. | |
(pdf) |
[GMNP17] | Maintaining Balanced Trees For Structured Distributed Streaming Systems. |
F. Giroire, R. Modrzejewski, N. Nisse, S. Perennes. | |
In Discrete Applied Mathematics, vol. 232, pp. 176-188, 2017. | |
(pdf) |
[RHC+17] | Minnie: An SDN world with few compressed forwarding rules. |
Rifai, M. and Huin, N. and Caillouet, C. and Giroire, F. and Lopez, Dino and Moulierac, J. and Urvoy-Keller, G. | |
In Computer Networks, vol. 121, pp. 185-207, 2017. | |
(pdf) |
[AGM+16] | Energy efficient content distribution |
J. Araujo, F. Giroire, J. Moulierac, Y. Liu, and R. Modrzejewski. | |
In Computer Journal, Oxford, vol. 59, iss. 2, pp. 192-207, 2016. | |
(pdf) |
[GPT15] | On the Complexity of Equal Shortest Path Routing. |
F. Giroire, S. Perennes, I. Tahiri. | |
In Networks, 65(4):344-352, 2015. | |
(pdf) |
[GMPR15] | Minimization of Network Power Consumption with Redundancy Elimination. |
F. Giroire, J. Moulierac, T.K. Phan, and F. Roudaut. | |
In Computer Communications Journal, Elsevier. 59:98-105, 2015. | |
(pdf) |
[GLM+15] | Connected Surveillance Game |
F. Giroire, I. Lamprou, D. Mazauric, N. Nisse, S. Perennes, R. Soares | |
In Journal of Theoretical Computer Science, 584, 131-143. | |
(pdf) |
[CGM+14] | To Satisfy Impatient Web surfers is Hard |
F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse. | |
In Journal of Theoretical Computer Science, vol. 526, pp. 1-17, 2014. | |
(pdf) |
[CGM+14] | P2P Storage Systems: Study of Different Placement Policies |
S. Caron, F. Giroire, D. Mazauric, J. Monteiro, S. Perennes. | |
In Journal of Peer-to-Peer Networking and Applications, Springer, Vol. 7, Issue 4, pp. 427-443, Dec. 2014 | |
(pdf) |
[ACG+13] | On the hull number of some graph classes. |
J. Araujo, V. Campos, F. Giroire, L. Sampaio, and R. Soares. | |
In Journal of Theoretical Computer Science, Elsevier, Vol. 475, pp. 1-12, March 2013. | |
(pdf) | |
http://dx.doi.org/10.1016/j.tcs.2012.12.035 |
[ABG+12] | Weighted improper colouring. |
J. Araujo, J-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. | |
In Journal of Discrete Algorithms, 16:53-66, October 2012. | |
(pdf) |
[GMM12] | Energy Efficient Routing by Switching-Off Network Interfaces. |
F. Giroire, D. Mazauric, J. Moulierac. | |
Chapter 10 - Energy-Aware Systems and Networking for Sustainable Initiatives, pp. 207-236. IGI Global, June 2012. | |
(pdf) |
[DGS11] | Circuits in graphs through a prescribed set of ordered vertices. |
D. Coudert, F. Giroire, and I. Sau. | |
In Journal of Interconnection Networks (JOIN), 11(3-4):121-141, 2011. | |
(pdf) |
[ACGH11] | Good edge-labelling of graphs. |
J. Araujo, N. Cohen, F. Giroire, and F. Havet. | |
In Discrete Applied Mathematics, 2011. In press. | |
(pdf) |
[AGHP10] | Minimal selectors and fault tolerant networks. |
O. Amini, F. Giroire, F. Huc, and S. Pérennes. | |
In Networks, 55(4):326-340, July 2010. | |
(pdf) |
[Gir09] | Order Statistics and Estimating Cardinalities of Massive Data Sets. |
F. Giroire. | |
In Discrete Applied Mathematics, 157(2):406-427, 2009 | |
(pdf) |
[LTG21+] | A right placement makes a happy emulator: aplacement module for distributed sdn/nfv emulation. |
G. Di Lena, A. Tomassilli, F. Giroire, D. Saucez, T. Turletti, and C. Lac. | |
Accepted for publication in Proceedings of IEEE International Conference on Communications (ICC 2021), Montreal, Canada, June 2021. |
[TCG+20] | Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter. |
T. Trolliet, N. Cohen, F. Giroire, L. Hogie, S. Pérennes. | |
Accepted for publication in Proceedings of the International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2020), Madrid, Spain, Dec 2020. | |
(pdf) | |
[TCG+20] | A Random Growth Model with any Real or Theoretical Degree Distribution. |
T. Trolliet, F. Giroire, S. Pérennes. | |
Accepted for publication in Proceedings of the International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2020), Madrid, Spain, Dec 2020. | |
(pdf) | |
[GGJM20] | Be Scalable and Rescue My Slices During Reconfiguration. |
A. Gausseran, F. Giroire, B. Jaumard, and J. Moulierac. | |
Accepted for publication in Proceedings of IEEE International Conference on Communications (ICC 2020), Dublin, Ireland, June 2020. |
[GGJM20] | Be Scalable and Rescue My Slices During Reconfiguration. |
A. Gausseran, F. Giroire, B. Jaumard, and J. Moulierac. | |
Accepted for publication in Proceedings of IEEE International Conference on Communications (ICC 2020), Dublin, Ireland, June 2020. |
[GHTP19] | When Network Matters: Data Center Scheduling with Network Tasks |
F. Giroire, N. Huin, A. Tomassilli, S. Perennes. | |
Accepted for publication in Proceedings of IEEE International Conference on Computer Communications (INFOCOM 2019), Paris, France, April 2019. | |
(pdf) |
[THG19] | The structured way of dealing with heterogeneous live streaming systems. |
A. Tomassilli, N. Huin, and F. Giroire. | |
Accepted for publication in Proceedings of 14-th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC 2019), Antwerp, Belgium, November 2019. |
[TDG+19] | Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. |
A. Tomassilli, Giuseppe, G. Di Lena, F. Giroire, I. Tahiri, D. Saucez, S. Perennes, T. Turletti, R. Sadykov, F. Vanderbeck, and C. Lac. | |
Accepted for publication in Proceedings of IEEE International Conference on Cloud Networking (CloudNet 2019), Coimbra, Portugal, November 2019. |
[GHPT19] | No Interruption When Reconfiguring my SFCs. |
A. Gausseran, A. Tomassilli, F. Giroire, and J. Moulierac. | |
Accepted for publication in Proceedings of IEEE International Conference on Cloud Networking (CloudNet 2019), Coimbra, Portugal, November 2019. |
[DTS+19] | Mininet on steroids: exploiting the cloud for Mininet performance. |
G. Di Lena, A. Tomassilli, D. Saucez, F. Giroire, T. Turletti, and C. Lac. | |
Accepted for publication in Proceedings of IEEE International Conference on Cloud Networking (CloudNet 2019), Coimbra, Portugal, November 2019. |
[TDG+19] | Poster: Design of survivable sdn/nfv-enabled networks with bandwidth-optimal failure recovery. |
A. Tomassilli, Giuseppe, G. Di Lena, F. Giroire, I. Tahiri, D. Saucez, S. Perennes, T. Turletti, R. Sadykov, F. Vanderbeck, and C. Lac. | |
Accepted for publication in Proceedings of IFIP Networking, Varsovie, Poland, May 2019. Extented abstract. |
[GHPT19] | Poster: Don't Interrupt Me When You Reconfigure my Service Function Chains. |
A. Gausseran, A. Tomassilli, F. Giroire, and J. Moulierac. | |
Accepted for publication in Proceedings of IFIP Networking, Varsovie, Poland, May 2019. Extented abstract. |
[TGHP18] | Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints |
A. Tomassilli, F. Giroire, N. Huin, S. Perennes. | |
Accepted for publication in Proceedings of IEEE International Conference on Computer Communications (INFOCOM 2018), Honolulu, Hawai, US, April 2018. | |
(pdf) |
[CGR18] | Optimization of Mobile Sensor Coverage with UAVs. |
C. Caillouet, F. Giroire, and T. Razafindralambo. | |
Accepted for publication in Proceedings of The 11th International Workshop on Wireless Sensor, Robot and UAV Networks - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Honolulu, Hawai, US, April 2018. |
[GHPT18] | Resource Requirements for Reliable Service Function Chaining. |
A. Tomassilli, N. Huin, F. Giroire, and B. Jaumard. | |
Accepted for publication in Proceedings of IEEE International Conference on Communications (ICC), Kansas City, US, May 2018. |
[GHPT18] | Path protection in optical flexible networks with distance-adaptive modulation formats |
A. Tomassilli, B. Jaumard and F. Giroire. | |
Accepted for publication in Proceedings of International Conference on Optical Network Design and Modeling (ONDM), pp. 30-35, Dublin, May 2018. |
[HJG17] | Optimization of Network Service Chain Provisioning. |
N. Huin, B. Jaumard, F. Giroire. | |
In Proceedings of IEEE International Conference on Communications (ICC 2017), Paris, France, May 2017. |
[HRG+17] | Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks. |
N. Huin, M. Rifai, F. Giroire, D. Lopez Pacheco, G. Urvoy- Keller, and J. Moulierac. | |
In In Proceedings of IEEE Global Communications Conference (GLOBECOM 2017), Singapore, December 2017. |
[THFJ17] | Energy-Efficient Service Function Chain Provisioning. |
A. Tomassilli, N. Huin, F. Giroire, and B. Jaumard | |
In Proceedings of International Network Optimization Conference (INOC 2017), Lisbon, Portugal, February 2017. |
[GM16] | Analysis of the failure tolerance of linear access networks. |
F. Giroire, J.-C. Maureira. | |
In Proceedings of IEEE Global Communications Conference (GLOBECOM 2016), Washington, United States, December 2016. |
[GPT15b] | How to design graphs with low forwarding index and limited number of edges. |
F.Giroire, S. Perennes, and I. Tahiri. | |
In proceeding of the 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italy, Oct 2015. |
[GH15] | Study of repair protocols for live video streaming distributed systems. |
F. Giroire, N. Huin. | |
In Proceedings of IEEE Global Communications Conference (GLOBECOM 2015), San Diego, United States, December 2015. |
[RHC+15] | Too many sdn rules? compress them with Minnie |
M. Rifai, N. Huin, C. Caillouet, F. Giroire, D. Lopez, J. Moulierac, G. Urvoy-Keller. | |
In Proceedings of IEEE Global Communications Conference (GLOBECOM 2015), San Diego, United States, December 2015. |
[GHM15] | Compressing two-dimensional routing tables with order. |
F. Giroire F. Havet, and J. Moulierac. | |
In International Network Optimization Conference (INOC 2015), Warsaw, Poland, May 2015. |
[GPT15] | Grid spanners with low for- warding index for energy efficient networks. |
F. Giroire, S. Perennes, and I. Tahiri. | |
In proceeding of International Network Optimization Conference (INOC 2015), Warsaw, Poland, May 2015. |
[GMP14] | Optimizing Rule Placement in Software-Defined Networks for Energy-aware Routing. |
F. Giroire, J. Moulierac, K. Phan. | |
In Proceedings of IEEE Global Communications Conference (GLOBECOM 2014), Austin, United States, December 2014. |
[MCT+13] | Energy Efficient Content Distribution in an ISP Network. |
R. Modrzejewski, L. Chiaraviglio, I. Tahiri, F. Giroire, E. Le Rouzic, E. Bonetto, F. Musumeci, R. Gonzalez, C. Guerrero. | |
In Proceedings of IEEE Global Communications Conference (GLOBECOM 2013), Atlanta, United States, December 2013. |
[GMNP13] | Repair Time in Distributed Storage Systems. |
F. Giroire, S. K. Gupta, R. Modrzejewski, J. Monteiro and S. Perennes. | |
In the proceedings of the 6th International Conference on Data Management in Cloud, Grid and P2P Systems (Globe 2013), Prague, Czech Republic, August 2013. |
[GMNP13] | Maintaining Balanced Trees For Structured Distributed Streaming Systems. |
F. Giroire, R. Modrzejewski, N. Nisse, S. Perennes. | |
In Proceedings of the 20th Colloquium on Structural Information and Communication Complexity (SIROCCO 2013), Springer LNCS, Ischia, Italy, July 2013. |
[GMN+13] | Connected Surveillance Game. |
F. Giroire, D. Mazauric, N. Nisse, S. Perennes and R. Pardo Soares. | |
In Proceedings of the 20th Colloquium on Structural Information and Communication Complexity (SIROCCO 2013), Springer LNCS, Ischia, Italy, July 2013. |
[GMN+13] | TREND towards more energy-efficient optical networks. |
E. Le Rouzic, E. Bonetto, L. Chiaraviglio, F. Giroire, F. Idzikowski, F. Jimenez, C. Lange, J. Montalvo, F. Musumeci, I. Tahiri, A. Valenti, W. Van Heddeghem, Yabin Ye, A. Bianco, A. Pattavina. | |
In proceedings of the IEEE 17th International Conference on Optical Network Design and Modeling (ONDM 2013), Brest, France, April 2013. |
[AGL+13] | Minimum energy-efficient CDN Network. |
J. Araujo, F. Giroire, Y. Liu, R. Modrzejewski and J. Moulierac. | |
In IEEE International Conference on Communications (ICC 2013), Budapest, Hungary, June 2013. |
[GPT13] | On the Hardness of Equal Shortest Path Routing. |
F. Giroire, S. Perennes, I. Tahiri. | |
In International Network Optimization Conference (INOC 2013), Tenerife, Spain, May 2013. |
[GMPR12] | Minimization of Network Power Consumption with Redundancy Elimination. |
F. Giroire, J. Moulierac, T.K. Phan, and F. Roudaut. | |
In Proceedings of IFIP 12th event of the series of International Conferences on Networking (Networking 2012), Prague, Czech Republic, pages 247-258, May 2012. Springer. | |
(pdf) |
[FGJ+12] | To Satisfy Impatient Web surfers is Hard. |
F. V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, and N. Nisse. | |
In 6th International Conference on FUN with Algorithms (FUN 2013), volume 7288, pages 166-176, 2012. Springer, LNCS. |
[ABG+11] | Weighted Improper Colouring. |
J Araujo, J-C Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. | |
In Proceedings of International Workshop on Combinatorial Algorithms (IWOCA 2011), volume 7056 of Lecture Notes in Computer Science, Victoria, Canada, pages 1-18, June 2011. Springer-Verlag. |
[ACG+11] | On the hull number of some graph classes. |
J. Araujo, V. Campos, F. Giroire, L. Sampaio, and R. Soares. | |
In Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011), volume 38 of Electronic Notes in Discrete Mathematics, Budapest, Hungary, pages 49-55, September 2011. |
[AJM11] | Hybrid Approaches for Distributed Storage Systems. |
J. Araujo, F. Giroire, and J. Monteiro. | |
In Proceedings of Fourth International Conference on Data Management in Grid and P2P Systems (Globe 2011), Toulouse, France, September 2011. |
[GMP10] | Peer-to-Peer Storage Systems: a Practical Guideline to be Lazy |
F. Giroire, J. Monteiro, S. Perennes. | |
In the proceedings of IEEE Global Communications Conference (GLOBECOM 2010), Miami, US, December 2010. | |
[CGM+10] | Data Life Time for Different Placement Policies in P2P Storage Systems |
S. Caron, F. Giroire, D. Mazauric, J. Monteiro, S. Perennes. | |
In the proceedings of (GLOBE 2010), Bilbao, September 2010. | |
[CGM+10] | P2P Storage Systems: Data Life Time for Different Placement Policies |
S. Caron, F. Giroire, D. Mazauric, J. Monteiro, S. Perennes. | |
In the proceedings of ALGOTEL'10, Belle Dune, France, May 2010 | |
[ACGH09] | Good edge-labelling of graphs |
J. Araujo, N. Cohen, F. Giroire, F. Havet. | |
In the proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09), Gramado, Brazil, November 2009. | |
[GMP09] | P2P Storage Systems: How Much Locality Can They Take? |
F. Giroire, J. Monteiro, S. Perennes. | |
In the proceedings of the 34th IEEE Conference on Local Computer Networks (LCN'09), Zurich, Switzerland, October 2009. | |
[DGMP09] | Analysis of Failure Correlation in Peer-to-Peer Storage Systems |
O. Dalle, F. Giroire, J. Monteiro, S. Perennes. | |
In the proceedings of the 9th International Conference on Peer to Peer Computing (P2P'09), Seattle US, September 2009. | |
[GCT+09] | Exploiting Temporal Persistence to Detect Covert Botnet Channels |
F. Giroire, J. Chandrashekar, N. Taft, E. Schooler and K. Papagiannaki. | |
In the proceedings of The 12th International Symposium on Recent Advances in Intrusion Detection (RAID'09), Saint-Malo, September 2009. | |
[CGS09] | Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids |
D. Coudert, F. Giroire, and I. Sau-Valls | |
In the proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA'09), Czech Republic, July 2009. | |
[BCF+09] | Debating IT Monoculture for End Host Intrusion Detection. |
D. Barman, J. Chandrashekar, M. Faloutsos, F. Giroire, L. Huang and N. Taft | |
In the proceedings of ACM SIGCOMM Workshop on Research on Enterprise Networking (WREN'09), Barcelona, September 2009. | |
[DGMP09] | Analysis of Failure Correlation in Peer-to-Peer Storage Systems |
O. Dalle, F. Giroire, J. Monteiro, S. Perennes. | |
In the proceedings of the 11ème édition des Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL'09), Carry Le Rouet, June 2009. | |
Best student paper awards for Julian Monteiro. | |
[GCI+08] | The Cubicle vs. The Coffee Shop: Behavioral Modes in Enterprise End-Users. |
F. Giroire, J. Chandrashekar, G. Iannaccone, K. Papagiannaki, E. Schooler, N. Taft. | |
Accepted to Passive and Active Measurement conference (PAM), Cleveland, US, April 2008. | |
In the Springer Lecture Notes in Computer Science (LNCS) series. LNCS 4979, pp. 202-211. | |
(abstract, pdf, ps) |
[BGP07] | Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions. |
J-C. Bermond, F. Giroire, and S. Pérennes. | |
Proceedings of SIROCCO, Castiglioncello, LNCS 4474, pp. 261-273, Italy, June 2007. | |
(abstract, pdf, ps) |
[FuGi07] | Estimating the number of Active Flows in a Data Stream over a Sliding Window. |
E. Fusy and F. Giroire. | |
In David Appelgate, editor, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALC0) pp. 223-231, SIAM Press, New Orleans, United States, january 2007. | |
(abstract, pdf, ps) |
[ACG+07] | Approaches to Anomaly Detection using Host Network-Traffic Traces. |
J. M. Agosta, J. Chandrashekar, F. Giroire, C. Livadas, J. Xu. | |
Neural Information Processing Systems (NIPS) workshop on Statistical Learning Techniques for Solving Systems Problems (MLSys), Vancouver, Canada, December 2007. | |
(pdf) |
[Gir06] | Directions to use probabilistic algorithms for cardinality for DNA analysis. |
F. Giroire. | |
In Poster Proceedings of JOBIM, Bordeaux, France, july 2006. | |
(pdf, ps) |
[ABG+06] | Design of minimal fault tolerant networks: Asymptotic bounds. |
O. Amini, J-C. Bermond, F. Giroire, F. Huc, and S. Pérennes. | |
In Proceedings of ALGOTEL, Trégastel, France, may 2006. | |
(abstract, pdf, ps) |
[Gir06b] | Extended Hit Counting to Estimate Cardinality. |
F. Giroire. | |
In Proceedings of WWW/Internet, Murcia, Spain, october 2006. | |
(abstract, pdf, ps) |
[Gir05] | Order Statistics and Estimating Cardinalities of Massive Data Sets. |
F. Giroire. | |
In Proceedings of 2005 International Conference on Analysis of Algorithms (AOFA), Barcelona, Spain, June 2005. | |
Published in Discrete Mathematics and Theoretical Computer, vol. AD, pp. 157-166. Science, 2005. | |
(abstract, pdf, ps) |
[GNTD03] | Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection. |
F. Giroire, A. Nucci, N. Taft, C. Diot. | |
In Proceedings of IEEE INFOCOM, San Francisco, USA, april 2003. | |
(abstract, pdf, ps) |
[GCT+07] | The Case For Personalizing End-Host Detectors. |
F. Giroire, J. Chandrashekar, N. Taft, G. Iannaccone, T. Karagiannis, K. Papagiannaki, E. Schooler. | |
Intel Research Technical Report, To be submitted. |
[GCI+07] | Inside the Forbidden City: A look at End-Host Traffic inside a Modern Enterprise. |
F. Giroire, J. Chandrashekar, G. Iannaccone, T. Karagiannis, K. Papagiannaki, E. Schooler, N. Taft. | |
Intel Research Technical Report. |
[AGHP06] | Minimal selectors and fault tolerant networks. |
O. Amini, F. Giroire, F. Huc, and S. Pérennes. | |
Research report, INRIA Research Report HAL-00082015, July 2006. |
[Gir03] | Study of Combinatorics Problems linked to the genome analysis: sequencing and polymorphism (in French). |
F. Giroire. | |
Master Thesis, 2003. |
[GNTD02] | Increasing the robustness of ip backbones in the absence of optical level protection. |
F. Giroire, A. Nucci, N. Taft, and C. Diot. | |
Sprint Technical Report, 2002. |
Method and System for Detecting and Reducing Botnet Activity. | |
J. Chandrashekar, E. Schooler, N. Taft, F. Giroire. | |
Publication number: US 2010/0169476 A1. | |
Publication Date: Jul. 2010. | |
(pdf) |
Method and Systems for Identifying Optimal Mapping in a Network. | |
Antonio Nucci, Nina Taft, Christophe Diot, Frederic Giroire. | |
Patent number US 7,453,824 B1. | |
Accepted Nov. 2008. | |
(pdf) |
Method and Systems for Correlating Practical Constraints in a Network. | |
Antonio Nucci, Nina Taft, Christophe Diot, Frederic Giroire. | |
Patent number US 7,394,760 B1. | |
Accepted Jul. 2008. | |
(pdf) |
Distrinet, a new tool for distributed network emulation (2019-2020). Networks have become complex systems that combine various concepts, techniques and technologies. As a result, their modeling or simulation is now extremely complex and researchers make extensive use of prototyping techniques. Two experimental techniques are mainly used when testing a network: simulation and emulation. Emulation offers good accuracy and allows applications to be tested directly in an environment similar to a real environment. Most emulators do not take into account scaling, as they are usually designed to run in a single machine. Among other tools, Mininet is the most popular when it comes to evaluating SDN proposals. It allows SDNs to be emulated on a single machine. Unfortunately, Mininet shows its limitations for resource-intensive experiments because the emulation host can be overloaded. To solve this problem, we propose Distrinet, a distributed implementation of Mininet on multiple hosts. Distrinet uses the same API as Mininet, which means it is compatible with Mininet programs. It is generic and can deploy experiments in Linux clusters or in the Amazon EC2 cloud.
https://distrinet-emu.github.io/
Software tool and algorithms to optimze the execution time and scalability on requests on the database of the SAS MillionRoads (2019-2020). The tool was developped during a collaboration between Inria and MillionRoads for their product humanroads.
Code in Java acquired by the company.
Scheduling with network tasks (2018-2019). We consider the placement of applications (workflow or job) within a data center. Traditionally, this is done by a task orchestrator without taking into account network constraints. According to recent studies, network transfers account for up to 50% of the time required to complete traditional jobs. Thus, network resources must be taken into account when placing jobs in a data center.
In [GHPT19], we propose a new scheduling framework, introducing network jobs that must be executed on network machines next to traditional CPU jobs. The model takes into account the communication competition for network resources, which is not taken into account in the previously proposed communication-based scheduling models. Network transfers within a data center can be easily modeled in our framework. As we show, classical algorithms do not efficiently manage a limited amount of network bandwidth. We therefore propose new algorithms with approximation guarantees in order to minimize the makepan in this framework. We demonstrate their efficiency and the importance of taking into account the network capacity through extended simulations on workflows built from Google data center traces.
https://gitlab.com/eesdn-others/scheduling-algorithm
Scalable routing and placement of service functions chains (2016-2018). Service chains consist of a set of network services, such as firewalls or application delivery controllers, that are interconnected by a network to support various applications. While this concept is not new, a very important new trend has emerged with the rise of software-defined networks (SDNs) and network function virtualization (NFV). The combination of SDN and NFV can make the service chain and application provisioning process much shorter and simpler.
In [HJG18], we study service chain provisioning in conjunction with the number/location of virtual network functions (VNF). Although chains are often built to support multiple applications, the question arises as to how service chain provisioning can be planned to prevent data from passing through unnecessary network devices or servers and consuming additional bandwidth and CPU cycles. This requires careful selection of the number and location of VNFs. We propose an accurate mathematical model using decomposition methods with scalable solution to conduct such an investigation. We conduct extensive numerical experiments, and show that we can accurately solve the routing of service chain requests in minutes for networks with up to 50 nodes, and traffic requests between all node pairs. A detailed analysis is then performed on the best trade-off between minimizing bandwidth requirements and minimizing the number of VNFs and optimizing their location using different data sets.
https://gitlab.com/eesdn-others/sfc-cg
Interest clustering coefficients (2019-2020). We introduce a new metric to measure the clustering of a directed social graph with links of interest, namely the interest clustering coefficient. We calculated it (exactly and using sampling methods) on a very large social graph, a snapshot of Twitter with 505 million users and 23 billion links. We also provide the values of the previously introduced directed and undirected metrics, a first on such a large graph. We thus show that the interest clustering coefficients are higher than the classical directed clustering coefficients presented in the literature. This shows the relevance of metrics to capture the informational aspects of directed graphs. We also explored recommendations based on this new metric.
https://github.com/fredericgiroire/ICC
Design and optimized implementation of a probabilistic counting algorithm, MINCOUNT (2005-2006) (during my PhD, 2006). The algorithm in C has also been tested and validated by the research group of FRANCE TELECOM in Lannion, France, for its applications to network security.
Design and implementation of an algorithm MAPPING to build routes in a optical fiber network (patented algorithm) (2002) (internship in Sprint Labs, 2002). The software in C++ is used by the SPRINT Network Operation Center.