By

P.Iswarya(72008132021)

M.ChitraDevi(72008132010)

Guided By

Mr.N.Jagadeesh B.Tech

Clogging –Aware Traffic Allocation for Multiple-Path

Routing Using Portfolio Selection

ABSTRACT

• In multipath routing protocol jamming aware

source routing, the traffic allocation is based

on at individual network node.[centralized]

• This can be solved by using a distributed

algorithm based on decomposition in Network

Utility Maximization(NUM).

Example:

EXISTING SYSTEM

• In existing system, there is no

acknowledgement when packets are sent to

destination in case of failure.

• Existing path is not updated.

• Disconnect the path if it is disturbed.

PROPOSED SYSTEM

• Each node must estimate of its packet success

rate to the source node.

• The use of portfolio selection allows the data

sources to balance the expected data throughput.

• we send the data using back up path in case of

jamming.

HARDWARE REQUIREMENTS

• Processor :Pentium IV 2.4 GHz• Primary Memory :512 MB• Floppy Disk :1.44MB• Hard Disk Drive :40GB• Monitor                 : 15 VGA color•  Mouse                   : Logitech•  RAM                  

 : 256MB

SOFTWARE REQUIREMENTS

• Operating System :Windows 98/2000/XP• Front End :Java 1.6• Back End :MS SQL Server 2000

 

USECASE DIAGRAM

calculate the best path

server

create nodes

interconnect nodes

choose a source node in network

select a file

select a destination

send the file through the best path

view the data

client

details are stored

Database

CLASS DIAGRAM

client

name : stringip address : int

create the nodes()interconnect the nodes()select source node()select a file()send file()view data()

database

name : string

store details()

server

ip address : int

calculate best path()

DATAFLOW DIAGRAM

System sends the data to receiver node

Find node failure or link failure

Sender system get available path from server

Calculate backup path

Use that backup path

Data transmit through this path

Receiver receive the data

Yes

No

MODULES

• Topology Construction

• Node Failure Detection

• Link Failure Detection

• Backup Path Transmission

TOPOLOGY CONSTRUCTION

• Design is to overcome link and node failure.

• Nodes are interconnected.

• Nodes exchange data with each other.

• Nodes and link details are maintained in server

system.

NODE FAILURE DETECTION

• Packets are sent through the links.

• Acknowledgement is not sent.

• Data does not reach destination.

• Problem is solved using alternate node

selection.

LINK FAILURE DETECTION

• It is found by node failure.

• Data does not reach destination.

• Solve using Backup path.

BACKUP PATH TRANMISSION

• Find more than one shortest path.

• Use alternate path in case of failure in data

transmission.

• Time is consumed.

SAMPLE CODING

• import java.sql.*;• import java.io.*;• import java.net.*;• import java.util.*;• public class server• { private dbase db;• ResultSet rs,rs1;• Connection cs;• Statement st,st1;• Vector v,v1;• static ServerSocket sersoc;• static Socket soc;• ObjectInputStream dis;• ObjectOutputStream dos;• InputStream is;}

SNAPSHOTS

NEW USER REGISTRATION AND NODE CONNECTION

USER LOGIN

LOGIN PAGE

NEW USER REGISTRATION

NODE CONNECTION

USER LOGIN

LOGIN PAGE

NEW USER REGISTRATION

NODE CONNECTION

NODE CONNECTION

USER LOGIN

LOGIN PAGE

SEND THE FILE

FILE CONTENT

BEST PATH

CONCLUSION

• It is developed to fulfilling the necessary

requirements, as identified in the requirements

analysis phase, such as the system is very

much user friendly, form level validation and

field level validation are performing very

efficiently.

FUTURE ENCHANCEMENT

• Every system should allow scope for further

development or enhancement. The system can be

adapted for any further development.

• The system is so flexible to allow any modification

need for the further functioning of programs.

REFERENCE

• [1] Akyildiz I.F, Wang, and Wang.W [Mar. 2005], “Wireless mesh networks: A survey,” Comput. Newt., vol. 47, no. 4, pp. 445–487.

• [2] Anderson.R [2001], Security Engineering: A Guide to Building Dependable Distributed Systems. New York: Wiley.

• [3] Bellardo.J and Savage.S, Aug. [2003] “802.11 denial-of-service attacks: Real vulnerabilities and practical solutions,” in Proc. USENIX Security Symp., Washington, DC, , pp. 15–28.