A Model and Algorithm for Self-Adaptation in Service-Oriented Systems

Free registration required

Executive Summary

In this paper, the authors address the problem of self-adaptation in internet-scale service-oriented systems. Services need to adapt by selecting the best neighboring services solely based on local, limited information. In such complex systems, the global significance of the various selection parameters dynamically changes. They introduce a novel metric measuring the distribution and potential impact of service properties affecting such selection parameters. They further present a formalism identifying the most significant properties based on aggregated service interaction data. They ultimately provide a ranking algorithm exploiting these dynamic interaction characteristics.

  • Format: PDF
  • Size: 396.2 KB