Optimized Link State Protocol Version 2 Assaf Israel, Eli Nazarov, Asi Bross Version 2 Assaf Israel, Eli Nazarov, Asi Bross.

Slides:



Advertisements
Similar presentations
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Advertisements

Routing Protocol.
Securing OLSR Using Node Locations Daniele Raffo Cédric Adjih Thomas Clausen Paul Mühlethaler 11 th European Wireless Conference 2005 (EW 2005) April
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
1 LINK STATE PROTOCOLS (contents) Disadvantages of the distance vector protocols Link state protocols Why is a link state protocol better?
UM-OLSR OLSR routing protocol in NS2
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
1 Internet Networking Spring 2006 Tutorial 3 Ad-hoc networks TBRPF (based on IETF tutorials on TBRPF)
Delivery, Forwarding, and Routing
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Connecting Networks © 2004 Cisco Systems, Inc. All rights reserved. Exploring How Routing Works INTRO v2.0—4-1.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Routing and Routing Protocols Dynamic Routing Overview.
Link State Routing Protocols Last Update Copyright Kenneth M. Chipps Ph.D.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
Introduction to Routing and Routing Protocols By Ashar Anwar.
Distance Vector Routing Protocols W.lilakiatsakun.
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
CS 4396 Computer Networks Lab
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking BGP, Flooding, Multicast routing.
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
Mobile Routing protocols MANET
Mobile Adhoc Network: Routing Protocol:AODV
Ad hoc On-demand Distance Vector (AODV) Routing Protocol ECE 695 Spring 2006.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Carlos Rodrigo Aponte OLSRv2 High Level Overview.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
Page 110/27/2015 A router ‘knows’ only of networks attached to it directly – unless you configure a static route or use routing protocols Routing protocols.
OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.
Simulation of the OLSRv2 Protocol First Report Presentation.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
Doc.: IEEE /1047r0 Submission Month 2000August 2004 Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1 Routing Protocols for MANET Avinash Joshi,
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Routing Overview.
Distance Vector Routing Protocols Dynamic Routing.
Routing and Routing Protocols
Link State Routing David Holmer Generic Link State Routing  Each node monitors neighbors/local links and advertises them to the network.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
An internet is a combination of networks connected by routers. When a datagram goes from a source to a destination, it will probably pass through many.
Intro DSR AODV OLSR TRBPF Comp Concl 4/12/03 Jon KolstadAndreas Lundin CS Ad-Hoc Routing in Wireless Mobile Networks DSR AODV OLSR TBRPF.
Routing Protocols Brandon Wagner.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Routing Protocols and Concepts Dr. Muazzam A. Khan.
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Spring Routing: Part I Section 4.2 Outline Algorithms Scalability.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
1 Optimized Link State Routing Protocol for Ad Hoc Networks Jacquet, p IEEE INMIC Dec park gi won
+ Dynamic Routing Protocols 2 nd semester
1 CMPT 471 Networking II OSPF © Janice Regan,
Instructor Materials Chapter 5: Dynamic Routing
Packets & Routing Lower OSI layers (1-3) concerned with packets and the network Packets carry data independently through the network, and into other networks…
Routing Protocols and Concepts
Link-State Routing Protocols
Chapter 5: Dynamic Routing
by Saltanat Mashirova & Afshin Mahini
Link-State Routing Protocols
Viet Nguyen Jianqing Liu Yaqin Tang
Link-State Routing Protocols
Vinay Singh Graduate school of Software Dongseo University
Routing protocols in Mobile Ad Hoc Network
OSPF Protocol.
Presentation transcript:

Optimized Link State Protocol Version 2 Assaf Israel, Eli Nazarov, Asi Bross Version 2 Assaf Israel, Eli Nazarov, Asi Bross

OLSRv2 - Overview Applicability mobile ad-hoc networks (MANET) dynamic topology 100%> reliable environment (WiFi, WiMax) nodes can be gateways to other networks Characteristics Table driven proactive protocol Build on top of MANET NHDP Applicability mobile ad-hoc networks (MANET) dynamic topology 100%> reliable environment (WiFi, WiMax) nodes can be gateways to other networks Characteristics Table driven proactive protocol Build on top of MANET NHDP

TerminologyTerminology node 1-hop neighbor set 2-hop neighbor set bidirectional link interface node 1-hop neighbor set 2-hop neighbor set bidirectional link interface

Mobile Ad-hoc Networks Neighborhood Discovery Protocol A solid base for the OLSRv2 protocol. Objective - maintain 1-hop & 2-hop neighbors link state tables Pros Simplicity - only one type of messages Generic - does not limit to type of connectivity technology Cons Effects bandwidth as messages are routinely transmitted A solid base for the OLSRv2 protocol. Objective - maintain 1-hop & 2-hop neighbors link state tables Pros Simplicity - only one type of messages Generic - does not limit to type of connectivity technology Cons Effects bandwidth as messages are routinely transmitted

