SELF REPAIRING TREE TOPOLOGY

ENABLING CONTENT BASED ROUTING

IN LOCAL AREA NETWORK

�INTRODUCTION:

Content-based routing(CBR) differs from classical routing in that

messages are addressed based on their content instead of their destination. In CBR the

sender simply injects the message in the network, which determines how to route it

according to the nodes’ interests.

This ability is useful in many application scenarios. For instance, in a

stock quote application data procedures can publish stock updates on a CBR network,

which routes them only towards the consumers who subscribed to receive such updates.

Similarly, in a data sharing application repositories can advertise the attributes involved

in the query.

Most systems connect all the brokers(the CBR application-level

routers) in a single tree-shaped network. This broker tree is exploited to forward

messages.

Usually, these are not flooded to the entire tree, but routed towards

the interested components according to the message content and the subscriptions

stored at tree nodes.

CBR fosters a form of implicit communication that breaks the

coupling between senders and receivers. Senders no longer need to determine the

address of communication parties. Similarly, receivers do not know who is the sender

of a message, unless this information is somehow encoded in the message itself.

The sharp decoupling induced by this form of communication enables

one to easily add,remove, or change components at run-time with little impact on the

overall architecture.

Unfortunately, the advantages provided by this interaction model are

not supported by the state of the art of implemented systems. Indeed, the majority of

available CBR systems address scalability and ease of implementation by realizing the

broker tree as an overlay network, whose topology is assumed to be stable.

A requirement that clashes with the reality of dynamic scenarios like

LAN. Therefore, this situation leaves the potential of CBR largely unexploited precisely

in the application scenarios where it would make a huge difference.

�OBJECTIVE:

Content based routing (CBR) provides a powerful and flexible

foundation for distributed applications. Here we present LAN, a protocol to organize

the nodes of a LAN in a tree-shaped network able to

� Self-Repair to tolerate the frequent topological reconfigurations

typical of LAN;

� Achieve this goal through repair strategies that minimize the

changes that may impact the CBR layer exploiting the tree. LAN is

implemented and publicly available.

Here we report about its performance in simulated scenarios as well

as in

real-world experiments. The results confirm that its characteristics

enable reliable and efficient CBR on LAN.

�EXISTING SYSTEM:

Unfortunately, the advantages provided by this interaction

model are not supported by the state of the art of implemented systems.

Indeed, the majority of available CBR systems address

scalability and ease of implementation by realizing the broker tree as an overlay

network, whose topology is assumed to be stable.

A requirement that clashes with the reality of dynamic

scenarios like LAN.

Therefore, this situation leaves the potential of CBR largely

unexploited precisely in the application scenarios where it would make a huge

difference.

�PROPOSED SYSTEM:

This paper overcomes the limitation above by achieving the

following goal :

defining a protocol to organize the nodes of a mobile LAN network in

a single, self-repairing tree that efficiently supports content-based

routing.

The goal of supporting CBR explains the rationale behind

the choice of a tree topology. As already mentioned, most of currently available CBR

protocols adopt this topology for interconnecting brokers, but assume that the tree does

not change.

Therefore, our self-repairing tree enables the reuse of

mainstream CBR protocols in the dynamic scenario characterizing LANs, by leveraging

off the consistent body of results related to tree-based CBR.

At the same time, providing a tree able to self-repair upon

changes in the physical topology of a LAN is only our minimal target.

Our ultimate goal is to design a protocol whose

characteristics simplify the operations of the CBR layer operating on it.

�FEATURES OF THE PROJECT:

* The feature of the project is based on tree topology.

* It repairs the nodes by itself.

MODULES:

� Loading Screen

� Login Screen

� Route Request

� Route Reply

� Linkage breakage

� Partition Merging

MODULE DESCRIPTION

�LOADING SCREEN:

* This module is, just load your project for a certain times. It have

your title of the project and it loads for a time.

�LOGIN SCREEN:

* This module is used for enter the user and password. It have the

Username and Password.

* We have to enter the username and password.

* Then select the login button ,If it is right, then it will go to the next

screen.

* Else it will send the message of enter the correct username and

password.

�ROUTE REQUEST:

* In this module we have to send the file through the path.

* First we have to select the file using open dialog box.

