Coordinator election using the object model in p2p networks

Authors:
Hirokazu Yoshinaga;Takeshi Tsuchiya;Keiichi Koyanagi
Affiliations:
Graduate School of Information, Production, and Systems, Waseda University, Fukuoka, Japan;Graduate School of Information, Production, and Systems, Waseda University, Fukuoka, Japan;Graduate School of Information, Production, and Systems, Waseda University, Fukuoka, Japan
Venue:
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
Year:
2004

Citing 5
Cited 1

Leader Election in the Presence of Link Failures

IEEE Transactions on Parallel and Distributed Systems
Multicast operation of the ad-hoc on-demand distance vector routing protocol

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A Highly Available Local Leader Election Service

IEEE Transactions on Software Engineering
Environment Server: A System Support for Adaptive Distributed Applications

WWCA '98 Proceedings of the Second International Conference on Worldwide Computing and Its Applications
Elections in a Distributed Computing System

IEEE Transactions on Computers

STARCast: streaming collaboration architecture on heterogeneous environment everywhere

Proceedings of the 2004 ACM workshop on Next-generation residential broadband challenges

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose the ACE (Adaptive Coordinator Election) platform that elects and relocates a coordinator adaptively in P2P networks. In collaborative applications, a coordinator mediates synchronization, consistency, sequencing and delay difference. However, it is difficult to decide a coordinator in applications used in P2P networks because of some characteristics of network, e.g., network instability, and differences in physical networks and devices for participants. The ACE platform elects and relocates a coordinator dynamically according to environmental metrics obtained from participants. Each metric has a priority and weight to allow a coordinator to be chosen according to the purpose of applications. We implemented our platform using the JXTA framework and tested it. The results show the feasibility of adaptive coordinator relocation in P2P networks.