Abstract
Large number of peer processes are cooperating in peer-to-peer systems. In this paper, we discuss a hierarchical group protocol aiming at reducing communication and computation overheads for a scalable group of peer processes. A hierarchical group is composed of subgroups each of which is furthermore composed of subgroups. Even if messages are causally ordered in one subgroup, the messages may not be required to be causally ordered in a whole group. We discuss how to globally causally order messages by ordering mechanisms in each subgroup.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
