Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar