Revisit of statistical selection algorithm for peer-to-peer system

Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/394888

Full metadata record

DC Field	Value	Language
dc.contributor.author	Mohamed Othman	-
dc.contributor.author	Kweh Yeah Lun	-
dc.date.accessioned	2023-06-15T07:51:44Z	-
dc.date.available	2023-06-15T07:51:44Z	-
dc.identifier.other	ukmvital:122050	-
dc.identifier.uri	https://ptsldigital.ukm.my/jspui/handle/123456789/394888	-
dc.description.abstract	Over 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 has proposed a statistical selection algorithm with the same objective and run in multicast / broadcast environment that has been proved that is the best among others in terms of the number of messages needed to complete the searching process. This work revisited the work by Loo through simulation. The result obtained from the simulation is almost the same with in terms of the number of messages needed and the number of rounds needed.	-
dc.language.iso	eng	-
dc.publisher	Institute of Electrical and Electronics Engineers (IEEE),Piscataway, US	-
dc.subject	Peer-to-peer system	-
dc.subject	Statistical selection algorithm	-
dc.title	Revisit of statistical selection algorithm for peer-to-peer system	-
dc.type	Seminar Papers	-
dc.format.pages	7	-
dc.identifier.callno	T58.5.C634 2008 kat sem	-
dc.contributor.conferencename	International Symposium on Information Technology	-
dc.coverage.conferencelocation	Kuala Lumpur Convention Centre	-
dc.date.conferencedate	26/08/2008	-
Appears in Collections:	Seminar Papers/ Proceedings / Kertas Kerja Seminar/ Prosiding

Files in This Item:

There are no files associated with this item.