Abstract
Efficient data combination over wide-area networks is hard as these networks have large variations in available bandwidth. We examine the utility of changing the location of combination operations as a technique to adapt to variations in 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? 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 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?
| Original language | English |
|---|---|
| Pages | 498-505 |
| Number of pages | 8 |
| State | Published - 1998 |
| Event | Proceedings of the 1998 18th International Conference on Distributed Computing Systems - Amsterdam, Neth Duration: May 26 1998 → May 29 1998 |
Conference
| Conference | Proceedings of the 1998 18th International Conference on Distributed Computing Systems |
|---|---|
| City | Amsterdam, Neth |
| Period | 05/26/98 → 05/29/98 |
Fingerprint
Dive into the research topics of 'Adapting to bandwidth variations in wide-area data combination'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver