Loading...

Real-time k-Server with Lookahead

Fayaz-Bakhsh, Mojtaba | 2021

256 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 54515 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Abam, Mohammad Ali
  7. Abstract:
  8. In a real-time routing problem, a sequence of requests emerge overtime in a metric and should be served by $k$ moving agents (i.e. the servers) in order to minimize a certain cost function. If the cost function is the average of completion time of the requests, the problem is named \textit{online $k$-traveling repairman problem}. An online algorithm with lookahead would be aware about next arising requests in a specific time-window. We present deterministic and randomized algorithms with competitive ratios $5.829-\delta$ and $3.873-\delta$ against and oblivious adversary, where $\delta$ depends on server's lookahead, specification of metric and last request's release time. We the show without new restrictions, it is impossible to provide a competitive algorithm with respect to a cost function that guarantees quality of service and prohibition of increased latencies in serving requests overtime. Finally, we suggest adding fuel limit to the problem and do preliminary investigations
  9. Keywords:
  10. Real Time ; Forecasting ; Online Routing ; k-Server ; Online Traveling Repairman Problem

 Digital Object List