Market-based control: a paradigm for distributed resource allocation
Market-based control: a paradigm for distributed resource allocation
Dynamic parallel access to replicated content in the internet
IEEE/ACM Transactions on Networking (TON)
Dynamic Load Balancing on Web-Server Systems
IEEE Internet Computing
Lessons from Giant-Scale Services
IEEE Internet Computing
Distributed Auction Servers Resolving Winner and Winning Bid without Revealing Privacy of Bids
ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops
TURBO: an autonomous execution environment with scalability and load balancing features
DIS '06 Proceedings of the IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications
Perils of transitive trust in the domain name system
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Future Generation Computer Systems
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Resource allocation in decentralised computational systems: an evolutionary market-based approach
Autonomous Agents and Multi-Agent Systems
A diversity dilemma in evolutionary markets
Proceedings of the 13th International Conference on Electronic Commerce
| Hi-index | 0.00 |
In future massively distributed service-based computational systems, resources will span many locations, organisations and platforms. In such systems, the ability to allocate resources in a desired configuration, in a scalable and robust manner, will be essential. We build upon a previous evolutionary market-based approach to achieving resource allocation in decentralised systems, by considering heterogeneous providers. In such scenarios, providers may be said to value their resources differently. We demonstrate how, given such valuations, the outcome allocation may be predicted. Furthermore, we describe how the approach may be used to achieve a stable, uneven load-balance of our choosing. We analyse the system's expected behaviour, and validate our predictions in simulation. Our approach is fully decentralised; no part of the system is weaker than any other. No cooperation between nodes is assumed; only self-interest is relied upon. A particular desired allocation is achieved transparently to users, as no modification to the buyers is required.