Basic Grid Registry configuration – there is not any backup data Grid Registry configuration where every domain has duplicated information Find all services.

Slides:



Advertisements
Similar presentations
Polska Infrastruktura Informatycznego Wspomagania Nauki w Europejskiej Przestrzeni Badawczej Institute of Computer Science AGH ACC Cyfronet AGH The PL-Grid.
Advertisements

CGW14 is Over and What Next CGW14 is Over and What Next Marian Bubak Department of Computer Science and Cyfronet AGH University of Science.
Neighbor Discovery for IPv6 Mangesh Kaushikkar. Overview Introduction Terminology Protocol Overview Message Formats Conceptual Model of a Host.
Routing Indices For Peer-to-Peer Systems Arturo Crespo, Hector Garcia-Molina Stanford ICDCS 2002.
1 Improving the Performance of Distributed Applications Using Active Networks Mohamed M. Hefeeda 4/28/1999.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Internet Control Message Protocol (ICMP)
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
Support for Automatic Workflow Composition in Semantic Grid Environemnt Tomasz Gubała, Marian Bubak, Maciej Malawski Institute of Computer Science and.
A Scalable Content-Addressable Network Authors: S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker University of California, Berkeley Presenter:
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Routing.
Introduction to Dfs. Limits of Dfs 260 characters per file path 32 alternatives per volume 1 Dfs root per server Unlimited Dfs roots per domain Volumes.
Towards auto-scaling in Atmosphere cloud platform Tomasz Bartyński 1, Marek Kasztelnik 1, Bartosz Wilk 1, Marian Bubak 1,2 AGH University of Science and.
Environment for Management of Experiments on the Grid Master of Science Thesis AGH University of Science and Technology, Krakow, Poland Faculty of Electrical.
Advanced Grid-Enabled System for Online Application Monitoring Main Service Manager is a central component, one per each.
1 Version 3.1 modified by Brierley Module 8 TCP/IP Suite Error and Control Messages.
Łukasz Skitał 2, Renata Słota 1, Maciej Janusz 1 and Jacek Kitowski 1,2 1 Institute of Computer Science AGH University of Science and Technology, Mickiewicza.
CH2 System models.
Ad hoc On-demand Distance Vector (AODV) Routing Protocol ECE 695 Spring 2006.
T.Jadczyk, Bioinformatics Applications in the Virtual Laboratory Bioinformatics Applications in the Virtual Laboratory Tomasz Jadczyk AGH University of.
In each iteration macro model creates several micro modules, sends data to them and waits for the results. Using Akka Actors for Managing Iterations in.
A Proposal of Application Failure Detection and Recovery in the Grid Marian Bubak 1,2, Tomasz Szepieniec 2, Marcin Radecki 2 1 Institute of Computer Science,
Cracow Grid Workshop, October 27 – 29, 2003 Institute of Computer Science AGH Design of Distributed Grid Workflow Composition System Marian Bubak, Tomasz.
Experience with the OpenStack Cloud for VPH Applications Jan Meizner 1, Maciej Malawski 1,2, Piotr Nowakowski 1, Paweł Suder 1, Marian Bubak 1,2 AGH University.
A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
DataNet – Flexible Metadata Overlay over File Resources Daniel Harężlak 1, Marek Kasztelnik 1, Maciej Pawlik 1, Bartosz Wilk 1, Marian Bubak 1,2 1 ACC.
High Level Architecture (HLA)  used for building interactive simulations  connects geographically distributed nodes  time management (for time- and.
1 Detecting and Reducing Partition Nodes in Limited-routing-hop Overlay Networks Zhenhua Li and Guihai Chen State Key Laboratory for Novel Software Technology.
Engineering Workshops Purposes of Neighbor Solicitation.
EC-project number: Universal Grid Client: Grid Operation Invoker Tomasz Bartyński 1, Marian Bubak 1,2 Tomasz Gubała 1,3, Maciej Malawski 1,2 1 Academic.
EC-project number: ViroLab Virtual Laboratory Marian Bubak ICS / CYFRONET AGH Krakow virolab.cyfronet.pl.
AKOGRIMO Integration of Grid services with mobile technologies; validation in e-health, e-learning and disaster management areas CoreGRID European Grid.
Error and Control An IP datagram travels from node to node on the way to its destination Each router operates autonomously Failures or problems may occur.
1 An Error Reporting Mechanism (ICMP). 2 IP Semantics IP is best-effort Datagrams can be –Lost –Delayed –Duplicated –Delivered out of order –Corrupted.
1 Chapter 23 Internetworking Part 3 (Control Messages, Error Handling, ICMP)
Cooperative experiments in VL-e: from scientific workflows to knowledge sharing Z.Zhao (1) V. Guevara( 1) A. Wibisono(1) A. Belloum(1) M. Bubak(1,2) B.
Freenet “…an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity.
Research of P2P Architecture based on Cloud Computing Speaker : 吳靖緯 MA0G0101.
High Level Architecture (HLA)  used for building interactive simulations  connects geographically distributed nodes  time management (for time- and.
An Efficient Quorum-based Fault- Tolerant Approach for Mobility Agents in Wireless Mobile Networks Yeong-Sheng Chen Chien-Hsun Chen Hua-Yin Fang Department.
Marian Bubak 1,2, Włodzimierz Funika 1,2, Roland Wismüller 3, Tomasz Arodź 1,2, Marcin Kurdziel 1,2 1 Institute of Computer Science, AGH, Kraków, Poland.
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Maintaining and Updating Windows Server 2008 Lesson 8.
1 Chapter 23 Internetworking Part 3 (Control Messages, Error Handling, ICMP)
Internet Control Message Protocol (ICMP)
Internet Control Message Protocol (ICMP)
Demo of the Model Execution Environment WP2 Infrastructure Platform
Demo of the Model Execution Environment WP2 Infrastructure Platform
Model Execution Environment for Investigation of Heart Valve Diseases
Internet Control Message Protocol (ICMP)
21-2 ICMP(Internet control message protocol)
DICE - Distributed Computing Environments Team
COMPUTER NETWORKS CS610 Lecture-33 Hammad Khalid Khan.
Byungchul Park ICMP & ICMPv DPNM Lab. Byungchul Park
Routing.
Internet Control Message Protocol (ICMP)
Internet Control Message Protocol (ICMP)
Internet Control Message Protocol (ICMP)
Internet Control Message Protocol Version 4 (ICMPv4)
COS 561: Advanced Computer Networks
A Semantic Peer-to-Peer Overlay for Web Services Discovery
Routing.
H2020 EU PROJECT | Topic SC1-DTH | GA:
A Survey of Interactive Execution Environments
H2020 EU PROJECT | Topic SC1-DTH | GA:
Presentation transcript:

Basic Grid Registry configuration – there is not any backup data Grid Registry configuration where every domain has duplicated information Find all services solving TSP problem Marian Bubak 1,2, Cezary Górka 1, Marek Kasztelnik 1, Maciej Malawski 1,2, Tomasz Gubała 2 1 Institute of Computer Science AGH, Mickiewicza 30, Kraków, Poland 2 Academic Computer Centre CYFRONET, Nawojki 11, Kraków, Poland Building applications using Web or Grid services has become increasingly popular A user connects services into the workflow to perform needed computation There has to be a registry storing information about Web or Grid services (Grid Registry) Need of a fault-tolerant version of the Grid Registry For fault tolerance data stored in registry has to be redundant If data are duplicated, a synchronization mechanism is needed M. Bubak, T. Gubala, M. Kapałka, M. Malawski, K. Rycerz, Workflow composer and service registry for grid applications, Future Generation Computer Systems, vol. 21, no. 1, 2005, pp stores information about Web and Grid services (syntactic, semantic and human-readable description) distributed, scalable Grid-enabled The system is composed of single nodes Initial registry configuration. User can ask registry about information from Mathematics, Mathematics : Algebra and Mathematics : Discrete Mathematics domains Information stored in domain Mathematics : Algebra is duplicated Echo messages are sent to ancestors by all the nodes. It provides knowledge about current registry configuration Using Echo mechanism the registry detects that the node AA from domain Mathematics : Algebra crashed Registry reacts to this information – changes in Local Routing Table Query is redirected to backup node (1 – 7) One of the nodes from domain Mathematics : Algebra is still unreachable Administrator still can modify registry configuration (1 - 4) All information stored in registry is available for the user When broken node is repaired, it synchronizes information with the most up to date node from domain (2) All changed entries in Local Routing Table are updated in repaired node (2) If necessary, new connections are established (3) The test shows a comparison between response time depending on number of hops that message has to pass while reaching its destination in prototype and fault-tolerant version of the Grid Registry Before Grid Registry reacts to unreachable nodes, user can send query. Then it can be redirected to broken node. In this case error message is generated and then user's query is redirected to backup node. This test presents such a situation. Response time depends on number of generated error messages Grid Registry can modify its Local Routing Table, so query will not be redirected to broken nodes. Graph presents response time depending on number of broken nodes When broken node becomes reachable, Local Routing Table and XML database have to be synchronized. Test shows synchronization time depending on number of items that have to be synchronized Functionality solving this problem is available in new version of the Grid Registry Every node is a single point of failure this problem could be solved by adding data redundancy Desynchronization of data Overloaded nodes