Skip to Main content Skip to Navigation
Reports

End-host based mechanisms for implementing Flow Scheduling in GridNetworks

Sebastien Soudan 1, 2 Romaric Guillier 1, 2 Pascale Primet 1, 2
2 RESO - Protocols and softwares for very high-performance network
Inria Grenoble - Rhône-Alpes, ENS Lyon - École normale supérieure - Lyon, CNRS - Centre National de la Recherche Scientifique : UMR5668
Abstract : In Grids, transfer jobs and network resources need to be managed in a more deterministic way than in the Internet. New approaches like flow scheduling are proposed and studied as alternatives to traditional QoS and reservation proposals. To enable such flow scheduling approaches, run-time mechanisms controlling flow sending time and rate have to be implemented in the data plane. This paper quantify and compares in a range of latency conditions, such end-host based mechanisms combined with transport protocols to instantiate different scheduling strategies. We show that, in high speed network, a single-rate scheduling strategy implemented by an AIMD-based protocol with packet pacing mechanism offers predictable performance and is insensitive to latency. This paper also highlights the limits of other strategies and rate limitation mechanisms like token bucket which may present unpredictability and other drawbacks.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/inria-00150334
Contributor : Sebastien Soudan <>
Submitted on : Thursday, May 31, 2007 - 10:35:00 AM
Last modification on : Monday, May 4, 2020 - 11:37:41 AM
Long-term archiving on: : Thursday, September 23, 2010 - 4:24:42 PM

File

RR.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00150334, version 3

Collections

Citation

Sebastien Soudan, Romaric Guillier, Pascale Primet. End-host based mechanisms for implementing Flow Scheduling in GridNetworks. [Research Report] INRIA. 2007. ⟨inria-00150334v3⟩

Share

Metrics

Record views

408

Files downloads

412