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 条
  • [41] Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms
    Wu, Ro-Yu
    Tseng, Cheng-Chia
    Hung, Ling-Ju
    Chang, Jou-Ming
    COMBINATORIAL OPTIMIZATION (ISCO 2022), 2022, 13526 : 201 - 211
  • [42] APPLICATION OF THE MINIMUM-WEIGHT SPANNING-TREE ALGORITHM TO ASSIGNMENT OF COMMUNICATION FACILITIES
    STRAKHOV, NA
    BELL SYSTEM TECHNICAL JOURNAL, 1983, 62 (08): : 2581 - 2602
  • [43] Distributed discovery of semantic grid service using semantic clustering of service ontologies
    Rajagopal, Sudha
    Sridevi, S.
    Rajagopalan, M. R.
    Selvi, S. Thamarai
    TENCON 2007 - 2007 IEEE REGION 10 CONFERENCE, VOLS 1-3, 2007, : 1528 - +
  • [44] Spanning Tree Bounds for Grid Graphs
    Tapp, Kristopher
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (01):
  • [45] Distributed Minimum Spanning Tree based Information Exchange Policy for Distributed Systems
    Alam, Taj
    Raza, Zahid
    2016 FOURTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND GRID COMPUTING (PDGC), 2016, : 84 - 89
  • [46] APPLICATION OF THE MINIMUM-WEIGHT SPANNING-TREE ALGORITHM TO ASSIGNMENT OF COMMUNICATION FACILITIES.
    Strakhov, N.A.
    1600, (62):
  • [47] Using Carry Increment Adders to Enhance Energy Savings with Spanning-Tree Adder Structures
    Price, Kyle
    Stine, James E.
    2019 IEEE 62ND INTERNATIONAL MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS (MWSCAS), 2019, : 223 - 226
  • [48] A grid service-based Distributed Network Simulation Environment for computer networks education
    Bote-Lorenzo, Miguel L.
    Asensio-Perez, Juan I.
    Gomez-Sanchez, Eduardo
    Vega-Gorgojo, Guillermo
    Alario-Hoyos, Carlos
    COMPUTER APPLICATIONS IN ENGINEERING EDUCATION, 2012, 20 (04) : 654 - 665
  • [49] The Distributed Minimum Spanning Tree Problem
    Schmid, Stefan
    Pandurangan, Gopal
    Robinson, Peter
    Scquizzato, Michele
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2018, (125): : 51 - 80
  • [50] Confidence-based grid service discovery
    Derbal, Youcef
    INTERNATIONAL JOURNAL OF WEB AND GRID SERVICES, 2008, 4 (02) : 189 - 210