Resource location is a necessary operation for computer applications. In large scale peer-to-peer systems, random search is a scalable approach for locating dynamic resources. Current peer-to-peer systems can be partitioned into those which rely upon the Internet for message routing and those which utilize an overlay network. These two approaches result in different connectivity topologies. This thesis analyzes the effect of topological differences on the effectiveness of random search. After demonstrating the benefits of an overlay network, we propose a hybrid approach for resource location. Our proposed protocol provides deterministic searching capabilities which can help prevent request failures for sensitive applications.
| Identifer | oai:union.ndltd.org:TEXASAandM/oai:repository.tamu.edu:1969.1/551 |
| Date | 30 September 2004 |
| Creators | Nathuji, Ripal Babubhai |
| Contributors | Bettati, Riccardo, Zhao, Wei, Reddy, Narasimha |
| Publisher | Texas A&M University |
| Source Sets | Texas A and M University |
| Language | en_US |
| Detected Language | English |
| Type | Electronic Thesis, text |
| Format | 226118 bytes, 57229 bytes, electronic, application/pdf, text/plain, born digital |
Page generated in 0.0016 seconds