Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/5538
Title: A search theoretical approach to P2P networks: Analysis of learning
Authors: Taş, N. C.
Taş, Bedri Kamil Onur
Issue Date: 2006
Source: Advanced International Conference on Telecommunications andInternational Conference on Internet and Web Applications and Services, AICT/ICIW'06, 19 February 2006 through 25 February 2006, Guadelope, 68162
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. © 2006 IEEE.
URI: https://doi.org/10.1109/AICT-ICIW.2006.32
https://hdl.handle.net/20.500.11851/5538
ISBN: 0769525229; 9780769525228
Appears in Collections:İktisat Bölümü / Department of Economics
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Show full item record

CORE Recommender

Page view(s)

26
checked on Feb 6, 2023

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.