earticle

논문검색

Computational Nodes Location using Spatial Points Clustering in P2P Network System

초록

영어

In order to implement big data access and process with high efficiency, an algorithm of nodes location was proposed according to the state of computable resources. In this paper, we first describe and map the computational resource with javascript object notation(JSON) in P2P network system. Regarding the computational nodes as spatial points, then we present a generalized euclid distance(GED) model using the method of spatial points clustering. Through this model, the computational nodes can partition into multiple sub-group upon the characteristic attributes. After that, we calculate the spatial distance and attribute distance by spatial geometric model of global network positioning(GNP), ultimately implement the computable nodes location with efficiency, to provide the basis of load balance, especially in cloud computing. Experimental results show that our method not only can significantly improve system performance, also in accuracy of nodes location.

목차

Abstract
 1. Introduction
 2. Description for Computable Resources by JSON
 3. Querying Algorithm for Computable Resource in P2P System
  3.1. Bitmap index & Spanning-Tree Generation
  3.2. Querying Algorithm for Computable Resource
 4. Algorithm of Spatial Points Clustering on Computational node Location
  4.1. Generalized Euclid Distance
  4.2. Algorithm of Computable Nodes Location
 5. Simulation and Experiments
 6. Related Work
 7. Conclusion and Future Work
 Acknowledgements
 References

저자정보

  • Zhi Zeng Department of Computer Science, Huizhou University, Huizhou 516007, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.