Dynamic Routing. Lecturer: Carlos Rey-Moreno Networking Course Honors on Computer Science University of the Western Cape
|
|
- Winfred Ward
- 6 years ago
- Views:
Transcription
1 Dynamic Routing Lecturer: Carlos Rey-Moreno Networking Course Honors on Computer Science University of the Western Cape 18 Feb
2 Static vs Dynamic Routing Static Routing Dynamic Routing Creation of routing table Manual Automatic Difficulty High Low Control over the routes High (static) Limited (dynamic) Share routing information No Yes Memory /CPU overhead Low Medium Bandwidth overhead Low Medium Fault Tolerant No Yes Administrative Distance 1 Protocol specific
3 Dynamic Routing Categories There are two distinct categories of dynamic routing protocols: Distance-vector protocols Examples: RIP and IGRP Link-state protocols Examples: OSPF and IS-IS.
4 Distance Vector Protocols Key characteristics: Periodic updates of the full routing table (connected and learned routes) are sent to routing neighbors. Some form of distance is used to calculate a route s metric. RIP uses hopcount, and IGRP uses a composite of bandwidth and delay. Suffer from slow convergence 'Route by rumor' -> are highly susceptible to loops.
5 Distance Vector Protocols
6 Link-state Protocols Were developed to alleviate the convergence and loop issues of distance-vector protocols. It maintains three separate tables: Neighbor table contains a list of all neighbors, and the interface each neighbor is connected off of. Neighbors are formed by sending Hello packets. Topology table otherwise known as the linkstate table, contains a map of all links within an area, including each link s status. Shortest-Path table contains the best routes to each particular destination (otherwise known as the routing table )
7 Link-State Protocols
8 Wireless Dynamic Routing Protocols Classical routing protocols is that they are typically not well suited for wireless ad-hoc networks. Ad-hoc (mesh) networks are unstructured, dynamically change their topology, and are based on an inherently unreliable medium. Two types: Reactive (on demand): AODV and DSR Proactive: OLSR and B.A.T.M.A.N. 8
9 OLSR It is the currently most employed protocol for such scenarios Hello packets to discover 2-hop neighbors Distributed election of Multipoinf Relays (MPR) There exists a path to each of its 2-hop neighbors via a node selected as an MPR. MPR nodes then source and forward TC (topology control) messages that contain the MPR selectors. Not all links are advertised, not everyone advertise (only MPRs) Unreliable flooding 9
10 OLSR Limits of this algorithm Nodes need to be up all the time to keep the real routing table Use of resources (Hello and TC pcakets) Big mesh networks and requirement of a linkstate algorithm to recalculate the whole topology-graph Recalculating the whole topology graph once in an actual mesh with 450 nodes takes several seconds on a small embedded CPU (the normal one on wireless routers) 10
11 B.A.T.M.A.N. B.A.T.M.A.N. (better approach to mobile ad-hoc networking) is a routing protocol for multi-hop ad-hoc mesh networks. The approach is to divide the knowledge about the best endto-end paths between nodes in the mesh to all participating nodes. Each node perceives and maintains only the information about the best next hop towards all other nodes. An event-based flooding mechanism prevents the accruement of contradicting topology information and limits the amount of topology messages flooding the mesh Avoids loops, overhead of control traffic & optimizes routing decisions Info, documentation, downloads: 11
12 B.A.T.M.A.N algorithm Each node transmits broadcast messages (originator messages or OGMs) to inform the neighboring nodes about it's existence. Neighbors re-broadcast the OGMs according to specific rules to inform their neighbors about the existence of the original initiator of this message and so on. Thus the network is flooded with OGMs messages. OGMs are small, the typical raw packet size is 28 byte OGMs contain at least the address of the originator, the address of the node transmitting the packet, a TTL and a sequence number. A node sends an OGM by default each 1000 ms (1 second). 12
13 Processing the OGMs OGMs from a path with low quality will suffer more from packetloss or delay than those through faster and more reliable links. The sequence number tells it the OGM has been received once or more than once. Only the first one will be kept. Each node re-broadcasts each received OGM at most once and only those received from the neighbor which has been identified as the currently best next hop (best ranking neighbor) towards the original initiator of the OGM. The algorithm selects this neighbor as the currently best next hop to the originator of the message and configures its routing table respectively 13
14 Administrative Distance in BATMAN In B.A.T.M.A.N the concept is Transmission Quality (TQ). But how do we calculate it? With the Receive Quality (Received vs Expected) EQ= TQ*RQ => Local TQ=EQ/RQ And the Echo Quality (Generated vs Received in rebroadcast) 14
15 Path TQ OGM are generated with TQ 100% (255) Each node applies its own (local) TQ to the neighbor which sent the packet, before retransmitting Path TQ = Local TQ * Path TQ 15
16 OGM rebroadcast It only retransmits info about the best next node towards a destination. OGMs received within 100ms are aggregated 16
17 Penalization to TQ Asymmetry of links (on the Tx side) Interference on the Rx side (accounted in TQ) High RQ, low EQ (OGM dropped by interference) TQ low Interference on the Tx side. Similar RQ and similar EQ TQ High Hop Penalty Path TQ = Path TQ * (1 - HopPenalty) (default is 0.03) 17
18 Visualizing routing table (batctl o) [B.A.T.M.A.N. adv , MainIF/MAC: ath0/00:09:45:5b:69:ae (bat0)] Originator last-seen (#/255) Nexthop [outgoingif]: Potential nexthops s ( 76) [ ath0]: ( 29) ( 37) ( 76) s ( 86) [ ath0]: ( 32) ( 86) ( 43) s (177) [ ath0]: ( 58) (177) ( 77) s ( 93) [ ath0]: ( 34) ( 93) ( 43) s ( 73) [ ath0]: ( 28) ( 32) ( 73) s (207) [ ath0]: ( 0) (207) ( 77) s (100) [ ath0]: ( 39) (100) ( 47) s (217) [ ath0]: (107) (217) ( 84) s (220) [ ath0]: ( 71) (220) (115) s (242) [ ath0]: ( 71) ( 89) (242) 18
19 Real example 19
20 What do we see? Nowayilesi's MP (26) is down The connection with Headman's MP (20) is as weak as for getting OGMs through All the communications go through Scooter's MP (29) It has very good TQ to 24, 28 and 28 (even through 29, remember Hop Penalty) and week with the rest. 20
21 An small issue (default mtu not enough) batman-adv inserts an additional header of 28 bytes into each data packet being send over the mesh. We are increasing the maximum size of a packet over the plain interfaces to 1528, so that packets with the standard MTU of 1500 can pass normaly through bat0. That means that the mtu option need to be change in the physical interface running batman-adv. In our case is over the WiFi interface, which name is wifi0. 21
22 Parameters we can tweak By default (in /etc/config/batman-adv): orig_interval Default : 1s. No need for so many if nodes are not going to move aggregated_ogms Default: enables. It should reduce bandwidth overhead and collisions. hop_penalty Default: 30. It should be ok for most scenarios. 22
23 Parameters we can tweak Inside the code (main.h) BATADV_MAX_AGGREGATION_MS 100 The bigger the period the smaller the number of packets BATADV_TQ_LOCAL_WINDOW_SIZE 64 The bigger the window, the bigger the influence of the past (bad for mobility) BATADV_TQ_GLOBAL_WINDOW_SIZE 5.. For averaging the TQ to a given node from distinct neighbors. 23
24 Other ideas Variable Hop Penalty depending on the rate Not taking 30 all the time, but checking the rate you can use with the neighbor and penalize more for slower rates. Reward routes that avoid the hidden node problem. Penalizing those routes where the hidden node problem may happen 24
25 Ways of implementing it Batman has been implemented via: batmand, a daemon running at IP layer doing traditional dynamic routing Batman-adv, a kernel module above the MAC layer that creates bridged networks among the batman-adv interfaces. We are going to focus in batman-adv that is the one getting more support and updates (batmand stop 3 years ago) 25
Routing / Bridging. Lecturer: Carlos Rey-Moreno
Routing / Bridging Lecturer: Carlos Rey-Moreno carlos.reymoreno@gmail.com Networking Course Honors on Computer Science University of the Western Cape 12 Feb - 2013 Routed Networks Routed access points
More informationMobile Communications. Ad-hoc and Mesh Networks
Ad-hoc+mesh-net 1 Mobile Communications Ad-hoc and Mesh Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto Ad-hoc+mesh-net 2 What is an ad-hoc network? What are differences between
More informationolsr.org 'Optimized Link State Routing' and beyond December 28th, 2005 Elektra mesh.net
olsr.org 'Optimized Link State Routing' and December 28th, 2005 Elektra www.open mesh.net Introduction Olsr.org is aiming to an efficient opensource routing solution for wireless networks Work is currently
More informationUnicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks
Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on
More informationChapter 7 Routing Protocols
Chapter 7 Routing Protocols Nonroutable Protocols In the early days of networking, networks were small collections of computers linked together For the purposes of sharing information and expensive peripherals
More informationLecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday
Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing
More informationWhy dynamic route? (1)
Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update
More information2013, IJARCSSE All Rights Reserved Page 85
Volume 3, Issue 12, December 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Overview of
More informationImplementation and simulation of OLSR protocol with QoS in Ad Hoc Networks
Implementation and simulation of OLSR protocol with QoS in Ad Hoc Networks Mounir FRIKHA, Manel MAAMER Higher School of Communication of Tunis (SUP COM), Network Department, m.frikha@supcom.rnu.tn ABSTRACT
More informationAd Hoc Networks: Issues and Routing
Ad Hoc Networks: Issues and Routing Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse574-08/
More informationArvind Krishnamurthy Fall 2003
Ad-hoc Routing Arvind Krishnamurthy Fall 2003 Ad Hoc Routing Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems
More informationBetter Approach To Mobile Adhoc Networking
Better Approach To Mobile Adhoc Networking batman-adv - Kernel Space L2 Mesh Routing Martin Hundebøll Aalborg University, Denmark March 28 th, 2014 History of batman-adv The B.A.T.M.A.N. protocol initiated
More informationICS 351: Today's plan. distance-vector routing game link-state routing OSPF
ICS 351: Today's plan distance-vector routing game link-state routing OSPF distance-vector routing game 1. prepare a list of all neighbors and the links to them, and the metric for each link 2. create
More informationComparison of proposed path selection protocols for IEEE s WLAN mesh networks
Comparison of proposed path selection protocols for IEEE 802.11s WLAN mesh networks Sana Ghannay, Sonia Mettali Gammar and Farouk Kamoun CRISTAL lab, National School of Computer Sciences, ENSI, 2010, Manouba
More informationMobile Ad-hoc and Sensor Networks Lesson 05 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 2
Mobile Ad-hoc and Sensor Networks Lesson 05 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 2 Oxford University Press 2007. All rights reserved. 1 Temporally ordered routing algorithm (TORA) A reactive
More informationIntroduction to WiFi Networking. Training materials for wireless trainers
Introduction to WiFi Networking Training materials for wireless trainers Goals The goal of this lecture is to introduce 802.11 family of radio protocols 802.11 radio channels wireless network topologies
More informationPerformance Analysis of MANET Routing Protocols OLSR and AODV
VOL. 2, NO. 3, SEPTEMBER 211 Performance Analysis of MANET Routing Protocols OLSR and AODV Jiri Hosek Faculty of Electrical Engineering and Communication, Brno University of Technology Email: hosek@feec.vutbr.cz
More informationImproving B.A.T.M.A.N. Routing Stability and Performance
UNIVERSITÀ DEGLI STUDI DI TRENTO Facoltà di Scienze Matematiche, Fisiche e Naturali Corso di Laurea magistrale in Informatica Elaborato finale Improving B.A.T.M.A.N. Routing Stability and Performance Relatore:
More informationQUALITATIVE ANALYSIS AND PERFORMANCE EVALUATION OF OLSR, RIP, OSPF USING OPNET
QUALITATIVE ANALYSIS AND PERFORMANCE EVALUATION OF OLSR, RIP, OSPF USING OPNET Uppe Nanaji, Chatikam Raj Kumar, Dr. N.Thirupathi Rao Department of CSE Vignan s Institute of Information Technology Visakhapatnam,
More informationVaibhav Jain 2, Pawan kumar 3 2,3 Assistant Professor, ECE Deptt. Vaish College of Engineering, Rohtak, India. Rohtak, India
Volume 3, Issue 8, August 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Improved OLSR
More informationMobile Ad-hoc Networks
Mobile Ad-hoc Networks Fred Baker 1 The manet problem Mobile Random and perhaps constantly changing Ad-hoc Not engineered Networks Elastic data applications which use networks to communicate 2 Examples
More informationRouting Protocols in MANET: Comparative Study
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119
More informationTop-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols
Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Switching 2 Page 1 Objectives MAC address table Describe the features
More informationPerformance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols
www.ijcsi.org 551 Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols Kashif Ibrahim Qazi Javed Ahmed Abdul Qudoos Mirza Aamir Mehmood Department of Computer Science, Balochistan
More informationInter-networking. Problem. 3&4-Internetworking.key - September 20, LAN s are great but. We want to connect them together. ...
1 Inter-networking COS 460 & 540 2 Problem 3 LAN s are great but We want to connect them together...across the world Inter-networking 4 Internet Protocol (IP) Routing The Internet Multicast* Multi-protocol
More informationOSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190
Chapter 17 OSPF Protocol Overview The Open Shortest Path First (OSPF) protocol is an interior gateway protocol (IGP) that routes packets within a single autonomous system (AS). OSPF uses link-state information
More informationBTEC Level 3 Extended Diploma
BTEC Level 3 Extended Diploma Unit 9 Computer Network Routing and Routing Protocols BTEC Level 3 Extended Diploma Introduction to Routing Routing is the process that a router uses to forward packets toward
More informationPerformance Of OLSR Routing Protocol Under Different Route Refresh Intervals In Ad Hoc Networks
Performance Of OLSR Routing Protocol Under Different Route Refresh Intervals In Ad Hoc Networks P.Suganthi Research Scholar Mother Teresa Women s University Kodaikanal, TamilNadu, India Dr.A.Tamilarasi
More informationEIGRP Features and Operation
EIGRP Features and Operation Enhanced IGRP (EIGRP) is a classless, enhanced distance-vector protocol. EIGRP is a Cisco proprietary protocol. EIGRP includes the subnet mask in its route updates. And as
More informationOptimized Link State Routing
Optimized Link State Routing Proactive link-state protocol Periodic exchange of messages: Neighborhood discovering Topology information dissemination Optimized for MANETs Compacts the size of the information
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions
More informationEECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.
EECS 122, Lecture 16 Kevin Fall kfall@cs.berkeley.edu edu Link Costs and Metrics Routing protocols compute shortest/cheapest paths using some optimization criteria Choice of criteria has strong effect
More informationComprehensive Study and Review Various Routing Protocols in MANET
126 Comprehensive Study and Review Various Routing Protocols in MANET Prabhjot Kaur 1, Preet Bala 2 M-Tech Student(CSE), GZS PTU CAMPUS, Bathinda Prabhjot6996@gmail.com Dr. Shaveta Rani, Dr. Paramjeet
More informationRouting Protocols in MANETs
Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an
More informationLecture 12: Link-state Routing. Lecture 12 Overview. Router Tasks. CSE 123: Computer Networks Chris Kanich. Routing overview
Lecture : Link-state Routing CSE 3: Computer Networks Chris Kanich Lecture Overview Routing overview Intra vs. Inter-domain routing Link-state routing protocols CSE 3 Lecture : Link-state Routing Router
More informationMobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1
Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1 Oxford University Press 2007. All rights reserved. 1 Ad-hoc networks deployment For routing, target detection,
More informationSection 6. Implementing EIGRP ICND2
ICND2 Section 6 Implementing EIGRP Enhanced Interior Gateway Routing Protocol (EIGRP) was introduced in Cisco IOS Release 9.21 as an enhancement to the limitations of IGRP. IGRP was developed by Cisco
More informationCHAPTER 4: ROUTING DYNAMIC. Routing & Switching
CHAPTER 4: ROUTING DYNAMIC Routing & Switching CHAPTER4 4.1 Dynamic Routing Protocols 4.2 Distance Vector Dynamic Routing 4.3 RIP and RIPng Routing 4.4 Link-State Dynamic Routing 4.5 The Routing Table
More informationSEMESTER 2 Chapter 3 Introduction to Dynamic Routing Protocols V 4.0
SEMESTER 2 Chapter 3 Introduction to Dynamic Routing Protocols V 4.0 3.1.1 What are the four routing RIP, RIPv2, EIGRP, OSPFv2 protocols that are the focus of this course? 3.1.1.2 What are routing protocols?
More informationSimulation and Performance Analysis of OLSR Routing Protocol Using OPNET
Volume 2, Issue 2, February 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Simulation and Performance Analysis
More informationA COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET
ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer
More informationContent. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.
Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management
More informationYouki Kadobayashi NAIST
Information Network 1 Routing (1) Youki Kadobayashi NAIST 1 The Routing Problem! How do I get from source to destination?! Which path is best? In terms of:! Number of hops! Delay! Bandwidth! Policy constraints!
More informationRouting in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14
Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path
More informationEstimate the Routing Protocols for Internet of Things
Estimate the Routing Protocols for Internet of Things 1 Manjushree G, 2 Jayanthi M.G 1,2 Dept. of Computer Network and Engineering Cambridge Institute of Technology Bangalore, India Abstract Internet of
More informationPerformance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols
Performance Comparison of Ad Hoc Routing Protocols over IEEE 82.11 DCF and TDMA MAC Layer Protocols Govind. P. Gupta Computer Science Department R.K.G.I.T, Ghaziabad (India) er_gpgupta@yahoo.com A. K.
More informationChapter 7: Routing Dynamically. Routing & Switching
Chapter 7: Routing Dynamically Routing & Switching The Evolution of Dynamic Routing Protocols Dynamic routing protocols used in networks since the late 1980s Newer versions support the communication based
More informationLecture 8: Networks to Internetworks
Lecture 8: Networks to Internetworks CSE 123: Computer Networks Alex C. Snoeren NO CLASS FRIDAY Lecture 8 Overview Bridging & switching Learning bridges Spanning Tree Internetworking Routering Internet
More informationPerformance Study of the Better Approach to Mobile Adhoc Networking (B.A.T.M.A.N.) Protocol in the Context of Asymmetric Links
Performance Study of the Better Approach to Mobile Adhoc Networking (B.A.T.M.A.N.) Protocol in the Context of Asymmetric Links Alexander Klein and Lothar Braun and Fabian Oehlmann Institute of Computer
More informationA Comparative Study of Routing Protocols for Mobile Ad-Hoc Networks
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 11, November 2014,
More informationCE693: Adv. Computer Networking
CE693: Adv. Computer Networking L-10 Wireless Broadcast Fall 1390 Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan Seshan at CMU. When slides are
More informationUniversity of Trento, Italy
University of Trento, Italy Laboratory activities for the Nomadic Communications course 2009/200: Report 2 Marco Dalla Torre 363 marco.dallatorre@studenti.unitn.it Simone Raffaele 40950 simone.raffaele@studenti.unitn.it
More informationPerformance Evaluation of AODV DSDV and OLSR Routing Protocols with Varying FTP Connections in MANET
Performance Evaluation of AODV DSDV and OLSR Protocols with Varying FTP Connections in MANET Alok Upadhyay, Rupali Phatak Research Scholar, Asst. Professor -Department of Electronics & Communication Engineering
More information15-441: Computer Networking. Lecture 24: Ad-Hoc Wireless Networks
15-441: Computer Networking Lecture 24: Ad-Hoc Wireless Networks Scenarios and Roadmap Point to point wireless networks (last lecture) Example: your laptop to CMU wireless Challenges: Poor and variable
More informationKeywords- Routing protocols, Mobile Ad hoc network, routing schemes Classification of protocols, Comparison of protocols.
Classification of Routing Protocol in Mobile Ad Hoc Networks: A Review Vishal Pahal,* Amit Verma, Payal Gupta Department of Computer Science & Engineering Jind Institute of Engineering & technology. Jind,
More informationPlanning for Information Network
Planning for Information Network Lecture 8: Network Routing Protocols Assistant Teacher Samraa Adnan Al-Asadi 1 Routing protocol features There are many ways to characterize routing protocols, including
More informationDistance Vector Routing Protocols
Distance Vector Routing Protocols Routing Protocols and Concepts Chapter 4 Version 4.0 1 Objectives Identify the characteristics of distance vector routing protocols. Describe the network discovery process
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta Jetcheva Presentation by: Michael Molignano Jacob
More informationConfiguring EIGRP. 2001, Cisco Systems, Inc.
Configuring EIGRP 4-1 EIGRP Overview 4-2 What Is EIGRP? IPX Routing Protocols IP Routing Protocols AppleTalk Routing Protocol Enhanced IGRP IP Routing Protocols AppleTalk Routing Protocol IPX Routing Protocols
More informationCS551 Ad-hoc Routing
CS551 Ad-hoc Routing Bill Cheng http://merlot.usc.edu/cs551-f12 1 Mobile Routing Alternatives Why not just assume a base station? good for many cases, but not some (military, disaster recovery, sensor
More informationMobile & Wireless Networking. Lecture 10: Mobile Transport Layer & Ad Hoc Networks. [Schiller, Section 8.3 & Section 9] [Reader, Part 8]
192620010 Mobile & Wireless Networking Lecture 10: Mobile Transport Layer & Ad Hoc Networks [Schiller, Section 8.3 & Section 9] [Reader, Part 8] Geert Heijenk Outline of Lecture 10 Mobile transport layer
More informationOctober Copyright (C) The Internet Society (2003). All Rights Reserved.
Network Working Group Request for Comments: 3626 Category: Experimental T. Clausen, Ed. P. Jacquet, Ed. Project Hipercom, INRIA October 2003 Status of this Memo Optimized Link State Routing Protocol (OLSR)
More informationECS-087: Mobile Computing
ECS-087: Mobile Computing Mobile Adhoc Networks and Routing in MANETS (most of the slides borrowed from Prof. Sridhar Iyer) Diwakar Yagyasen 1 Index Mobile Ad Hoc Networks (MANET) MAC in MANET MANET routing
More informationImpact of Link Discovery Delay on Optimized Link State Routing Protocol for Mobile ad hoc Networks
Impact of Link Discovery Delay on Optimized Link State Routing Protocol for Mobile ad hoc Networks Akhila Kondai Problem Report submitted to the Benjamin M. Statler College of Engineering and Mineral Resources
More informationPerformance evaluation of reactive and proactive routing protocol in IEEE ad hoc network
Author manuscript, published in "ITCom 6 - next generation and sensor networks, Boston : United States (26)" DOI :.7/2.68625 Performance evaluation of reactive and proactive routing protocol in IEEE 82.
More informationRouting with a distance vector protocol - EIGRP
Routing with a distance vector protocol - EIGRP Introducing Routing and Switching in the Enterprise Chapter 5.2 Copyleft 2012 Vincenzo Bruno (www.vincenzobruno.it) Released under Crative Commons License
More informationRumor Routing Algorithm
Aleksi.Ahtiainen@hut.fi T-79.194 Seminar on Theoretical Computer Science Feb 9 2005 Contents Introduction The Algorithm Research Results Future Work Criticism Conclusions Introduction is described in paper:
More informationINTERNATIONAL JOURNAL FOR ADVANCE RESEARCH IN ENGINEERING AND TECHNOLOGY WINGS TO YOUR THOUGHTS..
INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH An Overview of Mobile Ad-Hoc Networks: Architecture, Routing and Challenges Avadhesh Kumar 1 Sonali Yadav 2 Kamalesh Chandra Maurya 3 1 Assistant Professor, avadhesh@iul.ac.in
More informationSEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 RIP, IGRP, EIGRP
SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 4.1.1 What are the three distance vector routing protocols? What are the key characteristics of RIP? What are the key characteristics of IGRP?
More informationLECTURE 9. Ad hoc Networks and Routing
1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links
More informationComputer Networks. Routing Algorithms
Computer Networks Routing Algorithms Topics Routing Algorithms Shortest Path (Dijkstra Algorithm) Distance Vector Routing Count to infinity problem Solutions for count to infinity problem Link State Routing
More informationYouki Kadobayashi NAIST
Information Network 1 Routing (1) Image: Part of the entire Internet topology based on CAIDA dataset, using NAIST Internet viewer Youki Kadobayashi NAIST 1 The Routing Problem! How do I get from source
More informationQoS Routing in Ad-hoc Networks
QoS Routing in Ad-hoc Networks Seminar Presentation for Advanced Topics in Broadband Networks Nirmal Mahadevan Balasubramanyam Guruprasad Sudharsan Srinivasan Outline QoS Parameters of QoS Challenges,
More informationQoS Routing using OLSR with Optimization for Flooding
QoS Routing using OLSR with Optimization for Flooding 1 Suman Banik, 2 Bibhash Roy, 3 Parthi Dey, 4 Nabendu Chaki, 5 Sugata Sanyal 1 Department of Election, Govt. of Tripura, India, 2 Tripura Institute
More informationSimulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Abstract Keywords:
Volume-9 Number-1 Jan -June 2017 pp. 16-21 available online at www.csjournalss.com Simulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Sachin Lalar, Arun Kumar Yadav
More informationTopics for This Week
Topics for This Week Routing Protocols in the Internet OSPF, BGP More on IP Fragmentation and Reassembly ICMP Readings Sections 5.6.4-5.6.5 1 Hierarchical Routing aggregate routers into regions, autonomous
More informationThe Performance of MANET Routing Protocols for Scalable Video Communication
Communications and Network, 23, 5, 9-25 http://dx.doi.org/.4236/cn.23.522 Published Online May 23 (http://www.scirp.org/journal/cn) The Performance of MANET Routing Protocols for Scalable Video Communication
More informationClustered Multi-layer Multi-protocol Wireless Mesh Networks
Clustered Multi-layer Multi-protocol Wireless Mesh Networks Taha Abdalla 1, Carlos Rey-Moreno 2 and William D. Tucker 2 and Antoine Bagula 2 Department of Computer Science University of the Western Cape
More informationCompSci 356: Computer Network Architectures. Lecture 8: Spanning Tree Algorithm and Basic Internetworking Ch & 3.2. Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 8: Spanning Tree Algorithm and Basic Internetworking Ch 3.1.5 & 3.2 Xiaowei Yang xwy@cs.duke.edu Review Past lectures Single link networks Point-to-point,
More informationRouting Performance of Wireless Mesh Networks: A Practical Evaluation of BATMAN Advanced
11th IEEE International Workshop on Wireless Local Networks WLN 2011, Bonn Routing Performance of Wireless Mesh Networks: A Practical Evaluation of BATMAN Advanced Daniel Seither, André König Multimedia
More informationCCNA IP ROUTING. Revision no.: PPT/2K605/03
CCNA 640-801 IP ROUTING Revision no.: PPT/2K605/03 Routing Basics The term routing is used for taking a packet from one device and sending it through the network to another device on a different network.
More informationDistance-Vector Routing: Distributed B-F (cont.)
istance-vector Routing: istributed - (cont.) xample [ istributed ellman-ord lgorithm ] ssume each node i maintains an entry (R(i,x), L(i,x)), where R(i,x) is the next node along the current shortest path
More informationTo enhance Routing in ZigBee Wireless Networks
To enhance Routing in ZigBee Wireless Networks P.Chanthiya Assistant Professor Department of Computer Science & Engineering, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur, India Abstract The
More informationTHE OSI MODEL. Application Presentation Session Transport Network Data-Link Physical. OSI Model. Chapter 1 Review.
THE OSI MODEL Application Presentation Session Transport Network Data-Link Physical OSI Model Chapter 1 Review By: Allan Johnson Table of Contents Go There! Go There! Go There! Go There! Go There! Go There!
More informationRouting Protocol comparison
Routing Protocol comparison Introduction to routing Networks allow people to communicate, collaborate, and interact in many ways. Networks are used to access web pages, talk using IP telephones, participate
More informationICS 351: Today's plan. OSPF BGP Routing in general
ICS 351: Today's plan OSPF BGP Routing in general link-state routing in distance-vector (Bellman-Ford, Ford-Fulkerson, RIP-style) routing, each router distributes its routing table to its neighbors an
More informationRouting protocols in WSN
Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can
More informationIntroduction to IP Routing. Geoff Huston
Introduction to IP Routing Geoff Huston Routing How do packets get from A to B in the Internet? A Internet B Connectionless Forwarding Each router (switch) makes a LOCAL decision to forward the packet
More informationCLASSIFICATION OF ROUTING Routing. Fig.1 Types of routing
Volume 5, Issue 5, MAY 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Survey on Unicast
More informationChapter 3. Introduction to Dynamic Routing Protocols. CCNA2-1 Chapter 3
Chapter 3 Introduction to Dynamic Routing Protocols CCNA2-1 Chapter 3 Introduction to Dynamic Routing Protocols Introduction to Dynamic Routing Protocols CCNA2-2 Chapter 3 Perspective and Background Dynamic
More informationYouki Kadobayashi NAIST
Information Network 1 Routing (1) Image: Part of the entire Internet topology based on CAIDA dataset, using NAIST Internet viewer Youki Kadobayashi NAIST 1 The Routing Problem How do I get from source
More informationQuantitative Performance Evaluation of DSDV and OLSR Routing Protocols in Wireless Ad-hoc Networks
Quantitative Performance Evaluation of DSDV and OLSR Routing Protocols in Wireless Ad-hoc Networks E. Suresh Babu P S V Srinivasa Rao M Srinivasa Rao C Nagaraju Assoc. Prof. of CSE K L University, Vijayawada.
More informationMANET TECHNOLOGY. Keywords: MANET, Wireless Nodes, Ad-Hoc Network, Mobile Nodes, Routes Protocols.
MANET TECHNOLOGY Dharna 1, Varsha Saroha 2, R. B. Dubey 3 1,2,3 Department of Electronics and Communication Engineering, Hindu College of Engineering, Sonepat, Haryana,(India) ABSTRACT Wireless technology
More informationROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols
ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols 1 Why can t we use conventional routing algorithms here?? A sensor node does not have an identity (address) Content based and data centric
More informationDelay Tolerant Networks
Delay Tolerant Networks DEPARTMENT OF INFORMATICS & TELECOMMUNICATIONS NATIONAL AND KAPODISTRIAN UNIVERSITY OF ATHENS What is different? S A wireless network that is very sparse and partitioned disconnected
More information' INRIA Rocquencourt, Domaine de Voluceau
OPTIMIZED FLOODING AND INTERFERENCE-AWARE QOS ROUTING IN OLSR* Dang Quan ~ ~ u ~ and e n Pascale ' ~inet' ' INRIA Rocquencourt, Domaine de Voluceau Rocquencourt - B.P 105 78153 Le Chesnay Cedex, France
More informationCSCE 463/612 Networks and Distributed Processing Spring 2018
CSCE 463/612 Networks and Distributed Processing Spring 2018 Network Layer IV Dmitri Loguinov Texas A&M University April 12, 2018 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter
More informationOpen Shortest Path First (OSPF)
CHAPTER 42 Open Shortest Path First (OSPF) Background Open Shortest Path First (OSPF) is a routing protocol developed for Internet Protocol (IP) networks by the interior gateway protocol (IGP) working
More informationFigure 1: Ad-Hoc routing protocols.
Performance Analysis of Routing Protocols for Wireless Ad-Hoc Networks Sukhchandan Lally and Ljiljana Trajković Simon Fraser University Vancouver, British Columbia Canada E-mail: {lally, ljilja}@sfu.ca
More informationSome portions courtesy Srini Seshan or David Wetherall
CSE 123 Computer Networks Fall 2009 Lecture 6: Data-Link III: Hubs, Bridges and Switches Some portions courtesy Srini Seshan or David Wetherall Misc Homework solutions have been posted I ll post a sample
More information