๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new consistency algorithm for dynamic documents in content distribution networks

โœ Scribed by Zongming Fei


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
261 KB
Volume
63
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis


One of the important problems in content distribution networks is how to maintain the consistency of content at replicas with the origin server, especially for those documents changing dynamically. In this paper, we propose a new hybrid consistency algorithm that will generate less traffic than the traditional propagation approach, and the invalidation approach. The basic scheme is extended to the case in which requests are not evenly distributed over all replicas. We propose a hierarchical framework which allows replicas at different levels to make a decision based on the statistics collected. Extensive simulations are performed to examine how the traffic generated and the freshness ratio at replicas are affected by various parameters. We experiment with a wide range of request rates, update frequencies, and numbers of replicas. The results show that our approach can take advantage of content distribution networks and significantly reduce the traffic generated.


๐Ÿ“œ SIMILAR VOLUMES


Distributed algorithms for finding and m
โœ Saurabh Srivastava; R.K. Ghosh ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 290 KB

A k-core C k of a tree T is subtree with exactly k leaves for k n l , where n l the number of leaves in T , and minimizes the sum of the distances of all nodes from C k . In this paper first we propose a distributed algorithm for constructing a rooted spanning tree of a dynamic graph such that root

A new proximal decomposition algorithm f
โœ Mahey, P.; Ouorou, A.; LeBlanc, L.; Chifflet, J. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 125 KB ๐Ÿ‘ 2 views

We present a new and much more efficient implementation of the proximal decomposition algorithm for routing in congested telecommunication networks. The routing model that we analyze is a static one intended for use as a subproblem in a network design context. After describing our new implementation

A new convolution algorithm for loss pro
โœ Qian Huang; King-Tim Ko; Villy Bรฆk Iversen ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 403 KB

Performance analysis in multiservice loss systems generally focuses on accurate and efficient calculation methods for traffic loss probability. Convolution algorithm is one of the existing efficient numerical methods. Exact loss probabilities are obtainable from the convolution algorithm in systems