| Type of Material: | Thesis |
| Title: | DESIGN OF EFFICIENT SEARCHING ALGORITHMS FOR UNSTRUCTURED PEER TO PEER NETWORKS |
| Researcher: | S.ANBU |
| Guide: | Dr. Jayanti Rebecca |
| Department: | Department of Engineering and Technology(Computer Science and Engineering) |
| Publisher: | Bharath University, Chennai |
| Place: | Chennai |
| Year: | 2011 |
| Language: | English |
| Subject: | Breadth first search technique | Depth first search technique | NAPSTER P2P NETWORK | GNUTELLA P2P 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; 2011; D05CS009 |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 454530 | |
| 003 | IN-AhILN | |
| 005 | 2024-09-12 17:52:58 | |
| 008 | __ | 240912t2011||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_454530 |
| 040 | __ | |aBHAU_600073|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aS.ANBU|eResearcher |
| 110 | __ | |aDepartment of Engineering and Technology(Computer Science and Engineering)|bBharath University, Chennai|dChennai|ein |
| 245 | __ | |aDESIGN OF EFFICIENT SEARCHING ALGORITHMS FOR UNSTRUCTURED PEER TO PEER NETWORKS |
| 260 | __ | |aChennai|bBharath University, Chennai|c2011 |
| 300 | __ | |dDVD |
| 502 | __ | |bPhD|d2011|oD05CS009|cDepartment of Engineering and Technology(Computer Science and Engineering), Bharath University, Chennai, Chennai |
| 518 | __ | |d22.01.2005|oDate of Registration |
| 520 | __ | |aNowadays Peer-to-peer networks are very popular and common on small local area networks. Both wired and wireless home networks can be configured as Peer-to-peer networks. Much research is being done on peer-to-peer networks for various purposes. This research work aims to find some efficient searching algorithms or techniques to search resources in unstructured peer-to-peer network. In this research work, an efficient algorithm the Search Result Path Caching (SRPC) is developed to solve the search time issues of the existing algorithms. In this algorithm, the dynamic searching method is followed. As per this new algorithm, both breadth first search and depth first search are followed to find a resource. The path results obtained upon searching are stored in a path hash table. While searching, the search peer first evaluates its path table to find whether the path of the resource is available or not. If it is exists, the source node retrieves it from the table. This path table concept saves more search time |
| 650 | __ | |aComputer Science and Information Technology|2UGC |
| 650 | __ | |aEngineering and Technology|2AIU |
| 653 | __ | |aBreadth first search technique |
| 653 | __ | |aDepth first search technique |
| 653 | __ | |aNAPSTER P2P NETWORK |
| 653 | __ | |aGNUTELLA P2P NETWORK |
| 700 | __ | |aDr. Jayanti Rebecca|eGuide |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/170889|yShodhganga |
| 905 | __ | |afromsg |
User Feedback Comes Under This section.