Close category search window
 

A Hybrid Resource Information Dissemination Protocol for dynamic Grids

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Garudadri, R. ; Dept. of Comput. Sci. & Eng., Motilal Nehru Nat. Inst. of Technol., Allahabad, India ; Kant, K.

Grids now-a-days comprise of individual resources. These types of grids are called dynamic grids. The centralized grid services are being gradually replaced by distributed and scalable algorithms. One such grid service is dissemination of resource information (DRI) state among the nodes. Every node in a dynamic grid has resource information associated with it. There are different methods proposed for DRI. High message overhead and low percentage of dissemination is experienced in DRI. In order to improve upon these problems a Hybrid Resource Information Dissemination Protocol has been presented. This protocol uses two kinds of links among the nodes, namely, bidirectional links and random links to disseminate the resource information proactively. Bidirectional links are used to transfer the resource information mutually among the nodes and random links are the unidirectional links used for DRI to random neighbors of a node. Each node disseminates the resource information to predefined number of neighbors, including all the neighbors connected by bidirectional links, which is decided by fanout capability of a node. In addition to dissemination, this protocol adapts to dynamic environments, so as to get the resource information of newly joined neighbors. Initially, all the nodes are connected by random links. In the process of dissemination, based on the strong connectivity of the nodes, the random links among the nodes may be converted to bidirectional links, decreasing the message overhead considerably at the same time increasing the percentage of dissemination.

Published in:
Networks, 2008. ICON 2008. 16th IEEE International Conference on

Date of Conference: 12-14 Dec. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.