Sciweavers

176 search results - page 18 / 36
» Task distribution with a random overlay network
Sort
View
IPPS
2003
IEEE
14 years 29 days ago
A P2P Approach for Global Computing
We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some smallworld characteri...
Wen Dou, Yan Jia, Huaimin Wang, Wen Qiang Song, Pe...
INFOCOM
2007
IEEE
14 years 2 months ago
Queuing Delays in Randomized Load Balanced Networks
—Valiant’s concept of Randomized Load Balancing (RLB), also promoted under the name ‘two-phase routing’, has previously been shown to provide a cost-effective way of implem...
Ravi Prasad, Peter J. Winzer, Sem C. Borst, Marina...
AICT
2006
IEEE
122views Communications» more  AICT 2006»
14 years 1 months ago
Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems
A peer-to-peer file sharing system includes a lookup and a content distribution protocol. Very efficient peer-to-peer protocols exist for content distribution, but efficient in...
Anh-Tuan Gai, Laurent Viennot
TPDS
2010
135views more  TPDS 2010»
13 years 6 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
IPPS
2006
IEEE
14 years 1 months ago
Shubac: a searchable P2P network utilizing dynamic paths for client/server anonymity
A general approach to achieve anonymity on P2P networks is to construct an indirect path between client and server for each data transfer. The indirection, together with randomnes...
A. Brodie, Cheng-Zhong Xu, Weisong Shi