Ad-Hoc Networks. Manet: Mobile Ad-hoc Networking. Problems of Traditional Routing Algorithms. Traditional Routing Algorithms.

Size: px
Start display at page:

Download "Ad-Hoc Networks. Manet: Mobile Ad-hoc Networking. Problems of Traditional Routing Algorithms. Traditional Routing Algorithms."

Transcription

1 d-oc Networks Standard Mobile IP needs an infrastructure ome gent/oreign gent in the fixed network NS, routing etc. are not designed for mobility Sometimes there is no (stable) infrastructure! Wireless backbone, ad-hoc meetings, disaster areas cost can also be an argument against an infrastructure! Main topic: routing No default router available very node should be able to do forwarding Manet: Mobile d-hoc Networking Mobile Router Mobile evices ixed Network Manet Mobile IP, P Router nd system d-hoc network: each mobile device also is a mobile router Wireless mesh networks: backbone of designated wireless routers, usually not mobile 1 2 Traditional Routing lgorithms Problems of Traditional Routing lgorithms istance Vector Periodic exchange of messages with all physical neighbors that contain information about who can be reached at what distance Selection of the shortest path if several paths available Inefficient in ad-hoc networks Link State Periodic notification of all routers about the current state of all physical links Router get a complete picture of the network ompletely fails in ad-hoc networks eneral classification of routing protocols Proactive: frequent updates, complete routing tables Reactive: update only on demand ybrid: mix of proactive and reactive schemes symmetric connection The transmission quality in both directions can differ heavily If a route in one direction exists, maybe it does not hold for the other direction Redundant links Maybe a whole mesh of connections exists complex network, thus high computation overhead for routers Limited performance of mobile systems Periodic update of routing tables needs energy without contributing to the transmission of user data, sleep modes difficult to realize Limited bandwidth of the system is reduced even more due to the exchange of routing information Interference ata loss rate ut also can be useful to learn about the topology 3 4

2 Problems of Traditional Routing lgorithms ynamic of topology Largest problem: frequent changes of connections, connection quality, participants! N 1 N 4 N 2 N 5 N 3 time = t 1 time = t 2 good connection bad connection N 1 N 4 N 2 N 5 N 3 Possible Routing Protocols Many protocols have been proposed, partly adapted versions of Internet routing protocols, partly new inventions for MNTs but no single protocol works well in all environments: Reactive Protocols ynamic Source Routing (SR) d hoc On-demand istance Vector (OV) Temporally Ordered Routing lgorithm (TOR) Proactive Protocols (e.g., traditional link-state and distance-vector routing protocols) estination Sequenced istance Vector (SV) Optimized Link State Routing (OLSR) isheye State Routing (SR) ybrid Protocols Zone Routing Protocol (ZRP) 5 6 Which Protocol to choose? irst pproach: ynamic Source Routing Latency of route discovery Proactive protocols may have lower latency in finding paths to a destination since routes are maintained at all times Reactive protocols may have higher latency because a route from X to Y will be found only when X attempts to send to Y Overhead of route discovery/maintenance Reactive protocols may have lower protocol overhead since routes are determined only if needed Proactive protocols can (but not necessarily) result in higher overhead due to continuous route updating Which approach achieves a better trade-off of latency and overhead depends on the traffic and mobility patterns ut why not simply using flooding? Split routing into discovering a path and maintaining a path during usage iscover a path Only if a path for sending packets to a certain destination is needed and no path is currently available roadcast a packet with destination address and unique I (flooding) risk of collisions of route request messages coming in over different paths If a station receives a broadcast packet If the station is the receiver (i.e., has the correct destination address) then return the packet to the sender (path was collected in the packet) If the packet has already been received earlier (identified via I) then discard the packet Otherwise, append own address and broadcast packet Sender receives packet with the current path (address list) The destination can read out the path and answer the same way (symmetric paths!) or starts the same procedure in the other direction 7 8

3 ynamic Source Routing ynamic Source Routing Use and maintain a path When sending a packet, fill in the whole path information (IP header options) fter sending a packet Wait for a layer 2 acknowledgement (if applicable) Listen into the medium to detect if other stations forward the packet (if possible) Request an explicit acknowledgement If a station encounters problems it can inform the sender of a packet or look-up a new path locally Only while the path is in use one has to make sure that it can be used continuously 9 10 Modifications of SR dvantages and isadvantages of SR lot of modifications are proposed to improve the mechanism Nodes could sense the medium to learn about the topology from passing control messages Restriction of the forwarding of route requests by defining a maximum range of the request messages (TTL) if the path length to the receiver is known, this can avoid flooding the whole network in all directions aching of path information using passing route requests/replies caching all route information for a certain time can help in many ways: Speed up route discovery (usage for own or foreign path choice) Reduces flooding of route requests When an error is detected, try to locally change the source-designated route ut: route reply storms since many nodes know an answer use random delays for route replies to avoid interference at the receiving node dvantages No periodic updates needed, a path only is searched on demand reduced overhead for route maintenance ast route discovery if route caching is applied Several redundant paths due to several intermediate nodes replying with cached information isadvantages elay before a sending and after problems arose Packet header size grows with length of the route looding of route request maybe loads the whole network (if path length to the receiver is unknown and no TTL can be used) Increase delay of route request/reply by random times to avoid collisions, or live with data loss ached route entries can become invalid and may pollute other caches timeouts needed, but need to be adaptive, based on link stability 11 12

