By Topic

Stream assignment for grid network with joint communication and computation constraints

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
$33 $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)
J. I. Khan ; Res. Lab. for Media Commun. & Networking, Kent State Univ., OH, USA ; K. Palanisamy

Dynamic assignment of complex applications' resource need on a dynamically aggregated computing infrastructure assembled via a network is central to autonomic grid computing and several other netcentric computing paradigms. In this paper we present an algorithm for active flow assignment in autonomic grid system. Active flow refers to the case where the bandwidth requirement between the flow processing elements can change due to active transformation/processing of the flow. We present the algorithm with the help of a dynamically deployable video grid application that is capable of negotiating local network state based rate and let the stream propagate over, grid network with highly asymmetric link and node capacities with minimum delay involved, in two diverse models, MISD and SIMD. The algorithm uses network connectivity graph factorization and thus adheres to the hierarchical nature of the autonomous networks

Published in:

2nd International Conference on Broadband Networks, 2005.

Date of Conference:

7-7 Oct. 2005