A Recursive Distributed Topology Discovery Service for Grid Clients

被引:2
作者
Valcarenghi, Luca [1 ]
Paolucci, Francesco [1 ]
Cugini, Filippo [2 ]
Castoldi, Piero [1 ]
机构
[1] Scuola Super Sant Anna, Pisa, Italy
[2] CNIT, Pisa, Italy
关键词
Grid computing; network discovery; network tomography; recursive exploration;
D O I
10.1109/LCOMM.2009.090651
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Distributed application (e.g., grid-enabled application) performance can be improved by complementing the computational resource information advertised to the clients with network information (e.g., topology and link capacity). In this way, clients may choose the jointly optimal resources. This study focuses on how to provide clients with network information. The proposed method, namely the Recursive Distributed Topology Discovery Service (RD-TDS), utilizes a selected set of distributed beacons (i.e., measurement points) for network discovery. Each RD-TDS beacon recursively probes nodes that it has not discovered during its previous exploration steps but that have been discovered by other beacons. The exploration ends when each beacon does not have any new node to probe. The RD-TDS evaluation confirms the expected advantage of such method: closely approximating the full topology discovery with a limited number of active beacons. In addition, the proposed method rationale can be easily applied to many current network exploration tools.
引用
收藏
页码:549 / 551
页数:3
相关论文
共 9 条
  • [1] BEJERANO Y, 2006, IEEE T NETWORKING, V14
  • [2] Crovella M., 2006, Internet Measurement: Infrastructure, Traffic & Applications
  • [3] DONNET B, 2007, IEEE COMMUN SURVEYS, V9
  • [4] Ficara D, 2007, GLOB TELECOMM CONF, P2591
  • [5] GUILLAUME JL, 2006, COMPUTER NETWORKS, V50
  • [6] JIN X, 2008, IEEE T PARALLEL DIST, V19
  • [7] KUCHAR A, P IEEE ICTON 2004
  • [8] MICHAUT F, 2005, IEEE COMMUN SURVEYS, V7
  • [9] Topology discovery services for monitoring the global grid
    Valcarenghi, L
    Foschini, L
    Paolucci, F
    Castoldi, P
    Cugini, F
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2006, 44 (03) : 110 - 117