4 OV OV d hoc On emand istance Vector routing (OV) Very popular routing protocol Same basic idea as SR for route discovery procedure: Route requests are forwarded in a manner similar to SR (using TTL to reduce the broadcasting range) When a node broadcasts a route request, it sets up a reverse path pointing towards the source (OV assumes symmetric links!) When the destination receives a route request, it replies with a route reply Route reply travels along the reverse path set-up when route request is forwarded Main difference to SR: nodes maintain routing tables instead of using source routing (IP options not needed, smaller headers) Nodes remember from where a packet came and fill in routing tables with such information. n entry for a route which is not active for a certain time, is deleted. lso, hello messages are used periodically to test link availability In these cases, all neighbors are sent a link failure reports to invalid their own entries 13 Sequence numbers are added to the request packets to only get an answer for intermediate nodes having the most current path information. In each route request for a destination the sequence number is increased, only nodes with at least this number are allowed to reply. It also prevents the network from loops: ssume that does not know about the failure of link - because the link failure report sent by is lost Now performs a route discovery for. Node receives the request (say, via path --) Node will reply since knows a route to via node Results in a loop (for instance, ---- ) 14 OLSR OLSR orwarding Process Links State Routing means broadcasting of knowledge about costs to neighbors Optimized Link State Routing adapts this scheme: The overhead of flooding link state information is reduced by requiring fewer nodes to forward the information, i.e. perform broadcasting only on a reduced topology broadcast from node X is only forwarded by its multipoint relays Multipoint relays of node X are its neighbors such that each two-hop neighbor of X is a one-hop neighbor of at least one multipoint relay of X ach node selects a minimal dominating set of multipoint relays for its two-hop neighborhood Immense reduction of broadcasted control traffic ach node transmits its neighbor list in periodic beacons, so that all nodes know their 2-hop neighbors, in order to choose the multipoint relays ombine link-state protocol & topology control 1. Node has nodes and as multipoint relay and broadcasts its information 3. Node has nodes and as multipoint relay and broadcasts its information 2. Only nodes and have to forward the received information 4. Only node goes on forwarding the information 15 16

5 SV nhancement of istance Vector Routing ( estination Sequenced ) ach host manages a distance table which contains the number of hops to other hosts (or maybe some costs due to another metric) Routing tables are exchanged if changes occur (full dump and incremental dump) ach node appends a sequence number to its own entry, counted up with each exchange Routing entries are only updated with the information received from the neighbors, if their sequence number is newer than the one considered before gain: discovery and maintenance of a path, but only counting of number of hops to a destination Sequence number for each path update uarantee for correct order of all updates void loops and inconsistencies Slow down of changes Storage of the time between first and best announcement of a path elay of an update if the path probably is not stable (basing on the stored time) isheye State Routing ases on Link State Routing Load caused by information exchange is reduced: Logically subdivide the nodes in zones which centrically surround a node. The exchange frequency decreases with increasing zone distance Information exchange like in SV Much more pproaches xamples for Interference-ased Routing.g. routing based on assumptions about interference between signals: S 1 N 1 N 3 N2 1 Least Interference Routing (LIR) alculate the cost of a path based on the number of stations that can receive a transmission LIR is very simple to implement, only information from direct neighbors is necessary Max-Min Residual apacity Routing (MMRR) alculate the cost of a path based on a probability function of successful transmissions and interference N 4 S 2 N 5 N 6 2 Least Resistance Routing (LRR) alculate the cost of a path based on interference, jamming and other transmissions Neighbors (i.e. in radio range) Interference N 7 N 8 N

6 Reduction of looding by Position Information lustering of d-oc Networks ierarchical structure needed for large networks (scalability, as in the Internet): lso possible: use geographic position information of neighbors and destination to choose the next node, e.g. by PS RM istance Routing ffect lgorithm for Mobility eoast eographic ddressing and Routing LR Location-ided Routing reedy Perimeter Stateless Routing (PSR) base station Internet cluster access point cluster super cluster SR lusterhead-ateway Switch Routing SR ierarchical State Routing LNMR Landmark d oc Routing onclusion Transfer protocols The network layer is the Internet IP has central role or a mobile IP: no changes of existing systems, only adding mobility to the classical IP P supports Mobile IP Many topics are still under research (security, QoS, ) change to IPv6 would make easier many things Routing protocols d-hoc networks give additional requirements to routing algorithms lat approaches only for small networks, otherwise hierarchical routing is needed No optimal algorithm known for all situations urrent research topic nything more? The network layer is the highest layer involved in network aspects do we need to do a look to the transport layer also? 23

Routing in wireless networks

Routing in wireless networks Routing in wireless networks. Pham Université de Pau et des Pays de l dour épartement Informatique http://www.univ-pau.fr/~cpham ongduc.pham@univ-pau.fr Routing in wireless networks What s a wireless network?

More information

Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols

Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols Behavior Analysis of TCP Traffic in Mobile Ad Hoc Network using Reactive Routing Protocols Purvi N. Ramanuj Department of Computer Engineering L.D. College of Engineering Ahmedabad Hiteishi M. Diwanji

More information

Advanced Computer Networks

Advanced Computer Networks Introduction to Mobile Ad hoc Networks (MANETs) Advanced Computer Networks Outline Ad hoc networks Differences to other networks Applications Research areas Routing Other research areas Enabling Technologies

More information

Lecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol

Lecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed Bellman-Ford Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem

More information

Mobile Ad Hoc Networks. Ad Hoc Networks - A New Communication Paradigm 1. Mobile Ad Hoc Networks (MANET) Mobile Ad Hoc Networks. Why Ad Hoc Networks?

Mobile Ad Hoc Networks. Ad Hoc Networks - A New Communication Paradigm 1. Mobile Ad Hoc Networks (MANET) Mobile Ad Hoc Networks. Why Ad Hoc Networks? obile d oc etworks d oc etworks - ew ommunication Paradigm 1 ormed by wireless hosts which may be mobile Without (necessarily) using a pre-existing infrastructure Routes between nodes may potentially contain

