Analysis of impact of network delay on multiversion conservative timestamp algorithms in DDBS

  • Ren J
  • Takahashi Y
  • Hasegawa T
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 9

    Citations

    Citations of this article.

Abstract

In a distributed environment, users access databases in remote sites via a communication network. The randomness of the network delay may cause operations to arrive at the remote sites out of sequence. Multiversion conservative timestamp algorithms can be used to schedule the operations to maintain the consistency of the databases. We model the algorithms as queueing systems with partial order resequencing constraints, where the resequencing constraints vary as the number of versions in the algorithms. Under the assumption of an iid network delay, the distributions of the response time of operations and the buffer occupancy in the resequencing buffer are derived analytically for the algorithms with version number one to infinity. The impact of the network delay on the performance of the DDBS is investigated. It is found that the variance of the network delay has significant effect on the system performance.

Author-supplied keywords

  • Concurrency control
  • Database
  • Multiversion technique
  • Partial order resequencing
  • Performance analysis
  • Resequence
  • Schedule
  • Timestamp algorithm

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Jing Fei Ren

  • Yutaka Takahashi

  • Toshiharu Hasegawa

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free