Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleAdaptive reorganization of coherency-preserving dissemination tree for streaming data
dc.contributor.authorZhou, Y.
dc.contributor.authorOoi, B.C.
dc.contributor.authorTan, K.-L.
dc.contributor.authorYu, F.
dc.identifier.citationZhou, Y.,Ooi, B.C.,Tan, K.-L.,Yu, F. (2006). Adaptive reorganization of coherency-preserving dissemination tree for streaming data. Proceedings - International Conference on Data Engineering 2006 : 55-. ScholarBank@NUS Repository. <a href="" target="_blank"></a>
dc.description.abstractIn many recent applications, data are continuously being disseminated from a source to a set of servers. In this paper, we propose a cost-based approach to construct dissemination trees to minimize the average loss of fidelity of the system. Our cost model takes into account both the processing cost and the communication cost. To adapt to inaccurate statistics, runtime fluctuations of data characteristics, server workloads, and network conditions etc., we propose a runtime adaptive scheme to incrementally transform a dissemination tree to a more cost-effective one. Given apriori statistics of the system, we propose two static algorithms to construct a dissemination tree for relatively static environments. The 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. © 2006 IEEE.
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings - International Conference on Data Engineering
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.