On-line k-server problem with twin-request and its work function algorithm

On-line k-server problem with twin-request and its work function algorithm

0.00 Avg rating0 Votes
Article ID: iaor20063691
Country: China
Volume: 25
Issue: 7
Start Page Number: 98
End Page Number: 104
Publication Date: Jul 2005
Journal: Systems Engineering Theory & Practice
Authors: ,
Abstract:

In contrast to the conventional k-server problem with the assumption of only one request occurring at each step, we propose to investigate the k-server problem with multi-request for an on-line selection scheme. Firstly, we introduce and explore the nature model of k-server problem with multi-request. Our analysis further focuses on the case of twin-request, namely, at each step, two requests occur and the on-line player must choose two servers at the same time to satisfy the requests. We employ the Work Function Algorithm to solve it and give the relevant analysis and competitive ratio proof. The general cases of twin-request and multi-request are still open.

Reviews

Required fields are marked *. Your email address will not be published.