QOS - ORIENTED ROUTING PROTOCOLS Presented by : S.Aakasham, ME-CSE PG Scholar (2013-2015) SVS COLLEGE OF ENGINEERING,CBE-109
Jun 29, 2015
QOS - ORIENTED ROUTING PROTOCOLS
Presented by :S.Aakasham, ME-CSE
PG Scholar (2013-2015)
SVS COLLEGE OF ENGINEERING,CBE-109
Outline
Introduction of QoS Literature survey Objective Algorithm Advantages Disadvantages References
2
Introduction Of QoS
To find a QoS path between source and destination, Which satisfies The QoS requirements for each admitted connection and Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
3
Challenges In QOS
Mobility
Dynamic changing topology
Bandwidth constrains
Energy constrains
Scalability
4
Literature Survey
Himansha Sharma, Yogendra Kumar Jain, Geetika S. Pandey “QoS oriented reservation based routing mechanism for wireless”
Vida Lashkari B. O., Mehdi Dehghan “QoS-aware Multicast Ad hoc On-Demand Distance Vector Routing”
5
1.QOS ORIENTED RESERVATION BASED ROUTING MECHANISM FOR WIRELESS
In this paper introduced QoS reservation mechanism for MANETs, allowing bandwidth allocation on a per flow basis
To select the highest possible transmission rate for exchanging data, independently for each neighbor
The paper analyzes the applicability of the proposed mechanism over both proactive and reactive routing protocols
6
Reservation-Based Mechanism
First reserving the network path that has sufficient resources to
satisfy the QoS requirements
Achieving global efficiency in resource utilization
It also naturally distributes the traffic more evenly among network
nodes (i.e. load balancing)
7
Algorithm
Available bandwidth
It can be defined as the maximum throughput with which we
can transmit (between two nodes) without interrupt flows
transmitted on the Ad Hoc network
It is required for admission control; QoS based routing, flow
management and resources reservation
8
Algorithm (Cont..)
The maximum available bandwidth quantity on a node can be defined by this function :
MAB(i) = BW(i) – x(i) – SUM(j) € Ni x(j)
x (i) = Used Bandwidth on the node i x (j) = Used Bandwidth by the node j, neighbour of the node i Node j = neighbour of node i Ni = set of node i
9
Algorithm (Cont..)
The available bandwidth is expressed by the following expression:
AB (i,j) = MIN { MAB(i), MAB(j)}
For a path p= (S, i, j…k, D) S: Source D: Destination i, j…k the intermediate nodes
10
Algorithm (Cont..)
Maximum Available Bandwidth guaranteed on the path is done by the formula :
MAB(p) = MIN { MAB(S, i) , MAB(i, j) , MAB(k, D)}
11
Advantages
It is simple and very effective way of using the transmission rate
12
Disadvantages
A reservation mechanism to free the existing reservation, when
link is broken and set of connection loose
13
2. QOS-AWARE MULTICAST AD HOC ON-DEMAND DISTANCE VECTOR ROUTING
In this paper introduced to improve the route discovery
mechanism for QoS multicast routes
To perform accurate resource reservation, it developed a method
for estimating the consumed bandwidth in multicast trees
In this paper introduce the QoS-MAODV protocol by using
admission control and bandwidth reservation in each node
14
Algorithm
QoS-MAODV protocol uses six different message types for
creation of QoS multicast tree
1. Route request (Rreq)
2. Route reply (Rrep)
3. Multicast activation (Mact)
4. Group hello (Grph)
5. Hello
6. QoS-lost
15
Algorithm (Cont..)
MAODV keeps a routing table
1. Bandwidth reservation table
It includes multicast group address, Amount of reserved bandwidth,
state of the reservation, time stamp, hop count from the source node,
and IP address of the source node
2. Neighbors table
It includes neighbor address, amount of reserved bandwidth in neighbor
node, state of the reservation, amount of consumed bandwidth in
neighbor, state of neighbor and time stamp
16
Bandwidth Control
Bself (I) can be defined by the total reserved bandwidth of all existing flows at node I for all nodes J in the neighborhood of node :
Available bandwidth at node I can be given by :
17
Bandwidth Control (Cont..)
Given the requested bandwidth Bmin, the bandwidth to be reserved for the flow j at node I is:
The consumed bandwidth for flow j on node I's channel can be given by:
Buplink (I)(j) is the reserved bandwidth for flow j on the upstream neighbor of node I,
Bdownlink (I)(j) is the bandwidth that the downstream neighbor of node I reserved for flow j
18
Advantages
Minimum required bandwidth support
Decrease the end-to-end delay
19
QOD ROUTING PROTOCOL FOR HWN
Usually, a hybrid network has widespread base stations The data transmission in hybrid networks has two features:
1. An AP can be a source or a destination to any mobile node It allows a stream to have anycast transmission along multiple
transmission paths to its destination through base stations
2. The number of transmission hops between a mobile node and an AP is small It enables a source node to connect to an AP through an intermediate
node
20
Network model of the HWM
21
Algorithms
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
22
Algorithm(cont..)
1.QoS-guaranteed neighbor selection algorithm The algorithm selects qualified neighbors and deadline-driven scheduling
mechanism to guarantee QoS routing Get an allocation set A :
Uas(i)* Wi : available workload rate source node needs to distribute its packets to the Nq
Ai : workload rate allocation from source node to immediate node Wg : the packet generating rate of the source node
23
Algorithm(cont..)
2.Distributed packet scheduling algorithm After qualified neighbors are identified, this algorithm schedules packet
routing. It assigns earlier generated packets to forwarders with higher queuing delays, while assigns more recently generated packets to forwarders with lower queuing delays to reduce total transmission delay
Distributed queuing mechanism (e.g.: 3 packets distributed)
24
Algorithm(cont..)
2.Distributed packet scheduling algorithm The queuing time of a packet with priority x estimated by :
and : The transmission delay and arrival interval of a packet
with the jth priority
: The number of packets arriving during the packet’s
queuing time
25
Algorithm(cont..)
3.Mobility-based segment resizing algorithm The source node adaptively resizes each packet in its packet stream for each
neighbor node according to the neighbor’s mobility
The mobility of a node increases, the size of a packet Sp sent from a node to its neighbor nodes i decreases as following :
γ : Scaling parameter an
υi : The relative mobility speed of the source node and intermediate node =1 kb
26
Algorithm(cont..)
4.Soft-deadline based forwarding scheduling algorithm An intermediate node first forwards the packet with the least time
allowed to wait before being packet forwarding A forwarding node can use the least slack first (LSF) scheduling
algorithm
The slack time of a packet p is defined as :
Dp : Deadline of packet p t : The current time c’ : The remaining packet transmission time of the packet
27
Algorithm(cont..)
5.Data redundancy elimination based transmission The APs and mobile nodes can overhead and cache packets Use an end-to-end traffic redundancy elimination (TRE) algorithm
eliminates the redundant data to improve the QoS of the packet transmission
28
REFERENCES
Himansha Sharma, Yogendra Kumar Jain, Geetika S. Pandey “QoS oriented reservation based routing mechanism for wireless” Journal of Global Research in Computer Science ad-hoc networks” Volume 2, No. 12, December 2011
Vida Lashkari B. O., Mehdi Dehghan “QoS-aware Multicast Ad hoc On-Demand Distance Vector Routing” Proceedings of the World Congress on Engineering Vol 2 WCE 2007
29