| Type of Material: | Thesis |
| Title: | Improving Query Search Performance in Unstructured P2P Networks Using Proclamation Based Search Algorithm |
| Researcher: | AR.ARUNACHALAM |
| Guide: | Dr.A.CHANDRASEKAR |
| Department: | Department of Engineering and Technology(Computer Science and Engineering) |
| Publisher: | Bharath University, Chennai |
| Place: | Chennai |
| Year: | 2017 |
| Language: | English |
| Subject: | Connected dominating set | Peer-to-Peer Simplified | Juxtapose | BitTorrent Network | Computer Science and Information Technology | Engineering and Technology |
| Dissertation/Thesis Note: | PhD; Department of Engineering and Technology(Computer Science and Engineering), Bharath University, Chennai, Chennai; 2017; D10CS001 |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 454455 | |
| 003 | IN-AhILN | |
| 005 | 2024-09-12 10:51:14 | |
| 008 | __ | 240912t2017||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_454455 |
| 040 | __ | |aBHAU_600073|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aAR.ARUNACHALAM|eResearcher |
| 110 | __ | |aDepartment of Engineering and Technology(Computer Science and Engineering)|bBharath University, Chennai|dChennai|ein |
| 245 | __ | |aImproving Query Search Performance in Unstructured P2P Networks Using Proclamation Based Search Algorithm |
| 260 | __ | |aChennai|bBharath University, Chennai|c2017 |
| 300 | __ | |dDVD |
| 502 | __ | |bPhD|d2017|oD10CS001|cDepartment of Engineering and Technology(Computer Science and Engineering), Bharath University, Chennai, Chennai |
| 518 | __ | |d20.07.2010|oDate of Registration |
| 520 | __ | |aSearching in unstructured P2P networks is considerably more challenging because of the lack of global routing and dynamic topology. Various search algorithms have been evolved in the past In unstructured P2P systems, the majority of active query-based search algorithms shares a known approach: when there is a search message, a peer delivers a query to different peers in the overlay network As the query has to travel many hops, generally it will take longer time for the query to be answered. As a result, there is huge number of query messages which is generated in the network. So, more bandwidth and power is consumed in all the nodes which are associated in the routing path. Too much usage of queries generally leads to lengthy search latency and heavy load in the system. The challenge in unstructured p2p networks is designing an efficient search Algorithm. Some typical search algorithms are random walk and flooding. Flooding in general covers many nodes but the drawback is that it generates huge amount of qu |
| 650 | __ | |aComputer Science and Information Technology|2UGC |
| 650 | __ | |aEngineering and Technology|2AIU |
| 653 | __ | |aConnected dominating set |
| 653 | __ | |aPeer-to-Peer Simplified |
| 653 | __ | |aJuxtapose |
| 653 | __ | |aBitTorrent Network |
| 700 | __ | |aDr.A.CHANDRASEKAR|eGuide |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/170872|yShodhganga |
| 905 | __ | |afromsg |
User Feedback Comes Under This section.