arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0711.0301cs.NI
收藏

超高速网络中提前资源预留的吞吐量优化在线算法

Throughput Optimal On-Line Algorithms for Advanced Resource Reservation in Ultra High-Speed Networks

Reuven Cohen, Niloofar Fazlollahi, David Starobinski

摘要:

高级信道预留正在成为需要传输大文件的超高速网络的重要特征。应用包括科学数据传输和数据库备份。在本文中,我们提出了两个新的,在线算法,先进的保留,称为BatchAll和BatchLim,保证实现最佳的吞吐量性能,基于多商品流参数。这两种算法都具有多项式时间的复杂度和可证明的界限上的最大延迟1+ 100带宽增强的网络。BatchLim算法在发出请求时立即返回连接的完成时间,但代价是比BatchAll稍微宽松的竞争比率。我们还提出了一个简单的方法,限制了算法所使用的并行路径的数量,同时可证明边界的传输吞吐量的最大减少因子。我们表明,虽然不同的路径的数量可以是指数级的大,近似的流量所需的路径的实际数量是相当小的,成比例的网络中的边缘的数量。对许多拓扑结构的仿真表明,在实践中,3到5个并行路径足以实现接近最佳性能。竞争算法的性能也比较贪婪的基准,无论是通过分析和仿真。

英文摘要:

Advanced channel reservation is emerging as an important feature of ultra high-speed networks requiring the transfer of large files. Applications include scientific data transfers and database backup. In this paper, we present two new, on-line algorithms for advanced reservation, called BatchAll and BatchLim, that are guaranteed to achieve optimal throughput performance, based on multi-commodity flow arguments. Both algorithms are shown to have polynomial-time complexity and provable bounds on the maximum delay for 1+epsilon bandwidth augmented networks. The BatchLim algorithm returns the completion time of a connection immediately as a request is placed, but at the expense of a slightly looser competitive ratio than that of BatchAll. We also present a simple approach that limits the number of parallel paths used by the algorithms while provably bounding the maximum reduction factor in the transmission throughput. We show that, although the number of different paths can be exponentially large, the actual number of paths needed to approximate the flow is quite small and proportional to the number of edges in the network. Simulations for a number of topologies show that, in practice, 3 to 5 parallel paths are sufficient to achieve close to optimal performance. The performance of the competitive algorithms are also compared to a greedy benchmark, both through analysis and simulation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