-
J Araujo,
Frédéric Giroire,
J Moulierac,
Yi Liu,
and R Modrzejewski.
Energy Efficient Content Distribution.
The Computer Journal,
59(2):192-207,
February 2016.
[WWW
] [PDF
]
Keywords:
Energy Efficiency,
Integer Linear Programming,
Content Deliv-ery Network,
In-network Caching,
Future Internet.
@article{araujo:hal-01238051,
TITLE = {{Energy Efficient Content Distribution}},
AUTHOR = {Araujo, J and Giroire, Fr{\'e}d{\'e}ric and Moulierac, J and Liu, Yi and Modrzejewski, R},
URL = {https://hal.inria.fr/hal-01238051},
JOURNAL = {{The Computer Journal}},
PUBLISHER = {{Oxford University Press (UK)}},
VOLUME = {59},
NUMBER = {2},
PAGES = {192-207},
YEAR = {2016},
MONTH = Feb,
DOI = {10.1093/comjnl/bxv095},
KEYWORDS = {Energy Efficiency ; Integer Linear Programming ; Content Deliv-ery Network ; In-network Caching ; Future Internet},
PDF = {https://hal.inria.fr/hal-01238051/file/compj.pdf},
HAL_ID = {hal-01238051},
HAL_VERSION = {v1},
}
-
Julio Araujo,
Frédéric Havet,
Claudia Linhares Sales,
and Ana Silva.
Proper orientation of cacti.
Journal of Theoretical Computer Science (TCS),
639:14-25,
2016.
[WWW
] [PDF
]
Keywords:
proper orientation,
graph coloring,
cactus graph,
claw-free graph,
planar graph,
block graph.
@article{araujo:hal-01338646,
TITLE = {{Proper orientation of cacti}},
AUTHOR = {Araujo, Julio and Havet, Fr{\'e}d{\'e}ric and Linhares Sales, Claudia and Silva, Ana},
URL = {https://hal.inria.fr/hal-01338646},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {639},
PAGES = {14-25},
YEAR = {2016},
DOI = {10.1016/j.tcs.2016.05.016},
KEYWORDS = {proper orientation ; graph coloring ; cactus graph ; claw-free graph ; planar graph ; block graph},
PDF = {https://hal.inria.fr/hal-01338646/file/proper-cacti-TCS-FINAL.pdf},
HAL_ID = {hal-01338646},
HAL_VERSION = {v1},
}
-
Julio Araujo,
Gregory Morel,
Leonardo Sampaio,
Ronan Soares,
and Valentin Weber.
Hull number: P5-free graphs and reduction rules.
Discrete Applied Mathematics,
210:171 - 175,
September 2016.
[WWW
]
@article{araujo:hal-01568575,
TITLE = {{Hull number: P5-free graphs and reduction rules}},
AUTHOR = {Araujo, Julio and Morel, Gregory and Sampaio, Leonardo and Soares, Ronan and Weber, Valentin},
URL = {https://hal.archives-ouvertes.fr/hal-01568575},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {210},
PAGES = {171 - 175},
YEAR = {2016},
MONTH = Sep,
HAL_ID = {hal-01568575},
HAL_VERSION = {v1},
}
-
Joergen Bang-Jensen,
Nathann Cohen,
and Frédéric Havet.
Finding good 2-partitions of digraphs II. Enumerable properties.
Journal of Theoretical Computer Science (TCS),
640:1-19,
August 2016.
[WWW
] [PDF
]
Keywords:
Feedback vertex set,
Out-branching,
Tournament,
Oriented,
NP-complete,
Polynomial,
Partition,
Splitting digraphs,
Acyclic,
Semicomplete digraph,
2-Partition,
Minimum degree.
@article{bangjensen:hal-01346079,
TITLE = {{Finding good 2-partitions of digraphs II. Enumerable properties}},
AUTHOR = {Bang-Jensen, Joergen and Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01346079},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {640},
PAGES = {1-19},
YEAR = {2016},
MONTH = Aug,
DOI = {10.1016/j.tcs.2016.05.034},
KEYWORDS = {Feedback vertex set ; Out-branching ; Tournament ; Oriented ; NP-complete ; Polynomial ; Partition ; Splitting digraphs ; Acyclic ; Semicomplete digraph ; 2-Partition ; Minimum degree},
PDF = {https://hal.archives-ouvertes.fr/hal-01346079/file/D2partE.pdf},
HAL_ID = {hal-01346079},
HAL_VERSION = {v1},
}
-
J Bang-Jensen and Frédéric Havet.
Finding good 2-partitions of digraphs I. Hereditary properties.
Journal of Theoretical Computer Science (TCS),
636:85--94,
2016.
[WWW
] [PDF
]
Keywords:
minimum degree,
2-partition,
tournament,
out-branching,
feedback vertex set,
oriented,
NP-complete,
polynomial,
partition,
splitting digraphs,
acyclic,
semicomplete digraph.
@article{bangjensen:hal-01327015,
TITLE = {{Finding good 2-partitions of digraphs I. Hereditary properties}},
AUTHOR = {Bang-Jensen, J and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01327015},
JOURNAL = {{Journal of Theoretical Computer Science (TCS)}},
PUBLISHER = {{Elsevier}},
VOLUME = {636},
PAGES = {85--94},
YEAR = {2016},
DOI = {10.1016/j.tcs.2016.05.029},
KEYWORDS = {minimum degree ; 2-partition ; tournament ; out-branching ; feedback vertex set ; oriented ; NP-complete ; polynomial ; partition ; splitting digraphs ; acyclic ; semicomplete digraph},
PDF = {https://hal.archives-ouvertes.fr/hal-01327015/file/D2partH.pdf},
HAL_ID = {hal-01327015},
HAL_VERSION = {v1},
}
-
J Bang-Jensen,
Frédéric Havet,
and Anders Yeo.
The complexity of finding arc-disjoint branching flows.
Discrete Applied Mathematics,
209:16-26,
2016.
[WWW
] [PDF
]
@article{bangjensen:hal-01360910,
TITLE = {{The complexity of finding arc-disjoint branching flows}},
AUTHOR = {Bang-Jensen, J and Havet, Fr{\'e}d{\'e}ric and Yeo, Anders},
URL = {https://hal.inria.fr/hal-01360910},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {209},
PAGES = {16-26},
YEAR = {2016},
DOI = {10.1016/j.dam.2015.10.012},
PDF = {https://hal.inria.fr/hal-01360910/file/bflows4.pdf},
HAL_ID = {hal-01360910},
HAL_VERSION = {v1},
}
-
Jean-Claude Bermond,
Cristiana Gomes Huiban,
and Patricio Reyes.
Round weighting problem and gathering in radio networks with symmetrical interference.
Discrete Mathematics, Algorithms and Applications,
8(2):1650035 57 pages,
2016.
[WWW
]
Keywords:
Radio networks,
wireless networks,
interference,
grids,
gathering,
bounds,
approximation algorithms..
@article{bermond:hal-01407591,
TITLE = {{Round weighting problem and gathering in radio networks with symmetrical interference}},
AUTHOR = {Bermond, Jean-Claude and Gomes Huiban , Cristiana and Reyes, Patricio},
URL = {https://hal.archives-ouvertes.fr/hal-01407591},
JOURNAL = {{Discrete Mathematics, Algorithms and Applications}},
PUBLISHER = {{World Scientific Publishing}},
VOLUME = {8},
NUMBER = {2},
PAGES = {1650035 57 pages},
YEAR = {2016},
DOI = {10.1142/S179383091650035X},
KEYWORDS = {Radio networks ; wireless networks ; interference ; grids ; gathering ; bounds ; approximation algorithms.},
HAL_ID = {hal-01407591},
HAL_VERSION = {v1},
}
-
Jean-Claude Bermond,
Alain Jean-Marie,
Dorian Mazauric,
and Joseph Yu.
Well Balanced Designs for Data Placement.
Journal of Combinatorial Designs,
24(2):55-76,
February 2016.
[WWW
] [PDF
]
@article{bermond:hal-01223288,
TITLE = {{Well Balanced Designs for Data Placement}},
AUTHOR = {Bermond, Jean-Claude and Jean-Marie, Alain and Mazauric, Dorian and Yu, Joseph},
URL = {https://hal.inria.fr/hal-01223288},
JOURNAL = {{Journal of Combinatorial Designs}},
PUBLISHER = {{Wiley}},
VOLUME = {24},
NUMBER = {2},
PAGES = {55-76},
YEAR = {2016},
MONTH = Feb,
DOI = {10.1002/jcd.21506},
PDF = {https://hal.inria.fr/hal-01223288/file/revfinal.pdf},
HAL_ID = {hal-01223288},
HAL_VERSION = {v1},
}
-
David Coudert,
Guillaume Ducoffe,
and Nicolas Nisse.
To Approximate Treewidth, Use Treelength!.
Siam Journal on Discrete Mathematics,
30(3):13,
2016.
[WWW
] [PDF
]
Keywords:
Graph,
Treewidth,
Treelength,
Cycle basis,
Genus.
@article{coudert:hal-01348965,
TITLE = {{To Approximate Treewidth, Use Treelength!}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01348965},
JOURNAL = {{Siam Journal on Discrete Mathematics}},
PUBLISHER = {{Society for Industrial and Applied Mathematics}},
VOLUME = {30},
NUMBER = {3},
PAGES = {13},
YEAR = {2016},
DOI = {10.1137/15M1034039},
KEYWORDS = {Graph ; Treewidth ; Treelength ; Cycle basis ; Genus},
PDF = {https://hal.inria.fr/hal-01348965/file/treewidth-treelength.pdf},
HAL_ID = {hal-01348965},
HAL_VERSION = {v1},
}
-
David Coudert and Guillaume Ducoffe.
Data center interconnection networks are not hyperbolic.
Theoretical Computer Science,
639:72-90,
2016.
[WWW
] [PDF
]
Keywords:
interconnection network,
data center,
Cayley graph,
greedy routing scheme,
metric embedding,
graph endomorphism,
Gromov hy-perbolicity.
@article{coudert:hal-01323301,
TITLE = {{Data center interconnection networks are not hyperbolic}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.inria.fr/hal-01323301},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {639},
PAGES = {72-90},
YEAR = {2016},
DOI = {10.1016/j.tcs.2016.05.025},
KEYWORDS = {interconnection network ; data center ; Cayley graph ; greedy routing scheme ; metric embedding ; graph endomorphism ; Gromov hy-perbolicity},
PDF = {https://hal.inria.fr/hal-01323301/file/data-centers--and--hyperbolicity.pdf},
HAL_ID = {hal-01323301},
HAL_VERSION = {v1},
}
-
David Coudert and Guillaume Ducoffe.
On the hyperbolicity of bipartite graphs and intersection graphs.
Discrete Applied Mathematics,
214:187-195,
2016.
[WWW
] [PDF
]
Keywords:
biclique graph,
line graph,
clique graph,
Gromov hyperbolicity,
bipartite graph,
intersection graph,
graph power.
@article{coudert:hal-01220132,
TITLE = {{On the hyperbolicity of bipartite graphs and intersection graphs}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.inria.fr/hal-01220132},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {214},
PAGES = {187-195},
YEAR = {2016},
DOI = {10.1016/j.dam.2016.06.017},
KEYWORDS = {biclique graph ; line graph ; clique graph ; Gromov hyperbolicity ; bipartite graph ; intersection graph ; graph power},
PDF = {https://hal.inria.fr/hal-01220132/file/bipartite.pdf},
HAL_ID = {hal-01220132},
HAL_VERSION = {v2},
}
-
David Coudert,
Dorian Mazauric,
and Nicolas Nisse.
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth.
ACM Journal of Experimental Algorithmics,
21(1):23,
2016.
[WWW
] [PDF
]
@article{coudert:hal-01266496,
TITLE = {{Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth}},
AUTHOR = {Coudert, David and Mazauric, Dorian and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01266496},
JOURNAL = {{ACM Journal of Experimental Algorithmics}},
VOLUME = {21},
NUMBER = {1},
PAGES = {23},
YEAR = {2016},
DOI = {10.1145/2851494},
PDF = {https://hal.inria.fr/hal-01266496/file/babpw-20151120.pdf},
HAL_ID = {hal-01266496},
HAL_VERSION = {v1},
}
-
David Coudert,
Stéphane Pérennes,
Hervé Rivano,
and Marie-Emilie Voge.
Combinatorial optimization in networks with Shared Risk Link Groups.
Discrete Mathematics and Theoretical Computer Science,
Vol. 18, no 3:25,
May 2016.
[WWW
] [PDF
]
Keywords:
colored graphs,
Shared Risk Link Group,
complexity,
algorithms,
Multi-layer networks.
@article{coudert:hal-01053859,
TITLE = {{Combinatorial optimization in networks with Shared Risk Link Groups}},
AUTHOR = {Coudert, David and P{\'e}rennes, St{\'e}phane and Rivano, Herv{\'e} and Voge, Marie-Emilie},
URL = {https://hal.inria.fr/hal-01053859},
TYPE = {Research Report},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {Vol. 18, no 3},
PAGES = {25},
INSTITUTION = {{INRIA}},
YEAR = {2016},
MONTH = May,
KEYWORDS = {colored graphs ; Shared Risk Link Group ; complexity ; algorithms ; Multi-layer networks},
PDF = {https://hal.inria.fr/hal-01053859/file/dmtcs-1420.pdf},
HAL_ID = {hal-01053859},
HAL_VERSION = {v4},
}
-
Nicolas Nisse and Ronan Pardo Soares.
On the Monotonicity of Process Number.
Discrete Applied Mathematics,
210:103-111,
2016.
[WWW
] [PDF
]
Keywords:
Graph Searching,
Process Number,
Monotonicity.
@article{nisse:hal-01345240,
TITLE = {{On the Monotonicity of Process Number}},
AUTHOR = {Nisse, Nicolas and Pardo Soares, Ronan},
URL = {https://hal.inria.fr/hal-01345240},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
SERIES = {Discrete Applied Mathematics},
VOLUME = {210},
PAGES = {103-111},
YEAR = {2016},
KEYWORDS = {Graph Searching ; Process Number ; Monotonicity},
PDF = {https://hal.inria.fr/hal-01345240/file/LAGOS-Journal.pdf},
HAL_ID = {hal-01345240},
HAL_VERSION = {v1},
}
-
Jean-Claude Bermond,
Nathann Cohen,
David Coudert,
Dimitrios Letsios,
Ioannis Milis,
Stéphane Pérennes,
and Vassilis Zissimopoulos.
Bin Packing with Colocations.
In Klaus Jansen and Monaldo Mastrolilli, editors,
14th International Workshop on Approximation and Online Algorithms (WAOA),
volume 10138,
Aarhus, Denmark,
pages 40-51,
August 2016.
Springer.
[WWW
] [PDF
]
@inproceedings{bermond:hal-01435614,
TITLE = {{Bin Packing with Colocations}},
AUTHOR = {Bermond, Jean-Claude and Cohen, Nathann and Coudert, David and Letsios, Dimitrios and Milis, Ioannis and P{\'e}rennes, St{\'e}phane and Zissimopoulos, Vassilis},
URL = {https://hal.inria.fr/hal-01435614},
BOOKTITLE = {{14th International Workshop on Approximation and Online Algorithms (WAOA)}},
ADDRESS = {Aarhus, Denmark},
EDITOR = {Klaus Jansen and Monaldo Mastrolilli},
PUBLISHER = {{Springer}},
VOLUME = {10138},
PAGES = {40-51},
YEAR = {2016},
MONTH = Aug,
DOI = {10.1007/978-3-319-51741-4\_4},
PDF = {https://hal.inria.fr/hal-01435614/file/revjcb.pdf},
HAL_ID = {hal-01435614},
HAL_VERSION = {v1},
}
-
Marwane Bouznif,
Frédéric Havet,
and Myriam Preissmann.
Minimum-Density Identifying Codes in Square Grids.
In 11th International Conference, AAIM 2016,
volume 9778 of Lecture Notes in Computer Science,
Bergamo, Italy,
pages 77-88,
July 2016.
Riccardo Dondi,
Springer.
[WWW
] [PDF
]
Keywords:
identifying code,
square grid,
discharging method.
@inproceedings{bouznif:hal-01346750,
TITLE = {{Minimum-Density Identifying Codes in Square Grids}},
AUTHOR = {Bouznif, Marwane and Havet, Fr{\'e}d{\'e}ric and Preissmann, Myriam},
URL = {https://hal.inria.fr/hal-01346750},
BOOKTITLE = {{11th International Conference, AAIM 2016}},
ADDRESS = {Bergamo, Italy},
ORGANIZATION = {{Riccardo Dondi}},
PUBLISHER = {{Springer}},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {9778},
PAGES = {77-88},
YEAR = {2016},
MONTH = Jul,
DOI = {10.1007/978-3-319-41168-2\_7},
KEYWORDS = {identifying code ; square grid ; discharging method},
PDF = {https://hal.inria.fr/hal-01346750/file/AAIM-grid-code.pdf},
HAL_ID = {hal-01346750},
HAL_VERSION = {v1},
}
-
Nathann Cohen,
Frédéric Havet,
William Lochet,
and Nicolas Nisse.
Subdivisions of oriented cycles in digraphs with large chromatic number.
In Bordeaux Graph Wokshop 2016,
Bordeaux, France,
pages 85-88,
November 2016.
[WWW
] [PDF
]
@inproceedings{cohen:hal-01411115,
TITLE = {{Subdivisions of oriented cycles in digraphs with large chromatic number}},
AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Lochet, William and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01411115},
BOOKTITLE = {{Bordeaux Graph Wokshop 2016}},
ADDRESS = {Bordeaux, France},
PAGES = {85-88},
YEAR = {2016},
MONTH = Nov,
PDF = {https://hal.archives-ouvertes.fr/hal-01411115/file/finalversion.pdf},
HAL_ID = {hal-01411115},
HAL_VERSION = {v1},
}
-
Nathann Cohen,
Mathieu Hilaire,
Nicolas Martins,
Nicolas Nisse,
and Stéphane Pérennes.
Spy-Game on graphs.
In Erik D. Demaine and Fabrizio Grandoni, editors,
8th International Conference on Fun with Algorithms, FUN 2016,
volume 49 of Leibniz International Proceedings in Informatics (LIPIcs),
La Maddalena, Maddalena Islands, Italy,
2016.
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
[WWW
] [PDF
]
@inproceedings{cohen:hal-01326446,
TITLE = {{Spy-Game on graphs}},
AUTHOR = {Cohen, Nathann and Hilaire, Mathieu and Martins, Nicolas and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-01326446},
BOOKTITLE = {{8th International Conference on Fun with Algorithms, FUN 2016}},
ADDRESS = {La Maddalena, Maddalena Islands, Italy},
EDITOR = {Erik D. Demaine and Fabrizio Grandoni},
PUBLISHER = {{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {49},
YEAR = {2016},
DOI = {10.4230/LIPIcs.FUN.2016.10},
PDF = {https://hal.archives-ouvertes.fr/hal-01326446/file/SpyGame_FUN_revised.pdf},
HAL_ID = {hal-01326446},
HAL_VERSION = {v1},
}
-
David Coudert and Guillaume Ducoffe.
Liens entre symétries et étirements de routages dans les réseaux d'interconnexions de centres de données.
In ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Bayonne, France,
May 2016.
[WWW
] [PDF
]
Keywords:
Mots-clefs : Graphe,
Centre de données,
Routage géométrique,
Endomorphisme de graphe,
Hyperbolicité.
@inproceedings{coudert:hal-01302470,
TITLE = {{Liens entre sym{\'e}tries et {\'e}tirements de routages dans les r{\'e}seaux d'interconnexions de centres de donn{\'e}es}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.archives-ouvertes.fr/hal-01302470},
BOOKTITLE = {{ALGOTEL 2016 - 18{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Bayonne, France},
YEAR = {2016},
MONTH = May,
KEYWORDS = {Mots-clefs : Graphe ; Centre de donn{\'e}es ; Routage g{\'e}om{\'e}trique ; Endomorphisme de graphe ; Hyperbolicit{\'e}},
PDF = {https://hal.archives-ouvertes.fr/hal-01302470/file/art-algotel-DChyp-final.pdf},
HAL_ID = {hal-01302470},
HAL_VERSION = {v1},
}
-
Rennan Dantas,
Frédéric Havet,
and Rudini M Sampaio.
Identifying codes for infinite triangular grids with a finite number of rows.
In Bordeaux Graph Workshop 2016,
Bordeaux, France,
November 2016.
[WWW
] [PDF
]
@inproceedings{dantas:hal-01411109,
TITLE = {{Identifying codes for infinite triangular grids with a finite number of rows}},
AUTHOR = {Dantas, Rennan and Havet, Fr{\'e}d{\'e}ric and Sampaio, Rudini M},
URL = {https://hal.archives-ouvertes.fr/hal-01411109},
BOOKTITLE = {{Bordeaux Graph Workshop 2016}},
ADDRESS = {Bordeaux, France},
YEAR = {2016},
MONTH = Nov,
PDF = {https://hal.archives-ouvertes.fr/hal-01411109/file/Triang-code-BGW.pdf},
HAL_ID = {hal-01411109},
HAL_VERSION = {v1},
}
-
Guillaume Ducoffe.
The Parallel Complexity of Coloring Games.
In Martin Gairing and Rahul Savani, editors,
9th International Symposium, SAGT 2016,
number 9928 of Algorithmic Game Theory,
Liverpool, United Kingdom,
pages 27-39,
September 2016.
Springer International Publishing.
[WWW
] [PDF
]
@inproceedings{ducoffe:hal-01361056,
TITLE = {{The Parallel Complexity of Coloring Games}},
AUTHOR = {Ducoffe, Guillaume},
URL = {https://hal.archives-ouvertes.fr/hal-01361056},
BOOKTITLE = {{9th International Symposium, SAGT 2016}},
ADDRESS = {Liverpool, United Kingdom},
EDITOR = {Martin Gairing and Rahul Savani},
PUBLISHER = {{Springer International Publishing}},
SERIES = {Algorithmic Game Theory},
NUMBER = {9928},
PAGES = {27-39},
YEAR = {2016},
MONTH = Sep,
DOI = {10.1007/978-3-662-53354-3\_3},
PDF = {https://hal.archives-ouvertes.fr/hal-01361056/file/Duc-SAGT16-finale.pdf},
HAL_ID = {hal-01361056},
HAL_VERSION = {v1},
}
-
Guillaume Ducoffe,
Sylvain Legay,
and Nicolas Nisse.
On the Complexity of Computing Treebreadth.
In Veli Mäkinen,
Simon J. Puglisi,
and Leena Salmela, editors,
27th International Workshop on Combinatorial Algorithms, IWOCA 2016,
number 9843 of Combinatorial Algorithms,
Helsinki, Finland,
pages 3-15,
August 2016.
Springer International Publishing.
[WWW
] [PDF
]
@inproceedings{ducoffe:hal-01354996,
TITLE = {{On the Complexity of Computing Treebreadth}},
AUTHOR = {Ducoffe, Guillaume and Legay, Sylvain and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01354996},
BOOKTITLE = {{27th International Workshop on Combinatorial Algorithms, IWOCA 2016}},
ADDRESS = {Helsinki, Finland},
EDITOR = {Veli M{\"a}kinen and Simon J. Puglisi and Leena Salmela},
PUBLISHER = {{Springer International Publishing}},
SERIES = {Combinatorial Algorithms},
NUMBER = {9843},
PAGES = {3-15},
YEAR = {2016},
MONTH = Aug,
DOI = {10.1007/978-3-319-44543-4\_1},
PDF = {https://hal.inria.fr/hal-01354996/file/DLN-IWOCA16.pdf},
HAL_ID = {hal-01354996},
HAL_VERSION = {v1},
}
-
Frédéric Giroire and Nicolas Huin.
Étude d'un système distribué de diffusion de vidéo en direct.
In ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Bayonne, France,
May 2016.
[WWW
] [PDF
]
Keywords:
pair-à-pair.
@inproceedings{giroire:hal-01305116,
TITLE = {{{\'E}tude d'un syst{\`e}me distribu{\'e} de diffusion de vid{\'e}o en direct}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas},
URL = {https://hal.inria.fr/hal-01305116},
BOOKTITLE = {{ALGOTEL 2016 - 18{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Bayonne, France},
YEAR = {2016},
MONTH = May,
KEYWORDS = {pair-{\`a}-pair},
PDF = {https://hal.inria.fr/hal-01305116/file/algotel22_camera_ready.pdf},
HAL_ID = {hal-01305116},
HAL_VERSION = {v1},
}
-
Myriana Rifai,
Nicolas Huin,
Christelle Caillouet,
Frédéric Giroire,
Joanna Moulierac,
Dino Lopez Pacheco,
and Guillaume Urvoy-Keller.
MINNIE : enfin un monde SDN sans (trop de) règles.
In ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Bayonne, France,
May 2016.
[WWW
] [PDF
]
@inproceedings{rifai:hal-01304687,
TITLE = {{MINNIE : enfin un monde SDN sans (trop de) r{\`e}gles}},
AUTHOR = {Rifai, Myriana and Huin, Nicolas and Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna and Lopez Pacheco, Dino and Urvoy-Keller, Guillaume},
URL = {https://hal.inria.fr/hal-01304687},
BOOKTITLE = {{ALGOTEL 2016 - 18{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Bayonne, France},
YEAR = {2016},
MONTH = May,
PDF = {https://hal.inria.fr/hal-01304687/file/algotel37_camera_ready.pdf},
HAL_ID = {hal-01304687},
HAL_VERSION = {v1},
}
-
Julio Araujo,
Guillaume Ducoffe,
Nicolas Nisse,
and Karol Suchan.
On interval number in cycle convexity.
Research Report,
Inria Sophia Antipolis ; I3S,
2016.
[WWW
] [PDF
]
Keywords:
graph,
convexity,
complexity,
dominating set.
@techreport{araujo:hal-01394201,
TITLE = {{On interval number in cycle convexity}},
AUTHOR = {Araujo, Julio and Ducoffe, Guillaume and Nisse, Nicolas and Suchan, Karol},
URL = {https://hal.inria.fr/hal-01394201},
TYPE = {Research Report},
INSTITUTION = {{Inria Sophia Antipolis ; I3S}},
YEAR = {2016},
KEYWORDS = {graph ; convexity ; complexity ; dominating set},
PDF = {https://hal.inria.fr/hal-01394201/file/cycleConvexity-DMTCS.pdf},
HAL_ID = {hal-01394201},
HAL_VERSION = {v2},
}
-
Julio Araujo,
Frédéric Giroire,
Yaning Y.L. Liu,
Remigiusz Modrzejewski,
and Joanna Moulierac.
Energy Efficient Content Distribution.
Research Report RR-8091,
INRIA,
January 2016.
[WWW
] [PDF
]
Keywords:
Energy Efficiency,
Integer Linear Programming,
Content Delivery Network,
Net- work Cache,
Future Internet.
@techreport{araujo:hal-00743248,
TITLE = {{Energy Efficient Content Distribution}},
AUTHOR = {Araujo, Julio and Giroire, Fr{\'e}d{\'e}ric and Liu, Yaning Y.L. and Modrzejewski, Remigiusz and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-00743248},
TYPE = {Research Report},
NUMBER = {RR-8091},
PAGES = {27},
INSTITUTION = {{INRIA}},
YEAR = {2016},
MONTH = Jan,
KEYWORDS = {Energy Efficiency ; Integer Linear Programming ; Content Delivery Network ; Net- work Cache ; Future Internet},
PDF = {https://hal.inria.fr/hal-00743248/file/report.pdf},
HAL_ID = {hal-00743248},
HAL_VERSION = {v3},
}
-
Jorgen Bang-Jensen,
Nathann Cohen,
and Frédéric Havet.
Finding good 2-partitions of digraphs II. Enumerable properties.
Research Report RR-8868,
INRIA Sophia Antipolis - I3S,
February 2016.
[WWW
] [PDF
]
@techreport{bangjensen:hal-01279338,
TITLE = {{Finding good 2-partitions of digraphs II. Enumerable properties}},
AUTHOR = {Bang-Jensen, J{{\o}}rgen and Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-01279338},
TYPE = {Research Report},
NUMBER = {RR-8868},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-01279338/file/RR-8868.pdf},
HAL_ID = {hal-01279338},
HAL_VERSION = {v1},
}
-
Jorgen Bang-Jensen and Frédéric Havet.
Finding good 2-partitions of digraphs I. Hereditary properties.
Research Report RR-8867,
INRIA Sophia Antipolis - I3S,
February 2016.
[WWW
] [PDF
]
@techreport{bangjensen:hal-01279332,
TITLE = {{Finding good 2-partitions of digraphs I. Hereditary properties}},
AUTHOR = {Bang-Jensen, J{{\o}}rgen and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-01279332},
TYPE = {Research Report},
NUMBER = {RR-8867},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-01279332/file/RR-8867.pdf},
HAL_ID = {hal-01279332},
HAL_VERSION = {v1},
}
-
Olivier Baudon,
Julien Bensmail,
Hervé Hocquard,
Mohammed Senhaji,
and Eric Sopena.
On locally irregular decompositions of subcubic graphs.
Research Report,
Université de bordeaux ; Université de Nice - Sophia Antipolis,
2016.
[WWW
] [PDF
]
@techreport{baudon:hal-01398228,
TITLE = {{On locally irregular decompositions of subcubic graphs}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Hocquard, Herv{\'e} and Senhaji, Mohammed and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-01398228},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} de bordeaux ; Universit{\'e} de Nice - Sophia Antipolis}},
YEAR = {2016},
PDF = {https://hal.archives-ouvertes.fr/hal-01398228/file/irr-subcub.pdf},
HAL_ID = {hal-01398228},
HAL_VERSION = {v1},
}
-
Olivier Baudon,
Julien Bensmail,
Jakub Przybylo,
and Mariusz Wozniak.
On locally irregular decompositions and the 1-2 Conjecture in digraphs.
Research Report,
Inria, CNRS, Université de Bordeaux, AGH University,
September 2016.
[WWW
] [PDF
]
@techreport{baudon:hal-01374427,
TITLE = {{On locally irregular decompositions and the 1-2 Conjecture in digraphs}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Przybylo, Jakub and Wo{\'z}niak, Mariusz},
URL = {https://hal.archives-ouvertes.fr/hal-01374427},
TYPE = {Research Report},
INSTITUTION = {{Inria, CNRS, Universit{\'e} de Bordeaux, AGH University}},
YEAR = {2016},
MONTH = Sep,
PDF = {https://hal.archives-ouvertes.fr/hal-01374427/file/12oriented.pdf},
HAL_ID = {hal-01374427},
HAL_VERSION = {v1},
}
-
Jean-Claude Bermond,
Nathann Cohen,
David Coudert,
Dimitrios Letsios,
Ioannis Milis,
Stéphane Pérennes,
and Vassilis Zissimopoulos.
Bin packing with colocations.
Research Report,
Inria ; I3S,
October 2016.
[WWW
] [PDF
]
@techreport{bermond:hal-01381333,
TITLE = {{Bin packing with colocations}},
AUTHOR = {Bermond, Jean-Claude and Cohen, Nathann and Coudert, David and Letsios, Dimitrios and Milis, Ioannis and P{\'e}rennes, St{\'e}phane and Zissimopoulos, Vassilis},
URL = {https://hal.inria.fr/hal-01381333},
TYPE = {Research Report},
INSTITUTION = {{Inria ; I3S}},
YEAR = {2016},
MONTH = Oct,
PDF = {https://hal.inria.fr/hal-01381333/file/bin-packing-rr.pdf},
HAL_ID = {hal-01381333},
HAL_VERSION = {v1},
}
-
Marwane Bouznif,
Frédéric Havet,
and Myriam Preissmann.
Minimum-density identifying codes in square grids.
Research Report RR-8845,
INRIA Sophia Antipolis - I3S,
January 2016.
[WWW
] [PDF
]
@techreport{bouznif:hal-01259550,
TITLE = {{Minimum-density identifying codes in square grids}},
AUTHOR = {Bouznif, Marwane and Havet, Fr{\'e}d{\'e}ric and Preissmann, Myriam},
URL = {https://hal.inria.fr/hal-01259550},
TYPE = {Research Report},
NUMBER = {RR-8845},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Jan,
PDF = {https://hal.inria.fr/hal-01259550/file/RR-8845.pdf},
HAL_ID = {hal-01259550},
HAL_VERSION = {v1},
}
-
Nathann Cohen,
Frédéric Havet,
William Lochet,
and Nicolas Nisse.
Subdivisions of oriented cycles in digraphs with large chromatic number.
Research Report RR-8865,
LRI - CNRS, University Paris-Sud ; LIP - ENS Lyon ; INRIA Sophia Antipolis - I3S,
February 2016.
[WWW
] [PDF
]
@techreport{cohen:hal-01277578,
TITLE = {{Subdivisions of oriented cycles in digraphs with large chromatic number}},
AUTHOR = {Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Lochet, William and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01277578},
TYPE = {Research Report},
NUMBER = {RR-8865},
PAGES = {25},
INSTITUTION = {{LRI - CNRS, University Paris-Sud ; LIP - ENS Lyon ; INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-01277578/file/RR-8865.pdf},
HAL_ID = {hal-01277578},
HAL_VERSION = {v1},
}
-
Nathann Cohen,
Mathieu Hilaire,
Nicolas Martins,
Nicolas Nisse,
and Stéphane Pérennes.
Spy-Game on graphs.
Research Report RR-8869,
Inria,
February 2016.
[WWW
] [PDF
]
@techreport{cohen:hal-01279339,
TITLE = {{Spy-Game on graphs}},
AUTHOR = {Cohen, Nathann and Hilaire, Mathieu and Martins, Nicolas and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01279339},
TYPE = {Research Report},
NUMBER = {RR-8869},
INSTITUTION = {{Inria}},
YEAR = {2016},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-01279339/file/RR-8869.pdf},
HAL_ID = {hal-01279339},
HAL_VERSION = {v1},
}
-
David Coudert and Guillaume Ducoffe.
Clique-decomposition revisited.
Research Report,
INRIA Sophia Antipolis - I3S,
February 2016.
[WWW
] [PDF
]
Keywords:
planar graphs,
treewidth,
clique-decomposition,
minimal triangulation,
clique-number,
bounded-degree graphs.
@techreport{coudert:hal-01266147,
TITLE = {{Clique-decomposition revisited}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume},
URL = {https://hal.archives-ouvertes.fr/hal-01266147},
TYPE = {Research Report},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Feb,
KEYWORDS = {planar graphs ; treewidth ; clique-decomposition ; minimal triangulation ; clique-number ; bounded-degree graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01266147/file/clique-decomposition-revisited.pdf},
HAL_ID = {hal-01266147},
HAL_VERSION = {v1},
}
-
David Coudert.
A note on Integer Linear Programming formulations for linear ordering problems on graphs.
Research Report,
Inria ; I3S ; Universite Nice Sophia Antipolis ; CNRS,
February 2016.
[WWW
] [PDF
]
@techreport{coudert:hal-01271838,
TITLE = {{A note on Integer Linear Programming formulations for linear ordering problems on graphs}},
AUTHOR = {Coudert, David},
URL = {https://hal.inria.fr/hal-01271838},
TYPE = {Research Report},
PAGES = {33},
INSTITUTION = {{Inria ; I3S ; Universite Nice Sophia Antipolis ; CNRS}},
YEAR = {2016},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-01271838/file/cwmip.pdf},
HAL_ID = {hal-01271838},
HAL_VERSION = {v1},
}
-
David Coudert,
Guillaume Ducoffe,
Nicolas Nisse,
and Mauricio Soto.
Distance-preserving orderings in graphs.
Research Report RR-8973,
Inria Sophia Antipolis,
2016.
[WWW
] [PDF
]
Keywords:
bounded treewidth,
distance-preserving elimination ordering,
metric graph theory,
NP-complete,
exact expo- nential algorithm,
integer linear programming.
@techreport{coudert:hal-01393523,
TITLE = {{Distance-preserving orderings in graphs}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Nisse, Nicolas and Soto, Mauricio},
URL = {https://hal.inria.fr/hal-01393523},
TYPE = {Research Report},
NUMBER = {RR-8973},
INSTITUTION = {{Inria Sophia Antipolis}},
YEAR = {2016},
KEYWORDS = {bounded treewidth ; distance-preserving elimination ordering ; metric graph theory ; NP-complete ; exact expo- nential algorithm ; integer linear programming},
PDF = {https://hal.inria.fr/hal-01393523/file/RR-8973.pdf},
HAL_ID = {hal-01393523},
HAL_VERSION = {v1},
}
-
David Coudert,
James Luedtke,
Eduardo Moreno,
and Konstantinos Priftis.
Computing and maximizing the exact reliability of wireless backhaul networks.
Research Report,
Inria Sophia Antipolis ; I3S,
November 2016.
[WWW
] [PDF
]
Keywords:
Network design,
Backhaul network,
Reliability,
Optimization.
@techreport{coudert:hal-01394593,
TITLE = {{Computing and maximizing the exact reliability of wireless backhaul networks}},
AUTHOR = {Coudert, David and Luedtke, James and Moreno, Eduardo and Priftis, Konstantinos},
URL = {https://hal.inria.fr/hal-01394593},
TYPE = {Research Report},
PAGES = {9},
INSTITUTION = {{Inria Sophia Antipolis ; I3S}},
YEAR = {2016},
MONTH = Nov,
KEYWORDS = {Network design ; Backhaul network ; Reliability ; Optimization},
PDF = {https://hal.inria.fr/hal-01394593/file/backhaul-rr.pdf},
HAL_ID = {hal-01394593},
HAL_VERSION = {v1},
}
-
Rennan Dantas,
Frédéric Havet,
and Rudini Sampaio.
Identifying codes for infinite triangular grids with a finite number of rows.
Research Report RR-8951,
INRIA Sophia Antipolis - I3S,
August 2016.
[WWW
] [PDF
]
Keywords:
identifying code,
grid,
discharging method,
méthode de déchargement,
grille,
code identifiant.
@techreport{dantas:hal-01358064,
TITLE = {{Identifying codes for infinite triangular grids with a finite number of rows}},
AUTHOR = {Dantas, Rennan and Havet, Fr{\'e}d{\'e}ric and Sampaio, Rudini},
URL = {https://hal.inria.fr/hal-01358064},
TYPE = {Research Report},
NUMBER = {RR-8951},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Aug,
KEYWORDS = {identifying code ; grid ; discharging method ; m{\'e}thode de d{\'e}chargement ; grille ; code identifiant},
PDF = {https://hal.inria.fr/hal-01358064/file/RR-8951.pdf},
HAL_ID = {hal-01358064},
HAL_VERSION = {v1},
}
-
Guillaume Ducoffe,
Sylvain Legay,
and Nicolas Nisse.
On computing tree and path decompositions with metric constraints on the bags.
Research Report RR-8842,
INRIA Sophia Antipolis - Méditerranée ; LRI - CNRS, University Paris-Sud,
January 2016.
[WWW
] [PDF
]
Keywords:
path-breadth,
k-good tree decompositions,
tree-length,
tree-breadth,
path-length.
@techreport{ducoffe:hal-01254917,
TITLE = {{On computing tree and path decompositions with metric constraints on the bags}},
AUTHOR = {Ducoffe, Guillaume and Legay, Sylvain and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01254917},
TYPE = {Research Report},
NUMBER = {RR-8842},
PAGES = {66},
INSTITUTION = {{INRIA Sophia Antipolis - M{\'e}diterran{\'e}e ; LRI - CNRS, University Paris-Sud}},
YEAR = {2016},
MONTH = Jan,
KEYWORDS = {path-breadth ; k-good tree decompositions ; tree-length ; tree-breadth ; path-length},
PDF = {https://hal.inria.fr/hal-01254917/file/RR-8842.pdf},
HAL_ID = {hal-01254917},
HAL_VERSION = {v1},
}
-
Frédéric Giroire,
Nicolas Huin,
Joanna Moulierac,
and Khoa Phan.
Energy-Aware Routing in Software-Defined Networks with Table Compression (using Wildcard Rules).
Research Report RR-8897,
INRIA Sophia Antipolis - I3S,
April 2016.
[WWW
] [PDF
]
Keywords:
energy savings,
backbone networks,
Software Defined Networks,
data center networks,
routing tables,
compression,
TCAM memory,
réseaux programmables,
réseaux de centre de données,
table de routage,
mémoire TCAM,
économie d'énergie,
réseau backbone.
@techreport{giroire:hal-01296992,
TITLE = {{Energy-Aware Routing in Software-Defined Networks with Table Compression (using Wildcard Rules)}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and Moulierac, Joanna and Phan, Khoa},
URL = {https://hal.inria.fr/hal-01296992},
TYPE = {Research Report},
NUMBER = {RR-8897},
INSTITUTION = {{INRIA Sophia Antipolis - I3S}},
YEAR = {2016},
MONTH = Apr,
KEYWORDS = {energy savings ; backbone networks ; Software Defined Networks ; data center networks ; routing tables ; compression ; TCAM memory ; r\'eseaux programmables ; r\'eseaux de centre de donn\'ees ; table de routage ; m\'emoire TCAM ; {\'e}conomie d'{\'e}nergie ; r{\'e}seau backbone},
PDF = {https://hal.inria.fr/hal-01296992/file/RR-8897.pdf},
HAL_ID = {hal-01296992},
HAL_VERSION = {v1},
}
-
Frédéric Giroire and Juan-Carlos Maureira.
Analysis of the Failure Tolerance of Linear Access Networks.
Research Report RR-8903,
CNRS, University of Nice Sophia Antipolis, I3S, UMR 7271, COATI, Inria, 06900 Sophia Antipolis, France ; Center of Mathematical Modeling, University of Chile, Chile ; Inria Sophia Antipolis,
April 2016.
[WWW
] [PDF
]
Keywords:
Access networks,
failure tolerance,
telecommuting,
connectivity analysis,
maintenance cost.
@techreport{giroire:hal-01308241,
TITLE = {{Analysis of the Failure Tolerance of Linear Access Networks}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Maureira, Juan-Carlos},
URL = {https://hal.inria.fr/hal-01308241},
TYPE = {Research Report},
NUMBER = {RR-8903},
INSTITUTION = {{CNRS, University of Nice Sophia Antipolis, I3S, UMR 7271, COATI, Inria, 06900 Sophia Antipolis, France ; Center of Mathematical Modeling, University of Chile, Chile ; Inria Sophia Antipolis}},
YEAR = {2016},
MONTH = Apr,
KEYWORDS = {Access networks ; failure tolerance ; telecommuting ; connectivity analysis ; maintenance cost},
PDF = {https://hal.inria.fr/hal-01308241/file/RR-8903.pdf},
HAL_ID = {hal-01308241},
HAL_VERSION = {v1},
}
-
Nicolas Huin,
Andrea Tomassilli,
Frédéric Giroire,
and Brigitte Jaumard.
Energy-Efficient Service Function Chain Provisioning.
Research Report RR-8980,
Inria Sophia Antipolis ; Université Côte d'Azur ; Cnrs ; Concordia University,
November 2016.
[WWW
] [PDF
]
Keywords:
Column Generation,
Network Function Virtualization,
Service Function Chains,
Software Defined Networks,
Energy Efficiency,
Optimization,
Optimisation,
Efficacité énergétique,
Réseaux logiciels,
Virtualisation des fonctions réseaux,
Chaînes de fonctions de service,
Génération de Colonnes.
@techreport{huin:hal-01403967,
TITLE = {{Energy-Efficient Service Function Chain Provisioning}},
AUTHOR = {Huin, Nicolas and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Jaumard, Brigitte},
URL = {https://hal.inria.fr/hal-01403967},
TYPE = {Research Report},
NUMBER = {RR-8980},
PAGES = {15},
INSTITUTION = {{Inria Sophia Antipolis ; Universit{\'e} C{\^o}te d'Azur ; Cnrs ; Concordia University}},
YEAR = {2016},
MONTH = Nov,
KEYWORDS = { Column Generation ; Network Function Virtualization ; Service Function Chains ; Software Defined Networks ; Energy Efficiency ; Optimization ; Optimisation ; Efficacit{\'e} {\'e}nerg{\'e}tique ; R{\'e}seaux logiciels ; Virtualisation des fonctions r{\'e}seaux ; Cha{\^i}nes de fonctions de service ; G{\'e}n{\'e}ration de Colonnes},
PDF = {https://hal.inria.fr/hal-01403967/file/RR-8980.pdf},
HAL_ID = {hal-01403967},
HAL_VERSION = {v2},
}
-
Myriana Rifai,
Nicolas Huin,
Christelle Caillouet,
Frédéric Giroire,
Joanna Moulierac,
Dino Lopez Pacheco,
and Guillaume Urvoy-Keller.
MINNIE: an SDN World with Few Compressed Forwarding Rules.
Research Report RR-8848,
INRIA Sophia-Antipolis ; I3S,
January 2016.
[WWW
] [PDF
]
Keywords:
Software Defined Networks,
data center networks,
routing tables,
compression,
TCAM memory.
@techreport{rifai:hal-01264387,
TITLE = {{MINNIE: an SDN World with Few Compressed Forwarding Rules}},
AUTHOR = {Rifai, Myriana and Huin, Nicolas and Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna and Lopez Pacheco, Dino and Urvoy-Keller, Guillaume},
URL = {https://hal.inria.fr/hal-01264387},
TYPE = {Research Report},
NUMBER = {RR-8848},
INSTITUTION = {{INRIA Sophia-Antipolis ; I3S}},
YEAR = {2016},
MONTH = Jan,
KEYWORDS = {Software Defined Networks ; data center networks ; routing tables ; compression ; TCAM memory},
PDF = {https://hal.inria.fr/hal-01264387/file/RR-8848.pdf},
HAL_ID = {hal-01264387},
HAL_VERSION = {v1},
}
-
Andrea Tomassilli,
Nicolas Huin,
Frédéric Giroire,
and Brigitte Jaumard.
Energy-Efficient Service Chains with Network Function Virtualization.
Research Report RR-8979,
Inria Sophia Antipolis ; Université Côte d'Azur ; Cnrs ; Concordia University,
October 2016.
[WWW
] [PDF
]
Keywords:
Optimization,
Energy Efficiency,
Network Function Virtualization,
Service Function Chains,
Software Defined Networks,
Chaînes de fonctions de service,
Virtualisation des fonctions réseaux,
Réseaux logiciels,
Efficacité énergétique,
Optimisation.
@techreport{tomassilli:hal-01403936,
TITLE = {{Energy-Efficient Service Chains with Network Function Virtualization}},
AUTHOR = {Tomassilli, Andrea and Huin, Nicolas and Giroire, Fr{\'e}d{\'e}ric and Jaumard, Brigitte},
URL = {https://hal.inria.fr/hal-01403936},
TYPE = {Research Report},
NUMBER = {RR-8979},
PAGES = {14},
INSTITUTION = {{Inria Sophia Antipolis ; Universit{\'e} C{\^o}te d'Azur ; Cnrs ; Concordia University}},
YEAR = {2016},
MONTH = Oct,
KEYWORDS = {Optimization ; Energy Efficiency ; Network Function Virtualization ; Service Function Chains ; Software Defined Networks ; Cha{\^i}nes de fonctions de service ; Virtualisation des fonctions r{\'e}seaux ; R{\'e}seaux logiciels ; Efficacit{\'e} {\'e}nerg{\'e}tique ; Optimisation},
PDF = {https://hal.inria.fr/hal-01403936/file/RR-8979.pdf},
HAL_ID = {hal-01403936},
HAL_VERSION = {v1},
}
