The week's pick
Reseach Article
A Class based Piece Selection for Multi-Dimensional Aggregated Data Distribution in Peer to Peer Network
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 57 - Number 12 |
| Year of Publication: 2012 |
| Authors: N. T. Renukadevi, P. Thangaraj |
10.5120/9165-3557
|
N. T. Renukadevi, P. Thangaraj . A Class based Piece Selection for Multi-Dimensional Aggregated Data Distribution in Peer to Peer Network. International Journal of Computer Applications. 57, 12 ( November 2012), 9-12. DOI=10.5120/9165-3557
Abstract
A peer-to-peer (P2P) is a distributed application architecture, where each computer (node) in the net acts as a client/ server for the other nodes in the network. It allows sharing right to different sources and partitions tasks or workloads among peers. All the peers are equally privileged participants in the application. The searching performance, query expressivity, multi-dimensional distributed indexing are the emerging aspects of P2P. Its popularity is due to its scalability and distribution of large files efficiently without undue pressure on the origin server. In this work, it is proposed to investigate the performance of P2P networking when used to store multidimensional compressed aggregated data which can be used to download required data based on the query rather than downloading the entire database. For real-time query from users the specific pieces should be downloaded based on the query. To achieve this goal, it is critical to efficiently schedule the order in which pieces of the desired data are downloaded. Simply downloading pieces in sequential (earliest-first) order is prone to bottlenecks. Consequently it is proposed to implement aggregated class based scheduling ensuring high piece diversity while at the same time prioritizing pieces needed to maintain uninterrupted download based on query
References
- Moro, G. & Ouksel, A. M. (2003), G-Grid: A class of scalable and self-organizing data structures for multi-dimensional querying and content routing in p2p networks, in Proceedings of Agents and Peer-to-Peer Computing, Melbourne, Australia', Vol. 2872, pp. 123{137
- Milojicic, D. S. , Kalogeraki, V. , Lukose, R. , Nagaraja, K. , Pruyne, J. , Richard, B. , Rollins, S. & Xu, Z. (2002), Peer-to-peer computing, Technical Report HPL-2002-57, HP Lab.
- E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim. A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys and Tutorials, 7(2):72{93, 2005.
- D. Boukhelef and H. Kitagawa. Dynamic load balancing in RCAN content addressable network. In ICUIMC, pages 98{106, 2009.
- G. Giakkoupis and V. Hadzilacos. A scheme for load balancing in heterogenous distributed hash tables. In PODC, pages 302{311, 2005.
- K. Kenthapadi and G. S. Manku. Decentralized algorithms using both local and random probes for p2p load balancing. In SPAA, pages 135{144, 2005.
- S. Blanas and V. Samoladas. Contention-based performance evaluation of multidimensional range search in p2p networks. In InfoScale'07, pages 1–8, 2007.
- Minqi Zhou, Weining Qian, Xueqing Gang, Aoying Zhou, Multi-dimensional data density estimation in P2P networks, Distributed And Parallel Databases 26 (2–3) (2009) 261–289.
- Kantere, V. , Skiadopoulos, S. , Sellis, T. : Storing and Indexing Spatial Data in P2P Systems. IEEE Transactions on Knowledge and Data Engineering (to appear).
- C. Doulkeridis, A. Vlachou, K. Nørvag, Y. Kotidis, and M. Vazirgiannis, "Multidimensional routing indices for ef?cient distributed query processing," in CIKM, 2009, pp. 1489–1492
Index Terms
Keywords