{"id":"https://openalex.org/W2164240252","doi":"https://doi.org/10.1109/ptp.2003.1231509","title":"Adaptive probabilistic search for peer-to-peer networks","display_name":"Adaptive probabilistic search for peer-to-peer networks","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2164240252","doi":"https://doi.org/10.1109/ptp.2003.1231509","mag":"2164240252"},"language":"en","primary_location":{"id":"doi:10.1109/ptp.2003.1231509","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ptp.2003.1231509","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005628435","display_name":"Dimitrios Tsoumakos","orcid":"https://orcid.org/0000-0003-4420-8949"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Tsoumakos","raw_affiliation_strings":["Department of Computer Science, University of Maryland, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113572284","display_name":"N. Roussopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Roussopoulos","raw_affiliation_strings":["Department of Computer Science, University of Maryland, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":295,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"102","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9837999939918518,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8030545115470886},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7175021171569824},{"id":"https://openalex.org/keywords/flooding","display_name":"Flooding (psychology)","score":0.708979606628418},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6439028382301331},{"id":"https://openalex.org/keywords/peer-to-peer","display_name":"Peer-to-peer","score":0.6267860531806946},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.5816584229469299},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5716930627822876},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5675738453865051},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5079248547554016},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5025384426116943},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4273117780685425},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.19546809792518616},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17296409606933594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11578240990638733}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8030545115470886},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7175021171569824},{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.708979606628418},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6439028382301331},{"id":"https://openalex.org/C534932454","wikidata":"https://www.wikidata.org/wiki/Q161410","display_name":"Peer-to-peer","level":2,"score":0.6267860531806946},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.5816584229469299},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5716930627822876},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5675738453865051},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5079248547554016},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5025384426116943},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4273117780685425},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.19546809792518616},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17296409606933594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11578240990638733},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ptp.2003.1231509","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ptp.2003.1231509","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.156.2563","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.2563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cslab.ece.ntua.gr/~dtsouma/index_files/107_Tsoumakos_D.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.5747","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.5747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~dtsouma/objects/P2P2003.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W3976408","https://openalex.org/W150763935","https://openalex.org/W1527463082","https://openalex.org/W1580004440","https://openalex.org/W1650675509","https://openalex.org/W2007219304","https://openalex.org/W2098125775","https://openalex.org/W2104210894","https://openalex.org/W2105726509","https://openalex.org/W2106644316","https://openalex.org/W2123820820","https://openalex.org/W2134177285","https://openalex.org/W2135805607","https://openalex.org/W2150676586","https://openalex.org/W2152319665","https://openalex.org/W2155659292","https://openalex.org/W2158049821","https://openalex.org/W2163059190","https://openalex.org/W2163598690","https://openalex.org/W2167898414","https://openalex.org/W2174507869","https://openalex.org/W3216487844","https://openalex.org/W4243132303","https://openalex.org/W6606086524","https://openalex.org/W6652417112","https://openalex.org/W6683345705","https://openalex.org/W7008219709"],"related_works":["https://openalex.org/W2086397253","https://openalex.org/W2133122801","https://openalex.org/W2039543756","https://openalex.org/W2386325437","https://openalex.org/W2353043494","https://openalex.org/W600422426","https://openalex.org/W2441202759","https://openalex.org/W2007156430","https://openalex.org/W2935886589","https://openalex.org/W36953100"],"abstract_inverted_index":{"Peer-to-peer":[0],"networks":[1,37],"are":[2],"gaining":[3],"increasing":[4],"attention":[5],"from":[6,83],"both":[7],"the":[8,11,33,39,47,73],"scientific":[9],"and":[10,50,123],"large":[12],"Internet":[13],"user":[14],"community.":[15],"Popular":[16],"applications":[17],"utilizing":[18],"this":[19],"new":[20],"technology":[21],"offer":[22],"many":[23],"attractive":[24],"features":[25],"to":[26,59,86,125],"a":[27],"growing":[28],"number":[29,115],"of":[30,35,116],"users.":[31],"At":[32],"heart":[34],"such":[36],"lies":[38],"search":[40,68,76],"algorithm.":[41],"Proposed":[42],"methods":[43],"either":[44],"depend":[45],"on":[46],"network-disastrous":[48],"flooding":[49],"its":[51],"variations":[52],"or":[53],"utilize":[54],"various":[55],"indices":[56],"too":[57],"expensive":[58],"maintain.":[60],"We":[61],"describe":[62],"an":[63],"adaptive,":[64],"bandwidth-efficient":[65],"algorithm":[66],"for":[67],"in":[69],"unstructured":[70],"peer-to-peer":[71],"networks,":[72],"adaptive":[74],"probabilistic":[75],"method":[77],"(APS).":[78],"Our":[79],"scheme":[80],"utilizes":[81],"feedback":[82],"previous":[84],"searches":[85],"probabilistically":[87],"guide":[88],"future":[89],"ones.":[90],"It":[91],"performs":[92],"efficient":[93],"object":[94],"discovery":[95],"while":[96],"inducing":[97],"zero":[98],"overhead":[99],"over":[100],"dynamic":[101],"network":[102],"operations.":[103],"Extensive":[104],"simulation":[105],"results":[106],"show":[107],"that":[108],"APS":[109],"achieves":[110],"high":[111],"success":[112],"rates,":[113],"increased":[114],"discovered":[117],"objects,":[118],"very":[119],"low":[120],"bandwidth":[121],"consumption":[122],"adaptation":[124],"changing":[126],"topologies.":[127]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":26},{"year":2012,"cited_by_count":17}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}