Data structures and network algorithms
Data structures and network algorithms
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Improving the WWW: caching or multicast
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Implications of proxy caching for provisioning networks and servers
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Engineering server-driven consistency for large scale dynamic Web services
Proceedings of the 10th international conference on World Wide Web
Adaptive precision setting for cached approximate values
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Best-effort cache synchronization with source cooperation
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Adaptive Push-Pull: Disseminating Dynamic Web Data
IEEE Transactions on Computers
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
A scalable and highly available web server
COMPCON '96 Proceedings of the 41st IEEE International Computer Conference
The case for geographical push-caching
HOTOS '95 Proceedings of the Fifth Workshop on Hot Topics in Operating Systems (HotOS-V)
Maintaining Strong Cache Consistency in the World-Wide Web
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Design Considerations for Distributed Caching on the Internet
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Resilient and Coherence Preserving Dissemination of Dynamic Data Using Cooperating Peers
IEEE Transactions on Knowledge and Data Engineering
Construction of a Coherency Preserving Dynamic Data Dissemination Network
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Executing incoherency bounded continuous queries at web data aggregators
WWW '05 Proceedings of the 14th international conference on World Wide Web
Design and evaluation of a continuous consistency model for replicated services
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Hierarchical cache consistency in a WAN
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
Improving web server performance by caching dynamic data
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Salamander: a push-based distribution substrate for internet applications
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Stochastic consistency, and scalable pull-based caching for erratic data stream sources
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Optimized query planning of continuous aggregation queries in dynamic data dissemination networks
Proceedings of the 16th international conference on World Wide Web
| Hi-index | 0.00 |
Consider a content distribution network consisting of a set of sources, repositories and clients where the sources and the repositories cooperate with each other for efficient dissemination of dynamic data. In this system, necessary changes are pushed from sources to repositories and from repositories to clients so that they are automatically informed about the changes of interest. Clients and repositories associate coherence requirements with a data item d, denoting the maximum permissible deviation of the value of d known to them from the value at the source. Given a list of served by each repository and a set of requests, we address the following problem: How do we assign clients to the repositories, so that the fidelity, that is, the degree to which client coherence requirements are met, is maximized?In this paper, we first prove that the client assignment problem is NP-Hard. Given the closeness of the client-repository assignment problem and the matching problem in combinatorial optimization, we have tailored and studied two available solutions to the matching problem from the literature: (i) max-flow min-cost and (ii) stable-marriages. Our empirical results using real-world dynamic data show that the presence of coherence requirements adds a new dimension to the client-repository assignment problem. An interesting result is that in update intensive situations a better fidelity can be delivered to the clients by attempting to deliver data to some of the clients at a coherence lower than what they desire. A consequence of this observation is the necessity for quick adaptation of the delivered (vs. desired) data coherence with respect to the changes in the dynamics of the system. We develop techniques for such adaptation and show their impressive performance.