Sciweavers

176 search results - page 10 / 36
» Task distribution with a random overlay network
Sort
View
SPAA
2004
ACM
14 years 1 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
COLCOM
2005
IEEE
14 years 1 months ago
Symbiotic multi-path routing with attractor selection
In this paper we discuss the effects of symbiosis when using an attractor selection model for multi-path routing in an overlay network. Attractor selection is a biologically inspi...
Kenji Leibnitz, Naoki Wakamiya, Masayuki Murata
P2P
2010
IEEE
207views Communications» more  P2P 2010»
13 years 6 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
ICDCS
2005
IEEE
14 years 1 months ago
On Cooperative Content Distribution and the Price of Barter
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...
Prasanna Ganesan, Mukund Seshadri
IPPS
2006
IEEE
14 years 1 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang