Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Modelling and analysis of M/G^{a,b}/1/N queue – A simple alternative approach
Queueing Systems: Theory and Applications
Reliable Blast UDP: Predictable High Performance Bulk Data Transfer
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Experiences in Design and Implementation of a High Performance Transport Protocol
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Direct Cache Access for High Bandwidth Network I/O
Proceedings of the 32nd annual international symposium on Computer Architecture
Exploiting NIC architectural support for enhancing IP-based protocols on high-performance networks
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Self-prevention of socket buffer overflow
Computer Networks: The International Journal of Computer and Telecommunications Networking
PipesFS: fast Linux I/O in the unix tradition
ACM SIGOPS Operating Systems Review - Research and developments in the Linux kernel
A Dynamic Performance-Based Flow Control Method for High-Speed Data Transfer
IEEE Transactions on Parallel and Distributed Systems
Receive side coalescing for accelerating TCP/IP processing
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Ultrascience net: network testbed for large-scale science applications
IEEE Communications Magazine
DRAGON: a framework for service provisioning in heterogeneous grid networks
IEEE Communications Magazine
Minimizing the Data Transfer Time Using Multicore End-System Aware Flow Bifurcation
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
| Hi-index | 0.01 |
The transmission capacity of today's high-speed networks is often greater than the capacity of an end-system (such as a server or a remote client) to consume the incoming data. The mismatch between the network and the end-system, which can be exacerbated by high end-system workloads, will result in incoming packets being dropped at different points in the packet receiving process. In particular, a packet may be dropped in the NIC, in the kernel ring buffer, and (for rate based protocols) in the socket buffer. To provide reliable data transfers, these losses require retransmissions, and if the loss rate is high enough result in longer download times. In this paper, we focus on UDP-like rate based transport protocols, and address the question of how best to estimate the rate at which the end-system can consume data which minimizes the overall transfer time of a file. We propose a novel queueing network model of the end-system, which consists of a model of the NIC, a model of the kernel ring buffer and the protocol processing, and a model of the socket buffer from which the application process reads the data. We show that using simple and approximate queueing models, we can accurately predict the effective end-system bottleneck rate that minimizes the file transfer time. We compare our protocol with PA-UDP, an end-system aware rate based transport protocol, and show that our approach performs better, particularly when the packet losses in the NIC and/or the kernel ring buffer are high. We also compare our approach to TCP. Unlike in our rate based scheme, TCP invokes the congestion control algorithm when there are losses in the NIC and the ring buffer. With higher end-to-end delay, this results in significant performance degradation compared to our reliable end-system aware rate based protocol.