Publication Type:

Conference Proceedings

Source:

2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI), IEEE, Bangalore, India, India, p. pp. 2475-2480 (2018)

URL:

https://ieeexplore.ieee.org/document/8554723

Keywords:

Clustering, Clustering algorithms, distributed databases, k-clique, Nickel, P2P network, peer-to-peer computing, Protocols, resource discovery, routing, Semantics

Abstract:

Data transfer amongst peers in a network without a central authority to regulate traffic, is on the ascendancy in the recent years. In this paper, we propose a k-clique based overlay network formation using multi key-single value pair mapping mechanism within a peer to peer network. This clique based model aims to discover resources of the same metadata type within a cluster of subnet with a minimum of hops as possible subject to the nodes having certain properties. The discovery of a subset of resources sharing similar characteristics is essential in the context of requirements being dynamic, in fields related to Internet of Things and Cloud systems. The simulated experiment validates our approach as it discovers resources in very less number of hops.

Cite this Research Publication

T. R. K. Prasad, Jayakumar P., and Dr. Sajeev G. P., “A K-Clique Based Clustering Protocol for Resource Discovery in P2P Network”, 2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI). IEEE, Bangalore, India, India, pp. pp. 2475-2480, 2018.