Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In the file migration problem,  are given a metric space X and a large object (file) of size D stored at a point of X. An input is a sequence of points that request access to this object, presented in online manner to an algorithm. Upon seeing a~requesting point r, the algorithm pays the distance beten r and the point currently storing the object and, afterwards, it may move the object to an arbitrary point of X. The cost of such movement is equal to the distance travelled by the object times the object size D. This fundamental online problem captures the tradeoffs of efficient access to shared objects in multi-access systems, such as memory pages in multiprocessor systems or databases in networks #R##N#,  construct a deterministic 4-competitive algorithm for this problem (for any metric space) beating the currently best 20-year old, 4.086-competitive MTLM algorithm by Bartal et al. (SODA 1997). Like MTLM our algorithm also operates in phases, but it adapts their lengths dynamically depending on the geometry of requests seen so far.  also show that if an online algorithm operates in phases of fixed length and the adversary is able to modify the graph beten phases, no algorithm can beat the competitive ratio of 4.086.
['Marcin Bienkowski', 'Jaroslaw Byrka', 'Marcin Mucha']
I am writing a research paper on a idea Dynamic beats fixed: On phase-based algorithms for file migration
[{"from": "human", "value": "I am writing a research paper on a idea Dynamic beats fixed: On phase-based algorithms for file migration"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In the file migration problem,  are given a metric space X and a large object (file) of size D stored at a point of X. An input is a sequence of points that request access to this object, presented in online manner to an algorithm. Upon seeing a~requesting point r, the algorithm pays the distance beten r and the point currently storing the object and, afterwards, it may move the object to an arbitrary point of X. The cost of such movement is equal to the distance travelled by the object times the object size D. This fundamental online problem captures the tradeoffs of efficient access to shared objects in multi-access systems, such as memory pages in multiprocessor systems or databases in networks #R##N#,  construct a deterministic 4-competitive algorithm for this problem (for any metric space) beating the currently best 20-year old, 4.086-competitive MTLM algorithm by Bartal et al. (SODA 1997). Like MTLM our algorithm also operates in phases, but it adapts their lengths dynamically depending on the geometry of requests seen so far.  also show that if an online algorithm operates in phases of fixed length and the adversary is able to modify the graph beten phases, no algorithm can beat the competitive ratio of 4.086."}]