On an efficient computational resource scheduling for prioritized multiple target contents searching in large-scale networks

This paper proposes an efficient scheme of computational resource scheduling for target contents searching in large-scale networks, in the case where a user requests prioritized multiple content items. In this scheme, a limited number of available resources are selected for the searching taking account of a content´s existence probability, processing capacity, bandwidth and so on, and assigned to each information source to be searched. Computer simulations evaluate the effectiveness of the scheme, and the results show that the scheme achieves lower searching cost, which is calculated taking into account searching priority, than any other schemes for comparison, especially in the case of a lot of searching requests at the same time.