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 条
  • [31] AN EXPANDED SPANNING-TREE PROTOCOL FOR HOME-ORIENTED NETWORK MANAGEMENT
    TAKASHIMA, I
    IKEZAKI, M
    IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, 1991, 37 (03) : 379 - 387
  • [32] Enhancing the performance of service discovery protocol using minimum spanning tree
    Jayapal, Cynthia
    Jayavel, Senthil
    Vanitha, V.
    INTERNATIONAL JOURNAL OF MOBILE COMMUNICATIONS, 2020, 18 (04) : 443 - 461
  • [33] A new agent-based distributed model of grid service advertisement and discovery
    Ma, D
    Zhang, W
    Zhang, HJ
    GRID AND COOPERATIVE COMPUTING, PT 2, 2004, 3033 : 157 - 160
  • [34] A Recursive Distributed Topology Discovery Service for Grid Clients
    Valcarenghi, Luca
    Paolucci, Francesco
    Cugini, Filippo
    Castoldi, Piero
    IEEE COMMUNICATIONS LETTERS, 2009, 13 (07) : 549 - 551
  • [35] Improved Distributed Spanning Tree and Case Study for Replica Location Service
    Wang, Tiejun
    Liu, Heng
    Sun, Ming
    Liu, Zhen
    Zhou, Mingtian
    2010 SECOND INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND APPLICATIONS: ICCEA 2010, PROCEEDINGS, VOL 2, 2010, : 547 - 551
  • [36] Distributed Data Gathering Algorithm Based on Spanning Tree
    Dong, Shi
    Sarem, Mudar
    Zhou, Wengang
    IEEE SYSTEMS JOURNAL, 2021, 15 (01): : 289 - 296
  • [37] A DISTRIBUTED SPANNING TREE ALGORITHM
    JOHANSEN, KE
    JORGENSEN, UL
    NIELSEN, SH
    NIELSEN, SE
    SKYUM, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 312 : 1 - 12
  • [38] GNSD: A novel service discovery mechanism for grid environment
    Tao, Yongcai
    Jin, Hai
    Shi, Xuanhua
    Qi, Li
    INTERNATIONAL CONFERENCE ON NEXT GENERATION WEB SERVICES PRACTICES, PROCEEDINGS, 2006, : 17 - +
  • [39] The Distributed Spanning Tree Structure
    Dahan, Sylvain
    Philippe, Laurent
    Nicod, Jean-Marc
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (12) : 1738 - 1751
  • [40] Service Discovery based on Tree Structure
    Chen, Wuhui
    Paik, Incheon
    Kang, Daeyong
    Tanaka, Takazumi
    4TH INTERNATIONAL CONFERENCE ON AWARENESS SCIENCE AND TECHNOLOGY (ICAST 2012), 2012, : 263 - 268