Adapting to Bandwidth Variations in Wide-Area Data Combination

Published

May 26, 1998

Author(s)

Mudumbai Ranganathan, A Acharya, J Saltz

Abstract

Efficient data combination over wide-area networks is hard as wide-area networks have large variations in available network bandwidth. In this paper, we examine the utility of changing the location of combination operators as a technique to adapt to variations in wide-area network bandwidth. We try to answer the following questions. First, does relocation of operators provide a significant performance improvement? Second, is on-line relocation useful or does a one-time positioning at start-up time provide most, if not all the benefits? Third, if on-line relocation is useful, how frequently should it be done and is global knowledge of network performance required or can local knowledge and local relocation of operators be sufficient? Fourth, does the effectiveness of operator relocation depend on the ordering of the combination operations? That is, are certain ways of ordering more amenable to adaptation than others? Finally, how do the results change as the number of data sources changes?

Proceedings Title

Proceedings of the 18th IEEE International Conference on Distributed Computing Systems

Conference Dates

May 26-29, 1998

Conference Location

Amsterdam, NL

Conference Title

International Conference on Distributed Computing Systems

Pub Type

Conferences

Keywords

mobile agents, mobile networks, reactive applications

Citation

Ranganathan, M. , Acharya, A. and Saltz, J. (1998), Adapting to Bandwidth Variations in Wide-Area Data Combination, Proceedings of the 18th IEEE International Conference on Distributed Computing Systems, Amsterdam, NL (Accessed April 29, 2024)