SmoothFlood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks
Flooding search is a basic searching scheme for unstructured peer-to-peer networks. This technique produces exponentially redundant messages in each hop. Subsequent growths of redundant messages will limit system scalability and will cause unnecessary traffic in network areas. To improve this search...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2010
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/45788/ http://psasir.upm.edu.my/id/eprint/45788/1/SmoothFlood%20decreasing%20redundant%20messages%20and%20increasing%20search%20quality%20of%20service%20in%20peer-to-peer%20networks.pdf |
| _version_ | 1848850537477308416 |
|---|---|
| author | Barjini, Hassan Othman, Mohamed |
| author_facet | Barjini, Hassan Othman, Mohamed |
| author_sort | Barjini, Hassan |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Flooding search is a basic searching scheme for unstructured peer-to-peer networks. This technique produces exponentially redundant messages in each hop. Subsequent growths of redundant messages will limit system scalability and will cause unnecessary traffic in network areas. To improve this searching scheme and reduce redundant messages, this paper proposed a novel algorithm (SmoothFlood) which divides flooding scheme into two stages. In first stage algorithm follows standard flooding by the limited number of hops, but in the next stage it will choose nosy nodes in each region. These nodes maintain the data index of all clients’ nodes. This proposed algorithm extends the search quality by reducing redundant messages in each hop. Simulation results show it will decrease more than 65 percentages of redundant messages and will save up to 70 percentages of searching traffic. |
| first_indexed | 2025-11-15T10:07:52Z |
| format | Conference or Workshop Item |
| id | upm-45788 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:07:52Z |
| publishDate | 2010 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-457882020-08-07T03:00:36Z http://psasir.upm.edu.my/id/eprint/45788/ SmoothFlood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks Barjini, Hassan Othman, Mohamed Flooding search is a basic searching scheme for unstructured peer-to-peer networks. This technique produces exponentially redundant messages in each hop. Subsequent growths of redundant messages will limit system scalability and will cause unnecessary traffic in network areas. To improve this searching scheme and reduce redundant messages, this paper proposed a novel algorithm (SmoothFlood) which divides flooding scheme into two stages. In first stage algorithm follows standard flooding by the limited number of hops, but in the next stage it will choose nosy nodes in each region. These nodes maintain the data index of all clients’ nodes. This proposed algorithm extends the search quality by reducing redundant messages in each hop. Simulation results show it will decrease more than 65 percentages of redundant messages and will save up to 70 percentages of searching traffic. IEEE 2010 Conference or Workshop Item PeerReviewed text en http://psasir.upm.edu.my/id/eprint/45788/1/SmoothFlood%20decreasing%20redundant%20messages%20and%20increasing%20search%20quality%20of%20service%20in%20peer-to-peer%20networks.pdf Barjini, Hassan and Othman, Mohamed (2010) SmoothFlood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks. In: 2010 International Conference on Information Retrieval and Knowledge Management (CAMP'10), 17-18 Mar. 2010, Shah Alam Convention Centre, Shah Alam. (pp. 138-142). 10.1109/INFRKM.2010.5466930 |
| spellingShingle | Barjini, Hassan Othman, Mohamed SmoothFlood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks |
| title | SmoothFlood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks |
| title_full | SmoothFlood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks |
| title_fullStr | SmoothFlood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks |
| title_full_unstemmed | SmoothFlood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks |
| title_short | SmoothFlood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks |
| title_sort | smoothflood: decreasing redundant messages and increasing search quality of service in peer-to-peer networks |
| url | http://psasir.upm.edu.my/id/eprint/45788/ http://psasir.upm.edu.my/id/eprint/45788/ http://psasir.upm.edu.my/id/eprint/45788/1/SmoothFlood%20decreasing%20redundant%20messages%20and%20increasing%20search%20quality%20of%20service%20in%20peer-to-peer%20networks.pdf |