Performance Evaluation of Novel Dynamic Data Replication Algorithm under Optical Burst Switching

Abstract

Abstract The database replication mechanism ensures the duplication of data from one geographical location to another. In recent past, PDDRA (pre-fetching-based dynamic data replication algorithm) is investigated heavily under various classes of request arrivals. The request arriving at a particular server for replication depends on many factors such as bandwidth supported by link, its geographical location and routing algorithms. The number of served requests depends on the processing speed and buffering capacity of a particular server. If a request cannot be served at the server, it is dropped. If a bunch of requests arrive at a server, then traffic modelled as bursty traffic. The objective of this paper is to investigate the performance of dynamic replication algorithm under bursty request arrival. In a similar context, a mathematical model is detailed for the estimation of request burst length, such that both buffering capacity and transmission delay can be kept minimal. Finally, simulation results are present to evaluate the fraction of successful request under diverse conditions.