An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
We study the problem of offering publish/subscribe functionality on top of structured overlay networks using data models and languages from IR. We show how to achieve this by ext...
— Grido is an architecture that targets a network operator intending to provide enhanced services to its customers. This is achieved by setting up a “backbone” overlay networ...
Shirshanka Das, Alok Nandan, Michael G. Parker, Gi...
Simultaneous overlay networks compete for network resources and disrupt each other. If they cooperate with each other, the collective performance can be improved and they can coex...
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have r...
Karl Aberer, Luc Onana Alima, Ali Ghodsi, Sarunas ...
— Recently, overlay networks have emerged as a means to enhance end-to-end application performance and availability. Overlay networks attempt to leverage the inherent redundancy ...
— In this paper, we propose a cost-based model to evaluate the resources that each node has to contribute for participating in an overlay network. Such a cost model allows to gau...
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
By allowing end hosts to make routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multip...
We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...