Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/394624
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMohamed Othman-
dc.contributor.authorKweh Yeah Lun-
dc.date.accessioned2023-06-15T07:48:11Z-
dc.date.available2023-06-15T07:48:11Z-
dc.identifier.otherukmvital:119647-
dc.identifier.urihttps://ptsldigital.ukm.my/jspui/handle/123456789/394624-
dc.description.abstractOver the years, the distributed computing environment has been developed so fast that there's a need to develop an effective selection algorithm for it. Loo [9] has proposed a statistical selection algorithm with the same objective and run in multicast / broadcast environment that has been proved that it is the best among others in term of the number of messages needed to complete the searching process. This work revisited the work by Loo [9] through simulation. The result obtained from the simulation is almost the same with [9] in terms of the number of messages needed and the number of rounds needed-
dc.language.isoeng-
dc.publisherInstitute of Institute of Electrical and Electronics Engineers. Inc.-
dc.subjectSelection algorithm-
dc.subjectComputing environment-
dc.titleRevisit of statistical selection algorithm for peer to peer system-
dc.typeSeminar Papers-
dc.format.volumeVol. 1-
dc.format.pages654-660 p.-
dc.identifier.callnokat sem T58.5.C634Re-
dc.contributor.conferencenameInternational Symposium on Information Technology-
dc.coverage.conferencelocationKuala Lumpur Convention Centre-
dc.date.conferencedate26/08/2008-
Appears in Collections:Seminar Papers/ Proceedings / Kertas Kerja Seminar/ Prosiding

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.