On transport daemons for small collaborative applications over wide-area networks

Chase Wu, Nageswara S V Rao, S. Sitharama Iyengar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations

Abstract

A number of science applications employing collaborative computations require transport methods that guarantee end-to-end performance at the application level. Throughputs achieved by the traditional transport methods are limited to single default best-effort IP paths, which are often insufficient for the application tasks. In this paper, we present a measurement-based approach that utilizes application-level daemons at the collaborating sites to enhance the transport performance by utilizing multiple quickest paths. This method is based on a linear approximation of the effective bandwidth, and is computationally efficient and analytically tractable under fairly general conditions. We implemented and tested this method at Internet nodes, and the experimental results show significant performance improvements over the default TCP.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the 24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005
EditorsT. Dahlberg, R. Oliver, A. Sen, G. Xue
Pages159-166
Number of pages8
StatePublished - Dec 12 2005
Externally publishedYes
Event24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005 - Phoenix, AZ, United States
Duration: Apr 7 2005Apr 9 2005

Other

Other24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005
CountryUnited States
CityPhoenix, AZ
Period4/7/054/9/05

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'On transport daemons for small collaborative applications over wide-area networks'. Together they form a unique fingerprint.

Cite this