A delay optimal algorithm to locate and migrate data resources in broadband networks

  • Authors:

  • P.C Saxena;D.R Choudhury;G Gabrani

  • Affiliations:

  • School of Computer and System Sciences, Jawaharlal Nehru University, New Delhi 110067, India;Department of Computer Engineering, Delhi College of Engineering, Bawana Road, New Delhi 110042, India;Department of Computer Engineering, Delhi College of Engineering, Bawana Road, New Delhi 110042, India

  • Venue:
  • Computer Communications
  • Year:
  • 2003

Quantified Score

Hi-index 0.24

Visualization

Abstract

The dynamic migration of data resources such as databases and files has become more popular with the advent of broadband networks such as ATM, especially for transaction processing. In a system that uses data resource migration based methods for transaction processing, the data resources are migrated to the transaction initiation site before any operations are performed on them. In such an environment the location of the data resources therefore keeps on changing. Hence some mechanisms are required to first identify the exact locations of the data resources and then migrate them to the transaction initiation site. Such a system operation is referred to as locate and migrate operation and is to be dealt in a manner so that the time delay in locating the data resources is reduced. This in turn reduces the transaction processing time. In this paper, we propose a new algorithm to locate and migrate data resources that focuses on reducing the time delay to locate the migratory data resources. We evaluate the performance of the proposed algorithm and also compare it with one of the existing algorithms by simulation studies under several system parameters such as frequency of request generation, frequency of data resource migration and scale of network.