project presentation (parn)

7/21/2019 Project Presentation (PARN)

1/28

BACK PRESSURE BASED PACKET-

BY-PACKET ADAPTIVE ROUTING

IN COMMUNICATION NETWORK

Internal Guide:

Mr. M.K. NizamuddinAssociate Professor

D.C.E.T.

Naziya AnjumM.Tech., C.S.E., IV Semester

D.C.E.T.


2/28

ContentsIntroduction

Aim of the Project

Technical ApproachExisting System

Proposed System

Module DescriptionAlgorithms & Techniques

Experimental Results

Conclusion


3/28

Introduction

Back-Pressure-Based adaptive routingalgorithm

Poor Delay performance & highimplementation complexity

New adaptive routing algorithm is developed

Decouple Routing & scheduling components

Extends to employ simple network coding


4/28

Aim of the Project

Back-Pressure-Based Packet-By-PacketAdaptive Routing in Communication

NetworksAim is achieved through:

Study of networking concepts

Back-Pressure based Packet-by-Packetadaptive routing algorithm, Shadow Queuealgorithm and Adaptive routing algorithm

Network coding


5/28

Technical Approach

Compatible with Java 1.7 & higher versions

Windows 7 Operating SystemDeveloped on 3GB RAM, 300 GB hard Disk

Processor(R) Dual-core with a speed of 2.30

GHz


6/28

Existing System

Back-Pressure-Based adaptive routingalgorithm

Assigns weights (called as Back-Pressure)to each link

Packets are send only through scheduled

linksMaintains per-destination queues

Provides maximum network throughput


7/28

(contd..) Existing System

Disadvantages

Maintains queue for each potentialdestination

High implementation complexity for largenetworks

Explores network resources & choose longpaths

Poor Delay Performance


8/28

Proposed system

Packet-by-Packet Adaptive Routing forNetworks (PARN)

It is based upon Back-pressure Algorithm Decouple Routing and scheduling

Components using Probabilistic Routing and

Shadow queues Maintains Real queues(per-neighbor queues)

Performs routing via Probabilistic splitting

Uses Network Coding


9/28

(contd..)

Proposed System Reduces Delay performance

Provides low implementation complexityDestination

ROUTE

UPDATEROUTE

UPDATE

SOURCE

Router

Update

Data Transfer

ROUTE

UPDATE

TRANSMISSIONRANGE


10/28

Modules

DescriptionExponential Averaging

Token Bucket Algorithm

Extra Link Activation

Choice of Parameter


11/28

(contd..)

Modules Description

Module 1: Exponential Averaging

Uses the concept of Shadow Queues

Shadow Network with Back-Pressurealgorithm

Updates probabilistic routing table

Activates transmission between nodes

FIFO queues


12/28

(contd..)

Modules Description

Module 2: Token Bucket Algorithm

Overhead of routers:

Average Shadow rate & generating randomnumbers for routing packets

Maintains token Bucket:

each node, each next-hop & each destination

Arrival rate of packets < Token generationrate


13/28

(contd..)

Modules Description

Module 3: Extra Link Activation

Run Shadow Back-Pressure algorithm

Activates links > M

Discourage unnecessarily long paths

Light & moderate traffic loads:

Packets waits long time to processed

Add additional Links

Decoupling is achieved


14/28

(contd..)

Modules DescriptionModule 4: Choice of Parameter

Shadow scheduling algorithm

determines link capacityLink capacity < shadow arrival rate

link capacity-arrival rate

: large to ensure small delaysSmall to ensure capacity region isnot diminished


15/28


16/28


17/28

(contd..)

Algorithms & TechniquesAdaptive Routing Algorithm

Assigns packets arriving to a node to next-hop

neighborMaintains stable system

Based on the destination of a packet, a packet

is routed to its next hop based on routingtable entries.

Packet waiting at link are transmitted over alink when that link is scheduled.


18/28

(contd..)

Algorithms & Techniques

Network Coding

Relay between two other nodes XORs

packets and broadcasts them to decrease thenumber of transmissions

i jn


19/28

Experimentalresults

Client searched router to send packet


20/28

(contd..)

Experimental resultsRouter receives request & then ping to all nodes


21/28


22/28

(contd..)Experimental results

Router selects best node to transfer request


23/28


Selected node transfers request to server


24/28


Performs Network Traffic


25/28


Server receives the request


26/28

Conclusion

Presents a new adaptive Routing algorithm(PARN)

Routes packets on shortest hops whenpossible

Decouples routing and scheduling usingprobabilistic splitting algorithm built on the

concept of shadow queues. Reduce the queuing complexity at each node

Extended to optimally trade off betweenrouting and network coding.


27/28

Reference

Back-Pressure-Based Packet-by-Packet

Adaptive Routing in CommunicationNetworksAthanasopoulou Eleftheria, Loc X. Bui, Tianxiong

Ji, Srikant & Alexander Stolyar

IEEE/ACM Transactions on Networking, VOL. 21,No. 1, Feb 2013


28/28

project presentation (parn)

Documents