Abstract
In many distributed applications, each participating node can be characterized by one single set of attributes. The problem is to support complex queries, such as range and k-nearest-neighbor (KNN) queries, on this set of multidimensional attributes. Traditional peer-to-peer (P2P) systems either adopt an unstructured interconnection and use flooding to search for matching nodes, or implement a distributed hash table (DHT) to serve as a directory for indexing the attributes. The former suffers from excessive flooding traffic, while the latter has the overhead of updating and maintaining the directory. This paper introduces an attribute-based P2P interconnection strategy that uses the attributes to interconnect the peers instead of hash keys. Under the condition that each node is characterized by one set of attributes, the attribute-based networks can support range and KNN queries, guarantee lookup efficiency, and eliminate the need to maintain a directory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, I., Aspnes, J., Yuan, J.: Skip B-Trees. In: Proc. Ninth International Conference on Principals of Distributed Systems, pp. 284–295 (2005)
Arge, L., Eppstein, D., Goodrich, M.T.: SkipWebs: Efficient Distributed Data Structures for MultiDimensional Data Sets. In: Proc. of the Twenty-fourth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC) (2005)
Aspnes, J., Shah, G.: Skip Graphs. In: Proc. Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 384–393 (2002)
Clarke, I., et al.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Proc. Workshop on Design Issues in Anonymity and Unobservability, pp. 311–320 (2000)
Eppstein, D., Goodrich, M.T., Sun, J.Z.: The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data. In: Proc. 21st ACM Symp. On Computational Geometry (SCG) (2005)
Ganesan, P., Yang, B., Garcia-Molina, H.: One Torus to Rule Them All: Multidimensional Queries in P2P Systems. In: Proc. of the Seventh International Workshop on the Web and Databases (WebDB) (2004)
Harvey, N.J.A., et al.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: Proc. of the Fourth USENIX Symposium on Internet Technologies and Systems (USITS) (2003)
Ratnasamy, S., et al.: A Scalable Content-Addressable Network. In: Proc. ACM Symposium on Communications Architectures and Protocols (SIGCOMM), pp. 161–172 (2001)
Rhea, S., et al.: Handling Churn in a DHT. In: Proc. 2004 USENIX Technical Conference (2004)
Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 161–172. Springer, Heidelberg (2001)
Stoica, I., et al.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proc. of the International Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 149–160 (2001)
Napster, http://www.napster.com/
Gnutella, http://www.gnutella.com/
Tang, C., Xu, Z., Mahalingam, M.: pSearch: Information Retrieval in Structured Overlays. ACM SIGCOMM Computer Communication Review, 89–94 (2003)
Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: Supporting Scalable Multi-Attribute Range Queries. In: Proc. ACM Symposium on Communications Architectures and Protocols (SIGCOMM) (2004)
Schmidt, C., Parashar, M.: Flexible Information Discovery in Decentralized Distributed Systems. In: Proc. HPDC (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Chen, HC., King, CT. (2007). SONMAS: A Structured Overlay Network for Multidimensional Attribute Space. In: Cérin, C., Li, KC. (eds) Advances in Grid and Pervasive Computing. GPC 2007. Lecture Notes in Computer Science, vol 4459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72360-8_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-72360-8_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72359-2
Online ISBN: 978-3-540-72360-8
eBook Packages: Computer ScienceComputer Science (R0)