An OLSR implementation, experience, and future design issues.

Slides:



Advertisements
Similar presentations
RIP V1 W.lilakiatsakun.
Advertisements

Design and Implementation of the OLSR Protocol in an Ad Hoc Framework Juan Gutiérrez Plaza Supervisor: Raimo Kantola Instructor: José Costa Requena Networking.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
1 CWCCWC Oulu Determining the Optimal Configuration for the Zone Routing Protocol By M. R. Pearlman and Z. J. Haas Presentation by Martti Huttunen
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Institute of Technology, Sligo Dept of Computing Routing & IGRP Semester 3, Chapter 5.
UM-OLSR OLSR routing protocol in NS2
CS541 Advanced Networking 1 Dynamic Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/10/2009.
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.
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Routing & IGRP Semester 3, Chapter 5 Allan Johnson.
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Routing and Routing Protocols
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
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.
Ad Hoc Wireless Routing COS 461: Computer Networks
ROUTING BASICS. Why are Routers Necessary? One of the key components of the technical infrastructure of the network One of the key components of the technical.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
Routing and Routing Protocols Routing Protocols Overview.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
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.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 6 Routing and Routing Protocols.
Mobile Adhoc Network: Routing Protocol:AODV
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
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.
Simulation of the OLSRv2 Protocol First Report Presentation.
The Performance of Query Control Schemes for the Zone Routing Protocol Zygmunt J. Haas Marc R. Pearlman.
Doc.: IEEE /1047r0 Submission Month 2000August 2004 Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1 Routing Protocols for MANET Avinash Joshi,
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Netprog: Routing and the Network Layer1 Routing and the Network Layer (ref: Interconnections by Perlman)
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
Routing and Routing Protocols
TCOM 515 Lecture 2. Lecture 2 Objectives Dynamic Routing Distance Vectore Routing Link State Routing Interior vs Exterior RIP - Routing Information Protocol.
Advanced Technology Centre © BAE SYSTEMS All rights reserved. Slide 1 OLSR Simulation and Implementation Christopher Dearlove
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
1 Version 3.1 Module 6 Routed & Routing Protocols.
SRI International 1 Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) Richard Ogier September 21, 2002.
Doc.: IEEE /0406r0 Submission March 2007 James P. Hauser, Naval Research LabSlide 1 A Comparison of Broadcast Routing Protocols Notice: This document.
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.
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.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
1 © 2004, Cisco Systems, Inc. All rights reserved. Routing and Routing Protocols: Routing Static.
1 Optimized Link State Routing Protocol for Ad Hoc Networks Jacquet, p IEEE INMIC Dec park gi won
Computer Networks 0110-IP Gergely Windisch
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Routing and Routing Protocols CCNA 2 v3 – Module 6.
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.
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Dynamic Routing Protocols II OSPF
Semester 3, Chapter 5 Allan Johnson
AODV-OLSR Scalable Ad hoc Routing
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Routing and Routing Protocols: Routing Static
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Routing Protocols and Concepts
Link-State Routing Protocols
A comparison of Ad-Hoc Routing Protocols
Sensor Network Routing
CCNA 2 v3.1 Module 6 Routing and Routing Protocols
THE NETWORK LAYER.
Chapter 5 The Network Layer.
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Routing and Routing Protocols: Routing Static
by Saltanat Mashirova & Afshin Mahini
Vidur Nayyar Xueting Wang Weicong Zhao
Link-State Routing Protocols
Link-State Routing Protocols
Routing and the Network Layer (ref: Interconnections by Perlman
Vinay Singh Graduate school of Software Dongseo University
Presentation transcript:

An OLSR implementation, experience, and future design issues

Implementation Nrlolsr evolved from OLSR draft version 3 – NRL had previous work which modified INRIAv3 code for research purposes –This effort was a complete restart and independent code implementation Built on top of NRLs protolib library for system portability Works with: linux, windows, wince, openzaurus, ns-2, opnet Nrlolsr is a research oriented OLSR implementation Has non-standard command line options for research purposes Nrlolsr is not fully rfc3626 compliant –Does not support MID messages or dual interfaces –Does not have standard TC_REDUNDANCY –Has different message jitter functionality –Uses a link-local multicast address instead of broadcast by default

History March 01: Release for ns-2 OLSR draft v3 June 01: Updated to draft v4 April 03: Release for linux, draft v8 Ns was temporarily not supported May 03: IPv6 support added October 03: Release for windows Febuary 04: Release for wince, ns2, and opnet

Current Design Structure Nrlolsr is built upon protolib and does not make any direct system calls. Protolib provides a system independent interface. Timers, socket calls, route table management, address handling are all taken care of though protolib calls. Core OLSR code is used for all supported systems. Porting Nrlolsr to a new system only requires re-defining existing protolib function calls.

Research Early development of nrlolsr helped test out early specifications. Nrlolsr is used to test out new methods. –Load balancing (not currently supported) –Fuzzy-sighted flooding –Tos routing –Simplified multicasting Nrlolsr was used to collect data for two NRL Milcom papers. –J. Dean, J. Macker, “A Study of Link State Flooding Optimizations for Scalable Wireless Networks,” MILCOM, Oct, 2003 –J. Macker, J. Dean, W. Chao, “An Implementation and Study of Simplified Multicast Forwarding in Mobile Ad hoc Networks,” MILCOM, Nov, 2004 (pending)

Research Options -al option will set TC_REDUNDANCY higher than 2. All nodes source tc messages of all of their neighbors. -fuzzy option will set ttl and validity time of outgoing tc messages based upon a preset equation. -slowdown option attempts to slow down the rate of sending tc messages if local neighborhood is stable -spf will perform shortest path first route calculations and send around spf information set manually (ns) or though packets from outside sources (custom mac layer). ~Qos delay -minmax will perform maximum smallest value calculations and send around minmax values set in same manor as spf. ~Qos throughput.

OLSR observations Number of MPRs in a network is not necessarily on the same scale as the total number of forwarders. Smaller hello interval or mac layer sensing generally improves route connectively. Willingness values in the range of 1-6 in most random networks do not drastically change overall performance. 0 and 7 can. -al option generally helps (-al=TC_REDUNDANCY2+) Its important to use active timers for hysteresis and not rely on sequence numbers. Jitter as specified changes interval.

MPR vs Forwards example 8 MPRs and at most 4 forwards Mpr node Non-mpr node Link

Willingness example Willingness values in node Default Willingness using 1-6 range Willingness using 0 and 7

TC_REDUNDANCY example Broadcast links with TC_REDUNDANCY Example network Broadcast links with TC_REDUNDANCY 2 or –al*

Debugging Examples Simulation work solved many debugging issues –Many complex scenarios were examined –Packet forwarding code was located in wrong place causing extra forwards. –Incorrect route calculations in which next connecting link was added no matter hop count. –Willingness method broken while using –al option. User reported bug issues –Nrlolsr was forwarding ttl of 1 –Many system specific issues –To many other to list Interop discovered bugs –Broadcast address configuration does not work correctly in linux –Parsing dual message packets does not process any but first message –Previous IPv6 support appears broken in NRLOLSR 7.4 release (will fix in next release)

Possible Future Improvements Hybrid proactive/reactive protocol Load balancing/type of service routing

Hybrid OLSR Current limitations and possible solutions No standard way of limiting flooding in terms of area –Develop 3 or more standard flooding patterns –Send interval time and flooding pattern instead of validity time and extrapolate validity time using hop count. No event driven link state messages –Allow event driven link state messages but put a cap on the amount –Only send event driven tcs when global routing will be affected No reactive route building and suggested approach –Define when route requests might be sent –Include path state in route requests –Have route replies include full link state path to destination –Allow virtual links of greater than one hop –Add links to link state database and redo routing table

Load balancing and TOS routing OLSR does not presently have a standard method for extra link cost values to be sent –Allow for TC+ messages which include fields for link values and type of value field –TC+ messages should also include node values –Route calculation methods should be developed for different types of service Many routing table implementations do not allow for load balancing or ToS routing

Conclusion Interop a success – several lessons learned OLSR is mature but room still exists for improvement Nrlolsr provides both simulation and real world operations Nrlolsr is a research oriented implementation Nrlolsr is freely available at pf.itd.nrl.navy.mil