How to provide continuous services by mobile servers in communication networks

Authors:
Satoshi Fujita;Yue Liang
Affiliations:
Department of Information Engineering, Graduate School of Engineering, Hiroshima University;Department of Information Engineering, Graduate School of Engineering, Hiroshima University
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 1
Cited 2

A Study on r-Configurations---A Resource Assignment Problem on Graphs

SIAM Journal on Discrete Mathematics

Vertex domination in dynamic networks

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
A tight bound on the number of mobile servers to guarantee the mutual transferability among dominating configurations

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new framework to provide continuous services by “mobile servers” in interconnection networks. In particular, we prove that for the classes of ring networks with n vertices, ⌈(n + 1) / 3⌉ mobile servers are necessary and sufficient to realize mutual transfers among configurations dominating the network, where transfer between two dominating configurations is realized by moving the role of dominating vertex from a vertex to an adjacent vertex.