Vous êtes sur la page 1sur 28

BACK PRESSURE BASED PACKET-

BY-PACKET ADAPTIVE ROUTING


IN COMMUNICATION NETWORK
Internal Guide:
Mr. M.K. Nizamuddin
Associate Professor
D.C.E.T.
Naziya Anjum
M.Tech., C.S.E., IV Semester
D.C.E.T.
Contents
Introduction
Aim of the Project
Technical Approach
Existing System
Proposed System
Module Description
Algorithms & Techniques
Experimental Results
Conclusion
Introduction
Back-Pressure-Based adaptive routing
algorithm
Poor Delay performance & high
implementation complexity
New adaptive routing algorithm is developed
Decouple Routing & scheduling components
Extends to employ simple network coding
Aim of the Project
Back-Pressure-Based Packet-By-Packet
Adaptive Routing in Communication
Networks
Aim is achieved through:
Study of networking concepts
Back-Pressure based Packet-by-Packet
adaptive routing algorithm, Shadow Queue
algorithm and Adaptive routing algorithm
Network coding
Technical Approach
Compatible with Java 1.7 & higher versions
Windows 7 Operating System
Developed on 3GB RAM, 300 GB hard Disk
Processor(R) Dual-core with a speed of 2.30
GHz


Existing System
Back-Pressure-Based adaptive routing
algorithm
Assigns weights (called as Back-Pressure)
to each link
Packets are send only through scheduled
links
Maintains per-destination queues
Provides maximum network throughput



(contd..) Existing System
Disadvantages
Maintains queue for each potential
destination
High implementation complexity for large
networks
Explores network resources & choose long
paths
Poor Delay Performance

Proposed system
Packet-by-Packet Adaptive Routing for
Networks (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

(contd..)
Proposed System
Reduces Delay performance
Provides low implementation complexity

Destination
ROUTE
UPDATE
ROUTE
UPDATE
SOURCE
Router
Update
Data Transfer
ROUTE
UPDATE
TRANSMISSION RANGE
Modules
Description
Exponential Averaging
Token Bucket Algorithm
Extra Link Activation
Choice of Parameter
(contd..)
Modules Description
Module 1: Exponential Averaging
Uses the concept of Shadow Queues
Shadow Network with Back-Pressure
algorithm
Updates probabilistic routing table
Activates transmission between nodes
FIFO queues

(contd..)
Modules Description
Module 2: Token Bucket Algorithm
Overhead of routers:
Average Shadow rate & generating random
numbers for routing packets
Maintains token Bucket:
each node, each next-hop & each destination
Arrival rate of packets < Token generation
rate

(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

(contd..)
Modules Description
Module 4: Choice of Parameter
Shadow scheduling algorithm
determines link capacity
Link capacity < shadow arrival rate
link capacity-arrival rate
: large to ensure small delays
Small to ensure capacity region is
not diminished


Algorithms & Techniques
Packet-By-Packet adaptive routing for
Networks (PARN)
Back Pressure Algorithm: each node
maintains queue for each destination
|D|=|N|-1
PARN: each node maintains queue for every
neighbor called as Real Queue
Each node also maintains Shadow Queue
(contd..)
Algorithms & Techniques
Shadow Queue Algorithm
Shadow is a counter that is incremented by 1
upon shadow packet arrival and
decremented by 1 upon departure.
shadow packet contains control messages
for routing and scheduling
Back Pressure algorithm run on shadow
queues is used to activate links
(contd..)
Algorithms & Techniques
Adaptive Routing Algorithm
Assigns packets arriving to a node to next-hop
neighbor
Maintains stable system
Based on the destination of a packet, a packet
is routed to its next hop based on routing
table entries.
Packet waiting at link are transmitted over a
link when that link is scheduled.



(contd..)
Algorithms & Techniques
Network Coding
Relay between two other nodes XORs
packets and broadcasts them to decrease the
number of transmissions

i j n
Experimental results
Client searched router to send packet
(contd..)
Experimental results
Router receives request & then ping to all nodes
(contd..)
Experimental results
All nodes replies to router
(contd..)
Experimental results
Router selects best node to transfer request
(contd..)
Experimental results
Selected node transfers request to server
(contd..)
Experimental results
Performs Network Traffic
(contd..)
Experimental results
Server receives the request
Conclusion
Presents a new adaptive Routing algorithm
(PARN)
Routes packets on shortest hops when
possible
Decouples routing and scheduling using
probabilistic splitting algorithm built on the
concept of shadow queues.
Reduce the queuing complexity at each node
Extended to optimally trade off between
routing and network coding.

Reference
Back-Pressure-Based Packet-by-Packet
Adaptive Routing in Communication
Networks
Athanasopoulou Eleftheria, Loc X. Bui, Tianxiong
Ji, Srikant & Alexander Stolyar
IEEE/ACM Transactions on Networking, VOL. 21,
No. 1, Feb 2013

Vous aimerez peut-être aussi