SIL: a model for analyzing scalable peer-to-peer search networks

DOI10.1016/J.COMNET.2005.09.018MaRDI QIDQ871129zbMATH OpenOpenAlexFDO

Authors Brian F. Cooper, Hector Garcia-Molina

Publication date 15 March 2007

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2005.09.018

zbMATH Keywords

network modelingpeer-to-peer systemsefficient networksinformation search and discoverysupernodes

Mathematics Subject Classification ID

Searching and sorting (68P10) Network design and communication in computer systems (68M10)

Recommendations

• Survey of research towards robust peer-to-peer networks: search methods
• SFES: a scalable, fault-tolerant, efficient search scheme in a peer-to-peer network

Cited in

(2)

• Scalable percolation search on complex networks
• SFES: a scalable, fault-tolerant, efficient search scheme in a peer-to-peer network

This page was built for publication: SIL: a model for analyzing scalable peer-to-peer search networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871129)