A gossip-based protocol to reach consensus via uninorm aggregation operator

Authors:
Qiaoli Huang;Shiqun Yin;Zhixing Huang
Affiliations:
Faculty of Computer and Information Science, Southwest University, Chongqing, China;Faculty of Computer and Information Science, Southwest University, Chongqing, China;Faculty of Computer and Information Science, Southwest University, Chongqing, China
Venue:
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Year:
2008

Citing 12
Cited 0

Uninorm aggregation operators

Fuzzy Sets and Systems
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Peer-to-Peer Membership Management for Gossip-Based Protocols

IEEE Transactions on Computers
Probabilistic Reliable Dissemination in Large-Scale Systems

IEEE Transactions on Parallel and Distributed Systems
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Gossip-based aggregation in large dynamic networks

ACM Transactions on Computer Systems (TOCS)
Efficient gossip and robust distributed computation

Theoretical Computer Science
Robust gossiping with an application to consensus

Journal of Computer and System Sciences
A spectrum of compromise aggregation operators for multi-attribute decision making

Artificial Intelligence
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing

IEEE Transactions on Parallel and Distributed Systems
Gossip-based aggregation of trust in decentralized reputation systems

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A gossip-style failure detection service

Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gossip-based protocols for group communication have attractive scalability and reliability properties. This study presents a gossipbased protocol based on an uninorm aggregation operator, which enables agents to reach a consensus. The convergence, speed and randomness characteristics of this protocol are theoretically analyzed. The experimental results showed that this protocol is efficient, scalable and resilient against the failures under various network topologies. It indicated that this model can be used to interpret the uncertainty and the fast convergence characteristics of collective decision dynamics.