1. Sliding Window Protocol Program
2. Program For Sliding Window Protocol In Java

I am attempting to implement the following Basic Sliding Window algorithm in Java. I get the basic idea of it, but I am a bit confused by some the wording, specifically the sentence in bold:

1. Vedio on sliding window protocol in NetSim which includes running the user generated code and sample code present in the NetSim. Client Server Program In Java Using SocketsCode Labs.
2. //Here is sliding window protocol class implementation in java, hope this will help you. /** * A go-back n type sliding window protocol */ public class GoBackN.

A sliding window of fixed width w is moved across the file, and at every position k in the file, the fingerprint of its content is computed. Let k be a chunk boundary (i.e., Fk mod n = 0). Instead of taking the hash of the entire chunk, we choose the numerically smallest fingerprint of a sliding window within this chunk. Then we compute a hash of this randomly chosen window within the chunk. Intuitively, this approach would permit small edits within the chunks to have less impact on the similarity computation. This method produces a variable length document signature, where the number of fingerprints in the signature is proportional to the document length.

Mar 13, 2012 - Simulation of Sliding Window Protocol */. // SlideServer.c: A Simple Slide Server Program Using Sliding Window Protocol.

Please see my code/results below. Am I understanding the basic idea of the algorithm? As per the text in bold, what does it mean to 'choose the numerically smallest fingerprint of a sliding window within its chunk'? I am currently just hashing the entire chunk.

code:

results:

3 Answers

The simple answer is NO per my understanding (I once studied sliding window algorithm years ago, so I just remember the principles, while cannot remember some details. Correct me if you have more insightful understanding).

As the name of the algorithm 'Sliding Window', your window should be sliding not jumping as it says

in your quotes. That is to say the window slides one character each time.

Per my knowledge, the concept of chunks and windows should be distinguished. So should be fingerprint and hash, although they could be the same. Given it too expense to compute hash as fingerprint, I think Rabin fingerprint is a more proper choice. The chunk is a large block of text in the document and a window highlight a small portion in a chunk.IIRC, the sliding windows algorithm works like this:

1. The text file is chunked at first;
2. For each chunk, you slide the window (a 15-char block in your running case) and compute their fingerprint for each window of text;
3. You now have the fingerprint of the chunk, whose length is proportional to the length of chunk.

Sliding Window Protocol Program

The next is how you use the fingerprint to compute the similarity between different documents, which is out of my knowledge. Could you please give us the pointer to the article you referred in the OP. As an exchange, I recommend you this paper, which introduce a variance of sliding window algorithm to compute document similarity.

Another application you can refer to is rsync, which is a data synchronisation tool with block-level (corresponding to your chunk) deduplication. See this short article for how it works.

That is not a sliding window. All you have done is break up the input into disjoint chunks. An example of a sliding window would be

this program may help you. and please try to make more efficent

Not the answer you're looking for? Browse other questions tagged javaalgorithm or ask your own question.

Program For Sliding Window Protocol In Java