Analysis of High-speed Data Transfer Protocols

Show simple item record

dc.contributor.advisor Brownlee, N en
dc.contributor.advisor Mahanti, A en
dc.contributor.advisor Carpenter, B en
dc.contributor.author Yu, Y en
dc.date.accessioned 2016-06-26T21:12:38Z en
dc.date.issued 2016 en
dc.identifier.citation 2016 en
dc.identifier.uri http://hdl.handle.net/2292/29164 en
dc.description.abstract Researchers working in diverse fields such as astronomy, experimental physics, genomics, and meteorology frequently have to deal with analysing voluminous amounts of complex data. Such data is often referred to as big data. These researchers work in teams and have to transfer this data over long distances. Many research sites, although equipped with 100 Gb/s links, only use 10 Gb/s links to transfer their data. Efficiently transferring big data over long distances requires the use of appropriate transfer protocols. TCP Reno [62] cannot utilise the high-speed network capacity well while UDP does not provide reliable transmission of data. Sneakernet is also inefficient because of slow disk read/write times. Several TCP-based and UDP-based protocols have been proposed, however, a comparative analysis of such protocols is lacking in the literature. We built in-lab, national and international testbed and used TCP-based and UDP-based high-speed data transfer protocols to measure their performance and fairness. We performed extensive experiments to measure the effectiveness of each protocol in terms of its throughput for various round-trip times, and against increasing levels of congestion inducing TCP or UDP background traffic on a 10 Gb/s network. From the results, we have analysed the protocols to choose a protocol that is well-suited for any particular network path. Also, there are definitions of ‘fairness’ for traditional network flows but these do not consider the flows’ purpose. We investigate how different high-speed data transfer systems perform on high-speed communication networks and observe congestion induced by the systems on other traffic in the network. Measuring induced congestion may provide us insights of what is ‘fair’ in high-speed networks, and how it is different to traditional fairness where the purpose of a flow is not considered. These insights could help both users and network administrators to consider network flow fairness in a new light. We found the primary bottleneck of the high-speed data transfer is in slow disk speed and small TCP socket buffer size. Using multiple transfer flows improves the performance of GridFTP and FDT in a long-haul link more than in a short-haul link because it increases aggregated TCP socket buffer size, and has less impact on the shared link in terms of increased RTT. However, using multiple flows causes more packet losses on the path and each flow goes to recovery mode which may take longer than short-haul link. We found that GridFTP is the most efficient protocol for transferring data in high-speed networks. We recommend using fewer than four parallel flows with GridFTP because of the potential impact to other network services due to increased RTT on shared links. This will improve the existing data transfer performance and reduce its impact on shared links. en
dc.publisher ResearchSpace@Auckland en
dc.relation.ispartof PhD Thesis - University of Auckland en
dc.relation.isreferencedby UoA99264849712902091 en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/nz/ en
dc.title Analysis of High-speed Data Transfer Protocols en
dc.type Thesis en
thesis.degree.discipline Computer Science en
thesis.degree.grantor The University of Auckland en
thesis.degree.level Doctoral en
thesis.degree.name PhD en
dc.rights.holder Copyright: The Author en
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en
pubs.elements-id 531544 en
pubs.record-created-at-source-date 2016-06-27 en
dc.identifier.wikidata Q112931878


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics