On the domatic number of interval graphs
Information Processing Letters
Finding a minimum independent dominating set in a permutation graph
Discrete Applied Mathematics
Linear algorithm for domatic number problem on interval graphs
Information Processing Letters
The domatic number problem interval graphs
SIAM Journal on Discrete Mathematics
The weighted perfect domination problem
Information Processing Letters
On approximating the minimum independent dominating set
Information Processing Letters
A Study on r-Configurations---A Resource Assignment Problem on Graphs
SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
How to provide continuous services by mobile servers in communication networks
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Vertex domination in dynamic networks
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
| Hi-index | 0.00 |
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 host computers, and assume that a user host can receive the service if at least one adjacent host computer (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 with n hosts, ⌈(n+1)/2⌉ mobile servers are necessary and sufficient to realize continuous services by the mobile servers, and for the class of Hamiltonian graphs with n hosts, ⌈(n+1)/3⌉ mobile servers are necessary and sufficient.