Modeling of two distributed schemes for data synchronization in a computer network

  • Authors:
  • Chin-Hwa Lee;R. S. Shastri

  • Affiliations:
  • -;-

  • Venue:
  • ANSS '78 Proceedings of the 11th annual symposium on Simulation
  • Year:
  • 1978

Quantified Score

Hi-index 0.01

Visualization

Abstract

In the network environment with distributed multiple-copied files a lockout mechanism is required to guarantee the data synchronization. File access requests from geographically distributed computer node have to be coordinated to maintain consistency of multiple-copied files. Network-wide semaphore scheme and hopping permit scheme are proposed in this paper to protect file access critical session among concurrent users on the networks. Simulation results using GPSS have shown slightly better average-response-time for the network-wide semaphore scheme. There is also result which shows the superior control traffic overhead of the hopping permit scheme. The most important of all from the results is the dependencies of the above two performance criteria on the computer network size.