The basic idea for deleting version entries is the following: The entry can be removed when all the file replicas versions are known to be greater than or equal to the version entry.
The version entry determines which replicas satisfy the consistency criterion. Since all the replicas satisfy the later version criterion, the entry is not required anymore. Any replica that is next accessed will yield a later version.
We use this idea to design the version information truncation algorithm. For mobile computing we can not assume that two copies will ever come in contact directly. This introduces several complications in the truncation algorithm.
