rsync算法.docVIP

HYPERLINK /ziffer/archive/2009/12/10/1621105.html rsync算法　 参考： HYPERLINK .au/rsync/tech_report/tech_report.html \t _blank .au/rsync/tech_report/tech_report.html　　　 Abstract:　 This report presents an algorithm for updating a file on one machine to be identical to a file on another machine. We assume that the two machines are connected by a low-bandwidth high-latency bi-directional communications link. The algorithm identifies parts of the source file which are identical to some part of the destination file, and only sends those parts which cannot be matched in this way. Effectively, the algorithm computes a set of differences without having both files on the same machine. The algorithm works best when the files are similar, but will also function correctly and reasonably efficiently when the files are quite different.　　 HYPERLINK .au/rsync/tech_report/node1.html \t _blank The problem 　　 HYPERLINK .au/rsync/tech_report/node2.html \t _blank The rsync algorithm 　　 HYPERLINK .au/rsync/tech_report/node3.html \t _blank Rolling checksum 　 HYPERLINK .au/rsync/tech_report/node4.html \t _blank Checksum searching 　　　 HYPERLINK .au/rsync/tech_report/node5.html \t _blank Pipelining 　　 HYPERLINK .au/rsync/tech_report/node6.html \t _blank Results 　　　 HYPERLINK .au/rsync/tech_report/node7.html \t _blank Availability 　 HYPERLINK .au/rsync/tech_report/node8.html \t _blank About this document ... 　 　　 The problem 　 Imagine you have two files, A and B, and you wish to update B to be the same as A. The obvious method is to copy A onto B. 　 Now imagine that the two files are on machines connected by a slow communications link, for example a dial up IP link. If A is large, copying A onto B will be slow. To make it faster you could compress A before sending it, but that will usually only gain a factor of 2 to 4. 　　　 Now assume that A and B are quite similar, perhaps both derived from the same original file. To really speed things up you would need to take advantage of this similari