Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/395039
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Amir Modarresi | - |
dc.contributor.author | Ali Mamat | - |
dc.contributor.author | Hamidah Ibrahim | - |
dc.contributor.author | Norwati Mustapha | - |
dc.date.accessioned | 2023-06-15T07:54:08Z | - |
dc.date.available | 2023-06-15T07:54:08Z | - |
dc.identifier.other | ukmvital:122775 | - |
dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/395039 | - |
dc.description.abstract | Peer clustering is way for managing the structure of Peer-to-Peer (P29) networks. It can be done on physical structure of the network like physical proximity of peers or semantic relationship among them. Our proposed model uses social network concepts as the main physical structure for clustering peers. Nodes in the model are grouped into several communities and sub communities with similar interests. The order and relation among communities are defined and controlled by a shared ontology. This structure provides lower distance and better locality in search. A simulation of the model shows lower path and better clustering than a random network. | - |
dc.language.iso | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE),Piscataway, US | - |
dc.subject | Peer-to-peer model | - |
dc.subject | Peer clustering | - |
dc.title | A social network peer-to-peer model for peer clustering | - |
dc.type | Seminar Papers | - |
dc.format.pages | 7 | - |
dc.identifier.callno | T58.5.C634 2008 kat sem j.3 | - |
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.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.