Abstract

A description is given of how to determine the optimal migration policy for data items in a distributed database. A migration policy determines whether remote execution or migration is used when a remote request on a data item is initiated. A migration policy is modeled using a discrete Markov chain. The states in the Markov chain encode the history of previous requests and determine the probability distribution of the location of future requests. A modified policy iteration procedure is used to determine the optimal policy. >

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call