A Service Replic Distribution Scheme Based on Group Structure

DOI

10.2991/jcis.2008.110How to use a DOI?

Abstract

How to effectively distribute service replicas to its n nodes is of much importance in distributed and parallel systems. In many cases, the service replicas are randomly placed, and some service replicas have no relation to any nodes in which they are. So these service replicas are very difficultly accessed, and the flexibility of the system is poor. This paper presents such a novel service replicas distribution scheme. Instead of traditional method, this scheme is mainly based on the group structure that makes every node relate to the characteristics of the service replicas. The proposed scheme is very flexible to change the structures of the service applications. So the scheme can be employed to many scenarios where service replicas are needed.

Copyright

© 2008, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yang Wangli
AU  - Wang Huiying
PY  - 2008/12
DA  - 2008/12
TI  - A Service Replic Distribution Scheme Based on Group Structure
BT  - Proceedings of the 11th Joint Conference on Information Sciences (JCIS 2008)
PB  - Atlantis Press
SP  - 655
EP  - 660
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2008.110
DO  - 10.2991/jcis.2008.110
ID  - Wangli2008/12
ER  -