A search theoretical approach to P2P networks: Analysis of learning

Nazif Cihan Taş*, Bedri Kâmil Onur Taş

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

One of the main characteristics of the peer-to-peer systems is the highly dynamic nature of the users present in the system. In such a rapidly changing enviroment, end-user guarantees become hard to handle. In this paper, we propose a search-theoretic view for performing lookups. We define a new search mechanism with cost-analysis for refining the lookups by predicting the arrival and leave possibilities of the users. Our system computes a threshold for the number of times that a user has to perform. We compare our results with the naive approach of accepting the first set of results as the basis.

Original languageEnglish
Title of host publicationProceedings of the Advanced International Conference on Telecommunications andInternational Conference on Internet and Web Applications and Services, AICT/ICIW'06
Pages113
Number of pages1
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventAdvanced International Conference on Telecommunications andInternational Conference on Internet and Web Applications and Services, AICT/ICIW'06 - Guadelope, French Southern Territories
Duration: Feb 19 2006Feb 25 2006

Publication series

NameProceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services, AICT/ICIW'06
Volume2006

Other

OtherAdvanced International Conference on Telecommunications andInternational Conference on Internet and Web Applications and Services, AICT/ICIW'06
Country/TerritoryFrench Southern Territories
CityGuadelope
Period2/19/062/25/06

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'A search theoretical approach to P2P networks: Analysis of learning'. Together they form a unique fingerprint.

Cite this