Papers by Sadish Sendil Murugaraj
Peer-to-Peer (P2P) system has become one of the hottest research topics, its excellent characteri... more Peer-to-Peer (P2P) system has become one of the hottest research topics, its excellent characteristics of fully decentralized control and self-organizing make it attractive for some particular applications. Routing algorithm has great influence in P2P applications. Current routing algorithm concentrates on creating well organized network architecture to improve the routing performance. However, for each routing procedure, system returns location information of the requested file only and the characteristics of system workload are considered. Routing performance is critical for P2P networks to achieve high performance. Using sandwich method, the HDHTR and SDHTR are combined based on the following criteria: 1. creating a P2P ring where routing tasks are first executed in lower level ring before they go to higher level thus reducing routing overhead. 2. A super node based routing algorithm which reduce the average routing latency and cost. Hence it reduces the routing overhead and average routing latency, which thereby reduce the traffic.
Problem Statement: Peer to Peer (P2P) systems have grown dramatically in recent years. The most p... more Problem Statement: Peer to Peer (P2P) systems have grown dramatically in recent years. The most popular type of P2P systems are file sharing networks, which are used to share various types of content over the Internet. Due to the increase in popularity of P2P systems, the network performance of these systems has become a very important issue in the design and realization of these networks. Hence, the performance of the P2P has been improved. Approach: This paper suggests the following methods for the improving the performance of P2P systems: Method-1: Improving the P2P routing using a sandwich technique. Method-2: Improving the search performance by introducing a new searching method based on the super peer. Method-3: Improving the search by introducing a ranking algorithm based on the knowledge database. Results: The system demonstrates that the methods introduced here have improved the performance of P2P network efficiently when compared to the existing methodologies. Conclusions / Recommendations: The performance of the P2P systems have improved by using the above said methods, hence the traffic can be reduced in P2P network.
Peer-to-Peer systems are one of the effective ways of communicating and sharing
data equally. The... more Peer-to-Peer systems are one of the effective ways of communicating and sharing
data equally. The new age protocols are able to route efficiently with faster download,
better stability and a good user interface. However, determining the destination peer in the
first place is not always trivial. Selection of right peer for the given query is difficult.
Especially the distributed knowledge management setting suffers from the behavior of
selfish peers which are autonomous and require some incentive for their service. In the
proposed data model, the ontology based selection method is implemented. The ontology
produces a relation in between the terms as well as keywords and the user pretend to
search. So the metadata based result would be stored inside the Knowledge Database.
Inside the stored data, the proposed method introducing a Rank based peer to peer
searching strategy; hence the expanded Meta based search results should be prioritized and
proper result should be published to the user. Therefore, matching of user query should be
improved and most exact result to be obtained by the user at a single search. The results
show that the search performance and Meta data based results can be improved through the
proposed method. The P2P search performance improves then indirectly the P2P traffic can
be reduced.
Journal of Mathematics and …, Jan 1, 2010
International Journal of Computer Science
Uploads
Papers by Sadish Sendil Murugaraj
data equally. The new age protocols are able to route efficiently with faster download,
better stability and a good user interface. However, determining the destination peer in the
first place is not always trivial. Selection of right peer for the given query is difficult.
Especially the distributed knowledge management setting suffers from the behavior of
selfish peers which are autonomous and require some incentive for their service. In the
proposed data model, the ontology based selection method is implemented. The ontology
produces a relation in between the terms as well as keywords and the user pretend to
search. So the metadata based result would be stored inside the Knowledge Database.
Inside the stored data, the proposed method introducing a Rank based peer to peer
searching strategy; hence the expanded Meta based search results should be prioritized and
proper result should be published to the user. Therefore, matching of user query should be
improved and most exact result to be obtained by the user at a single search. The results
show that the search performance and Meta data based results can be improved through the
proposed method. The P2P search performance improves then indirectly the P2P traffic can
be reduced.