GTP: group transport protocol for lambda-grids

Wu, Ren-Hao; Chien, Andrew A.

doi:10.1109/ccgrid.2004.1336572

Cited by 27 publications

(23 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Often, the end host may not be able to receive data continuously at the high bit rate supported by a dedicated circuit in a lambda grid [27], [10]. As an example, when the end host is under a heavy workload, packets may be lost when the operating system allocates a large context switch to an alternate process.…”

Section: Online Reconfigurationmentioning

confidence: 99%

Algorithms for Integrated Routing and Scheduling for Aggregating Data from Distributed Resources on a Lambda Grid

Banerjee

Feng

Ghosal

et al. 2008

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-In many e-science applications, there exists an important need to aggregate information from data repositories distributed around the world. In an effort to better link these resources in a unified manner, many lambda-grid networks, which provide end-to-end dedicated optical-circuit-switched connections, have been investigated. In this context, we consider the problem of aggregating files from distributed databases at a (grid) computing node over a lambda grid. The challenge is 1) to identify routes (that is, circuits) in the lambda-grid network, along which files should be transmitted, and 2) to schedule the transfers of these files over their respective circuits. To address this challenge, we propose a hybrid approach that combines offline and online scheduling. We define the TimePath Scheduling Problem (TPSP) for offline scheduling. We prove that TPSP is NP-complete, develop a Mixed Integer Linear Program (MILP) formulation for TPSP, and then propose a greedy approach to solve TPSP because the MILP does not scale well. We compare the performance of the greedy approach on a few representative lambda-grid network topologies. One key input to the offline schedule is the file transfer time. Due to dynamics at the receiving end host, which is hard to model precisely, the actual file transfer time may vary. We first propose a model for estimating the file transfer time. Then, we propose online reconfiguration algorithms so that as files are transferred, the offline schedule may be modified online, depending on the amount of time that it actually took to transfer the file. This helps in reducing the total time to transfer all the files, which is an important metric. To demonstrate the effectiveness of our approach, we present results on an emulated lambda-grid network testbed.

show abstract

Section: Online Reconfigurationmentioning

confidence: 99%

Algorithms for Integrated Routing and Scheduling for Aggregating Data from Distributed Resources on a Lambda Grid

Banerjee

Feng

Ghosal

et al. 2008

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Accordingly, researchers have pursued alternative solutions to overcome the the limitations of TCP/IP in large BDP networks and provide highperformance networking capabilities in such environments. In recent years, rate-controlled UDP/IP-based protocols [He et al 2002;Xiong et al 2005;Gu and Grossman 2004;Wu and Chien 2004;Dickens 2003;Zheng et al 2004;Rao et al 2004] have emerged as feasible alternatives.…”

Section: Introductionmentioning

confidence: 99%

End-System Aware, Rate-Adaptive Protocol for Network Transport in LambdaGrid Environments

Datta

Feng

Sharma

2006

ACM/IEEE SC 2006 Conference (SC'06)

View full text Add to dashboard Cite

Next-generation e-Science applications will require the ability to transfer information at high data rates between distributed computing centers and data repositories. A LambdaGrid offers dedicated, optical, circuit-switched, point-topoint connections that can be reserved exclusively for such applications. These dedicated high-speed connections eliminate network congestion as seen in traditional Internet, but they effectively push the network congestion to the end systems, as processing speeds cannot keep up with networking speeds. Thus, developing an efficient transport protocol over such high-speed dedicated circuits is of critical importance.We propose the idea of a end-system aware, rate-adaptive protocol for network transport, based on end-system performance monitoring. Our proposed protocol significantly improves the performance of data transfer over LambdaGrids by intelligently adapting the sending rate based on end-system constraints. We demonstrate the effectiveness of our proposed protocol and illustrate the performance gains achieved via wide-area network emulation.

show abstract

“…This leads to unwanted packet losses, particularly when the receiving endsystem is swamped with too many packets to process, i.e., the network outstrips the ability of the processor to keep up. Though dedicated optical connections such as those in LambdaGrids effectively eliminate congestion in the network, the network throughput of such connections (namely 10 Gbps for an OC-192 connection) often exceed the capabilities of data processing at the end system [11,12], thus creating congestion at the end system.…”

Section: Introductionmentioning

confidence: 99%