A Scheduling Method for Multiple Content Searching Using Dynamic Prediction of Optimum Amount of Idle Computational Resource in Large-Scale Networks
Proceedings of 2019 the 9th International Workshop on Computer Science and Engineering · 2019
This paper proposes a search scheme for mu ltip le target content items with a priority, which is 1 stored in a lot of nodes scattered in a co mmun ication network, using idle co mputational resources.In our previous study, our proposed scheme successfully reduced searching costs such as searching time and communicat ion load by defining the utilization rate of all co mputational resources as a parameter, and setting its appropriate value according to the searching environment.In this paper, we assume that the appropriate parameter is unknown, and we propose a scheme wh ich dynamically predicts optimal parameter value fro m the costs of the in itial search results, and continues to make a searching schedule with c orrecting the optimal parameter value.The effectiveness of the proposed scheme is evaluated by computer simulations.