On the public citation graph
Optimizing random walk search algorithms in P2P networks
0 signed · 95 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1016/0263-7855(92)80055-iopenalex-snapshot
The art of computer systems performance analysis
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.009openalex-snapshot
On certain connectivity properties of the internet topology
inferredcites →https://doi.org/10.1103/physreve.64.046135openalex-snapshot
Search in power-law networks
inferredcites →https://doi.org/10.1103/physreve.65.026107openalex-snapshot
Growing scale-free networks with tunable clustering
inferredcites →https://doi.org/10.1103/physreve.65.057102openalex-snapshot
Growing scale-free networks with small-world behavior
inferredcites →https://doi.org/10.1109/hot-p2p.2005.13openalex-snapshot
Modeling and Analysis of Random Walk Search Algorithms in P2P Networks
inferredcites →https://doi.org/10.1109/icdcs.2002.1022237openalex-snapshot
Improving search in peer-to-peer networks
inferredcites →https://doi.org/10.1109/icdcs.2002.1022239openalex-snapshot
Routing indices for peer-to-peer systems
inferredcites →https://doi.org/10.1109/infcom.2003.1209234openalex-snapshot
Distributed construction of random expander networks
inferredcites →https://doi.org/10.1109/infcom.2004.1354487openalex-snapshot
Random walks in peer-to-peer networks
inferredcites →https://doi.org/10.1109/ptp.2003.1231504openalex-snapshot
The effectiveness of realistic replication strategies on quality of availability for peer-to-peer systems
inferredcites →https://doi.org/10.1109/ptp.2003.1231509openalex-snapshot
Adaptive probabilistic search for peer-to-peer networks
inferredcites →https://doi.org/10.1109/ptp.2003.1231525openalex-snapshot
Search performance analysis in peer-to-peer networks
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1145/2591635.2667182openalex-snapshot
Search and replication in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1145/347057.347397openalex-snapshot
Equation-based congestion control for unicast applications
inferredcites →https://doi.org/10.1145/347059.347397openalex-snapshot
Equation-based congestion control for unicast applications
inferredcites →https://doi.org/10.1145/584792.584842openalex-snapshot
A local search mechanism for peer-to-peer networks
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.2307/2282952openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-84882-599-4_18openalex-snapshot
Neighbor Selection in Peer-to-Peer Overlay Networks: A Swarm Intelligence Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-29029-0_16openalex-snapshot
Opportunistic Communication by Pedestrians with Roadside Units as Message Caches
inferred← citeshttps://doi.org/10.1007/978-3-030-39746-3_41openalex-snapshot
Human Mobility and Message Caching in Opportunistic Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-57811-4_8openalex-snapshot
A Cost Analysis of Routing Algorithms in Pedestrian-Based Delay Tolerant Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-14314-4_9openalex-snapshot
The Probability of Encounters of Mutual Search Using Lévy Walk on Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-96146-5_21openalex-snapshot
FLTP: A Fast and Low-Bandwidth Transaction Propagation Protocol in Ethereum
inferred← citeshttps://doi.org/10.1007/978-3-319-15916-4_5openalex-snapshot
Resource Constrained Randomized Coverage Strategies for Unstructured Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-65521-5_70openalex-snapshot
Collecting Data in Sensor Networks Using Homesick Lévy Walk
inferred← citeshttps://doi.org/10.1007/978-3-319-75928-9_84openalex-snapshot
Performance Evaluation of Lévy Walk on Message Dissemination in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-18009-5_10openalex-snapshot
Improving Random Walk Estimation Accuracy with Uniform Restarts
inferred← citeshttps://doi.org/10.1007/978-3-642-24806-1_23openalex-snapshot
Placing Content in Hybrid Peer-to-Peer Networks by User Activities Consideration
inferred← citeshttps://doi.org/10.1007/s10922-011-9203-3openalex-snapshot
Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents
inferred← citeshttps://doi.org/10.1007/s11227-019-03139-3openalex-snapshot
A location and time-aware resource searching scheme in mobile P2P ad hoc networks
inferred← citeshttps://doi.org/10.1007/s11235-010-9285-3openalex-snapshot
Multi swarms for neighbor selection in peer-to-peer overlay networks
inferred← citeshttps://doi.org/10.1007/s12043-015-0931-xopenalex-snapshot
Coverage maximization under resource constraints using proliferating random walks
inferred← citeshttps://doi.org/10.1007/s12065-018-0189-6openalex-snapshot
Message broadcasting by opportunistic communication on unit disk graphs
inferred← citeshttps://doi.org/10.1007/s12083-010-0082-2openalex-snapshot
Survey of search and optimization of P2P networks
inferred← citeshttps://doi.org/10.1007/s12083-018-0680-yopenalex-snapshot
An adaptable and ISP-friendly multicast overlay network
inferred← citeshttps://doi.org/10.1007/s12083-019-00831-2openalex-snapshot
DPAS: A dynamic popularity-aware search mechanism for unstructured P2P systems
inferred← citeshttps://doi.org/10.1016/j.chaos.2026.118810openalex-snapshot
Network exploration by random walks: A large deviation perspective
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.09.006openalex-snapshot
Modeling message propagation in random graph networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.12.005openalex-snapshot
Exploiting semantic proximities for content search over p2p networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2010.01.026openalex-snapshot
Random walk with jumps in large-scale random geometric graphs
inferred← citeshttps://doi.org/10.1016/j.jnca.2009.11.003openalex-snapshot
A path-traceable query routing mechanism for search in unstructured peer-to-peer networks
inferred← citeshttps://doi.org/10.1016/j.jnca.2017.04.014openalex-snapshot
HARD: Hybrid Adaptive Resource Discovery for Jungle Computing
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.11.010openalex-snapshot
Resource discovery for distributed computing systems: A comprehensive survey
inferred← citeshttps://doi.org/10.1016/j.micpro.2016.06.007openalex-snapshot
ElCore: Dynamic elastic resource management and discovery for future large-scale manycore enabled distributed systems
inferred← citeshttps://doi.org/10.1016/j.pmcj.2010.11.011openalex-snapshot
Connectivity in time-graphs
inferred← citeshttps://doi.org/10.1049/cje.2015.04.002openalex-snapshot
Enhanced Entropy‐Based Resource Searching in Unstructured P2P Networks
inferred← citeshttps://doi.org/10.1103/physreve.111.054309openalex-snapshot
Biased random walks on networks with stochastic resetting
inferred← citeshttps://doi.org/10.1103/physreve.81.061124openalex-snapshot
Coverage-maximization in networks under resource constraints
inferred← citeshttps://doi.org/10.1103/physreve.87.022807openalex-snapshot
Coverage maximization under resource constraints using a nonuniform proliferating random walk
inferred← citeshttps://doi.org/10.1109/aina.2017.102openalex-snapshot
Message Dissemination Using Lévy Flight on Unit Disk Graphs
inferred← citeshttps://doi.org/10.1109/aina.2018.00034openalex-snapshot
Resource Exploration Using Levy Walk on Unit Disk Graphs
inferred← citeshttps://doi.org/10.1109/atc.2008.4760560openalex-snapshot
A novel topology for peer-to-peer based platform
inferred← citeshttps://doi.org/10.1109/ccece.2014.6900982openalex-snapshot
Bacterial foraging search in unstructured P2P networks
inferred← citeshttps://doi.org/10.1109/chinacom.2009.5339868openalex-snapshot
GnutellaBT: Merging gnutella and BitTorrent for efficient P2P resource sharing
inferred← citeshttps://doi.org/10.1109/cse.2009.92openalex-snapshot
Information Flow and Search in Unstructured Keyword Based Social Networks
inferred← citeshttps://doi.org/10.1109/glocom.2010.5684324openalex-snapshot
Privacy Exposure of Online Social Search
inferred← citeshttps://doi.org/10.1109/icc.2009.5199194openalex-snapshot
Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information
inferred← citeshttps://doi.org/10.1109/ncis.2011.138openalex-snapshot
DLPSPN: New Efficient Super-Peer Network Based on Double-Loop Petersen Graph
inferred← citeshttps://doi.org/10.1109/nswctc.2010.278openalex-snapshot
Resource Search in Peer-to-Peer Network Based on Power Law Distribution
inferred← citeshttps://doi.org/10.1109/pimrc.2007.4394157openalex-snapshot
Searching with Multiple Random Walk Queries
inferred← citeshttps://doi.org/10.1109/skg.2010.25openalex-snapshot
Building Resilient Unstructured Peer-to-Peer Networks Using Mobile Agents
inferred← citeshttps://doi.org/10.1109/tit.2019.2925610openalex-snapshot
Low-Mean Hitting Time for Random Walks on Heterogeneous Networks
inferred← citeshttps://doi.org/10.1109/tnse.2022.3140213openalex-snapshot
Optimizing the Trapping (Transport) Efficiency in Regular Branched Networks
inferred← citeshttps://doi.org/10.1109/wicom.2008.1244openalex-snapshot
Research of Direction-Based Search Algorithm in P2P Network
inferred← citeshttps://doi.org/10.1109/wicom.2009.5302444openalex-snapshot
Research on Direction Search Algorithm Based on LAN Agent in P2P Network
inferred← citeshttps://doi.org/10.1109/wicom.2009.5302448openalex-snapshot
DTDS: LAN Agent-Based Dynamic Transmit Direction Search Algorithm in P2P Network
inferred← citeshttps://doi.org/10.1145/1879141.1879192openalex-snapshot
Estimating and sampling graphs with multidimensional random walks
inferred← citeshttps://doi.org/10.1155/2012/923023openalex-snapshot
Improved Degree Search Algorithms in Unstructured P2P Networks
inferred← citeshttps://doi.org/10.1155/2013/264383openalex-snapshot
Improved Message Diffusion Model for Node Coverage Problem of Ad Hoc Network Based on Node Visit Times
inferred← citeshttps://doi.org/10.1155/2014/197878openalex-snapshot
CSA: A Credibility Search Algorithm Based on Different Query in Unstructured Peer‐to‐Peer Networks
inferred← citeshttps://doi.org/10.1155/2016/5641831openalex-snapshot
A Hierarchical Load Balancing Strategy Considering Communication Delay Overhead for Large Distributed Computing Systems
inferred← citeshttps://doi.org/10.14232/phd.11555openalex-snapshot
Integrating Blockchain and Fog Computing Technologies for Efficient Privacy-preserving Systems
inferred← citeshttps://doi.org/10.1587/transcom.e95.b.289openalex-snapshot
Randomized Search Strategy for Unstructured P2P Networks
inferred← citeshttps://doi.org/10.18419/opus-2806openalex-snapshot
Optimized information discovery in structured peer-to-peer overlay networks
inferred← citeshttps://doi.org/10.32604/cmc.2021.015371openalex-snapshot
Analytical Comparison of Resource Search Algorithms in Non-DHT Mobile Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.32604/cmc.2021.016692openalex-snapshot
Mathematical Model Validation of Search Protocols in MP2P Networks
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2011.03878openalex-snapshot
Exploiting Multi-Level Locality to Implement the Scalable Search in Unstructured P2P Network
inferred← citeshttps://doi.org/10.4304/jnw.5.11.1365-1372openalex-snapshot
Reliable Resource Search in Scale Free Peer-to-Peer Network
inferred← citeshttps://doi.org/10.48550/arxiv.1007.1809openalex-snapshot
Mean First Hitting Time of Searching for Path Through Random Walks on Complex Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1008.1629openalex-snapshot
Survey of Search and Replication Schemes in Unstructured P2P Networks
inferred← citeshttps://doi.org/10.5296/npa.v2i1.263openalex-snapshot
SURVEY OF SEARCH AND REPLICATION SCHEMES IN UNSTRUCTURED P2P NETWORKS
inferred← citeshttps://doi.org/10.7287/peerj-cs.431v0.1/reviews/1openalex-snapshot
Peer Review #1 of "FoBSim: an extensible open-source simulation tool for integrated fog-blockchain systems (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.431v0.1/reviews/2openalex-snapshot
Peer Review #2 of "FoBSim: an extensible open-source simulation tool for integrated fog-blockchain systems (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.431v0.2/reviews/1openalex-snapshot
Peer Review #1 of "FoBSim: an extensible open-source simulation tool for integrated fog-blockchain systems (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.431v0.2/reviews/2openalex-snapshot
Peer Review #2 of "FoBSim: an extensible open-source simulation tool for integrated fog-blockchain systems (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.431openalex-snapshot
FoBSim: an extensible open-source simulation tool for integrated fog-blockchain systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.