Random walks are ubiquitous in the sciences, and they are interesting from both theoretical
and practical perspectives. They are one of the most fundamental types of stochastic …

Large-scale distributed computing environments provide a vast amount of heterogeneous
computing resources from different sources for resource sharing and distributed computing …

The concept of unstructured Peer-to-Peer (P2P) systems—setting free from any structural
constraints—has put forward an appropriate paradigm for sharing a wide assortment of …

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 …

Although anonymizing Peer-to-Peer (P2P) systems often incurs extra traffic costs, many
systems try to mask the identities of their users for privacy considerations. Existing anonymity …

Abstract Service-oriented multi-agent systems are dynamic systems that are populated by
heterogeneous agents. These agents model their functionality as services in order to allow …

Rare event statistics for random walks on complex networks are investigated using the large
deviation formalism. Within this formalism, rare events are realised as typical events in a …

Designing efficient search algorithms is a key challenge in unstructured peer-to-peer
networks. Flooding and random walk (RW) are two typical search algorithms. Flooding …

Although anonymizing Peer-to-Peer (P2P) systems often incurs extra costs in terms of
transfer efficiency, many systems try to mask the identities of their users for privacy …

Peer-to-peer technologies have proven their strength in large-scale resource sharing and
data transfer. Such systems, however, still need to address a variety of issues, including …