Improved Rerouting Table for Resource Discovery in Grid
The grid technology enables sharing and collaboration of heterogeneous and geographically distributed resources. Resource Discovery has an important role in Grid. It allows the system to be aware of which resources are available and which have been added to system. Finding an algorithm that can prov...
Gespeichert in:
Veröffentlicht in: | International journal of advancements in computing technology 2012-01, Vol.4 (1), p.415-423 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The grid technology enables sharing and collaboration of heterogeneous and geographically distributed resources. Resource Discovery has an important role in Grid. It allows the system to be aware of which resources are available and which have been added to system. Finding an algorithm that can provide a user's need with low traffic and low cost, is an important task in resource discovery. Several mechanisms have been proposed for solving resource discovery problem during the past years. One of them is routing table mechanism. Since the Grid is a dynamic environment, the proposed model must consider this issue, and resources must be able to be in two states: on or off. In the previous proposed algorithms, by turning on or off a single resource, all available routers need to be checked for updating. That results the growth of traffic and system overloading. In this paper, we suggest a radius for updating the tables which does not affect the whole system. So, it reduces the extra traffic and hop counts for updating the system. We compare our algorithm with previous algorithms. Results of simulations show that the number of hops for updating in our algorithm is less than other algorithms, and also the cost of updating in our proposed algorithm is low. |
---|---|
ISSN: | 2005-8039 2233-9337 |
DOI: | 10.4156/ijact.vol4.issue1.47 |