Optimization Algorithms for Data Transfer in the Grid Environment

Optimization Algorithms for Data Transfer in the Grid Environment

Muzhou Xiong (Huazhong University of Science and Technology, China) and Hai Jin (Huazhong University of Science and Technology, China)
DOI: 10.4018/978-1-4666-0879-5.ch210
OnDemand PDF Download:
No Current Special Offers


In this chapter, two algorithms have been presented for supporting efficient data transfer in the Grid environment. From a node’s perspective, a multiple data transfer channel can be formed by selecting some other nodes as relays in data transfer. One algorithm requires the sender to be aware of the global connection information while another does not. Experimental results indicate that both algorithms can transfer data efficiently under various circumstances.
Chapter Preview


Distributed data intensive computing, such as gravitational-wave physics (Barish, 1999), high-energy physics (Wulz, 1998) and astronomy (Szalay, 2008), has become an important application of the Grid technology (Foster, 2001; Chervenak, 2001; Rajasekar, 2003). The future of these paradigms is to share a variety of resources within collaboration in pursuit of common goals (Deelman, 2004). All these paradigms are data driven, which means that only when the data is ready will the computing resource work. Hence, “data” are regarded as the most important resources, and they are the bridges via which the activities and people among those paradigms are connected. For the performance issue, it is important to fetch data as fast as possible. In other words, the performance of data transfer is the key factor affecting the efficiency of data intensive distributed computing.

The data transfer between a server and a client over Internet is limited by several bottlenecks (Gkantsidis, 2003). First, the achievable bandwidth by the client is limited by the server’s bandwidth to the Internet, which is referred as First-Mile problem. Secondly, the achievable bandwidth is limited by the data transfer speed of the link connecting the server and client. Thirdly, the bottleneck may exist in the client’s connection to the Internet, namely the Last-Mile problem. Thus, the data transfer speed may only be as high as the slowest link in the aforementioned setup. The optimization of data transfer is around those three aspects. The typical solutions to the First-Mile and Last-Mile problems are to improve the bandwidth of the client and server using advanced network techniques, such as Gigabyte Ethernet and Fiber channel etc. Usually the bandwidth of the direct connection from a node to Internet is high. However, the data transfer speed is determined by the slowest part of these three aspects. The main reason for low data transfer speed lies in the achievable bandwidth of the path between the server and the client, which is much lower than that of each node connecting to Internet. The bandwidth of the path selected by the routing algorithm, or in other words, the direct bandwidth from the source to the destination, is usually much less than those available to the connections from the source and the destination directly to Internet. Under this circumstance, both the source and the destination have the capabilities of sending/receiving more data given that the larger direct bandwidth those connecting to the Internet can be further utilized.

However, existing common-used routing protocols only support a single path between any pair of nodes on Internet. Aiming at this limitation, the method of multi-path data transfer is proposed to improve the performance of data. The basic idea of multi-path data transfer lies in establishing multiple paths from the node or nodes where data can be stored for delivery to the destination eventually. The multi-path data transfer can be applied either at application level or routing protocol level. At application level, the paths are controlled by the data transfer protocol itself and could be formed according to the two following mechanisms: (1) the client is connected to the sever through multiple channels via some relay nodes (Gkantsidis, 2003), and (2) several clients sending different part of the data to server (Vazhkudai, 2003). The former method requires that the bandwidth between the server and client should be large enough for multiple simultaneous data transfer. The latter method needs several duplicated copies of data to be transferred.

The current routing protocols over Internet naturally form a two-level hierarch: inter-domain and intra-domain. BGP (Border Gateway Protocol) (Stewart, 1998), the de facto standard inter-domain routing protocol, often leads to failures and poor performance in end-to-end data transfer. With respect to this, multi-path methods have been developed to tackle the limitation at routing protocol level. Typical examples include Detour (Savage, 1999) and RON (Andersen, 2001), which successfully demonstrate that the multi-path data transfer methods can enable quicker reaction to failures and improve end-to-end performance. When the bandwidth constraints are within a network domain, multi-path data transfer may provide a much higher throughput (Akella, 2003; Akella, 2004).

Complete Chapter List

Search this Book: