A. Orlitsky and K. Viswanathan. Practical algorithms for interactive communication. In IEEE Int. Symp. on Information Theory, June 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Server-Friendly Delta Compression for Efficient Web Access - Savant, Suel (2003) (Correct)
....rsync is efficient for different versions of the same page, but performs only slightly better than gzip on related pages from the same site. Of course, this could be due to shortcomings in the rsync algorithm, and there are in fact several proposals for improved file synchronization techniques [5, 13]. However, these proposals rely on additional roundtrips and thus might not be appropriate for a web access scenario since modem latencies are high and objects are not that large. It appears difficult to achieve significant bandwidth savings over rsync without incurring more than the single ....
A. Orlitsky and K. Viswanathan. Practical algorithms for interactive communication. In IEEE Int. Symp. on Information Theory, June 2001.
Algorithms for Delta Compression and Remote File Synchronization - Suel, Memon (2002) (Correct)
....do very well even with a large block size. Given these observations, some basic performance bounds based on block size and number and size of file modifications can be shown. However, rsync does not have any good performance bounds with respect to common file distance metrics such as edit distance [37]. Of course, in general the optimal block size changes even within a file. In practice, rsync starts out with a block size of several hundred bytes, and uses heuristics to adapt the block size later. Another optimization in rsync allows the server to compress all transmitted symbols for unmatched ....
....compression and remote file synchronization techniques in terms of performance; we believe that this indicates room for significant improvements. One promising approach uses multiple roundtrips between client and server, e.g. to determine the best block size or to recursively split blocks; see [16, 20, 37] for such methods. Recent experimental results by Orlitsky and Viswanathan [37] show improvements over rsync using 15 such a multi round protocol . 3.4 Theoretical Results In addition to the heuristic solution given by rsync, a number of theoretical approaches have been studied that achieve ....
[Article contains additional citation context not shown here]
A. Orlitsky and K. Viswanathan. Practical algorithms for interactive communication. In IEEE Int. Symp. on Information Theory, June 2001.
Improved File Synchronization Techniques for Maintaining - Large Replicated Collections (Correct)
No context found.
A. Orlitsky and K. Viswanathan. Practical algorithms for interactive communication. In IEEE Int. Symp. on Information Theory, June 2001.
Server-Friendly Delta Compression for Efficient Web Access - Savant, Suel (Correct)
No context found.
A. Orlitsky and K. Viswanathan. Practical algorithms for interactive communication. In IEEE Int. Symp. on Information Theory, June 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC