Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On Fully Decentralized Resource Discovery in Grid Environments
GRID '01 Proceedings of the Second International Workshop on Grid Computing
Virtual and Dynamic Hierarchical Architecture for E-Science Grid
International Journal of High Performance Computing Applications
A workflow portal supporting multi-language interoperation and optimization: Research Articles
Concurrency and Computation: Practice & Experience - Workshop on Grid Computing Portals (GCE 2005)
Production Rule Based Selection Decision for Dynamic Flexible Workflow
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
Dynamic service selection in workflows using performance data
Scientific Programming - Dynamic Computational Workflows: Discovery, Optimization and Scheduling
Framework for Workflow Parallel Execution in Grid Environment
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
DNS-Based discovery system in service oriented programming
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
VIRGO: virtual hierarchical overlay network for scalable grid computing
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
| Hi-index | 0.00 |
Resource discovery plays an important role on scientific workflows in large scalable network environment. This paper presents a resource discovery framework based on VIRGO P2P Distributed DNS. With the convention of resource name as the format--- functionscheme":"global-hier-part"/"local-name, this framework supports flexible queries using partial keywords and wildcards, and range queries by a SQL-like query statement. The global-hier-part is managed by registers the same as DNS servers except the extension of RRs. The DNS servers construct n-tuple overlay virtual hierarchical overlay network of VIRGO. With cached addresses of DNS servers, the overload of traffic in tree structure can be avoided. The time complexity, space complexity and message-cost of lookup with this framework is O(L), where L is the number of sub domains in Domain Name.