Selective flooding based on relevant nearest-neighbor using query feedback and similarity across unstructured peer-to-peer networks
Efficient searching is a fundamental problem for unstructured peer to peer networks. Flooding requires a lot of resources in the network and thus will increase the search cost. Searching approach that utilizes minimum network resources is required to produce efficient searching in the robust and dyn...
à®®à¯à®´à¯ விளகà¯à®•à®®à¯
Saved in:
| தலைமை எழà¯à®¤à¯à®¤à®¾à®³à®°à¯à®•ளà¯: | , |
|---|---|
| வடிவமà¯: | கடà¯à®Ÿà¯à®°à¯ˆ |
| வெளியீடபà¯à®ªà®Ÿà¯à®Ÿà®¤à¯: |
Science Publications
2009
|
| பகà¯à®¤à®¿à®•ளà¯: | |
| நிகழà¯à®¨à®¿à®²à¯ˆ அணà¯à®•லà¯: | http://eprints.utm.my/13095/ http://eprints.utm.my/13095/ http://eprints.utm.my/13095/ |
| கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•ளà¯: |
கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯ இணை
கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•ள௠இலà¯à®²à¯ˆ, இநà¯à®¤ கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯à®²à¯ˆ à®®à¯à®¤à®²à®¿à®²à¯ பதிவ௠செயà¯à®¯à¯à®™à¯à®•ளà¯!
|
இநà¯à®¤ கரà¯à®¤à¯à®¤à¯ˆ à®®à¯à®¤à®²à®¿à®²à¯ விடà¯à®Ÿà¯à®šà¯à®šà¯†à®²à¯à®²à¯à®™à¯à®•ளà¯!