Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/783
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorWang, G-
dc.creatorCao, J-
dc.creatorChan, KCC-
dc.date.accessioned2014-12-11T08:28:44Z-
dc.date.available2014-12-11T08:28:44Z-
dc.identifier.isbn0-7695-2197-5-
dc.identifier.issn0190-3918-
dc.identifier.urihttp://hdl.handle.net/10397/783-
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.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.en_US
dc.rightsThis 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.en_US
dc.subjectDatabase systemsen_US
dc.subjectFormal logicen_US
dc.subjectHierarchical systemsen_US
dc.subjectLocal area networksen_US
dc.subjectMembership functionsen_US
dc.subjectNetwork protocolsen_US
dc.subjectProbabilityen_US
dc.subjectQuality of serviceen_US
dc.subjectRoutersen_US
dc.titleRGB : a scalable and reliable group membership protocol in mobile Interneten_US
dc.typeConference Paperen_US
dcterms.abstractWe 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationProceedings of the 2004 International Conference on Parallel Processing : 15-18 August 2004, Montreal, Quebec, Canada, [p. 1-8]-
dcterms.issued2004-
dc.identifier.isiWOS:000223861500039-
dc.identifier.scopus2-s2.0-10044228400-
dc.identifier.rosgroupidr23752-
dc.description.ros2004-2005 > Academic research: refereed > Refereed conference paper-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryVoR alloweden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
scalable-reliable_04.pdf247.23 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

130
Last Week
1
Last month
Citations as of Jul 14, 2024

Downloads

205
Citations as of Jul 14, 2024

SCOPUSTM   
Citations

6
Last Week
0
Last month
0
Citations as of Jun 21, 2024

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Jun 27, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.