Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
Ant-based load balancing in telecommunications networks
Adaptive Behavior
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Blueprints for high availability: designing resilient distributed systems
Blueprints for high availability: designing resilient distributed systems
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A taxonomy and survey of grid resource management systems for distributed computing
Software—Practice & Experience
From insect to Internet: Situated control for networked robot teams
Annals of Mathematics and Artificial Intelligence
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
The Small-World Phenomenon: An Algorithmic Perspective
The Small-World Phenomenon: An Algorithmic Perspective
Self-Organizing Control in Plantetary-Scale Computing
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Service-Centric Globally Distributed Computing
IEEE Internet Computing
Messor: load-balancing through a swarm of autonomous agents
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
Application service placement in stochastic grid environments using learning and ant-based methods
Multiagent and Grid Systems - Special Issue on Nature inspired systems for parallel, asynchronous and decentralised environments
Network-aware service placement and selection algorithms on large-scale overlay networks
Computer Communications
A node placement heuristic to encourage resource sharing in mobile computing
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
| Hi-index | 0.00 |
Motivated by trends in the industry towards transforming IT in large integrated service networks, this paper describes algorithms for the adaptive placement of “services” (as abstractions of collections of applications) in networks of “servers” (as abstractions for locations where services can be hosted). Networks comprised of interacting services as the foundation is also a vision pronounced by the Grid [9]. Manageability and “self-operation” of Grids is highly desirable. We analyze the requirements for algorithms one specific problem: the service placement problem. We discuss algorithms that neither require central control nor complete information about the system state. Algorithms are performed on a distributed overlay structure which summarizes load conditions in the underlying service network. The presented algorithms fulfill tasks of making initial placement decisions as well as initiating rearrangements when imbalance is detected. Presented algorithms have different characteristics regarding the tradeoff between accuracy (or quality) of a placement decision and its timeliness within which a decision can be made determining responsiveness.