Uniform Page Migration Problem in Euclidean Space
Division of Electrical Engineering and Computer Science, Kanazawa University, Kanazawa 920-1192, Japan
Author to whom correspondence should be addressed.
Academic Editor: Dimitris Fotakis
Received: 16 June 2016 / Revised: 16 August 2016 / Accepted: 18 August 2016 / Published: 23 August 2016
The page migration problem in Euclidean space is revisited. In this problem, online requests occur at any location to access a single page located at a server. Every request must be served, and the server has the choice to migrate from its current location to a new location in space. Each service costs the Euclidean distance between the server and request. A migration costs the distance between the former and the new server location, multiplied by the page size. We study the problem in the uniform model, in which the page has size
. All request locations are not known in advance; however, they are sequentially presented in an online fashion. We design a
-competitive online algorithm that improves the current best upper bound for the problem with the unit page size. We also provide a lower bound of
for our algorithm. It was already known that 2.5 is a lower bound for this problem.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Khorramian, A.; Matsubayashi, A. Uniform Page Migration Problem in Euclidean Space. Algorithms 2016, 9, 57.
Khorramian A, Matsubayashi A. Uniform Page Migration Problem in Euclidean Space. Algorithms. 2016; 9(3):57.
Khorramian, Amanj; Matsubayashi, Akira. 2016. "Uniform Page Migration Problem in Euclidean Space." Algorithms 9, no. 3: 57.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.