Estimating and sampling graphs with multidimensional random walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex
networks. Current sampling methods such as (independent) random vertex and random …
networks. Current sampling methods such as (independent) random vertex and random …
Resource discovery for distributed computing systems: A comprehensive survey
Large-scale distributed computing environments provide a vast amount of heterogeneous
computing resources from different sources for resource sharing and distributed computing …
computing resources from different sources for resource sharing and distributed computing …
Mobile application platform heterogeneity: Android vs Windows Phone vs iOS vs Firefox OS
Modern smartphones have a rich spectrum of increasingly sophisticated features, opening
opportunities for software-led innovation. Of the large number of platforms to develop new …
opportunities for software-led innovation. Of the large number of platforms to develop new …
Improving random walk estimation accuracy with uniform restarts
This work proposes and studies the properties of a hybrid sampling scheme that mixes
independent uniform node sampling and random walk (RW)-based crawling. We show that …
independent uniform node sampling and random walk (RW)-based crawling. We show that …
FoBSim: an extensible open-source simulation tool for integrated fog-blockchain systems
A lot of hard work and years of research are still needed for developing successful
Blockchain (BC) applications. Although it is not yet standardized, BC technology was proven …
Blockchain (BC) applications. Although it is not yet standardized, BC technology was proven …
Low-mean hitting time for random walks on heterogeneous networks
Y Sheng, Z Zhang - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
Mean hitting time for random walks on a network, defined as the average of hitting times
over all possible pairs of nodes, has found a large variety of applications in many areas. In …
over all possible pairs of nodes, has found a large variety of applications in many areas. In …
Survey of search and replication schemes in unstructured p2p networks
SM Thampi - arXiv preprint arXiv:1008.1629, 2010 - arxiv.org
P2P computing lifts taxing issues in various areas of computer science. The largely used
decentralized unstructured P2P systems are ad hoc in nature and present a number of …
decentralized unstructured P2P systems are ad hoc in nature and present a number of …
Message dissemination using lévy flight on unit disk graphs
K Shinki, M Nishida… - 2017 IEEE 31st …, 2017 - ieeexplore.ieee.org
Random walks play an important role in computer science, spreading a wide range of topics
in theory and practice, including networking, distributed systems, and optimization. Levy …
in theory and practice, including networking, distributed systems, and optimization. Levy …
Resource exploration using lévy walk on unit disk graphs
K Shinki, N Hayashibara - 2018 IEEE 32nd International …, 2018 - ieeexplore.ieee.org
Random walks play an important role in computer science, spreading a wide range of topics
in theory and practice, including networking, distributed systems, and optimization. Levy …
in theory and practice, including networking, distributed systems, and optimization. Levy …
A location and time-aware resource searching scheme in mobile P2P ad hoc networks
S Zhou, X Meng - The Journal of Supercomputing, 2020 - Springer
With the advanced development of wireless communication techniques and the increasing
application of smart devices, the mobile P2P ad hoc networks (ie, P2P MANETs) are …
application of smart devices, the mobile P2P ad hoc networks (ie, P2P MANETs) are …