A tight bound on the number of mobile servers to guarantee transferability among dominating configurations

  • Authors:

  • Satoshi Fujita

  • Affiliations:

  • Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739-8527, Japan

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2010

Quantified Score

Hi-index 0.04

Visualization

Abstract

In this paper, we propose a new framework to provide continuous services to users by a collection of mobile servers distributed over an interconnection network. We model those mobile servers as a subset of nodes, and assume that a user can receive the service if at least one adjacent node (including itself) plays the role of a server; i.e., we assume that the service could not be routed via the interconnection network. The main results obtained in this paper are summarized as follows: For the class of trees consisting of n nodes, @?n/2@? mobile servers are sometimes necessary and always sufficient to realize continuous services by the mobile servers, and for the class of Hamiltonian graphs with n nodes, @?(n+1)/3@? mobile servers are sometimes necessary and always sufficient.