Dynamic search algorithm for intelligent message routing project explains about implementing a new algorithm which can route messages accurately by performing search queries at node level. This paper covers introduction to problem in present network and analysis on new algorithm, existing system details and proposed system features with hardware and software requirements. In present peer to peer network node is used to route messages but they do not hold any global information like information about other nodes searching features they doesn’t work intelligently. Existing peer to peer system is a unstructured network which doesn’t hold global information for routing message accurately. Flooding and RW are two searching algorithms used which performs blindly by sending messages to different nodes without any accurate query. This proposed system works on Dynamic search algorithm which works on knowledge based search mechanism. This mechanism will increase search performance and it works 25 times faster than flooding and RW algorithm in power law graphs and 125 times faster in bimodal topology.
download Dynamic Search Algorithm For Intelligent Message Routing project report.
Latest posts by Ramesh Gavva Shanthan (see all)
- Integer and Polynomial Arithmetic Technical PPT Presentation - October 19, 2013
- X-Ray Technical PPT Presentation - October 19, 2013
- Sorting Systems PPT Presentation - October 11, 2013
‹‹‹ CDN for Genome Sequence Similarity Detection