Precision synchronization of computer network clocks
ACM SIGCOMM Computer Communication Review
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Performance Issues of Bandwidth Reservations for Grid Computing
SBAC-PAD '03 Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing
Providing Data Transfer with QoS as Agreement-Based Service
SCC '04 Proceedings of the 2004 IEEE International Conference on Services Computing
GNET-1: gigabit Ethernet network testbed
CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
UDT: UDP-based data transfer for high-speed wide area networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Trickle: a userland bandwidth shaper for Unix-like systems
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Grid'5000: A Large Scale and Highly Reconfigurable Grid Experimental Testbed
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Planning Large Data Transfers in Institutional Grids
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Investigating self-similarity and heavy-tailed distributions on a large-scale experimental facility
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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 AIMD-based 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.