Lightweight version vectors for pervasive computing devices

Abstract

Traditional version vectors can be used to optimize peerto-peer synchronization for pervasive computing devices. However, their storage overhead may be a prohibitive factor in scalability in an environment with typically low communication bandwidth and relatively small storage memory. We present a dynamic version vector design that allows small data sizes for version vector items. We call it lightweight version vector approach (LW) and argue that a step-increase method of LW can be an effective solution for peer-to-peer synchronization of pervasive computing devices.