browsing and overlay routing. While these applications often cite social network connectivity statistics to support their designs, researchers in psychology and sociology have repeatedly cast doubt on the practice of inferring meaningful relationships from social network connections alone. This leads

Abstract — In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access

Although the concept of application layer overlay routing has received much attention lately, there has been little focus on the “coexistence” and “interaction ” of overlays on top of the same physical network. In this paper, we show that when each overlay plays the optimal routing strategy so

the implications of our findings on related issues such as choosing an access provider and optimizing routes through the network. We believe that these results could be valuable in guiding the design of future network services, such as overlay routing, in terms of which links or paths to avoid (and how to avoid

in the underlying network, this view can become inconsistent, causing unstable overlay behavior and, worse, allowing more than one node to assume re-sponsibility for ranges of keys. We present a set of techniques for preventing in-consistencies under routing anomalies, and we propose to adopt strategies from mobile

the implications of our study on the design of path probing process in overlay networks and examine strategies to reduce the impact of race conditions.

network topologies connecting all nodes that offer promising properties in terms of excellent communication quality. We exploit the underlying network locality and proximity of the nodes for overlay routing and node placement strategy. In this paper, we describe in greater specific details our network

routing algorithms. Designing routing algorithms for wireless ad hoc networks is an extremely challenging task and still research in progress. In this paper, we mostly focus on the simpler question of how to maintain an overlay network of wireless links between the hosts so that, as a minimum requirement

To share and exchange the files among Internet users, Peer-to-Peer (P2P) applications build another layer of overlay networks on top of the Internet Infrastructure. In P2P file sharing systems, a file request takes two steps. First, a routing message is generated by the client (request initiator

about implications of movement models on the performance of VDTNs applied to rural scenarios, leading to insights for future routing algorithm theoretic study and protocol design.