More information

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc (International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com

More information

A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks

A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks T.Chandrasekhar 1, J.S.Chakravarthi 2, K.Sravya 3 Professor, Dept. of Electronics and Communication Engg., GIET Engg.

More information

Infrastructure Components: Hub & Repeater. Network Infrastructure. Switch: Realization. Infrastructure Components: Switch

Infrastructure Components: Hub & Repeater. Network Infrastructure. Switch: Realization. Infrastructure Components: Switch Network Infrastructure or building computer networks more complex than e.g. a short bus, some additional components are needed. They can be arranged hierarchically regarding their functionality: Repeater

More information

Ad hoc On Demand Distance Vector (AODV) Routing Protocol

Ad hoc On Demand Distance Vector (AODV) Routing Protocol Ad hoc On Demand Distance Vector (AODV) Routing Protocol CS: 647 Advanced Topics in Wireless Networks Dr. Baruch Awerbuch & Dr. Amitabh Mishra Department of Computer Science Johns Hopkins 4-1 Reading Chapter

More information

CSE 461: Distance Vector Routing. Next Topic

CSE 461: Distance Vector Routing. Next Topic S 46: istance Vector Routing Next Topic ocus How do we calculate routes for packets? Routing is a network layer function Routing Algorithms istance Vector routing (RIP) Application Presentation Session

More information

Scalable Unidirectional Routing with Zone Routing Protocol (ZRP) Extensions for Mobile Ad-Hoc Networks

Scalable Unidirectional Routing with Zone Routing Protocol (ZRP) Extensions for Mobile Ad-Hoc Networks Scalable Unidirectional Routing with Zone Routing Protocol (ZRP) xtensions for Mobile d-hoc Networks Prasun Sinha, o-ordinated Sciences Laboratory, University of Illinois, Urbana hampaign prasun@vayu.crhc.uiuc.edu

More information

Scenario based Performance Analysis of AODV and OLSR in Mobile Ad hoc Networks

Scenario based Performance Analysis of AODV and OLSR in Mobile Ad hoc Networks Scenario based Performance Analysis of AODV and OLSR in Mobile Ad hoc Networks Scenario based Performance Analysis of AODV and OLSR in Mobile Ad hoc Networks S. Gowrishankar, T.G. Basavaraju, M. Singh,

More information

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility

More information

Talk Announcement CSC 458 -- Lecture 5 Intra-Domain Routing Protocols. Administrivia. This Time

Talk Announcement CSC 458 -- Lecture 5 Intra-Domain Routing Protocols. Administrivia. This Time Talk nnouncement S 48 -- Lecture Intra-omain Routing Protocols Internet in the st entury. Vint erf. hief Internet vangelist, oogle ahen Stefan Saroiu http://www.cs.toronto.edu/syslab/courses/csc48 Tuesday,

More information

Fast and Secure Data Transmission by Using Hybrid Protocols in Mobile Ad Hoc Network

Fast and Secure Data Transmission by Using Hybrid Protocols in Mobile Ad Hoc Network Middle-East Journal of Scientific Research 15 (9): 1290-1294, 2013 ISSN 1990-9233 IDOSI Publications, 2013 DOI: 10.5829/idosi.mejsr.2013.15.9.11514 Fast and Secure Data Transmission by Using Hybrid Protocols

More information

Internet Layer. Routing Tables. Routing in the Internet. Routing Protocols

Internet Layer. Routing Tables. Routing in the Internet. Routing Protocols Internet Layer Routing Tables estination ddress Next Hop Raw division into three tasks: ata transfer over a global network Route decision at the sub-nodes ontrol of the network or transmission status.7...../8

More information

Dynamic Source Routing in Ad Hoc Wireless Networks

Dynamic Source Routing in Ad Hoc Wireless Networks Dynamic Source Routing in Ad Hoc Wireless Networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213-3891 dbj@cs.cmu.edu Abstract

More information

Formal Measure of the Effect of MANET size over the Performance of Various Routing Protocols

Formal Measure of the Effect of MANET size over the Performance of Various Routing Protocols Formal Measure of the Effect of MANET size over the Performance of Various Routing Protocols Er. Pooja Kamboj Research Scholar, CSE Department Guru Nanak Dev Engineering College, Ludhiana (Punjab) Er.

More information

Edges = communication links Vertices = computers, switches, routers, etc. For packet inbound at a particular vertex, determine what output edge to use

Edges = communication links Vertices = computers, switches, routers, etc. For packet inbound at a particular vertex, determine what output edge to use IP Routing Networks as Graphs Networks are graphs Edges = communication links Vertices = computers, switches, routers, etc For packet inbound at a particular vertex, determine what output edge to use Routers

More information

Distance Vector Routing Protocols. Routing Protocols and Concepts Ola Lundh

Distance Vector Routing Protocols. Routing Protocols and Concepts Ola Lundh Distance Vector Routing Protocols Routing Protocols and Concepts Ola Lundh Objectives The characteristics of distance vector routing protocols. The network discovery process of distance vector routing

More information

Location Information Services in Mobile Ad Hoc Networks

Location Information Services in Mobile Ad Hoc Networks Location Information Services in Mobile Ad Hoc Networks Tracy Camp, Jeff Boleng, Lucas Wilcox Department of Math. and Computer Sciences Colorado School of Mines Golden, Colorado 841 Abstract In recent

More information

Introduction to LAN/WAN. Network Layer

Introduction to LAN/WAN. Network Layer Introduction to LAN/WAN Network Layer Topics Introduction (5-5.1) Routing (5.2) (The core) Internetworking (5.5) Congestion Control (5.3) Network Layer Design Isues Store-and-Forward Packet Switching Services

More information

Chapter 4. Distance Vector Routing Protocols

Chapter 4. Distance Vector Routing Protocols Chapter 4 Distance Vector Routing Protocols CCNA2-1 Chapter 4 Note for Instructors These presentations are the result of a collaboration among the instructors at St. Clair College in Windsor, Ontario.

More information

A Study of Internet Connectivity for Mobile Ad Hoc Networks in NS 2

A Study of Internet Connectivity for Mobile Ad Hoc Networks in NS 2 A Study of Internet Connectivity for Mobile Ad Hoc Networks in NS 2 Alex Ali Hamidian January 2003 Department of Communication Systems Lund Institute of Technology, Lund University Box 118 S-221 00 Lund

More information

Network Layer Mobile IP Routing in Ad-Hoc Networks. Lehrstuhl für Informatik 4 Kommunikation und verteilte Systeme

Network Layer Mobile IP Routing in Ad-Hoc Networks. Lehrstuhl für Informatik 4 Kommunikation und verteilte Systeme Chapter 2 Technical Basics: Layer 1 Methods for Medium Access: Layer 2 Chapter 3 Wireless Networks: Bluetooth, WLAN, WirelessMAN, WirelessWAN Mobile Networks: GSM, GPRS, UMTS Chapter 4 Mobility on the

More information

Optimization of AODV routing protocol in mobile ad-hoc network by introducing features of the protocol LBAR

Optimization of AODV routing protocol in mobile ad-hoc network by introducing features of the protocol LBAR Optimization of AODV routing protocol in mobile ad-hoc network by introducing features of the protocol LBAR GUIDOUM AMINA University of SIDI BEL ABBES Department of Electronics Communication Networks,

More information

Scalable Source Routing

Scalable Source Routing Scalable Source Routing January 2010 Thomas Fuhrmann Department of Informatics, Self-Organizing Systems Group, Technical University Munich, Germany Routing in Networks You re there. I m here. Scalable

More information

Customer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4

Customer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4 Customer Specific Wireless Network Solutions Based on Standard IEEE 802.15.4 Michael Binhack, sentec Elektronik GmbH, Werner-von-Siemens-Str. 6, 98693 Ilmenau, Germany Gerald Kupris, Freescale Semiconductor

More information

ISSN: 2321-7782 (Online) Volume 2, Issue 4, April 2014 International Journal of Advance Research in Computer Science and Management Studies

ISSN: 2321-7782 (Online) Volume 2, Issue 4, April 2014 International Journal of Advance Research in Computer Science and Management Studies ISSN: 2321-7782 (Online) olume 2, Issue 4, April 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Paper / Case Study Available online at: www.ijarcsms.com

More information

Position and Velocity Aided Routing Protocol in Mobile Ad Hoc Networks

Position and Velocity Aided Routing Protocol in Mobile Ad Hoc Networks Position and Velocity Aided Routing Protocol in Mobile Ad Hoc Networks 1 Taifei Zhao, 2 Xizheng Ke, 3 Peilin Yang *1,Corresponding Author Department of Electronics Engineering, Xi an University of Technology,

More information

Routing Protocols OSPF CHAPTER. The following topics describe supported routing protocols. Topics include OSPF, page 9-1 IS-IS Protocol, page 9-3

Routing Protocols OSPF CHAPTER. The following topics describe supported routing protocols. Topics include OSPF, page 9-1 IS-IS Protocol, page 9-3 CHAPTER 9 The following topics describe supported routing protocols. Topics include OSPF, page 9-1 IS-IS Protocol, page 9-3 OSPF Open Shortest Path First (OSPF) is a link state Internet routing protocol.

More information

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK AN OVERVIEW OF MOBILE ADHOC NETWORK: INTRUSION DETECTION, TYPES OF ATTACKS AND

More information

COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK

COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 5 May, 2013 Page No. 1680-1684 COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK ABSTRACT: Mr.Upendra

More information

A Comprehensive Analysis on Route Discovery and Maintenance Features of DSDV, AODV and IERF Ad-hoc Routing Protocols

A Comprehensive Analysis on Route Discovery and Maintenance Features of DSDV, AODV and IERF Ad-hoc Routing Protocols International Journal of Computer Sciences and Engineering Open Access Research Paper Volume-4, Issue-2 E-ISSN: 2347-2693 A Comprehensive Analysis on Route Discovery and Maintenance Features of DSDV, AODV

More information

Security in Ad Hoc Network

Security in Ad Hoc Network Security in Ad Hoc Network Bingwen He Joakim Hägglund Qing Gu Abstract Security in wireless network is becoming more and more important while the using of mobile equipments such as cellular phones or laptops

More information

PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK

PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK http:// PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK Anjali Sahni 1, Ajay Kumar Yadav 2 1, 2 Department of Electronics and Communication Engineering, Mewar Institute,

More information

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks David B. Johnson David A. Maltz Josh Broch Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213-3891

More information

A Survey on Reduction in Energy Consumption by Improved AODV on Mobile Ad Hoc Network

A Survey on Reduction in Energy Consumption by Improved AODV on Mobile Ad Hoc Network International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-2 E-ISSN: 2347-2693 A Survey on Reduction in Energy Consumption by Improved AODV on Mobile Ad Hoc Network

More information

Study And Comparison Of Mobile Ad-Hoc Networks Using Ant Colony Optimization

Study And Comparison Of Mobile Ad-Hoc Networks Using Ant Colony Optimization Study And Comparison Of Mobile Ad-Hoc Networks Using Ant Colony Optimization 1 Neha Ujala Tirkey, 2 Navendu Nitin, 3 Neelesh Agrawal, 4 Arvind Kumar Jaiswal 1 M. Tech student, 2&3 Assistant Professor,

More information

Location-Aided Routing (LAR) in mobile ad hoc networks

Location-Aided Routing (LAR) in mobile ad hoc networks Location-Aided Routing (LAR) in mobile ad hoc networks Young-Bae Ko and Nitin H. Vaidya Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, USA 2000 Abstract A mobile

More information

Wireless Mesh Networks under FreeBSD

Wireless Mesh Networks under FreeBSD Wireless Networks under FreeBSD Rui Paulo rpaulo@freebsd.org The FreeBSD Project AsiaBSDCon 2010 - Tokyo, Japan Abstract With the advent of low cost wireless chipsets, wireless mesh networks became much

More information

Administrative Distance

Administrative Distance RIP is a distance vector routing protocol. It shares routing information through the local broadcast in every 30 seconds. In this tutorial we will explain RIP routing fundamentals with examples such as

More information

Security Threats in Mobile Ad Hoc Networks

Security Threats in Mobile Ad Hoc Networks Security Threats in Mobile Ad Hoc Networks Hande Bakiler, Aysel Şafak Department of Electrical & Electronics Engineering Baskent University Ankara, Turkey 21020013@baskent.edu.tr, asafak@baskent.edu.tr

More information

28 Networks and Communication Protocols

28 Networks and Communication Protocols 113 28 Networks and ommunication Protocols Trend in computer systems: personal computing. Reasons why: ost: economies of scale. lso, avoids large initial investment in timesharing system. Performance:

More information

Lecture 13: Distance-vector Routing. Lecture 13 Overview. Bellman-Ford Algorithm. d u (z) = min{c(u,v) + d v (z), c(u,w) + d w (z)}

Lecture 13: Distance-vector Routing. Lecture 13 Overview. Bellman-Ford Algorithm. d u (z) = min{c(u,v) + d v (z), c(u,w) + d w (z)} Lecture : istance-vector Routing S : omputer Networks hris Kanich Quiz TOMORROW Lecture Overview istance vector ssume each router knows its own address and cost to reach each of its directly connected

More information

A Review on Load Balancing Approach in MANET

A Review on Load Balancing Approach in MANET International Journal of Engineering and Technical Research (IJETR) ISSN: 2321-0869, Volume-2, Issue-7, July 2014 A Review on Load Balancing Approach in MANET Neena Yadav, Renu Yadav Abstract Mobile ad

More information

An Efficient QoS Routing Protocol for Mobile Ad-Hoc Networks *

An Efficient QoS Routing Protocol for Mobile Ad-Hoc Networks * An Efficient QoS Routing Protocol for Mobile Ad-Hoc Networks * Inwhee Joe College of Information and Communications Hanyang University Seoul, Korea iwj oeshanyang.ac.kr Abstract. To satisfy the user requirements

More information

CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS

CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 137 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 8.1 CONCLUSION In this thesis, efficient schemes have been designed and analyzed to control congestion and distribute the load in the routing process of

More information

Performance Comparison of AODV, DSDV, DSR and TORA Routing Protocols in MANETs

Performance Comparison of AODV, DSDV, DSR and TORA Routing Protocols in MANETs International Research Journal of Applied and Basic Sciences. Vol., 3 (7), 1429-1436, 2012 Available online at http:// www. irjabs.com ISSN 2251-838X 2012 Performance Comparison of AODV, DSDV, DSR and

More information

International Journal of Advanced Research in Computer Science and Software Engineering

International Journal of Advanced Research in Computer Science and Software Engineering Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Power Aware

More information

Routing in packet-switching networks

Routing in packet-switching networks Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call

More information

LIST OF FIGURES. Figure No. Caption Page No.

LIST OF FIGURES. Figure No. Caption Page No. LIST OF FIGURES Figure No. Caption Page No. Figure 1.1 A Cellular Network.. 2 Figure 1.2 A Mobile Ad hoc Network... 2 Figure 1.3 Classifications of Threats. 10 Figure 1.4 Classification of Different QoS

More information

Security and Scalability of MANET Routing Protocols in Homogeneous & Heterogeneous Networks

Security and Scalability of MANET Routing Protocols in Homogeneous & Heterogeneous Networks Security and Scalability of MANET Routing Protocols in Homogeneous & Heterogeneous Networks T.V.P. Sundararajan 1, Karthik 2, A. Shanmugam 3 1. Assistant Professor, Bannari Amman Institute Of Technology,

More information

Mobile Communications Chapter 8: Network Protocols/Mobile IP

Mobile Communications Chapter 8: Network Protocols/Mobile IP Mobile Communications Chapter 8: Network Protocols/Mobile IP Motivation Data transfer Encapsulation Security IPv6 Problems Micro mobility support DHCP Ad-hoc networks Routing protocols Prof. Dr.-Ing. Jochen

More information

Adapting Distributed Hash Tables for Mobile Ad Hoc Networks

Adapting Distributed Hash Tables for Mobile Ad Hoc Networks University of Tübingen Chair for Computer Networks and Internet Adapting Distributed Hash Tables for Mobile Ad Hoc Networks Tobias Heer, Stefan Götz, Simon Rieche, Klaus Wehrle Protocol Engineering and

More information

Performance Analysis of Load Balancing in MANET using On-demand Multipath Routing Protocol

Performance Analysis of Load Balancing in MANET using On-demand Multipath Routing Protocol ISSN: 2278 1323 All Rights Reserved 2014 IJARCET 2106 Performance Analysis of Load Balancing in MANET using On-demand Multipath Routing Protocol Monika Malik, Partibha Yadav, Ajay Dureja Abstract A collection

More information

Tomás P. de Miguel DIT-UPM. dit UPM

Tomás P. de Miguel DIT-UPM. dit UPM Tomás P. de Miguel DIT- 15 12 Internet Mobile Market Phone.com 15 12 in Millions 9 6 3 9 6 3 0 1996 1997 1998 1999 2000 2001 0 Wireless Internet E-mail subscribers 2 (January 2001) Mobility The ability

More information

ISSUES AND CHALLENGES OF QUALITY OF SERVICE IN MOBILE ADHOC NETWORK

ISSUES AND CHALLENGES OF QUALITY OF SERVICE IN MOBILE ADHOC NETWORK ISSUES AND CHALLENGES OF QUALITY OF SERVICE IN MOBILE ADHOC NETWORK Mukesh Kumar Student (Ph.D) Department of Computer Engineering The Technological Institute of Textile and Science, Bhiwani-127021, Haryana

More information

Lehrstuhl für Informatik 4 Kommunikation und verteilte Systeme. Auxiliary Protocols

Lehrstuhl für Informatik 4 Kommunikation und verteilte Systeme. Auxiliary Protocols Auxiliary Protocols IP serves only for sending packets with well-known addresses. Some questions however remain open, which are handled by auxiliary protocols: Address Resolution Protocol (ARP) Reverse

More information

Multipath Routing in Mobile Ad Hoc Networks: Issues and Challenges

Multipath Routing in Mobile Ad Hoc Networks: Issues and Challenges Multipath Routing in Mobile Ad Hoc Networks: Issues and Challenges Stephen Mueller 1,RoseP.Tsang 2, and ipak Ghosal 1 1 epartment of Computer Science, University of California, avis, CA 95616 2 Sandia

More information

Level 2 Routing: LAN Bridges and Switches

Level 2 Routing: LAN Bridges and Switches Level 2 Routing: LAN Bridges and Switches Norman Matloff University of California at Davis c 2001, N. Matloff September 6, 2001 1 Overview In a large LAN with consistently heavy traffic, it may make sense

More information

Wide Area Networks. Learning Objectives. LAN and WAN. School of Business Eastern Illinois University. (Week 11, Thursday 3/22/2007)

Wide Area Networks. Learning Objectives. LAN and WAN. School of Business Eastern Illinois University. (Week 11, Thursday 3/22/2007) School of Business Eastern Illinois University Wide Area Networks (Week 11, Thursday 3/22/2007) Abdou Illia, Spring 2007 Learning Objectives 2 Distinguish between LAN and WAN Distinguish between Circuit

More information

RT-QoS for Wireless ad-hoc Networks of Embedded Systems

RT-QoS for Wireless ad-hoc Networks of Embedded Systems RT-QoS for Wireless ad-hoc Networks of Embedded Systems Marco accamo University of Illinois Urbana-hampaign 1 Outline Wireless RT-QoS: important MA attributes and faced challenges Some new ideas and results

More information

Simulation of Internet Connectivity for Mobile Ad Hoc Networks in Network Simulator-2

Simulation of Internet Connectivity for Mobile Ad Hoc Networks in Network Simulator-2 Simulation of Internet Connectivity for Mobile Ad Hoc Networks in Network Simulator-2 Sulaiman Khalifa Yakhlef, Ismail Shrena, Nasaraldian Ambark Shashoa Azzaytuna University, Faculty of Engineering Tarhuna

More information

A Study of Dynamic Addressing Techniques in Mobile Ad hoc Networks

A Study of Dynamic Addressing Techniques in Mobile Ad hoc Networks A Study of Dynamic Addressing Techniques in Mobile Ad hoc Networks Yuan Sun Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara suny, ebelding @cs.ucsb.edu

More information

Security for Ad Hoc Networks. Hang Zhao

Security for Ad Hoc Networks. Hang Zhao Security for Ad Hoc Networks Hang Zhao 1 Ad Hoc Networks Ad hoc -- a Latin phrase which means "for this [purpose]". An autonomous system of mobile hosts connected by wireless links, often called Mobile

More information

Comprehensive Evaluation of AODV, DSR, GRP, OLSR and TORA Routing Protocols with varying number of nodes and traffic applications over MANETs

Comprehensive Evaluation of AODV, DSR, GRP, OLSR and TORA Routing Protocols with varying number of nodes and traffic applications over MANETs IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 9, Issue 3 (Mar. - Apr. 2013), PP 54-61 Comprehensive Evaluation of AODV, DSR, GRP, OLSR and TORA Routing Protocols

More information

Abstract. 1 Introduction. Aleksandr Huhtonen Helsinki University of Technology Telecommunication Software and Multimedia Laboratory ahuhtone@cc.hut.

Abstract. 1 Introduction. Aleksandr Huhtonen Helsinki University of Technology Telecommunication Software and Multimedia Laboratory ahuhtone@cc.hut. Comparing AODV and OLSR Routing Protocols Aleksandr Huhtonen Helsinki University of Technology Telecommunication Software and Multimedia Laboratory ahuhtone@cc.hut.fi Abstract An ad hoc wireless network

More information

Communication Networks Chapter 5. Switching Technology

Communication Networks Chapter 5. Switching Technology Communication Networks Chapter 5. Switching Technology o Circuit Switching o Message Switching o Virtual Circuit / Virtual Connection o Datagram Recapitulation: Telecommunications Network LAN 1 Backbone

More information

Study of Network Characteristics Incorporating Different Routing Protocols

Study of Network Characteristics Incorporating Different Routing Protocols Study of Network Characteristics Incorporating Different Routing Protocols Sumitpal Kaur #, Hardeep S Ryait *, Manpreet Kaur # # M. Tech Student, Department of Electronics and Comm. Engineering, Punjab

More information

From the previous lecture

From the previous lecture CS 640: Introduction to Computer Networks Aditya Akella Lecture 7 - IP: Addressing and Forwarding From the previous lecture We will cover spanning tree from the last lecture 2 Spanning Tree Bridges More

More information

VoIP over MANET (VoMAN): QoS & Performance Analysis of Routing Protocols for Different Audio Codecs

VoIP over MANET (VoMAN): QoS & Performance Analysis of Routing Protocols for Different Audio Codecs VoIP over MANET (VoMAN): QoS & Performance Analysis of Routing Protocols for Different Audio Codecs Said El brak Mohammed Bouhorma Anouar A.Boudhir ABSTRACT Voice over IP (VoIP) has become a popular Internet

More information

PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS

PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS Reza Azizi Engineering Department, Bojnourd Branch, Islamic Azad University, Bojnourd, Iran reza.azizi@bojnourdiau.ac.ir

More information

Keywords- manet, routing protocols, aodv, olsr, grp,data drop parameter.

Keywords- manet, routing protocols, aodv, olsr, grp,data drop parameter. Volume 5, Issue 3, March 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Evaluation of

More information

UNIT 8:- Mobile Ad-Hoc Networks, Wireless Sensor Networks

UNIT 8:- Mobile Ad-Hoc Networks, Wireless Sensor Networks UNIT 8:- Mobile Ad-Hoc Networks, Wireless Sensor Networks a Mobile Ad hoc NETwork (MANET) is one that comes together as needed, not necessarily with any support from the existing infrastructure or any

More information

- Hubs vs. Switches vs. Routers -

- Hubs vs. Switches vs. Routers - 1 Layered Communication - Hubs vs. Switches vs. Routers - Network communication models are generally organized into layers. The OSI model specifically consists of seven layers, with each layer representing

More information

LAN Switching. 15-441 Computer Networking. Switched Network Advantages. Hubs (more) Hubs. Bridges/Switches, 802.11, PPP. Interconnecting LANs

LAN Switching. 15-441 Computer Networking. Switched Network Advantages. Hubs (more) Hubs. Bridges/Switches, 802.11, PPP. Interconnecting LANs LAN Switching 15-441 Computer Networking Bridges/Switches, 802.11, PPP Extend reach of a single shared medium Connect two or more segments by copying data frames between them Switches only copy data when

More information

DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS

DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS K.V. Narayanaswamy 1, C.H. Subbarao 2 1 Professor, Head Division of TLL, MSRUAS, Bangalore, INDIA, 2 Associate

More information

Load Balancing and Resource Reservation in Mobile Ad-Hoc Networks 1

Load Balancing and Resource Reservation in Mobile Ad-Hoc Networks 1 Load Balancing and Resource Reservation in Mobile Ad-Hoc Networks 1 Gautam Chakrabarti Sandeep Kulkarni Department of Computer Science and Engineering Michigan State University Abstract To ensure uninterrupted

More information

OSI Network Layer OSI Layer 3

OSI Network Layer OSI Layer 3 OSI Network Layer OSI Layer 3 Network Fundamentals Chapter 5 ١ Objectives Identify the role of the Network Layer, as it describes communication from one end device to another end device Examine the most

More information

MAC Addresses and ARP. Mac Addressing, Ethernet, and Interconnections. LAN Addresses and ARP. LAN Address (more) ARP protocol: Same LAN (network)

MAC Addresses and ARP. Mac Addressing, Ethernet, and Interconnections. LAN Addresses and ARP. LAN Address (more) ARP protocol: Same LAN (network) M ddresses and RP Mac ddressing, thernet, and Interconnections 32-bit IP address: network-layer address used to get datagram to destination IP subnet M (or LN or physical or thernet) address: used to get

More information

Location-Aided Routing (LAR) in mobile ad hoc networks

Location-Aided Routing (LAR) in mobile ad hoc networks Wireless Networks 6 (2000) 307 321 307 Location-Aided Routing (LAR) in mobile ad hoc networks Young-Bae Ko and Nitin H. Vaidya Department of Computer Science, Texas A&M University, College Station, TX

More information

Star topology. Ethernet. Ethernet Frame Structure (more) Ethernet Frame Structure. Ethernet uses CSMA/CD. Unreliable, connectionless service

Star topology. Ethernet. Ethernet Frame Structure (more) Ethernet Frame Structure. Ethernet uses CSMA/CD. Unreliable, connectionless service thernet dominant wired LN technology: cheap $0 for 00Mbs! first widely used LN technology Simpler, cheaper than token LNs and TM Kept up with speed race: 0 Mbps 0 bps Star topology us topology popular

More information

ESSENTIALS. Understanding Ethernet Switches and Routers. April 2011 VOLUME 3 ISSUE 1 A TECHNICAL SUPPLEMENT TO CONTROL NETWORK

ESSENTIALS. Understanding Ethernet Switches and Routers. April 2011 VOLUME 3 ISSUE 1 A TECHNICAL SUPPLEMENT TO CONTROL NETWORK VOLUME 3 ISSUE 1 A TECHNICAL SUPPLEMENT TO CONTROL NETWORK Contemporary Control Systems, Inc. Understanding Ethernet Switches and Routers This extended article was based on a two-part article that was

More information

Survey on Load balancing protocols in MANET S (mobile ad-hoc networks)

Survey on Load balancing protocols in MANET S (mobile ad-hoc networks) Survey on Load balancing protocols in MANET S (mobile ad-hoc networks) Ramandeep Kaur 1, Gagandeep Singh 2, Sahil Vashist 3 1 M.tech Research Scholar, Department of Computer Science & Engineering, Chandigarh

More information

Route Discovery Protocols

Route Discovery Protocols Route Discovery Protocols Columbus, OH 43210 Jain@cse.ohio-State.Edu http://www.cse.ohio-state.edu/~jain/ 1 Overview Building Routing Tables Routing Information Protocol Version 1 (RIP V1) RIP V2 OSPF

More information

A Performance Comparison of Routing Protocols for Large-Scale Wireless Mobile Ad Hoc Networks

A Performance Comparison of Routing Protocols for Large-Scale Wireless Mobile Ad Hoc Networks A Performance Comparison of Routing Protocols for Large-Scale Wireless Mobile Ad Hoc Networks Ioannis Broustis Gentian Jakllari Thomas Repantis Mart Molle Department of Computer Science & Engineering University

More information

Architectural Framework for Large- Scale Multicast in Mobile Ad Hoc Networks

Architectural Framework for Large- Scale Multicast in Mobile Ad Hoc Networks Architectural Framework for Large- Scale Multicast in Mobile Ad Hoc Networks Ahmed Helmy Electrical Engineering Department University of Southern California (USC) helmy@usc.edu http://ceng.usc.edu/~helmy

More information

A Link-state QoS Routing Protocol for Ad Hoc Networks

A Link-state QoS Routing Protocol for Ad Hoc Networks A Link-state QoS Routing Protocol for Ad Hoc Networks Anelise Munaretto 1 Hakim Badis 2 Khaldoun Al Agha 2 Guy Pujolle 1 1 LIP6 Laboratory, University of Paris VI, 8, rue du Capitaine Scott, 75015, Paris,

More information

Ethernet. Ethernet Frame Structure. Ethernet Frame Structure (more) Ethernet: uses CSMA/CD

Ethernet. Ethernet Frame Structure. Ethernet Frame Structure (more) Ethernet: uses CSMA/CD Ethernet dominant LAN technology: cheap -- $20 for 100Mbs! first widely used LAN technology Simpler, cheaper than token rings and ATM Kept up with speed race: 10, 100, 1000 Mbps Metcalfe s Etheret sketch

More information

Final Exam. Route Computation: One reason why link state routing is preferable to distance vector style routing.

Final Exam. Route Computation: One reason why link state routing is preferable to distance vector style routing. UCSD CSE CS 123 Final Exam Computer Networks Directions: Write your name on the exam. Write something for every question. You will get some points if you attempt a solution but nothing for a blank sheet

More information

A Performance Comparison of Stability, Load-Balancing and Power-Aware Routing Protocols for Mobile Ad Hoc Networks

A Performance Comparison of Stability, Load-Balancing and Power-Aware Routing Protocols for Mobile Ad Hoc Networks A Performance Comparison of Stability, Load-Balancing and Power-Aware Routing Protocols for Mobile Ad Hoc Networks Natarajan Meghanathan 1 and Leslie C. Milton 2 1 Jackson State University, 1400 John Lynch

More information

NetworkPathDiscoveryMechanismforFailuresinMobileAdhocNetworks

NetworkPathDiscoveryMechanismforFailuresinMobileAdhocNetworks Global Journal of Computer Science and Technology: E Network, Web & Security Volume 14 Issue 3 Version 1.0 Year 2014 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals

More information

Scalable Routing Protocols for Mobile Ad Hoc Networks

Scalable Routing Protocols for Mobile Ad Hoc Networks Scalable Routing Protocols for Mobile Ad Hoc Networks Xiaoyan Hong, Kaixin Xu, Mario Gerla Computer Science Department, University of California, Los Angeles, CA 90095 {hxy,xkx,gerla}@cs.ucla.edu Abstract

More information

TCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) Internet Protocol (IP)

TCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) Internet Protocol (IP) TCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) *Slides adapted from a talk given by Nitin Vaidya. Wireless Computing and Network Systems Page

More information

Routing in Mobile Ad Hoc Networks

Routing in Mobile Ad Hoc Networks 16 Routing in Mobile Ad Hoc Networks Fenglien Lee University of Guam Guam 96923, USA 1. Introduction A mobile ad hoc network (MANET), sometimes called a mobile mesh network, is a self- configuring network

More information

Simulation Analysis of Different Routing Protocols Using Directional Antenna in Qualnet 6.1

Simulation Analysis of Different Routing Protocols Using Directional Antenna in Qualnet 6.1 Simulation Analysis of Different Routing Protocols Using Directional Antenna in Qualnet 6.1 Ankit Jindal 1, Charanjeet Singh 2, Dharam Vir 3 PG Student [ECE], Dept. of ECE, DCR University of Science &

More information

PERFORMANCE ANALYSIS OF AODV, DSR AND ZRP ROUTING PROTOCOLS IN MANET USING DIRECTIONAL ANTENNA

PERFORMANCE ANALYSIS OF AODV, DSR AND ZRP ROUTING PROTOCOLS IN MANET USING DIRECTIONAL ANTENNA International Research Journal of Engineering and Technology (IRJET) e-issn: -00 Volume: 0 Issue: 0 Oct-01 www.irjet.net p-issn: -00 PERFORMANCE ANALYSIS OF AODV, DSR AND ZRP ROUTING PROTOCOLS IN MANET

More information

Routing with OSPF. Introduction

Routing with OSPF. Introduction Routing with OSPF Introduction The capabilities of an internet are largely determined by its routing protocol. An internet's scalability, its ability to quickly route around failures, and the consumption

More information