www.studymafia.

org
Seminar
On
Rain
Technology

Submitted To: Submitted By:

www.studymafia.org www.studymafia.org
 Introduction
 Goal of Technology
 Architecture
 Features
 Advantages
 Applications
 Future Scope
 Conclusion
 Reference
 The name of the original research project is RAIN which
stand’s for Reliable Array of Independent Nodes. The RAIN
technology originated in a research project at the California
Institute of Technology (Caltech),in collaboration with
NASA’s Jet Propulsion Laboratory and the Defense Advanced
Research Projects Agency (DARPA).

I. A component that stores data across distributed processors

and retrieves it even if some of the processors fail.
II. A communications component that creates a redundant
network between multiple processors and supports a single,
uniform way of connecting to any of the processors.
III. A computing component that automatically recovers and
restarts applications if a processor fails
 RAIN Technology is able to offer the solution
by minimizing number of nodes in the chain
connecting the client and server.

 RAIN Technology making the exiting nodes

more robust and independent of each other.

 RAIN Technology provides the feature of

replacing a faulty node by a healthy one.
 Communication

 Group Membership

 Data Storage
 The Problem

How to connect n computing nodes in a ring of n switches?

 In this approach, we connect all the nodes to the nearest switch.
 A ring is 1-fault tolerant so, we can loose 1 switch without upset.
 A 2nd switch is failure can partition the network.
 Here the nodes are connected to switches that are maximum
distance apart from each other which is diameter in ring.
Diameter construction with nodes of degree 2 connected to n
switches of degree 4 can tolerate 3 fault without partitioning
the network. Which is optimal.

Diameter construction for n (a) odd (b) even

 The main function of group member is to tolerate the fault.
 Group member ensure that all processes maintain a consistent
view of global membership.
Token Mechanism:
 Fault tolerance in data storage across many
disks is obtained using redundant storage
schemes. Novel error-correcting codes have
been developed for this purpose. These are
array codes that encode and decode using
simple XOR operations.
 There is no limit on the size of a RAIN cluster.
 There is no concept of master-slave relation.
 A RAIN cluster can tolerate multiple node failure.
 This is highly efficiency in traffic management.
 New node can be added into the cluster to participate in
load sharing.
 It work with many different intermit application.
 High Availability Video Server
 High Availability Web Server
 Distributed Check pointing Mechanism
 Development of API’s for using the various building
blocks.

 The implementation of a real distributed file system

using the partitioning scheme developed here.

 The group communication protocols are being extended

to address more challenging scenarios.
 The goal of the RAIN project has been to build a test-bed for
various building blocks that address fault management

 Communication and storage in a distributed environment.

 The creation of such building blocks is important for the

development of a fully functional distributed computing
system.
 www.studymafia.org
 www.wikipedia.com
 www.google.com