Transparent Gif

Department of Computer Science

University of California, Santa Barbara

Abstract

Adapting to Bandwidth Variations in Wide-Area Data Combination

by: M. Ranganathan, Anurag Acharya, and Joel Saltz

Abstract:

Efficient data combination over wide-area networks is hard as wide-areanetworks have large variations in available network bandwidth. In this paper,we examine the utility of changing the location of combination operators as atechnique to adapt to variations in wide-area network bandwidth. We try toanswer the following questions. First, does relocation of operators provide asignificant performance improvement? Second, is on-line relocation useful ordoes a one-time positioning at start-up time provide most if not all thebenefits? If on-line relocation {\\em is} useful, how frequently should it bedone and is global knowledge of network performance required or can localknowledge and local relocation of operators sufficient? Fourth, does theeffectiveness of operator relocation depend on the ordering of the combinationoperations. That is, are certain ways of ordering more amenable to adaptationthan others? Finally, how do the results change as the number of data sourceschanges?

Keywords:

Internet, data combination, mobile code

Date:

December 1997

Document: 1997-26

XHTML Validation | CSS Validation
Updated 14-Nov-2005
Questions should be directed to: webmaster@cs.ucsb.edu