Scalable percolation search on complex networks

DOI10.1016/J.TCS.2005.12.014MaRDI QIDQ2368965zbMATH OpenOpenAlexFDO

Authors Nima Sarshar, P. Oscar Boykin, Vwani Roychowdhury

Publication date 28 April 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.12.014

zbMATH Keywords

Peer-to-peer networksPercolation search algorithmScalable searchUnstructured complex networks

Mathematics Subject Classification ID

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

Recommendations

• Random walk search in unstructured P2P
• A statistical construction of power-law networks
• Non-searchability of random scale-free graphs
• PercolationNET: A multi-tree P2P overlay network supporting high coverage search
• SIL: a model for analyzing scalable peer-to-peer search networks

Cites work

• A critical point for random graphs with a given degree sequence
• A random graph model for massive graphs
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• scientific article; zbMATH DE number 1792101 (Why is no real title available?)
• scientific article; zbMATH DE number 1931807 (Why is no real title available?)
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Statistical mechanics of complex networks
• Viceroy, a scalable and dynamic emulation of the butterfly

Cited in

(5)

• Random walk search in unstructured P2P
• Content search through comparisons
• PercolationNET: A multi-tree P2P overlay network supporting high coverage search
• A statistical construction of power-law networks
• Percolation-based replica discovery in peer-to-peer grid infrastructures

Describes a project that uses

Uses Software

• Chord

This page was built for publication: Scalable percolation search on complex networks

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