Mobile Ad-hoc Networks Neighborhood Discovery Protocol (cont.) Local Information Base - per node Active interface - IP tuples set Removed interface - IP tuples set Interface Information Base - per interface Link Set Current & Recently lost 1-hop neighbors to this interface Connection quality Validation time Local Information Base - per node Active interface - IP tuples set Removed interface - IP tuples set Interface Information Base - per interface Link Set Current & Recently lost 1-hop neighbors to this interface Connection quality Validation time InterfaceIP eth eth Link Set - eth0 Target InterfaceQualityV-Time eth ms eth ms eth1Lost-

Mobile Ad-hoc Networks Neighborhood Discovery Protocol (cont..) Interface Information Base (Cont.) 2-Hop Set Each entry consist of 2-hop address & all of the addresses of the corresponding symmetric 1-hop neighbor Each tuple records an address of recently lost 1-hop neighbor Interface Information Base (Cont.) 2-Hop Set Each entry consist of 2-hop address & all of the addresses of the corresponding symmetric 1-hop neighbor Each tuple records an address of recently lost 1-hop neighbor 2-Hop Set - eth0 2-hop IPReachable via [ , ] [ ] [ , ]

Mobile Ad-hoc Networks Neighborhood Discovery Protocol (cont.) Neighbor Information Base Neighbor Set - Neighbor tuples List all IP’s of a single 1-hop neighbor Lost Neighbor Set - Lost Neighbor tuples Neighbor Information Base Neighbor Set - Neighbor tuples List all IP’s of a single 1-hop neighbor Lost Neighbor Set - Lost Neighbor tuples Neighbor Set Local InterfaceTarget Interface set eth0 [ , ] eth0[ ] eth1 [ , ] Lost Neighbor Set Local InterfaceTarget Interface set eth0[ ]

“Hello” message The only type of message in MANET NHDP Generated by a node independently on each MANET interface Identify the source interface but adds information of all other local interfaces May be sent Proactively - at a regular pre-defined interval Dynamically - interval may be backed off to to congestion or network stability Event driven - e.g new/lost/changed status link The only type of message in MANET NHDP Generated by a node independently on each MANET interface Identify the source interface but adds information of all other local interfaces May be sent Proactively - at a regular pre-defined interval Dynamically - interval may be backed off to to congestion or network stability Event driven - e.g new/lost/changed status link

“Hello” message - Objectives Advertise the router’s interface addresses to it’s 1- hop neighbors. Advertise the router’s knowledge of each of its 1- hop neighbors. Advertise the router’s interface addresses to it’s 1- hop neighbors. Advertise the router’s knowledge of each of its 1- hop neighbors.

“Hello” message - Content Must contain all of the Local Interface Set IPs For each interface, and every pre-defined Refresh- Interval Must send all relevant information in the Interface Link Set & Neighbor Information Base. Validity Time for which the information is considered valid periodically should contain the Interval Time for which messages are sent from the interface. Must contain all of the Local Interface Set IPs For each interface, and every pre-defined Refresh- Interval Must send all relevant information in the Interface Link Set & Neighbor Information Base. Validity Time for which the information is considered valid periodically should contain the Interval Time for which messages are sent from the interface.

“Hello” message - Processing Updates the receiver’s Interface Information Base If an entry from the message source exists then the valid time is checked and updated accordingly If an entry does not exist from the message source, a new one will be created If a message contains information that a symmetrical link has been lost/created between the source and a third node the 2-hop neighbor, the 2-hop Set will be updated accordingly Updates to the Neighbor Information Base may occur Will cause generation of yet another Hello message Hello message are not forwarded Updates the receiver’s Interface Information Base If an entry from the message source exists then the valid time is checked and updated accordingly If an entry does not exist from the message source, a new one will be created If a message contains information that a symmetrical link has been lost/created between the source and a third node the 2-hop neighbor, the 2-hop Set will be updated accordingly Updates to the Neighbor Information Base may occur Will cause generation of yet another Hello message Hello message are not forwarded

MANET Neighborhood Discovery Protocol Optional extensions Link quality Jitter Link quality Jitter

OSLRv2 - Multi Point Relays Multipoint Relays (MPR)- Set of 1-hop neighbors which broadcast node’s packets. MPR must have bi-directional like with the node - avoid uni-directional link problems. The union of all neighbors of MPRs give the group of 2-hop neighbors of the node. Multipoint Relays (MPR)- Set of 1-hop neighbors which broadcast node’s packets. MPR must have bi-directional like with the node - avoid uni-directional link problems. The union of all neighbors of MPRs give the group of 2-hop neighbors of the node.

