Title of article
A tight bound on the number of mobile servers to guarantee transferability among dominating configurations Original Research Article
Author/Authors
Satoshi Fujita، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
913
To page
920
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
Keywords
Mobile servers , Peer-to-peer system , Hamiltonian graph , Dominating set , Transferability
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887406
Link To Document