Title:
Efficient Node Search in P2P Using Distributed Spanning Tree
Level:
Master Degree
Duration:
5-6 Months
Base Paper:
Efficient Node Search in P2P Using Distributed Spanning Tree
Journal:
(IJCSIS) International Journal of Computer Science and Information Security, Vol.
8, No. 3, June 2010
Abstract: Peer to Peer (P2P) networks are the important
part of the next cohort of Internet, so how to search the node in the P2P
networks efficiently is the key problem of the perception of the P2P network.
However, the node search process in unstructured P2P is not efficient because
the same search message may go through a node multiple times. To ease the complex
search and improve the search efficiency, we propose a mechanism using the
interconnection structure called Distributed Spanning Tree (DST) which
facilitates the P2P Network into a layered structure to improve the node search
technique. The performance evaluations of simulation demonstrate that the
proposed mechanism can improve the node search efficiency of P2P systems.
Note:
Sometime, concept implementation may differ from the concept in the base paper
to show the innovative technique which is must for any Master Project.
Password - pascal
Comment on any queries.
No comments:
Post a Comment