Please use this identifier to cite or link to this item:
|Title:||Disseminating streaming data in a dynamic environment: An adaptive and cost-based approach||Authors:||Zhou, Y.
Distributed stream processing
Streaming data dissemination
|Issue Date:||2008||Citation:||Zhou, Y., Ooi, B.C., Tan, K.-L. (2008). Disseminating streaming data in a dynamic environment: An adaptive and cost-based approach. VLDB Journal 17 (6) : 1465-1483. ScholarBank@NUS Repository. https://doi.org/10.1007/s00778-007-0077-7||Abstract:||In a distributed stream processing system, streaming data are continuously disseminated from the sources to the distributed processing servers. To enhance the dissemination efficiency, these servers are typically organized into one or more dissemination trees. In this paper, we focus on the problem of constructing dissemination trees to minimize the average loss of fidelity of the system. We observe that existing heuristic-based approaches can only explore a limited solution space and hence may lead to sub-optimal solutions. On the contrary, we propose an adaptive and cost-based approach. Our cost model takes into account both the processing cost and the communication cost. Furthermore, as a distributed stream processing system is vulnerable to inaccurate statistics, runtime fluctuations of data characteristics, server workloads, and network conditions, we have designed our scheme to be adaptive to these situations: an operational dissemination tree may be incrementally transformed to a more cost-effective one. Our adaptive strategy employs distributed decisions made by the distributed servers independently based on localized statistics collected by each server at runtime. For a relatively static environment, we also propose two static tree construction algorithms relying on apriori system statistics. These static trees can also be used as initial trees in a dynamic environment. We apply our schemes to both single- and multi-object dissemination. Our extensive performance study shows that the adaptive mechanisms are effective in a dynamic context and the proposed static tree construction algorithms perform close to optimal in a static environment. © Springer-Verlag 2007.||Source Title:||VLDB Journal||URI:||http://scholarbank.nus.edu.sg/handle/10635/39794||ISSN:||10668888||DOI:||10.1007/s00778-007-0077-7|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 4, 2019
WEB OF SCIENCETM
checked on Nov 4, 2019
checked on Oct 28, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.