1st International ICST Conference on Networks for Grid Applications

Research Article

End-host based mechanisms for implementing Flow Scheduling in GridNetworks

Download512 downloads
  • @INPROCEEDINGS{10.4108/gridnets.2007.2152,
        author={Sebastien Soudan and Romaric Guillier and Pascale Primet},
        title={End-host based mechanisms for implementing Flow Scheduling in GridNetworks},
        proceedings={1st International ICST Conference on Networks for Grid Applications},
        publisher={ICST},
        proceedings_a={GRIDNETS},
        year={2007},
        month={10},
        keywords={Grid networks flow scheduling bulk data transfers rate limitation pacing},
        doi={10.4108/gridnets.2007.2152}
    }
    
  • Sebastien Soudan
    Romaric Guillier
    Pascale Primet
    Year: 2007
    End-host based mechanisms for implementing Flow Scheduling in GridNetworks
    GRIDNETS
    ICST
    DOI: 10.4108/gridnets.2007.2152
Sebastien Soudan1,*, Romaric Guillier1, Pascale Primet1
  • 1: INRIA, Universite de Lyon ENS-Lyon, 46 allee d’Italie Lyon, France
*Contact email: ssoudan@ens-lyon.fr

Abstract

In Grids, data transfers 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, runtime mechanisms controlling flow sending time and rate have to be implemented in the data plane. This paper quantifies and compares such end-host based mechanisms combined with transport protocols to instantiate different scheduling strategies in a range of latency conditions. We show that, a single-rate scheduling strategy implemented by an AIMDbased protocol and a 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 generates unpredictability and other drawbacks.