End-host based mechanisms for implementing Flow Scheduling in GridNetworks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

End-host based mechanisms for implementing Flow Scheduling in GridNetworks

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.
Fichier principal
Vignette du fichier
RR.pdf (179.19 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00150334 , version 1 (30-05-2007)
inria-00150334 , version 2 (31-05-2007)
inria-00150334 , version 3 (31-05-2007)

Identifiers

  • HAL Id : inria-00150334 , version 3

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More