Welcome to the InfoSci Platform
Scalable Index and Data Management for Unstructured Peer-to-Peer Networks

Scalable Index and Data Management for Unstructured Peer-to-Peer Networks

Shang-Feng Chiang, Kuo Chiang, Ruo-Jian Yu, Sheng-De Wang
Copyright: © 2010 |Pages: 17
ISBN13: 9781605666617|ISBN10: 1605666610|EISBN13: 9781605666624
DOI: 10.4018/978-1-60566-661-7.ch006
Cite Chapter Cite Chapter

MLA

Chiang, Shang-Feng, et al. "Scalable Index and Data Management for Unstructured Peer-to-Peer Networks." Handbook of Research on Scalable Computing Technologies, edited by Kuan-Ching Li, et al., IGI Global, 2010, pp. 123-139. https://doi.org/10.4018/978-1-60566-661-7.ch006

APA

Chiang, S., Chiang, K., Yu, R., & Wang, S. (2010). Scalable Index and Data Management for Unstructured Peer-to-Peer Networks. In K. Li, C. Hsu, L. Yang, J. Dongarra, & H. Zima (Eds.), Handbook of Research on Scalable Computing Technologies (pp. 123-139). IGI Global. https://doi.org/10.4018/978-1-60566-661-7.ch006

Chicago

Chiang, Shang-Feng, et al. "Scalable Index and Data Management for Unstructured Peer-to-Peer Networks." In Handbook of Research on Scalable Computing Technologies, edited by Kuan-Ching Li, et al., 123-139. Hershey, PA: IGI Global, 2010. https://doi.org/10.4018/978-1-60566-661-7.ch006

Export Reference

Mendeley
Favorite

Abstract

In order to improve the scalability and reduce the traffic of Gnutella-like unstructured peer-to-peer networks, index caching and controlled flooding mechanisms had been an important research topic in recent years. In this chapter the authors will describe and present the current state of the art about index management schemes, interest groups and data clustering for unstructured peer-to-peer networks. Index caching mechanisms are an approach to reducing the traffic of keyword querying. However, the cached indices may incur redundant replications in the whole network, leading to the less efficient use of storage and the increase of traffic. They propose a multiplayer index management scheme that actively diffuses the indices in the network and groups indices according to their request rate. The peers of the group that have indices with higher request rate will be placed in layers that receive queries earlier. Their simulation shows that the proposed approach can keep a high success query rate as well as reduce the flooding size.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.