Multi Point Relays (Cont.) OLSRv2 uses MPR’s to calculate routes to all known nodes. Route is a sequence of hops through MPRs. Last MPR is the target node or the target is a 1-hop neighbor of the last MPR. MPR Selector is a neighbor that selected this node as a MPR. OLSRv2 uses MPR’s to calculate routes to all known nodes. Route is a sequence of hops through MPRs. Last MPR is the target node or the target is a 1-hop neighbor of the last MPR. MPR Selector is a neighbor that selected this node as a MPR.

SignalingSignaling Extends NHDP “Hello” messages to include the selected MPRs set of the source node. For each 1-hop neighbor with symmetric link that is selected as MPR for this router. TC messages Includes a Set of all 1-hop neighbors that selected the sending node as an MPR. Advertised Neighbor Set. Attached Network Set. Extends NHDP “Hello” messages to include the selected MPRs set of the source node. For each 1-hop neighbor with symmetric link that is selected as MPR for this router. TC messages Includes a Set of all 1-hop neighbors that selected the sending node as an MPR. Advertised Neighbor Set. Attached Network Set.

Message Processing & Forwarding TC messages may be processed and/or forwarded Hello messages are available to OLSRv2 after NHDP process - Never forwarded. TC messages may be processed and/or forwarded Hello messages are available to OLSRv2 after NHDP process - Never forwarded.

OSLRv2 - Databases All MANET NHDP Tables - with extensions e.g flags to indicate MPR and MPR selector in Neighbor set. Topology Information Base Processing & Forwarding Information Base All MANET NHDP Tables - with extensions e.g flags to indicate MPR and MPR selector in Neighbor set. Topology Information Base Processing & Forwarding Information Base

Topology Information Base Advertised Neighbor Set Includes addresses of neighbors that selected this node as MPR. Symmetric 1-hop neighbors that are advertised through TC massages. Derived from Neighbor Set. Advertised Remote Router Set Remote addresses of routers that transmits TC massages. Contains all of their addresses. Advertised Neighbor Set Includes addresses of neighbors that selected this node as MPR. Symmetric 1-hop neighbors that are advertised through TC massages. Derived from Neighbor Set. Advertised Remote Router Set Remote addresses of routers that transmits TC massages. Contains all of their addresses. Advertised Remote Router Set Source IPIP ListSequence No’Time [ , ] ms

Topology Information Base (Cont.) Topology Set Topology information about the network. Routing Set Records a path to each destination. Topology Set Topology information about the network. Routing Set Records a path to each destination. Topology Set Table Destination IPLast hopSequence No’Time ms Routing Set Table Destination IPNext hopHops No’Local Int’ eth0

Topology Information Base (Cont.) Attached Network Set Records Information about networks attached to other routers or can be reached via those router. Attached Network Set Records Information about networks attached to other routers or can be reached via those router. Attached network Set Net IPNet MaskRouter IPHops No’Sequence No’Time ms ms

Processing & Forwarding Information Base Used to ensure that each massage is processed and forwarded once, at most, per OLSRv2 interface Before processing/forwarding a massage, we must first check that it wasn't processed/forwarded yet. This is done using the information stored in Processing & Forwarding Information Base. Used to ensure that each massage is processed and forwarded once, at most, per OLSRv2 interface Before processing/forwarding a massage, we must first check that it wasn't processed/forwarded yet. This is done using the information stored in Processing & Forwarding Information Base.

Processing & Forwarding Information Base Received Set - per interface Signatures of messages received on this interface. Processed Set Signatures of messages processed by the router. Forwarded Set Signatures of messages forwarded by the router. Relay Set - per interface Symmetric 1-hop neighbors which messages should be forwarded when received on that interface. Received Set - per interface Signatures of messages received on this interface. Processed Set Signatures of messages processed by the router. Forwarded Set Signatures of messages forwarded by the router. Relay Set - per interface Symmetric 1-hop neighbors which messages should be forwarded when received on that interface.

“Hello” message process by OLSRv2 Updates its Neighbor Information Base if it was chosen as a MPR for the originator router (MPR Selector) In case of topology change the set of MPRs is recalculated. Updates its Neighbor Information Base if it was chosen as a MPR for the originator router (MPR Selector) In case of topology change the set of MPRs is recalculated.

TC messages processing When TC message received: Topology Set is updated. Advertised Remote Router Set is updated. Attached Network Set is updated. The Dijkstra algorithm can be used to construct the Routing Set When TC message received: Topology Set is updated. Advertised Remote Router Set is updated. Attached Network Set is updated. The Dijkstra algorithm can be used to construct the Routing Set

Packet routing When a packet needs to get from A to B it is sent to the next MPR as described in the Routing Set. Each MPR will forward the packet to the next MPR in the route. When a packet needs to get from A to B it is sent to the next MPR as described in the Routing Set. Each MPR will forward the packet to the next MPR in the route. Source Target MPR