UDT and TCP without Congestion Control for Profile Pursuit (2009)
Soudan, Sébastien, Guillier, Romaric
Instead of relying on the congestion control algorithm and its objective of statistical fair sharing when transfers are assorted with strict deadlines, it might be beneficial to share the links in a...
UDT and TCP without Congestion Control for Profile Pursuit (2009)
Soudan, Sébastien, Guillier, Romaric
Instead of relying on the congestion control algorithm and its objective of statistical fair sharing when transfers are assorted with strict deadlines, it might be beneficial to share the links in a...
Equilibrium in size-based scheduling systems (2009)
Soudan, Sébastien, Divakaran, Dinil Mon, Altman, Eitan
Size-based scheduling is advocated to improve response times of small flows. While researchers continue to explore different ways of giving preferential treatment to small flows without causing...
Equilibrium in size-based scheduling systems (2009)
Soudan, Sébastien, Divakaran, Dinil Mon, Altman, Eitan
Size-based scheduling is advocated to improve response times of small flows. While researchers continue to explore different ways of giving preferential treatment to small flows without causing...
Equilibrium in size-based scheduling systems (2009)
Soudan, Sébastien, Mon Divakaran, Dinil, Altman, Eitan
Size-based scheduling is advocated to improve response times of small flows. While researchers continue to explore different ways of giving preferential treatment to small flows without causing...
Equilibrium in size-based scheduling systems (2009)
Soudan, Sébastien, Mon Divakaran, Dinil, Altman, Eitan
Size-based scheduling is advocated to improve response times of small flows. While researchers continue to explore different ways of giving preferential treatment to small flows without causing...
Extending Routing Games to Flows over Time (2009)
Soudan, Sébastien, Mon Divakaran, Dinil, Altman, Eitan
Routing game presents an interesting framework to analyze the practical problem of source routing in the Internet. It is particularly useful in quantifying the inefficiency of selfish user behavior...
Extending Routing Games to Flows over Time (2009)
Soudan, Sébastien, Divakaran, Dinil Mon, Altman, Eitan, Primet, Pascale
Routing game presents an interesting framework to analyse the practical problem of source routing in the Internet. It is particularly useful in quantifying the inefficiency of selfish user behavior...
Extending Routing Games to Flows over Time (2009)
Soudan, Sébastien, Mon Divakaran, Dinil, Altman, Eitan
Routing game presents an interesting framework to analyze the practical problem of source routing in the Internet. It is particularly useful in quantifying the inefficiency of selfish user behavior...
Extending Routing Games to Flows over Time (2009)
Soudan, Sébastien, Divakaran, Dinil Mon, Altman, Eitan, Primet, Pascale
Routing game presents an interesting framework to analyse the practical problem of source routing in the Internet. It is particularly useful in quantifying the inefficiency of selfish user behavior...
A survey on core switch designs and algorithms (2009)
Divakaran, Dinil Mon, Soudan, Sébastien, Primet, Pascale, Altman, Eitan
Tremendous amounts of effort have gone into research on switch designs and architectures. This survey attempts to sketch the evolution of the modern switch architectures. The survey covers the...
A survey on core switch designs and algorithms (2009)
Divakaran, Dinil Mon, Soudan, Sébastien, Primet, Pascale, Altman, Eitan
Tremendous amounts of effort have gone into research on switch designs and architectures. This survey attempts to sketch the evolution of the modern switch architectures. The survey covers the...
Interaction between MPI and TCP in grids. (2009)
Hablot, Ludovic, Glück, Olivier, Mignot, Jean-Christophe, Guillier, Romaric, Soudan, Sébastien
As MPI applications are more and more resource consuming, they need to be executed on grids. The communications on the WAN interconnecting clusters mostly use TCP which suffers from WAN features:...
Interaction between MPI and TCP in grids. (2009)
Hablot, Ludovic, Glück, Olivier, Mignot, Jean-Christophe, Guillier, Romaric, Soudan, Sébastien
As MPI applications are more and more resource consuming, they need to be executed on grids. The communications on the WAN interconnecting clusters mostly use TCP which suffers from WAN features:...
Sébastien Soudan, Romaric Guillier, Ludovic Hablot, Yuetsu Kodama, Tomohiro Kudoh, Fumihiro Okazaki, ...
Abstract — This paper examines the interactions between high speed Ethernet switches and TCP in high bandwidth delay product networks. First, the behavior of a range of Ethernet switches when two...
Interaction between MPI and TCP in grids (2008)
Hablot, Ludovic, Glück, Olivier, Mignot, Jean-Christophe, Guillier, Romaric, Soudan, Sébastien
As MPI applications are more and more resource consuming, they need to be executed on grids. The communications on the WAN interconnecting clusters mostly use TCP which suffers from WAN features:...
Interaction between MPI and TCP in grids (2008)
Hablot, Ludovic, Glück, Olivier, Mignot, Jean-Christophe, Guillier, Romaric, Soudan, Sébastien
As MPI applications are more and more resource consuming, they need to be executed on grids. The communications on the WAN interconnecting clusters mostly use TCP which suffers from WAN features:...
Andrei Agapi, Thilo Kielmann, Marcelo Pasin, Sébastien Soudan, Andrei Agapi, ...
This report describes the results of a six-week research visit by the first author to the INRIA RESO research group at ENS Lyon. We address the problem of scheduling bulk data transfers in routing...
TCP Variants and Transfer Time Predictability in Very High Speed Networks (2007)
Guillier, Romaric, Soudan, Sébastien
In high performance distributed computing applications, data movements have demanding performance requirements such as reliable and predictable delivery. Predicting the throughput of large transfers...
TCP Variants and Transfer Time Predictability in Very High Speed Networks (2007)
Guillier, Romaric, Soudan, Sébastien
In high performance distributed computing applications, data movements have demanding performance requirements such as reliable and predictable delivery. Predicting the throughput of large transfers...
TCP variants and transfer time predictability in very high speed networks (2007)
Guillier, Romaric, Soudan, Sébastien
27 pages, graphiques en couleurs, bibliographie page 26 à 27
End-host based mechanisms for implementing flow scheduling in GridNetworks (2007)
Soudan, Sébastien, Guillier, Romaric, Primet, Pascale
18 pages, figures, graphiques, 21 références bibliographiques
Guillier, Romaric, Hablot, Ludovic, Kodama, Yuetsu, Kudoh, Tomohiro, Okazaki, Fumihiro, Primet, Pascale, ...
We consider the problem of huge data transfers and bandwidth sharing in contexts where transfer delay bounds are required. This report investigates large flow interactions in a real very high-speed...
Guillier, Romaric, Hablot, Ludovic, Kodama, Yuetsu, Kudoh, Tomohiro, Okazaki, Fumihiro, Primet, Pascale, ...
We consider the problem of huge data transfers and bandwidth sharing in contexts where transfer delay bounds are required. This report investigates large flow interactions in a real very high-speed...
TCP Variants and Transfer Time Predictability in Very High Speed Networks (2007)
Guillier, Romaric, Soudan, Sébastien
In high performance distributed computing applications, data movements have demanding performance requirements such as reliable and predictable delivery. Predicting the throughput of large transfers...
TCP Variants and Transfer Time Predictability in Very High Speed Networks (2007)
Guillier, Romaric, Soudan, Sébastien
In high performance distributed computing applications, data movements have demanding performance requirements such as reliable and predictable delivery. Predicting the throughput of large transfers...
Guillier, Romaric, Hablot, Ludovic, Kodama, Yuetsu, Kudoh, Tomohiro, Okazaki, Fumihiro, Primet, Pascale, ...
We consider the problem of huge data transfers and bandwidth sharing in contexts where transfer delay bounds are required. This report investigates large flow interactions in a real very high-speed...
Guillier, Romaric, Hablot, Ludovic, Kodama, Yuetsu, Kudoh, Tomohiro, Okazaki, Fumihiro, Primet, Pascale, ...
We consider the problem of huge data transfers and bandwidth sharing in contexts where transfer delay bounds are required. This report investigates large flow interactions in a real very high-speed...
Soudan, Sébastien, Guillier, Romaric, Hablot, Ludovic, Kodama, Yuetsu, Kudoh, Tomohiro, Okazaki, Fumihiro, ...
23 pages, figures, tableaux, graphiques, 11 références bibliographiques
Evaluation of 10 GbE links in Grid'5000 (2006)
Guillier, Romaric, Hablot, Ludovic, Primet, Pascale, Soudan, Sébastien
14 pages, figures, tableaux, graphiques, 8 références bibliographiques
Grid flow control : prototype of a grid gateway based on network processors (2006)
Soudan, Sébastien, Primet, Pascale
13 pages, figures en couleur, 14 références bibliographiques
Passerelle à base de processeurs réseaux pour le contrôle des flux de grille (2006)
Soudan, Sébastien, Primet, Pascale
Les grilles de calcul hautes performances sont aujourd'hui constituées de grappes d'ordinateurs interconnectées par des réseaux de coeur sur-dimensionnés. Cependant les liens d'accès dont les...
Passerelle à base de processeurs réseaux pour le contrôle des flux de grille (2006)
Soudan, Sébastien, Primet, Pascale
Les grilles de calcul hautes performances sont aujourd'hui constituées de grappes d'ordinateurs interconnectées par des réseaux de coeur sur-dimensionnés. Cependant les liens d'accès dont les...
Guillier, Romaric, Hablot, Ludovic, Kodama, Yuetsu, Kudoh, Tomohiro, Okazaki, Fumihiro, Primet, Pascale, ...
We consider the problem of huge data transfers and bandwidth sharing in contexts where transfer delay bounds are required. This report investigates large flow interactions in a real very high-speed...
Evaluation des liens 10 GbE de Grid'5000 (2006)
Guillier, Romaric, Hablot, Ludovic, Primet, Pascale, Soudan, Sébastien
L'instrument Grid5000 est destiné à l'étude des problématiques, des solutions et des logiciels de grille pour le calcul et le stockage distribué à large échelle. En 2006, Grid5000 s'est doté...
Evaluation des liens 10 GbE de Grid'5000 (2006)
Guillier, Romaric, Hablot, Ludovic, Primet, Pascale, Soudan, Sébastien
L'instrument Grid5000 est destiné à l'étude des problématiques, des solutions et des logiciels de grille pour le calcul et le stockage distribué à large échelle. En 2006, Grid5000 s'est doté...
Evaluation des liens 10 GbE de Grid'5000 (2006)
Guillier, Romaric, Hablot, Ludovic, Primet, Pascale, Soudan, Sébastien
L'instrument Grid5000 est destiné à l'étude des problématiques, des solutions et des logiciels de grille pour le calcul et le stockage distribué à large échelle. En 2006, Grid5000 s'est doté...
Evaluation des liens 10 GbE de Grid'5000 (2006)
Guillier, Romaric, Hablot, Ludovic, Primet, Pascale, Soudan, Sébastien
L'instrument Grid5000 est destiné à l'étude des problématiques, des solutions et des logiciels de grille pour le calcul et le stockage distribué à large échelle. En 2006, Grid5000 s'est doté...
Guillier, Romaric, Hablot, Ludovic, Kodama, Yuetsu, Kudoh, Tomohiro, Okazaki, Fumihiro, Primet, Pascale, ...
We consider the problem of huge data transfers and bandwidth sharing in contexts where transfer delay bounds are required. This report investigates large flow interactions in a real very high-speed...
Guillier, Romaric, Hablot, Ludovic, Kodama, Yuetsu, Kudoh, Tomohiro, Okazaki, Fumihiro, Primet, Pascale, ...
We consider the problem of huge data transfers and bandwidth sharing in contexts where transfer delay bounds are required. This report investigates large flow interactions in a real very high-speed...
Laboratoire de l’Informatique du Parallélisme (2006)
École Normale, Supérieure Lyon, Unité Mixte, Sébastien Soudan, Pascale Primet, ...
Partage de bande passante et plan de contrôle optique dans les grilles