A coordinated data collection approach: Design, evaluation, and comparison

被引:17
作者
Cheng, WC [1 ]
Chou, CF
Golubchik, L
Khuller, S
Wan, YCJ
机构
[1] Univ So Calif, Dept Comp Sci, Los Angeles, CA 90089 USA
[2] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10764, Taiwan
[3] Univ So Calif, Elect Engn Syst Dept, Los Angeles, CA 90089 USA
[4] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
data collection; graph theory; Internet-based applications; performance evaluation; system design;
D O I
10.1109/JSAC.2004.836009
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We consider the problem of collecting a large amount of data from several different hosts to a single destination in a wide-area network. This problem is important since improvements in data collection times in many applications such as wide-area upload applications, high-performance computing applications, and data mining applications are crucial to performance of those applications. Often, due to congestion conditions, the paths chosen by the network may have poor throughput. By choosing an alternate route at the application level, we may be able to obtain substantially faster completion time. This data collection problem is a nontrivial one because the issue is not only to avoid congested link(s), but to devise a coordinated transfer schedule which would afford maximum possible utilization of available network resources. Our approach for computing coordinated data collection schedules makes no assumptions about knowledge of the topology of the network or the capacity available on individual links of the network. This approach provides significant performance improvements under various degrees and types of network congestions. To show this, we give a comprehensive comparison study of the various approaches to the data collection problem which considers performance, robustness, and adaptation characteristics of the different data collection methods. The adaptation to network conditions characteristics are important as the above applications are long lasting, i.e., it is likely changes in network conditions will occur during the data transfer process. In general, our approach can be used for solving arbitrary data movement problems over the Internet. We use the Bistro platform to illustrate one application of our techniques.
引用
收藏
页码:2004 / 2018
页数:15
相关论文
共 31 条
  • [1] Ahuja RK, 1993, NETWORK FLOWS THEORY
  • [2] [Anonymous], NETWORK SIMULATOR NS
  • [3] [Anonymous], P 18 ACM SOSP CAN OC
  • [4] BADRINATH BR, 1998, DCSTR362 RUTG U COMP
  • [5] Bhattacharjee S., 2000, Performance Evaluation Review, V28, P29, DOI 10.1145/362883.362907
  • [6] CALVERT K, 2000, IEEE T NETWORKING, V19, P426
  • [7] Measuring bottleneck link speed in packet-switched networks
    Carter, RL
    Crovella, ME
    [J]. PERFORMANCE EVALUATION, 1996, 27-8 : 297 - 318
  • [8] Cheng WC, 2003, IEEE INFOCOM SER, P218
  • [9] CHENG WC, 2002, CSTR4322 U MARYL COL
  • [10] CHOU CF, 2002, P 7 INT WORKSH WEB C, P259