Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
MAGNET: A Tool for Debugging, Analyzing and Adapting Computing Systems
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Reliable Blast UDP: Predictable High Performance Bulk Data Transfer
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
The Globus Striped GridFTP Framework and Server
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
GTP: group transport protocol for lambda-Grids
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
ULE: a modern scheduler for FreeBSD
BSDC'03 Proceedings of the BSD Conference 2003 on BSD Conference
End-system aware, rate-adaptive protocol for network transport in LambdaGrid environments
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
IEEE Transactions on Parallel and Distributed Systems
Making a case for proactive flow control in optical circuit-switched networks
HiPC'08 Proceedings of the 15th international conference on High performance computing
Complexity analysis and algorithm design for advance bandwidth scheduling in dedicated networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Next-generation e-Science applications will require the ability to transfer information at high data rates between distributed computing centers and data repositories. To support such applications, lambda grid networks have been built to provide large, on-demand bandwidth between end-points that are interconnected via optical circuit-switched lambdas. It is extremely important to develop an efficient transport protocol over such high-capacity, dedicated circuits. Because lambdas provide dedicated bandwidth between endpoints, they obviate the need for network congestion control. Consequently, past research has demonstrated that rate-based transport protocols, such as RBUDP, are more effective than TCP in transferring data over lambdas. However, while lambdas eliminate congestion in the network, they ultimately push the congestion to the endpoints -- congestion that current rate-based transport protocols are ill-suited to handle. In this paper we introduce a "Rate-Adaptive Protocol for Intelligent Delivery (RAPID)" of data that is lightweight and end-system performance-aware, so as to maximize end-to-end throughput while minimizing packet loss. Based on self monitoring of the dynamic task-priority at the receiving end-system, our protocol enables the receiver to proactively deliver feedback to the sender, so that the sender may adapt its sending rate to avoid congestion at the receiving end-system. This avoids large bursts of packet losses typically observed in current rate-based transport protocols. Over a 10-Gigabit link emulation of an optical circuit, RAPID reduces file-transfer time, and hence improves end-to-end throughput by as much as 25%.