Professional Documents
Culture Documents
Outline
QoS Parameters of QoS Challenges, Design and Classification of QoS Routing Routing Protocols
QoS Aware AODV On-demand link-state multipath QoS RP (OLMQR) Asynchronous QoS Routing (AQR) QOLSR
QoS Frameworks
26.11.2004
What is QoS?
QoS is the performance level of service offered by a network to the user. The Goal of QoS is to achieve a more deterministic network behavior so that the information carried by the network can be better delivered and the resources can be better utilized. QoS routing is the process of providing end to end loop free paths to ensure the necessary QoS parameters are met.
26.11.2004
Multimedia Bandwidth, delay jitter & delay Emergency services Network availability Group communications Battery life.
26.11.2004
bandwidth delay jitter jitter battery charge processing power buffer space
26.11.2004
26.11.2004
26.11.2004
coupled
Decoupled
Independent
Dependent
Ondemand
Table driven
Hybrid
PLBQR
BR CEDAR
26.11.2004
M A C /D LL
IN S IG N A IN O R A SW A N P R TM A C
26.11.2004
10
26.11.2004
QoS Metrics
There are three QoS routing metrics
1) 2) 3)
11
26.11.2004
Asynchronous QoS Routing Other reactive approaches QoS extension to OLSR (QOLSR)
12
26.11.2004
AODV
AODV is designed for ad-hoc networks, on demand algorithm, loop-free, self starting & scales to large numbers. Supports unicast & multicast By forming trees composed of multicast group members & intermediate nodes needed to connect the group members multicast mode is supported . Ensure route validity AODV uses sequence numbers AODV uses Route request /Route reply to discover a route.
13
26.11.2004
26.11.2004
15
26.11.2004
16
26.11.2004
Asynchronous QoS Routing Other reactive approaches QoS extension to OLSR (QOLSR)
19
26.11.2004
End-to-end path bandwidth calculation algorithm to inform source node of available bandwidth to any destination. Bandwidth reservation to reserve sufficient number of slots for the QoS flow. A standby routing algorithm to reestablish the QoS flow in case of path breaks.
Provides efficient bandwidth allocation scheme for CDMAover-TDMA-based ad hoc wireless networks.
20
QoS Routing in Ad-Hoc Networks 26.11.2004
Route Discovery (QRREQ and QRREP) Bandwidth Reservation Reservation Failure (ReserveFail and NoRoute) Route Maintenance (RouteBroken)
QoS Routing in Ad-Hoc Networks 26.11.2004
21
Source floods QRREQ. Each packet contains path history and link-state information. Destination node collects all link-state information and creates own view of network. Destination sends QRREP on all paths which combined satisfy bandwidth requirements.
22
26.11.2004
Phase 1 is on-demand link-state discovery Source floods a QRREQ towards destination Each packet records path history and all link-state information. Destination may receive many different QRREQ packets from source and builds own view of current network topology. Phase 2 is unipath discovery Higher end-to-end path bandwidth is acquired as compared to hop-by-hop approach. For a given unipath, maximum path bandwidth is determined by constructing a time-slot reservation tree T and a least cost timeslot reservation tree TLCF.
QoS Routing in Ad-Hoc Networks 26.11.2004
23
24
26.11.2004
Phase 3 is multipath discovery and reply Multiple unipaths considered such that sum fulfills bandwidth requirements. Destination applies the unipath discovery operation to each path to determine maximum achievable path bandwidth on each path. For each accepted path destination updates network state information to reflect current bandwidth availability Along each path a QRREP is sent.
26
26.11.2004
27
26.11.2004
Bandwidth requirements can be met over multiple paths. Has better average call acceptance rate (ACAR).
Disadvantages
28
26.11.2004
Asynchronous QoS Routing Other reactive approaches QoS extension to OLSR (QOLSR)
29
26.11.2004
Merging of two disjoint networks N1 and N2 with different clocks affects existing real-time calls during the merging process (new network will have a single clock)
30
26.11.2004
Avoids the time synchronization problem Covered in an earlier presentation Bandwidth Feasibility Test Bandwidth Allocation Bandwidth Reservation
Three phases
31
26.11.2004
Selection of paths with needed bandwidth. Source sends RouteRequest packets to destination. Intermediate node checks bandwidth availability in link on which it received RouteRequest packet. Forwards the packet if sufficient bandwidth is available else it is dropped. Intermediate nodes append reservation table and a time offset to RouteRequest. On receiving RouteRequest packet destination runs slot allocation algorithm on a selected path by constructing QoS Frame for every link. Waits for some time and gathers RouteRequest packets to choose shortest path with necessary bandwidth.
QoS Routing in Ad-Hoc Networks 26.11.2004
32
Destination performs bandwidth allocation strategy that assigns free slots to every intermediate link in the chosen path. Information about asynchronous slots assigned at every intermediate link is included in the RouteReply. RouteReply is propagated through the selected path back to source.
Bandwidth allocation and positioning of slots which influence end-to-end delay and call acceptance rate. Early fit reservation (EFR) Minimum bandwidth-based reservation (MBR) Position-based hybrid reservation (PHR) k-hopcount hybrid routing (k-HHR)
QoS Routing in Ad-Hoc Networks 26.11.2004
33
Reservation of bandwidth at every link of the path is carried out. Reservation is effected by intermediate nodes with the information carried in the RouteReply packet, in an asynchronous fashion using RTMAC protocol. If reservation is successful RouteReply is forwarded. If designated slot is not free at the time of attempting the reservation, any of the free available slots can be reserved. If it is impossible to reserve bandwidth, RouteReply packet is dropped and control packet sent to the destination releases bandwidth reserved on path from this node to destination.
34
26.11.2004
End-to-end bandwidth reservation in asynchronous networks. Plan for delay requirements using slot allocation strategies.
Disadvantages
Setup time and reconfiguration time are high. Bandwidth efficiency not as high as in a fully synchronized TDMA system.
35
26.11.2004
Asynchronous QoS Routing Other reactive approaches QoS extension to OLSR (QOLSR)
36
26.11.2004
Distributed QoS Routing protocol. Basic idea is that source issues certain number of tickets and sends these tickets in probes for finding QoS feasible path. Number of tickets indicates number of paths that can be probed in parallel. Tolerates imprecise state information during QoS route computation (more tickets -> more precise the information). Exhibits good performance when degree of imprecision is high. Probes multiple paths in parallel to find a QoS feasible path. Optimality of a path among several feasible paths is explored. A primary-backup-based fault-tolerant technique is used to reduce service disruption during path breaks.
QoS Routing in Ad-Hoc Networks 26.11.2004
37
On-demand distributed QoS routing protocol for real-time applications. Every node maintains only local neighborhood information. Nodes maintain only active routes to reduce control overhead. On imminent link failure, GPS based location of destination used to reroute queries only to certain node neighbors along active route. Following messages exchange for initiating, maintaining, and terminating a real-time session: Initial Route Discovery Route/Reroute Acknowledgement Alternate route Discovery Route Deactivation
QoS Routing in Ad-Hoc Networks 26.11.2004
38
Based on the prediction of node locations. Overcomes to some extent problems due to presence of stale routing information. No resource reservation in path from source to destination but QoS-aware admission control performed. Network does its best to support QoS requirements. Uses an update protocol, with two types: Type 1 is a periodic update (each node is aware of complete topology refreshed periodically). Type 2 is an update indicates considerable changes Uses location and delay prediction schemes.
QoS Routing in Ad-Hoc Networks 26.11.2004
39
Asynchronous QoS Routing Other reactive approaches QoS extension to OLSR (QOLSR)
40
26.11.2004
QOLSR
QoS extension to OLSR (Experimental RFC 3626).
Well suited to large and dense mobile networks Table driven pro-active protocol. Uses hop-by-hop routing.
Each node selects a set of neighbor nodes called multipoint relays (MPR)
Optimal routes in terms of number of hops. Only MPR forward control traffic and provide a flooding control mechanism. Only partial link state to be flooded. This is used in OLSR for route calculation.
QoS Routing in Ad-Hoc Networks 26.11.2004
41
OLSR
42
26.11.2004
QOLSR (1)
Maximum bandwidth and minimum delay metrics for OLSR. No additional control messages needed. Neighbor detection:
Each node MUST detect the neighbor nodes with which it has a direct and bi-directional link. Each node periodically broadcasts HELLO messages, containing the information about its neighbors and their link status. These HELLO messages are received by all one hop neighbors, but they are not relayed to further nodes.
43
26.11.2004
QOLSR (2)
Neighbor QoS measurement
Each node MUST estimate the QoS conditions with its neighbors. This info is broadcast using additional fields of hello message. Allows each node to discover its neighborhood up to 2 hops and the QoS conditions Each node selects its MPR set from among its 1-hop symmetric neighbors. MPR set is selected such that it covers all symmetric strict 2-hop nodes.
44
26.11.2004
QOLSR (3)
MPR set consists of subset of the 1-hop neighbors which provides maximum bandwidth and minimum delay to each 2hop neighbor. MPRs of a given node are declared in the subsequent HELLOs transmitted by this node, so that the information reaches the MPRs themselves. The MPR set is re-calculated when a change in 1 hop or 2 hop neighbor sets with bi-directional link is detected ; or a change is detected in their QoS conditions.
45
26.11.2004
QOLSR (4)
MPR and QOS conditions information declaration
Topology Control extension messages sent by MPRs to declare MPR selector set and QoS conditions.
Neighborhood information base consists of information about its neighbors, 2 hop neighbors, MPRs and MPR selectors. Each node also maintains a Topology information base and QoS conditions of the network.
46
26.11.2004
QOLSR (5)
Routing table Calculation
Each node maintains a routing table. The routing table is built from the information in neighbor set and topology set. Uses the shortest-widest path algorithm to find a path with maximum bandwidth (a widest path) using a variant of Dijkstra routing algorithm. When there is more than one widest path, chooses the one with shortest delay. This routing table is updated when a change is detected in the neighbor set, or the topology set.
47
26.11.2004
QoS Frameworks
Framework : a complete system to provide required QoS. All components co-ordinate to provide required services. Key components of a QoS Framework
Service model : Per flow or service class. Flexible model Routing QoS signaling: MRSVP, active and passive agents QoS Medium access control: Call admission control Packet Scheduling
48
26.11.2004
INSIGNIA (1)
Provides adaptive services
In-band signaling
Insignia modules
Routing module Admission control Packet forwarding Packet scheduling Medium access control In band signaling
QoS Routing in Ad-Hoc Networks
Supports fast: Reservation Restoration Adaptation schemes The control information is carried along with the data packets Each data packet contains an optional QoS field known also as INSIGNIA field Can operate at a speed close to packet transmission rate
26.11.2004
49
INSIGNIA (2)
50
26.11.2004
QoS Frameworks
INORA INSIGNIA in-band signaling and TORA routing protocol. SWAN Distributed network model. Assumes best effort best effort MAC and feedback based control mechanisms. Proactive RTMAC Cross layer framework, with on demand QoS extension to DSR routing protocol and real time MAC.
51
26.11.2004
References
C. Siva Ram Murthy, B.S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols. ISBN 0-13-147023-x, Copyright Prentice Hall PTR, Inc., May 24, 2004. QOLSR, http://www.ietf.org/internet-drafts/draft-badis-manet-qolsr00.txt. http://qolsr.lri.fr/.
52
26.11.2004
Questions?
53
26.11.2004
Thank You
54
26.11.2004