End-host based mechanisms for implementing flow scheduling in GridNetworks

Abstract : In Grids, transfer jobs and network resources need to be managed in a moredeterministic way than in the Internet. New approaches like flow schedulingare proposed and studied as alternatives to traditional QoS and reservationproposals. To enable such flow scheduling approaches, run-time mechanismscontrolling flow sending time and rate have to be implemented in the dataplane. This paper quantify and compares in a range of latency conditions,such end-host based mechanisms combined with transport protocols to instantiatedifferent scheduling strategies. We show that, in high speed network, asingle-rate scheduling strategy implemented by an AIMD-based protocol withpacket pacing mechanism offers predictable performance and is insensitive tolatency. This paper also highlights the limits of other strategies and rate limitationmechanisms like token bucket which may present unpredictability andother drawbacks.
Document type :
Reports
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102599
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 3:02:45 PM
Last modification on : Wednesday, November 20, 2019 - 3:14:01 AM

File

RR2007-24.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102599, version 1

Collections

Citation

Sébastien Soudan, Romaric Guillier, Pascale Primet. End-host based mechanisms for implementing flow scheduling in GridNetworks. [Research Report] LIP RR-2007-24, Laboratoire de l'informatique du parallélisme. 2007, 2+16p. ⟨hal-02102599⟩

Share

Metrics

Record views

17

Files downloads

46