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

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.

References

1. Clip2. The gnutella protocol specification, 2001.
2. P. T. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, and A.-M. Kermarrec. Lightweight probabilistic broadcast. ACM Trans. Comput. Syst., 21(4):341--374, 2003.
3. P. T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulieacute;. Epidemic information dissemination in distributed systems. Computer, 37(5):60--67, 2004.
4. I. Gupta, R. van Renesse, and K. P. Birman. Scalable fault-tolerant aggregation in large process groups. In DSN '01: Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS), pages 433--442, Washington, DC, USA, 2001. IEEE Computer Society.
5. Q. Han, M. B. Nguyen, S. Irani, and N. Venkatasubramanian. Time-sensitive computation of aggregate functions over distributed imprecise data. ipdps, 03:118b, 2004.
6. A. Iamnitchi and I. Foster. A peer-to-peer approach to resource location in grid environments. Grid resource management: state of the art and future trends, pages 413--429, 2004.
7. M. Jelasity, W. Kowalczyk, and M. van Steen. An approach to massively distributed aggregate computing on peer-to-peer networks. PDP'04: 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 00:200--207, 2004.
8. M. Jelasity and A. Montresor. Epidemic-style proactive aggregation in large overlay networks. In ICDCS '04: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04), pages 102--109, Washington, DC, USA, 2004. IEEE Computer Society.
9. S. Kashyap, S. Deb, K. V. M. Naidu, R. Rastogi, and A. Srinivasan. Efficient gossip-based aggregate computation. In PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of distributed systems, pages 308--317, New York, NY, USA, 2006. ACM.
10. S. Kashyap, S. Deb, K. V. M. Naidu, R. Rastogi, and A. Srinivasan. Efficient gossip-based aggregate computation. In PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of distributed systems, pages 308--317, New York, NY, USA, 2006. ACM.
11. R. V. Renesse, K. P. Birman, and W. Vogels. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Comput. Syst., 21(2):164--206, 2003.
12. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149--160, 2001.
13. D. Talia and P. Trunfio. A p2p grid services-based protocol: Design and evaluation. In Proc. of the European Conference on Parallel Computing (EuroPar 2004), volume 3149 of LNCS, pages 1022--1031, Pisa, Italy, September 2004. Springer-Verlag.

Index Terms

• Networks

  • Network protocols