Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
Location Independent Remote Execution in NEST
IEEE Transactions on Software Engineering
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Paradigms for process interaction in distributed programs
ACM Computing Surveys (CSUR)
Heuristic methods for dynamic load balancing in a message-passing multicomputer
Journal of Parallel and Distributed Computing
Challenger: a multi-agent system for distributed resource allocation
AGENTS '97 Proceedings of the first international conference on Autonomous agents
IEEE Spectrum
Modern Operating Systems
A Roadmap of Agent Research and Development
Autonomous Agents and Multi-Agent Systems
The Self-Serv Environment for Web Services Composition
IEEE Internet Computing
Evaluating the Performance of Middleware Load Balancing Strategies
EDOC '04 Proceedings of the Enterprise Distributed Object Computing Conference, Eighth IEEE International
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
CORBA: integrating diverse applications within distributed heterogeneous environments
IEEE Communications Magazine
| Hi-index | 0.00 |
Highly competitive and open environments should encompass mechanisms that will assist Service Providers (SPs) in accounting for their interests, i.e., offering at a given period of time the adequate quality services in a cost-efficient manner. Assuming that a user wishes to access a specific service composed of a distinct set of service tasks, which can be served by various Candidate Service Nodes (CSNs), a problem that should be addressed is the assignment of service tasks to the most appropriate service nodes. The pertinent problem is concisely defined, optimally formulated and evaluated through simulation experiments on a real network test bed.