Obtaining representative and concise I/O workloads for the purpose of projecting the performance of storage systems remains a challenge due to the complex nature of I/O behaviors....
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...