* Using open dialog box we will choose the file, which we are going

to send.

* Here we can open a file from any drive, directory, and folder.

* After choosing the file, it will display the file.

* After that we have to send the file to the next node.

* When the next node is in active then it will send the content or file

to the next node. If it is failed then it will send the content or file to the next node.

���� ROUTE REPLY:

* This Module is used to response for the request which is made by

the route.

* When the node is send the content or file to the next node. If it is

active then it will receive the content or file.

* When the node is failed then it will send a message that node is not

active to the user.

* It will also send the message when the sub nodes are failed. If it is

in active then it receives the content or file.

LINKAGE BREAKAGE:

* In this module, when your sending the file to the next node. When

the next node is in active then the data to be received by the next node.

* When the failure occurs in the next node. At that time the sub node

of the next node will be exploit.

PARTITION MERGING:

* In this module, when your sending the file to the next node. When

the next node is not active. Then the sub node receives the file by another node.

���� DATA FLOW DIAGRAM:

Enter the Username

& Password

Process The

Input Valid

Or Not

Choose The

File or Data

to be

transferred

Choose The

File or Data

to be

selected

The

Selected

File to be

send to the

next node

Yes

No

It Receives The

Content and save the

file

The sub node of the node

will get the file and if we

want save it or forward to

the sub node

Check the

content of

the file in the

next node

YesIt won’t

save

No

�ACTIVITY DIAGRAM:

Sending to the next

node

Check the content of the file

in the next node

Check It is activate or not

Sub Node Receive the content and forward it

to the sub nodes

Sub Node Receive the content and save it

and then forward it to the sub nodes

Selecting The File

Yes No

Sub Node Receive the content and save it

and then forward it to the sub nodes

YesNoSave the receiving

file in the next node

�ARCHITECTURE OF SELF REPARING

TREE TOPOLOGY:

G

H

L

A

F

E

B

D

C

S1 self

S1 B

S1 A

S1 E

S1 G

S1 B

S1 H

S1 A

S1 H

SCREEN SHOTS

SYSTEM REQUIREMENTS:

Software:

• Client : Windows Client

• Software : JAVA

Hardware:

• Memory : 128MB RAM or above

• Secondary Storage : 40 GB HDD or above

• FLOPPY DISK : .44 MB or above

• Display unit : Color Monitor and other suitable accessories

• Processor : PIII or above

�SOFTWARE FEATURES:

Simple:

Java was designed to be easy for the professional programmer to

learn and use effectively. Java has another attribute that makes it easy to learn. It makes

an effort not to have surprising features.

Object-Oriented:

Although influenced by its predecessors, Java was not designed to be

source-code compatible with any other language. This allowed the Java team the

freedom to design with a blank slate

Robust:

The multiplatformed environment of the web pages extraordinary

demands on a program, because the program must execute reliably in a variety of

systems. Thus the ability to create robust programs was given a high priority in the

design of Java.

Multithreaded:

Java was designed to meet the real-world requirement of creating

interactive, networked programs. To accomplish this, Java supports multithreaded

programming, which allows you to write programs that do many things simultaneously.

Architectural-Neutral:

A central issue for the designers was that of code longevity and

portability. One of the main problems facing programmers is that no guarantee exists

that if you write a program today, it will run tomorrow-even on the same machine.

Interpreted and High Performance:

Java enables the creation of cross-platform programs by compiling

into an intermediate representation called java bytecode. This code can be interpreted

on any system that provides a Java Virtual Machine.

Distributed:

Java is designed for the distributed environment of the Internet,

because it handles TCP/IP protocols. In fact, accessing a resource using a URL is not

much different from accessing a file. The original version of Java(Oak) included

features for intra-address-space messaging..For example:RMI

Dynamic:

Java programs carry with them substantial amounts of run-time type

information that is used to verify and resolve accesses to objects at run time. This

makes it possible to dynamically link code in a safe and expedient manner.

�BIBLIOGRAPHY:

* T.Camp, J.Boleng, and V.Davies. A survey of mobility models for

ad hoc network research.

* A.Bulut, A. K.Singh, and R. Vitenberg. Distributed data streams

indexing using content-based routing paradigm.

THANK YOU