Latency Hiding Algorithm for P2P File Integrity Verification
Peng Sun · Jisuanji gongcheng · 2010
A latency hiding algorithm,called HASH-Latency Hiding(HASH-LH),is promoted.By leveraging the streaming process characteristics of the Hash algorithms used for P2P file integrity verification and the asynchronous receiving buffer of TCP,it is reasonable for HASH-LH to divide a big file block into multiple smaller sub-blocks,which makes the latency much shorter for calculating Hash values on each sub-block.Furthermore,the Hash calculation starts just after the first sub-block is received.As the latency of each sub-block Hash calculation becomes as short as it can be hidden by the asynchronous receiving buffer of TCP,it makes calculation and receiving processed nearly at the same time.As a result,all the latency from file verification is hidden and performance boosts up.