Adaptive data block scheduling for parallel TCP streams
Adaptive data block scheduling for parallel TCP streams
复制标题
并行 TCP 流的自适应数据块调度
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
B. Athey
中科院分区：
文献类型：
--
作者：
T. Hacker;Brian D. Noble;B. Athey
使用并行TCP流来增加吞吐量的应用程序必须在一个或多个网络路径上传输的一组TCP流上多路复用和解复用数据块。当应用程序使用明显的循环调度算法来复用数据块时，各个TCP流之间的传输速率差异可能导致数据块的重新排序。这迫使解复用接收器缓冲乱序数据块，从而消耗内存并可能导致接收应用程序停止。本文提出了一种新的自适应加权调度方法，用于在一组并行TCP流上复用数据块。我们的新的调度方法相比，使用GridFTP的调度方法，减少了重新排序的数据块之间的各个TCP流，保持聚合的吞吐量收益的并行TCP，消耗更少的接收器内存缓冲无序数据包，并提供更流畅的应用程序有效吞吐量。我们证明了我们的新的调度方法，使用数据传输实验在真实的和模拟广域网的改进特性。
Applications that use parallel TCP streams to increase throughput must multiplex and demultiplex data blocks over a set of TCP streams transmitting on one or more network paths. When applications use the obvious round robin scheduling algorithm for multiplexing data blocks, differences in transmission rate between individual TCP streams can lead to significant data block reordering. This forces the demultiplexing receiver to buffer out-of-order data blocks, consuming memory and potentially causing the receiving application to stall. This paper describes a new adaptive weighted scheduling approach for multiplexing data blocks over a set of parallel TCP streams. Our new scheduling approach, compared with the scheduling approached used by GridFTP, reduces reordering of data blocks between individual TCP streams, maintains the aggregate throughput gains of parallel TCP, consumes less receiver memory for buffering out-of-order packets, and delivers smoother application goodput. We demonstrate the improved characteristics of our new scheduling approach using data transmission experiments over real and emulated wide-area networks.