PolyU Institutional Repository >
COMP Conference Papers & Presentations >
Please use this identifier to cite or link to this item:
|Title: ||RGB : a scalable and reliable group membership protocol in mobile Internet|
|Authors: ||Wang, Guojun|
Chan, Keith C. C.
|Subjects: ||Database systems|
Local area networks
Quality of service
|Issue Date: ||2004 |
|Publisher: ||IEEE Computer Society|
|Citation: ||Proceedings of the 2004 International Conference on Parallel Processing : 15-18 August 2004, Montreal, Quebec, Canada, [p. 1-8].|
|Abstract: ||We propose a membership protocol for group communications in mobile Internet. The protocol is called RGB, which is the acronym of "a Ring-based hierarchy of access proxies, access Gateways, and Border routers". RGB runs in a parallel and distributed way in the sense that each network entity in the ring-based hierarchy maintains local information about its possible leader, previous, next, parent and child neighbors, and that each network entity independently collects/generates membership change information, which is propagated by the one-round membership algorithm concurrently running in all the logical rings. We prove that the proposed protocol is scalable in the sense that the scalability of a ring-based hierarchy is as good as that of a tree-based hierarchy. We also prove that the proposed protocol is reliable, in the sense that, with high probability of 99.500%, a ring-based hierarchy with up to 1000 access proxies attached by a large number of mobile hosts will not partition when node faulty probability is bounded by 0.1%; if at most 3 partitions are allowed, then the Function-Well probability of the hierarchy is 99.999% accordingly.|
|Rights: ||© 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Type: ||Conference Paper|
|Appears in Collections:||COMP Conference Papers & Presentations|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.