The distributed spanning-tree based service discovery in grid environment

被引:0
|
作者
Song, Xiao-Hua [1 ]
Cao, Yuan-Da [1 ]
Huang, He-Qing [1 ]
机构
[1] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing 100081, Peoples R China
关键词
distributed spanning-tree; delegation node; election algorithm; parallel searching; survivability;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the dynamic and heterogeneous characteristics of resources in grid environment, efficient service discovery becomes a challenging issue. In this paper, we propose a service discovery approach based on the distributed spanning-tree architecture. According to this architecture, we arrange the grid resources in such a hierarchical way as IS layer, Institution layer, Organization layer and Domain layer in turn. Any member at the same layer is equivalent. Only IS layer and Institution layer have real resource entities while other layers over them are overlays to cluster the resource information onto their own Delegation Nodes (DN). These DNs have the Resource Index and can locate the query route. Hence, query message traffic is sharply decreased depending on the DN's locating of query routes. Every Institution in grid owns a global unique ID according to the coding mechanism. Based on this, the parallel searching process can be synchronously implemented among peer nodes, which improves the efficiency dramatically. Caching and Collaboration Units techniques are adopted to increase the efficiency of service discovery. The DN can be replaced by the new elected one when it fails which ensures the survivability of the system. Performance evaluation shows that our approach achieves a good efficiency, scalability, survivability and adaptability.
引用
收藏
页码:2379 / +
页数:2
相关论文
共 50 条
  • [1] Randomized Lower Bound for Distributed Spanning-Tree Verification
    Izumi, Taisuke
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2014, 2014, 8576 : 137 - 148
  • [2] Spanning-Tree Based Coverage for a Tethered Robot
    Peng, Xiao
    Schwarzentruber, Francois
    Simonin, Olivier
    Solnon, Christine
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2025, 10 (02): : 1888 - 1895
  • [3] Generalization of the spanning-tree technique
    Suuriniemi, S
    Tarhasaari, T
    Kettunen, L
    IEEE TRANSACTIONS ON MAGNETICS, 2002, 38 (02) : 525 - 528
  • [4] Spanning-tree based coverage of continuous areas by a mobile robot
    Gabriely, Y
    Rimon, E
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2001, 31 (1-4) : 77 - 98
  • [5] Research of undirected network capacity expansion based on the spanning-tree
    Liu, Yuhua
    Xu, Kaihua
    Huang, Hao
    Teng, Wei
    SIMULATED EVOLUTION AND LEARNING, PROCEEDINGS, 2006, 4247 : 228 - 235
  • [6] Spanning-tree based coverage of continuous areas by a mobile robot
    Yoav Gabriely
    Elon Rimon
    Annals of Mathematics and Artificial Intelligence, 2001, 31 : 77 - 98
  • [7] Spanning-tree based autoconfiguration for mobile ad hoc networks
    Longjiang Li
    Yunze Cai
    Xiaoming Xu
    Wireless Personal Communications, 2007, 43 : 1465 - 1477
  • [8] A lattice spanning-tree entropy function
    Glasser, ML
    Lamb, G
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2005, 38 (25): : L471 - L475
  • [9] Spanning-tree based coverage of continuous areas by a mobile robot
    Gabriely, Y
    Rimon, E
    2001 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS I-IV, PROCEEDINGS, 2001, : 1927 - 1933
  • [10] Spanning-tree based autoconfiguration for mobile ad hoc networks
    Li, Longjiang
    Cai, Yunze
    Xu, Xiaoming
    WIRELESS PERSONAL COMMUNICATIONS, 2007, 43 (04) : 1465 - 1477