Upload
naziyanjum
View
221
Download
0
Embed Size (px)
Citation preview
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.
7/21/2019 Project Presentation (PARN)
2/28
ContentsIntroduction
Aim of the Project
Technical ApproachExisting System
Proposed System
Module DescriptionAlgorithms & Techniques
Experimental Results
Conclusion
7/21/2019 Project Presentation (PARN)
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
7/21/2019 Project Presentation (PARN)
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
7/21/2019 Project Presentation (PARN)
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
7/21/2019 Project Presentation (PARN)
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/21/2019 Project Presentation (PARN)
7/28
(contd..) Existing System
Disadvantages
Maintains queue for each potentialdestination
High implementation complexity for largenetworks
Explores network resources & choose longpaths
Poor Delay Performance
7/21/2019 Project Presentation (PARN)
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
7/21/2019 Project Presentation (PARN)
9/28
(contd..)
Proposed System Reduces Delay performance
Provides low implementation complexityDestination
ROUTE
UPDATEROUTE
UPDATE
SOURCE
Router
Update
Data Transfer
ROUTE
UPDATE
TRANSMISSIONRANGE
7/21/2019 Project Presentation (PARN)
10/28
Modules
DescriptionExponential Averaging
Token Bucket Algorithm
Extra Link Activation
Choice of Parameter
7/21/2019 Project Presentation (PARN)
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
7/21/2019 Project Presentation (PARN)
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
7/21/2019 Project Presentation (PARN)
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
7/21/2019 Project Presentation (PARN)
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
7/21/2019 Project Presentation (PARN)
15/28
7/21/2019 Project Presentation (PARN)
16/28
7/21/2019 Project Presentation (PARN)
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.
7/21/2019 Project Presentation (PARN)
18/28
(contd..)
Algorithms & Techniques
Network Coding
Relay between two other nodes XORs
packets and broadcasts them to decrease thenumber of transmissions
i jn
7/21/2019 Project Presentation (PARN)
19/28
Experimentalresults
Client searched router to send packet
7/21/2019 Project Presentation (PARN)
20/28
(contd..)
Experimental resultsRouter receives request & then ping to all nodes
7/21/2019 Project Presentation (PARN)
21/28
7/21/2019 Project Presentation (PARN)
22/28
(contd..)Experimental results
Router selects best node to transfer request
7/21/2019 Project Presentation (PARN)
23/28
(contd..)Experimental results
Selected node transfers request to server
7/21/2019 Project Presentation (PARN)
24/28
(contd..)Experimental results
Performs Network Traffic
7/21/2019 Project Presentation (PARN)
25/28
(contd..)Experimental results
Server receives the request
7/21/2019 Project Presentation (PARN)
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.
7/21/2019 Project Presentation (PARN)
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
7/21/2019 Project Presentation (PARN)
28/28