A domain-based query routing mechanism for peer-to-peer networks
In recent years, peer-to-peer (P2P) technology is widely used and concerned by both academic and industry. An important challenge associated with this technology is the routing of content-based queries (i.e. locating the peers that can provide the answer) in P2P networks that contain large number of...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2011
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/43018/ http://psasir.upm.edu.my/id/eprint/43018/1/A%20Domain-based%20query%20routing%20mechanism%20for%20peer-to-peer%20networks.pdf |
| _version_ | 1848850116090265600 |
|---|---|
| author | Hassan, Ghada Ibrahim, Hamidah Sulaiman, Md. Nasir Yakob, Rasali |
| author_facet | Hassan, Ghada Ibrahim, Hamidah Sulaiman, Md. Nasir Yakob, Rasali |
| author_sort | Hassan, Ghada |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | In recent years, peer-to-peer (P2P) technology is widely used and concerned by both academic and industry. An important challenge associated with this technology is the routing of content-based queries (i.e. locating the peers that can provide the answer) in P2P networks that contain large number of heterogeneous nodes. This challenge is mainly due to the decentralized distribution of the content among the large number of peers. To cope with this challenge, the proposed mechanisms have their own weaknesses to be a successful solution, since they suffer from high values for both number of messages per query and the response time. In this paper, we propose a new query routing mechanism to improve query routing performance in such P2P networks. The fundamental idea in the proposed mechanism is to limit the search space to a given query around the related peers. Therefore, the mechanism consists of a domain based architecture for grouping peers in the network into domains based on their contents. In each domain, interconnected groups of peers are constructed based on attributes analysis process. To perform the query routing, the mechanism provides the required methods for specifying the interaction between the peers in the same or
different groups. To validate our mechanism, an experimental study is conducted to compare the performance of the proposed mechanism with a baseline mechanism. The results show that the proposed mechanism achieves better performance with respect to the reduction of the average number of messages per query, the average search path length and the response time. |
| first_indexed | 2025-11-15T10:01:10Z |
| format | Article |
| id | upm-43018 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:01:10Z |
| publishDate | 2011 |
| publisher | Elsevier |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-430182016-05-03T09:32:48Z http://psasir.upm.edu.my/id/eprint/43018/ A domain-based query routing mechanism for peer-to-peer networks Hassan, Ghada Ibrahim, Hamidah Sulaiman, Md. Nasir Yakob, Rasali In recent years, peer-to-peer (P2P) technology is widely used and concerned by both academic and industry. An important challenge associated with this technology is the routing of content-based queries (i.e. locating the peers that can provide the answer) in P2P networks that contain large number of heterogeneous nodes. This challenge is mainly due to the decentralized distribution of the content among the large number of peers. To cope with this challenge, the proposed mechanisms have their own weaknesses to be a successful solution, since they suffer from high values for both number of messages per query and the response time. In this paper, we propose a new query routing mechanism to improve query routing performance in such P2P networks. The fundamental idea in the proposed mechanism is to limit the search space to a given query around the related peers. Therefore, the mechanism consists of a domain based architecture for grouping peers in the network into domains based on their contents. In each domain, interconnected groups of peers are constructed based on attributes analysis process. To perform the query routing, the mechanism provides the required methods for specifying the interaction between the peers in the same or different groups. To validate our mechanism, an experimental study is conducted to compare the performance of the proposed mechanism with a baseline mechanism. The results show that the proposed mechanism achieves better performance with respect to the reduction of the average number of messages per query, the average search path length and the response time. Elsevier 2011 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/43018/1/A%20Domain-based%20query%20routing%20mechanism%20for%20peer-to-peer%20networks.pdf Hassan, Ghada and Ibrahim, Hamidah and Sulaiman, Md. Nasir and Yakob, Rasali (2011) A domain-based query routing mechanism for peer-to-peer networks. Procedia Computer Science, 5. pp. 578-585. ISSN 1877-0509 http://www.sciencedirect.com/science/article/pii/S1877050911004005 10.1016/j.procs.2011.07.075 |
| spellingShingle | Hassan, Ghada Ibrahim, Hamidah Sulaiman, Md. Nasir Yakob, Rasali A domain-based query routing mechanism for peer-to-peer networks |
| title | A domain-based query routing mechanism for peer-to-peer
networks
|
| title_full | A domain-based query routing mechanism for peer-to-peer
networks
|
| title_fullStr | A domain-based query routing mechanism for peer-to-peer
networks
|
| title_full_unstemmed | A domain-based query routing mechanism for peer-to-peer
networks
|
| title_short | A domain-based query routing mechanism for peer-to-peer
networks
|
| title_sort | domain-based query routing mechanism for peer-to-peer
networks |
| url | http://psasir.upm.edu.my/id/eprint/43018/ http://psasir.upm.edu.my/id/eprint/43018/ http://psasir.upm.edu.my/id/eprint/43018/ http://psasir.upm.edu.my/id/eprint/43018/1/A%20Domain-based%20query%20routing%20mechanism%20for%20peer-to-peer%20networks.pdf |