• DocumentCode
    2076259
  • Title

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

  • Author

    Sotiriadis, Stelios ; Bessis, Nik ; Huang, Ye ; Sant, Paul ; Maple, Carsten

  • Author_Institution
    Dept. of Comput. Sci. & Technol., Univ. of Bedfordshire, Luton, UK
  • fYear
    2010
  • fDate
    15-18 Feb. 2010
  • Firstpage
    291
  • Lastpage
    298
  • Abstract
    In this paper we are focusing on the minimum requirements to be addressed in order to demonstrate a inter-node communication within a Virtual Organisation (VO) using the method of Self-led Critical Friends (SCF). The method is able to decide paths that a node can choose in order to locate neighbouring nodes by aiming at realizing the overhead of each communication. The weight of each path will be measured by the analysis of prerequisites in order to achieve the interaction between nodes. We define requirements as the least fundamentals that a node needs to achieve in order to determine its accessibility factor. The information gathered from an interaction is then stored in a snapshot, a profile that is made available during the discovery stage.
  • Keywords
    graph theory; grid computing; groupware; virtual enterprises; inter-collaborated node communication; node interactions measurement; self-led critical friends; virtual organisation; Communication system software; Competitive intelligence; Complex networks; Computer science; Graph theory; Informatics; Resource management; Software measurement; Software systems; Weight measurement; Graph Theory; Grid Technology; Metadata Snapshot Profile; Self-led Critical Friends;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Complex, Intelligent and Software Intensive Systems (CISIS), 2010 International Conference on
  • Conference_Location
    Krakow
  • Print_ISBN
    978-1-4244-5917-9
  • Type

    conf

  • DOI
    10.1109/CISIS.2010.84
  • Filename
    5447439