An Improved Application Level Multi-path Streaming Algorithm for HBDP Networks

被引:0
作者
Schrager, Dan [1 ]
Radulescu, Florin [1 ]
机构
[1] Univ Politehn Bucuresti, Fac Automat Control & Comp Sci, Bucharest, Romania
来源
COMPUTATIONAL COLLECTIVE INTELLIGENCE: TECHNOLOGIES AND APPLICATIONS | 2013年 / 8083卷
关键词
fork-join queues; pipe programming paradigm; multi-path;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Data intensive computing applications which require access to geographically distributed data are increasingly important in the grid and cloud computing field. We designed a novel approach to the task of transferring bulk data between remote hosts, based on the fork-join queueing model, by combining, at application level, the use of classical pipes as a mean of serializing data locally with multiple parallel TCP connections which ensure high bandwidth throughput. Our new experiments in 1 Gbps and up to 9 Gbps high bandwidth networks have proven the validity of our improved multi-path transmission algorithms. Both simple file transfers and arbitrary data streaming were done effectively, efficiently, in parallel, between pairs of distributed processes connected via extended fast pipes.
引用
收藏
页码:326 / 335
页数:10
相关论文
共 16 条
  • [1] Allcock W., 2005, GFD20 GLOB GRID FOR
  • [2] ALLMAN M, 1995, P ACTS RES C NASA LE
  • [3] BRAKMO LS, 1995, IEEE J SELECTED AREA, V13
  • [4] Crowcroft J., 1998, Computer Communication Review, V28, P53, DOI 10.1145/293927.293930
  • [5] 2 PARALLEL QUEUES CREATED BY ARRIVALS WITH 2 DEMANDS .1.
    FLATTO, L
    HAHN, S
    [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1984, 44 (05) : 1041 - 1053
  • [6] Floyd Sally., 2003, RFC3649 HIGHSPEED TC
  • [7] Ford A., 2012, TCP EXTENSI IN PRESS
  • [8] Gu Y., 2003, J GRID COMPUT, V1, P377, DOI DOI 10.1023/B:GRID.0000037553.18581.3B
  • [9] HE E, 2002, P IEEE INT C CLUST C
  • [10] Jin C., 2004, P IEEE INFOCOM