Reuse Frequency as Metric for Dependency Resolver Selection

  • Karl Pauls
  • Till G. Bay
Conference paper

DOI: 10.1007/11590712_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3798)
Cite this paper as:
Pauls K., Bay T.G. (2005) Reuse Frequency as Metric for Dependency Resolver Selection. In: Dearle A., Eisenbach S. (eds) Component Deployment. CD 2005. Lecture Notes in Computer Science, vol 3798. Springer, Berlin, Heidelberg

Abstract

The demand for component and service discovery engines to use in extensible applications is surging. No one so far has devoted much effort to metrics that aid selecting among different resolvers of the same dependency. This paper defines the Reuse Frequency: a metric that relates components or services to each other and measures their relative importance. Additionally, the ComponentGraph is presented that builds the averaged dependency graph of entities augmented with their popularity and the likelihood of each possible dependency resolver. The Reuse Frequency targets all scenarios where entities have dependencies on each other and a metric for the measurement of their relative importance is needed; the target implementation environment of the ComponentGraph is the Open Service Gateway Initiative framework, but the concepts are applicable to component or service repositories in general.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Karl Pauls
    • 1
  • Till G. Bay
    • 2
  1. 1.Fachbereich Mathematik und InformatikFreie Universität BerlinBerlinGermany
  2. 2.Eidgenössische Technische Hochschule Zürich, Chair of Software EngineeringETH ZentrumZürichSwitzerland

Personalised recommendations