Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A computational framework for the 3D structure determination of viruses with unknown symmetry
Journal of Parallel and Distributed Computing - High-performance computational biology
A Self-Organizing Flock of Condors
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid
Future Generation Computer Systems - Special issue: Advanced grid technologies
YAES: a modular simulator for mobile networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Cluster Computing on the Fly: resource discovery in a cycle sharing peer-to-peer system
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
n-Cycle: a set of algorithms for task distribution on a commodity grid
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
A super-peer model for resource discovery services in large-scale Grids
Future Generation Computer Systems
Towards new load-balancing schemes for structured peer-to-peer grids
Future Generation Computer Systems
Dynamic mapping of cooperating tasks to nodes in a distributed system
Future Generation Computer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
We consider a model where commodity service providers are offering commodity computational services to a set of customers. We provide a solution for the efficient distribution of tasks by forwarding the service requests on an overlay network comprised on random cycles. We introduce algorithms for the creation, maintenance and repair of the overlay network. We discuss two algorithms, random wandering and weighted stochastic forwarding, for the allocation of the tasks to providers. Both approaches are highly scalable because the algorithms use only limited local information. As we are designing our approach for use in a commercial setting, there is a requirement that the tasks, being a source of profits, be allocated fairly to the providers. We investigate the fairness of the algorithms and show that adding a random pre-walk can improve the fairness. Through a simulation study we show that the approach provides efficient task allocation on networks loaded up to 95% of their capacity.