An unstructured peer-to-peer approach to aggregate node selection

Authors:
Imran Rao;Aaron Harwood;Shanika Karunasekera
Affiliations:
The University of Melbourne, Melbourne, UNK, Australia;The University of Melbourne, Melbourne, Australia;The University of Melbourne, Melbourne, Australia
Venue:
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Year:
2008

Citing 8
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable Fault-Tolerant Aggregation in Large Process Groups

DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

ACM Transactions on Computer Systems (TOCS)
Lightweight probabilistic broadcast

ACM Transactions on Computer Systems (TOCS)
A peer-to-peer approach to resource location in Grid environments

Grid resource management
Epidemic-Style Proactive Aggregation in Large Overlay Networks

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Efficient gossip-based aggregate computation

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Epidemic Information Dissemination in Distributed Systems

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

In distributed and high performance applications it it is necessary to discover the aggregate resource capabilities of the collaborating peers. Another requirement of these applications is to locate the resources meeting the given aggregate search criteria. In this paper we present an unstructured peer-to-peer approach to aggregate node selection for resource management. Our objective is to efficiently calculate the aggregate value and search the aggregate node whose attribute matches or falls in the proximity of this value. Our contribution also includes the inclusion of an explicit network for aggregate query routing. We evaluated our protocol for accuracy, efficiency and communication cost through detailed simulations.