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

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.

A Resource Discovery Architecture of Loosely Coupled Grid Inter-cooperated Virtual Organisations Using Mobile Agents and Neural Networks

“…Three types of agreements are expected to be utilized after an inter-collaboration occurs. In [1] we have classified agreements as clique contracts, SCF contracts, and reference to the SCFs contracts, which are stored within a node's public profile. First, the clique contracts are agreements signed from the internal VO nodes and their functionality is to arrange interactions for newly added nodes to the clique.…”

“…Each node has a specific topological position and it is a vector of x,y coordinates in the lattice. So a vector consists of a training set S, which are the nodes and each one with a corresponding weight value W. So the input set is comprised as in (1). S = (s 1 , s 2 , s 3 , ..., s n )…”

“…In a rational way, node communication is achieved firstly, by attaining policies, followed by pairing knowledge background, and finally, by physical resource and time information coupling [1]. It is essential that by utilizing SCFs we aim to create a neighbourhood of nodes in which communication occurs from one node to another.…”