IDEAS home Printed from https://ideas.repec.org/a/igg/jdst00/v2y2011i3p19-36.html
   My bibliography  Save this article

Defining Minimum Requirements of Inter-Collaborated Nodes by Measuring the Weight of Node Interactions

Author

Listed:
  • Stelios Sotiriadis

    (University of Derby, UK)

  • Nik Bessis

    (Edge Hill University, UK)

  • Ye Huang

    (University of Fribourg, Switzerland)

  • Paul Sant

    (University of Bedfordshire, UK)

  • Carsten Maple

    (University of Bedfordshire, UK)

Abstract

This paper focuses on defining the minimum requirements to support the inter-cooperation between various scales, dynamically evolved Virtual Organizations (VOs). This proposed method is able to assign a weighted value to each pair-wise path that each member (node) can select in order to locate neighbouring nodes according to their preferences. The method also takes into account the communication overhead between each node interaction. The weight of each path is to be measured by the analysis of prerequisites in order to achieve a mutually agreed interaction between nodes. Requirements are defined as the least parameters or conditions that a node needs to achieve in order to determine its accessibility factor. The motivation behind this work is the vision of the Critical Friends Community model, which is a suitable topology for interoperable grid environments. The topology suggests that capturing inter-cooperated nodes interactions that can be publicly available could lead to knowledge of neighbouring VO members which, in turn, could be used for facilitating a more effective resource discovery and selection decision.

Suggested Citation

  • Stelios Sotiriadis & Nik Bessis & Ye Huang & Paul Sant & Carsten Maple, 2011. "Defining Minimum Requirements of Inter-Collaborated Nodes by Measuring the Weight of Node Interactions," International Journal of Distributed Systems and Technologies (IJDST), IGI Global, vol. 2(3), pages 19-36, July.
  • Handle: RePEc:igg:jdst00:v:2:y:2011:i:3:p:19-36
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdst.2011070102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jdst00:v:2:y:2011:i:3:p:19-36. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.