Data synchronization distributes data to users of various configurations, and poses many
challenges in today’s collaborative networks. In this paper, we propose a data synchronization scheme
to reduce the finish time of distributing data with the understanding that users are free to join late or
leave, which is common if the desired data is received. Our scheme involves a heuristic algorithm to
push-and-pull segments of data. The numerical results yield significant lesser finish time than the
conventional P2P approaches. Besides, there are no redundant transmissions and no need of searching
data pieces in our approach, which help to reduce the network traffic and receiving time of data.
