—The recently proposed Pocket Switched Network paradigm takes advantage of human social contacts to opportunistically create data paths over time. We examine how effective such a...
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
—In mobile ad hoc networks, solving the standard problems encountered in fixed networks can be challenging because of the unpredictable motion of mobile nodes. Due to the lack o...
In distributed systems that use active replication to achieve robustness, it is important to efficiently enforce consistency among replicas. The nonblocking mode helps to speed u...