This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Scalable P2P Platform for the Knowledge Grid
December 2005 (vol. 17 no. 12)
pp. 1721-1736
The Knowledge Grid needs to operate with a scalable platform to provide large-scale intelligent services. A key function of such a platform is to efficiently support various complex queries in a dynamic large-scale network environment. This paper proposes a platform to support index-based path queries by incorporating a semantic overlay with an underlying structured P2P network that provides object location and management services. Various distributed indexing structures can be dynamically formed by publishing semantic objects as indexing nodes. Queries are forwarded along the chains of semantic object pointers to search for objects. We investigate the deployment of a scalable distributed trie index for broadcast queries on key strings, propose a decentralized load balancing method for solving the problem of uneven load distribution incurred by heterogeneity of loads and node capacities and by the distributed trie index, and give an approach for improving the availability of the semantic overlay and its trie index. Experiments demonstrate the scalability of the proposed platform.

[1] K. Aberer, “P-Grid: A Self-Organizing Access Structure for P2P Information Systems,” Proc. Ninth Int'l Conf. Cooperative Information Systems, vol. 2172, pp. 179-194, 2001.
[2] W. Litwin, M.A. Neimat, and D. Schneider, “LH*— A Scalable Distributed Data Structure,” ACM Trans. Database Systems, vol. 21, no. 4, pp. 480-525, 1996.
[3] H. Balakrishnan, M. Frans Kaashoek, D. Karger, R. Morris, and I. Stoica, “Looking Up Data in P2P Systems,” Comm. ACM, vol. 46, no. 2, pp. 43-48, 2003.
[4] A. Crespo and H. Garcia-Molina, “Semantic Overlay Networks for P2P Systems,” technical reports, http://www-db.stanford.edu/~crespopublications /, 2003.
[5] A. Crespo and H. Garcia-Molina, “Routing Indices for Peer-to-Peer Systems,” Proc. 28th Int'l Conf. Distributed Computing Systems, pp. 23-32, July 2002.
[6] A. Crainiceanu, P. Linga, J. Gehrke, and J. Shanmugasundaram, “Querying Peer-to-Peer Networks Using P-Trees,” Proc. Seventh Int'l Workshop Web and Databases: Colocated with ACM SIGMOD/PODS2004, pp. 25-30, 2004.
[7] F. Dabek, M. Frans Kaashoek, D. Karger, R. Morris, and I. Stoica, “Wide-Area Cooperative Storage with CFS,” Proc. 18th ACM Symp. Operating Systems Principles (SOSP' 01), pp. 202-215, Oct. 2001.
[8] S. El-Ansary, L.O. Alima, P. Brand, and S. Haridi, “Efficient Broadcast in Structured P2P Networks,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), pp. 304-314, 2003.
[9] M.J. Freedman and R. Vingralek, “Efficient Peer-to-Peer Lookup Based on a Distributed Trie,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), pp. 66-75, Mar. 2002.
[10] P. Ganesan, M. Bawa, and H. Garcia-Molina, “Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems,” Proc. Very Large Data Bases Conf., pp. 444-455, 2004.
[11] L. Garcés, P.A. Felber, E.W. Biersack, G. Urvoy-Keller, and K.W. Ross, “Data Indexing in Peer-to-Peer DHT Networks,” Proc. 24th Int'l Conf. Distributed Computing Systems, pp. 200-208, Mar. 2004.
[12] B. Gedik and L. Liu, “PeerCQ: A Decentralized and Self-Configuring Peer-to-Peer Information Monitoring System,” Proc. 23rd Int'l Conf. Distributed Computing Systems, pp. 490-499, May 2003.
[13] B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Dynamic Structured P2P Systems,” Proc. IEEE INFOCOM Conf., vol. 4, pp. 2253-2262, Mar. 2004.
[14] M. Harren and J.M. Hellerstein, “Complex Queries in DHT-Based Peer-to-Peer Networks,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), pp. 242-259, Mar. 2002.
[15] N.J.A. Harvey, M. Jones, S. Saroiu, M. Theimer, and A. Wolman, “SkipNet: A Scalable Overlay Network with Practical Locality Properties,” Proc. Fourth USENIX Symp. Internet Technologies and Systems (USITS '03), pp. 113-126, Mar. 2003.
[16] M.F. Kaashoek and D.R. Karger, “Koorde: A Simple Degree-Optimal Distributed Hash Table,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), F. Kaashoek and I. Stoica, eds., pp. 98-107, 2003.
[17] A. Kementsietsidis, M. Arenas, and R.J. Miller, “Mapping Data in Peer to Peer Systems: Semantics and Algorithmic Issues,” Proc. ACM SIGMOD Conf., pp. 325-336, June 2003.
[18] D.E. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching, second ed. Addison-Wesley, 1973.
[19] A. Kothari, D. Agrawal, A. Gupta, and S. Suri, “Range Addressable Network: A P2P Cache Architecture for Data Ranges,” Proc. Third Int'l Conf. Peer-to-Peer Computing, pp. 14-22, Sept. 2003.
[20] B. Kröll and P. Widmayer, “Distributing a Search Tree Among a Growing Number of Processors,” ACM SIGMOD Record, vol. 23, no. 2, pp. 265-276, June 1994.
[21] J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao, “OceanStore: An Architecture for Global-Scale Persistent Storage,” Proc. Int'l Conf. Architectural Support for Programming Languages and Operating Systems, pp. 190-201, Nov. 2000.
[22] G. Li, “Project JXTA: A Technology Overview,” Sun Microsystems, Inc., http:/www.jxta.org, 2002.
[23] W. Litwin, M. Neimat, and D.A Schneider, “RP*: A Family of Order Preserving Scalable Distributed Data Structures,” Proc. 20th Int'l Conf. Very Large Data Bases (VLDB94), pp. 342-353, Sept. 1994.
[24] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. 16th Int'l Conf. Supercomputing, pp. 84-95, June 2002.
[25] X. Qian and Q. Yang, “Load Balancing on Generalized Hypercube and Mesh Multiprocessors with LAL,” Proc. 11th Int'l Conf. Distributed Computing System, pp. 402-409, May 1991.
[26] A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Structured P2P System,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), F. Kaashoek and I. Stoica, eds., pp. 119-128, 2003.
[27] A. Rowstron and P. Druschel, “Storage Management and Caching in PAST, A Large-Scale, Persistent Peer-to-Peer Storage Utility,” ACM SIGOPS Operating Systems Rev., vol. 35, no. 5, pp. 188-201, 2001.
[28] H.T. Shen, Y. Shu, and B. Yu, “Efficient Semantic-Based Content Search in P2P Network,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 7, pp. 813-826, Aug. 2004.
[29] M. Singhal, “Deadlock Detection in Distributed Systems,” Computer, vol. 22, no. 11, pp. 37-48, Nov. 1989.
[30] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM Conf., pp. 149-160, Aug. 2001.
[31] S. Voulgaris, A. Kermarrec, L. Massoulié, and M.V. Steen, “Exploiting Semantic Proximity in Peer-to-Peer Content Searching,” Proc. 10th IEEE Int'l Workshop Future Trends of Distributed Computing Systems, pp. 238-243, May 2004.
[32] C. Xu, B. Monien, R. Lüling, and F.C.M. Lau, “Nearest Neighbor Algorithms for Load Balancing in Parallel Computers,” Concurrency: Practice and Experience, vol. 7, no. 7, pp. 707-736, 1995.
[33] C. Xu and F.C.M. Lau, “Iterative Dynamic Load Balancing in Multicomputers,” J. Operational Research Soc., vol. 45, no. 7, pp. 786-796, 1994.
[34] J. Xu, A. Kumar, and X. Yu, “On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 151-163, 2004.
[35] B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Networks,” Proc. 28th Int'l Conf. Distributed Computing Systems, pp. 5-14, July 2002.
[36] B. Yang and H. Garcia-Molina, “Designing a Super-Peer Network,” Proc. Int'l Conf. Data Eng. (ICDE), pp. 49-63, Mar. 2003.
[37] B.Y. Zhao, H. Ling, J. Stribling, S.C. Rhea, A.D. Joseph, J.D. Kubiatowicz, “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, 2004.
[38] Y. Zhu, H. Wang, and Y. Hu, “Integrating Semantics-Based Access Mechanisms with P2P File Systems,” Proc. Third Int'l Conf. Peer-to-Peer Computing, pp. 118-125, Sept. 2003.
[39] H. Zhuge, “China's E-Science Knowledge Grid Environment,” IEEE Intelligent System, vol. 19, no. 1, pp. 13-17, 2004.
[40] H. Zhuge, The Knowledge Grid. World Scientific, 2004.
[41] H. Zhuge, “The Future Interconnection Environment,” Computer, vol. 38, no. 4, pp. 27-33, Apr. 2005.

Index Terms:
Index Terms- Peer-to-peer, semantic overlay, knowledge grid, path query, distributed trie index, load balancing, replication.
Citation:
Hai Zhuge, Xiaoping Sun, Jie Liu, Erlin Yao, Xue Chen, "A Scalable P2P Platform for the Knowledge Grid," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 12, pp. 1721-1736, Dec. 2005, doi:10.1109/TKDE.2005.190
Usage of this product signifies your acceptance of the Terms of Use.