Please use this identifier to cite or link to this item: http://ir.inflibnet.ac.in/handle/1944/1015
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSaradhi, Potharaju S R P-
dc.contributor.authorShaik, Mohmed Nazurudin-
dc.contributor.authorAditya, Potharaju S R-
dc.date.accessioned2010-05-12T05:41:08Z-
dc.date.available2010-05-12T05:41:08Z-
dc.date.issued2009-02-25-
dc.identifier.isbn978-81-902079-8-0-
dc.identifier.urihttp://hdl.handle.net/1944/1015-
dc.description.abstractPeer-to-Peer (P2P) computing has emerged as a popular model aiming at further utilizing Internet information and resources. Flooding is the basic method of searching in unstructured P2P networks; however, the blind flooding based search mechanism causes a large volume of unnecessary traffic, and greatly limits the performance of P2P systems. Our study shows that a large amount of this unwanted traffic is divinable and can be avoided while searching in P2P networks. In this paper, we aim at reducing the volume of unnecessary traffic, by proposing An Unnecessary Message Prediction based Searching mechanism (UMPS). UMPS is a pure distributed scheme, it is based on the distributed neighbor list where neighbors within two hops are stored in. UMPS cuts down unwanted traffic by terminating unnecessary flooding that has been predicted in advance, and the techniques related to distributed neighbor list are also discussed. Simulation results show that more than 60% unnecessary messages can be reduced by UMPS, and the query coverage range is retained at the same time, and more unwanted messages can be reduced if a peer has larger degree, therefore load balancing is achieved also.en_US
dc.language.isoenen_US
dc.publisherINFLIBNET Centeren_US
dc.subjectUMPSen_US
dc.subjectP2P Networken_US
dc.titleAn Innovative Approach to Content Search Across P2P Inter-Networksen_US
dc.typeArticleen_US
Appears in Collections:CALIBER 2009:Puducherry

Files in This Item:
File Description SizeFormat 
20.pdf330.86 kBAdobe PDFView/Open


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