Statistical fixed range multiple selection algorithm for peer-to-peer system
In this research, a new multiple selection algorithm, which is known as "statistical fixed range multiple selection algorithm" is proposed. This algorithm is developed based on the statistical knowledge about the uniform distribution nature of the data which has been arranged in ascending...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2010
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/56519/ http://psasir.upm.edu.my/id/eprint/56519/1/Statistical%20fixed%20range%20multiple%20selection%20algorithm%20for%20peer-to-peer%20system.pdf |
| _version_ | 1848853106201198592 |
|---|---|
| author | Kweh, Yeah Lun Othman, Mohamed Ahmad, Fatimah Ibrahim, Hamidah |
| author_facet | Kweh, Yeah Lun Othman, Mohamed Ahmad, Fatimah Ibrahim, Hamidah |
| author_sort | Kweh, Yeah Lun |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | In this research, a new multiple selection algorithm, which is known as "statistical fixed range multiple selection algorithm" is proposed. This algorithm is developed based on the statistical knowledge about the uniform distribution nature of the data which has been arranged in ascending order in the local file. A global file with n keys is distributed evenly among p peers in the peer-to-peer network. The selection algorithm can performs multiple selections concurrently to find multiple target keys with different predefined target ranks. The algorithm uses a fixed filter range approach that has been defined before the process begin, in which the algorithm is able to make sure that the target key is within the specified filter range in each local file. The range is made smaller and smaller as the selection process iterates until all target keys are found. The algorithm is able to reduce the number of rounds needed and increase the success rate of all multiple selections in the selection process compared to the previous multiple selection algorithms proposed by Loo in 2005. |
| first_indexed | 2025-11-15T10:48:42Z |
| format | Conference or Workshop Item |
| id | upm-56519 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:48:42Z |
| publishDate | 2010 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-565192017-08-01T08:48:51Z http://psasir.upm.edu.my/id/eprint/56519/ Statistical fixed range multiple selection algorithm for peer-to-peer system Kweh, Yeah Lun Othman, Mohamed Ahmad, Fatimah Ibrahim, Hamidah In this research, a new multiple selection algorithm, which is known as "statistical fixed range multiple selection algorithm" is proposed. This algorithm is developed based on the statistical knowledge about the uniform distribution nature of the data which has been arranged in ascending order in the local file. A global file with n keys is distributed evenly among p peers in the peer-to-peer network. The selection algorithm can performs multiple selections concurrently to find multiple target keys with different predefined target ranks. The algorithm uses a fixed filter range approach that has been defined before the process begin, in which the algorithm is able to make sure that the target key is within the specified filter range in each local file. The range is made smaller and smaller as the selection process iterates until all target keys are found. The algorithm is able to reduce the number of rounds needed and increase the success rate of all multiple selections in the selection process compared to the previous multiple selection algorithms proposed by Loo in 2005. IEEE 2010 Conference or Workshop Item PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/56519/1/Statistical%20fixed%20range%20multiple%20selection%20algorithm%20for%20peer-to-peer%20system.pdf Kweh, Yeah Lun and Othman, Mohamed and Ahmad, Fatimah and Ibrahim, Hamidah (2010) Statistical fixed range multiple selection algorithm for peer-to-peer system. In: 2010 International Conference on Computer Applications and Industrial Electronics (ICCAIE 2010), 5-7 Dec. 2010, Kuala Lumpur, Malaysia. (pp. 619-623). 10.1109/ICCAIE.2010.5735009 |
| spellingShingle | Kweh, Yeah Lun Othman, Mohamed Ahmad, Fatimah Ibrahim, Hamidah Statistical fixed range multiple selection algorithm for peer-to-peer system |
| title | Statistical fixed range multiple selection algorithm for peer-to-peer system |
| title_full | Statistical fixed range multiple selection algorithm for peer-to-peer system |
| title_fullStr | Statistical fixed range multiple selection algorithm for peer-to-peer system |
| title_full_unstemmed | Statistical fixed range multiple selection algorithm for peer-to-peer system |
| title_short | Statistical fixed range multiple selection algorithm for peer-to-peer system |
| title_sort | statistical fixed range multiple selection algorithm for peer-to-peer system |
| url | http://psasir.upm.edu.my/id/eprint/56519/ http://psasir.upm.edu.my/id/eprint/56519/ http://psasir.upm.edu.my/id/eprint/56519/1/Statistical%20fixed%20range%20multiple%20selection%20algorithm%20for%20peer-to-peer%20system.pdf |