Design

ABSTRACT

A customized mechanism to detect, monitor and block the data packets

according to the definitions submitted to the mechanism. The mechanism is

robust easy to implement, maintain, update and enhance. The mechanism takes

input as sample data packets which are to be blocked and checks those

definitions with the data packets according to the protocols and algorithms

which are a part of the mechanism

EXISTING SYSTEM

In the existing system when transferring data from sender to receiver there

may be chances of data loss. No user can be known whether the router is free after

he sends data to the router. Also no intimation when the buffer at the router is full or

busy or free. It causes retransmission of data to the router and hence redundant

bandwidth usage and consumption of time

2.4 PROPOSED SYSTEM

The main objective of this project is to reduce the congestion when data

transfers between source and destination. When data transfers between source and

destination there may be chances of occurrence of congestion and also it monitor

when congestion occurs. If so that has to be intimated or warned to the user. In this

System, using several algorithms viz. Leaky bucket algorithm and Virtual scheduling

algorithm congestion can be avoided.

Leaky Bucket Algorithm continuously receives and sends the data at the

particular interval of time to avoid congestion or flooding of data. Virtual scheduling

algorithm monitors the congestion occurrence, when congestion occurs it intimates

or warns user and simultaneously intimates when the router is free and data

transferred successfully to destination.

This system can be implemented in a real network to control the traffic

occurred in a network. User can get to know the status of the router whether router is

busy in controlling the inflow and outflow of data to transfer data to the destination.

-Data Packets Analyzer and Controller LAN- 15

Design

4.1 DATA FLOW DIAGRAMS

The DFD takes an input-process-output view of a system i.e. data objects flow

into the software, are transformed by processing elements, and resultant data

objects flow out of the software.

Data objects represented by labeled arrows and transformation are

represented by circles also called as bubbles. DFD is presented in a hierarchical

fashion i.e. the first data flow model represents the system as a whole. Subsequent

DFD refine the context diagram (level 0 DFD), providing increasing details with each

subsequent level.

The DFD enables the software engineer to develop models of the information

domain & functional domain at the same time. As the DFD is refined into greater

levels of details, the analyst performs an implicit functional decomposition of the

system. At the same time, the DFD refinement results in a corresponding refinement

of the data as it moves through the processes that embody the applications.

4.3.1 Rules for dataflow diagrams:

Fix the scope of the system by means of context diagrams.

Organize the DFD so that the main sequence of the actions

Reads left to right and top to bottom.

Identify all inputs and outputs.

Identify and label each process internal to the system with Rounded circles.

Do not indicate hardware and ignore control information.

Make sure the names of the processes accurately convey everything the process is done.

There must not be unnamed process.

Indicate external sources and destinations of the data, with Squares.

Number each occurrence of repeated external entities.

-Data Packets Analyzer and Controller LAN- 16

Design

4.3.2 Source Module

Fig: 4.2 Data Flow Diagram of Source Module

-Data Packets Analyzer and Controller LAN- 17

Source

Original Message

Message are divided and allocated in the form of 48

bytes (1 Packet)

Router

Router

Virtual Scheduling Algorithm

Destination

Leaky Bucket Algorithm

Design

4.3.3 Router Module

Fig: 4.3 Data Flow Diagram of Router Module

-Data Packets Analyzer and Controller LAN- 18

Destination

Retrieve the Allocated Byte

Combine the Packets (48 Bytes)To form the Message

Finally the Message is saved in a Text File with Destination Machine Name

Design

4.3.4 Destination Module

Fig: 4.4 Data Flow Diagram of destination Module

-Data Packets Analyzer and Controller LAN- 19

Design

HARDWARE REQUIREMENTS

The most common set of requirements defined by any operating system or

software application is the physical computer resources, also known as hardware. The

hardware requirements required for this project are:

20 GB of Hard disk

256 MB RAM

Pentium 133 MHZ or above (Processor)

PC’s which are interconnected in LAN

Network Adapter card configured with an IP address

3.2 SOFTWARE REQUIREMENTS

Software Requirements deal with defining software resource requirements and

pre-requisites that need to be installed on a computer to provide optimal functioning of

an application. These requirements or pre-requisites are generally not included in the

software installation package and need to be installed separately before the software is

installed. The software requirements that are required for this project are:

Java 1.3 or more

Windows 98 or more

-Data Packets Analyzer and Controller LAN- 20