Et3003 sem2-1314-9 network layers vi (routing protocols)

100 %
0 %
Information about Et3003 sem2-1314-9 network layers vi (routing protocols)

Published on March 12, 2014

Author: tutunj



Routing Protocols

Network Layer Part VI Computer Networks Tutun Juhana Telecommunication Engineering School of Electrical Engineering & Informatics Institut Teknologi Bandung 9



Cost or Metric • A router is usually attached to several networks  when it receives a packet, to which network should it pass the packet? • The decision is based on optimization: Which of the available pathways is the optimum pathway? What is the definition of the term optimum? • One approach is to assign a cost for passing through a network  We call this cost a metric • High cost can be thought of as something bad; low cost can be thought of something good 4

Static versus Dynamic Routing Tables • A static table is one with manual entries • A dynamic table, on the other hand, is one that is updated automatically when there is a change somewhere in the internet 5

Routing Protocol • A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes • It allows routers to share whatever they know about the internet or their neighborhood • The routing protocols also include procedures for combining information received from other routers • Routing protocols can be either an interior protocol or an exterior protocol – An interior protocol handles intradomain routing – an exterior protocol handles interdomain routing 6


8 a group of networks and routers under the authority of a single administration intra-domain routing inter-domain routing AS Numbers is assigned for each AS Ex: ITB’s ASN is 4796



• This method sees an AS, with all routers and networks, as a graph, a set of nodes and lines (edges) connecting the nodes – A router normally be represented by a node – A network be represented by a link connecting two nodes • The graph theory used Bellman-Ford (also called Ford-Fulkerson) algorithm to find the shortest path between nodes in a graph given the distance between nodes 11

Bellman-Ford Algorithm • It looks circular • To solve the problem, we use iteration to create a shortest distance table (vector) for each node using the following steps: 1. The shortest distance and the cost between a node and itself is initialized to 0. 2. The shortest distance between a node and any other node is set to infinity. The cost between a node and any other node should be given (can be infinity if the nodes are not connected) 3. The algorithm repeat as shown in Figure 11.4 until there is no more change in the shortest distance vector. 12


Distance Vector Routing Algorithm 14







Count to Infinity 21

• In distance vector routing, any decrease in cost (good news) propagates quickly, but any increase in cost (bad news) propagates slowly • For a routing protocol to work properly, if a link is broken (cost becomes infinity), every other router should be aware of it immediately, but in distance vector routing, this takes some time. • The problem is referred to as count to infinity  takes several updates before the cost for a broken link is recorded as infinity by all routers. 22

• Example of count to infinity Two-Node Loop 23

Another example 24 A converged network Source

The solutions 25

Defining Infinity • The first obvious solution to count to infinity is to redefine infinity to a smaller number 26 • Most implementations of the Distance Vector Protocol define 16 as infinity – However, this means that distance vector cannot be used in large systems  The size of the network, in each direction, can not exceed 15 hops

Split Horizon 27 Split horizon helps reduce convergence time by not allowing routers to advertise networks in the direction from which those networks were learned

28 Source

Split Horizon and Poison Reverse 29 Iit announces all networks. However, those networks learned in a given direction are announced with a hop count of 16, indicating that the network is unreachable  It avoids the Distance Vector Protocol deleting the route because it has no news about it during a certain time duration (timer)


Three-Node Instability 31

RIP Routing Information Protocol 32

RIP implements distance vector routing directly with some considerations 33


RIP Message Format 35

Requests and Responses 36

Request • A request message is sent by a router that has just come up or by a router that has some time-out entries. 37

Response • A response can be : – Solicited: sent only in answer to a request. • It contains information about the destination specified in the corresponding request – Unsolicited: is sent periodically • every 30 seconds or • when there is a change in the routing table • The response is sometimes called an update packet 38


Timers in RIP 40 controls the advertising of regular update messages Governs the validity of a route. If the timer is reached, route is declared unreachable, but does not immediately purge, instead, it continues to advertise the route with a metric value of 16. At the same time when a route declared unreachable, the garbage collection timer is set to 120 s for that route. When the count reaches zero, the route is purged from the table.


RIP Version 2 • It supports – Classless Addressing – Authentication – Multicasting  uses the all-router multicast address to send the RIP messages only to RIP routers in the network. 42

Encapsulation 43


45 Each node in the domain has the entire topology of the domain  use Dijkstra algorithm to build a routing table The routing table for each node is unique because the calculations are based on different interpretations of the topology

46 The whole topology can be compiled from the partial knowledge of each node (it knows the state (type, condition, and cost) of its links)



Creation of Link State Packet (LSP) • A link state packet (LSP) carries (among others huge information) 1. The node identity 2. The list of links 3. A sequence number 4. Age • The first two are needed to make the topology • The third facilitates flooding and distinguishes new LSPs from old ones • The fourth prevents old LSPs from remaining in the domain for a long time 49

• LSPs are generated on two occasions: – When there is a change in the topology of the domain – On a periodic basis • Much longer compared to distance vector routing in the range of 60 minutes or 2 hours based on the implementation 50

Flooding of LSPs 51

Formation of Shortest Path Tree: Dijkstra Algorithm • After receiving all LSPs, each node will have a copy of the whole topology not sufficient to find the shortest path to every other node  a shortest path tree is needed • A shortest path tree is a tree in which the path between the root and every other node is the shortest • What we need for each node is a shortest path tree with that node as the root 52

Dijkstra algorithm 53




Calculation of Routing Table from Shortest Path Tree 57

OSPF Open Shortest Path First 58

Area • OSPF divides an autonomous system into areas • An area is a collection of networks, hosts, and routers all contained within an autonomous system • All networks inside an area must be connected 59

• Routers inside an area flood the area with routing information • At the border of an area, special routers called area border routers summarize the information about the area and send it to other areas 60

• All of the areas inside an autonomous system must be connected to a special area called the backbone area – The backbone serves as a primary area and the other areas as secondary areas – This does not mean that the routers within areas cannot be connected to each other • The routers inside the backbone are called the backbone routers – backbone router can also be an area border router • Each area has an area identification • The area identification of the backbone is zero 61


If, because of some problem, the connectivity between a backbone and an area is broken, a virtual link between routers must be created by the administration to allow continuity of the functions of the backbone as the primary area 63

Metric • The OSPF protocol allows the administrator to assign a cost, called the metric, to each route • The metric can be based on a type of service (minimum delay, maximum throughput, and so on) • As a matter of fact, a router can have multiple routing tables, each based on a different type of service 64

Types of Links In OSPF terminology, a connection is called a link 65

Point-to-Point Link There is no need to assign a network address to this type of link 66

Transient Link • A transient link is a network with several routers attached to it 67 • It is not efficient  each router needs to advertise the neighborhood to four other routers • It is not realistic there is no single network (link) between each pair of routers (there is only one network (not router)that serves as a crossroad between all five routers) • To show that each router is connected to every other router through one single network  the network itself is represented by a node • A network is not a machine  it cannot function as a router • So, one of the routers in the network takes this responsibility  It is assigned a dual purpose  it is a true router and a designated router

• While there is a metric from each node to the designated router, there is no metric from the designated router to any other node  We can only assign a cost to a packet that is passing through the network (We cannot charge for this twice) – When a packet enters a network, we assign a cost; when a packet leaves the network to go to the router, there is no charge 68

Stub Link • A special case of the transient network • The link is only onedirectional, from the router to the network 69

Virtual Link When the link between two routers is broken, the administration may create a virtual link between them using a longer path that probably goes through several routers 70

Graphical Representation 71

OSPF Packets 72

Common Header 73

Link State Update Packet 74

Router Link LSA 75




Network Link LSA 79




Summary Link to Network LSA 83 The summary link to network LSA is used by the area border router to announce the existence of other networks outside the area


Summary Link to AS Boundary Router LSA 85


External Link LSA 87

Other Packets • They are not used as LSAs, but are essential to the operation of OSPF 88

Hello Message • OSPF uses the hello message to create neighborhood relationships and to test the reachability of neighbors 89

Database Description Message 90

Link State Request Packet 91

Link State Acknowledgment Packet 92

Encapsulation 93


Path vector routing is exterior routing protocol proved to be useful for interdomain or inter-AS routing 95

Reachability 96

Routing Tables • A path vector routing table for each router can be created if ASs share their reachability list with each other 97

Loop Prevention The instability of distance vector routing and the creation of loops can be avoided in path vector routing. When a router receives a reachability information, it checks to see if its autonomous system is in the path list to any destination. If it is, looping is involved and that network-path pair is discarded. 98

Aggregation 99

Policy Routing When a router receives a message, it can check the path. If one of the autonomous systems listed in the path is against its policy, it can ignore that path and that destination. It does not update its routing table with this path, and it does not send this message to its neighbors 100

BGP Border Gateway Protocol An interdomain routing protocol 101

Types of Autonomous Systems • Stub AS • Multihomed AS • Transit AS 102

Stub AS • A stub AS has only one connection to another AS • The hosts in the AS can send data traffic to other Ass • The hosts in the AS can receive data coming from hosts in other Ass • Data traffic cannot pass through a stub AS • A stub AS is either a source or a sink 103

Multihomed AS • A multihomed AS has more than one connection to other ASs, but it is still only a source or sink for data traffic • It can receive data traffic from more than one AS • It can send data traffic to more than one AS, but there is no transient traffic • It does not allow data coming from one AS and going to another AS to pass through 104

Transit AS A transit AS is a multihomed AS that also allows transient traffic. Good examples of transit ASs are national and international ISPs (Internet backbones) 105

CIDR BGP uses classless interdomain routing addresses. In other words, BGP uses a prefix to define a destination address. The address and the number of bits (prefix length) are used in updating messages 106

Path Attributes • Well-known attribute – One that every BGP router must recognize 1. Well-known mandatory attribute – one that must appear in the description of a route 2. well-known discretionary attribute – one that must be recognized by each router, but is not required to be included in every update message • Optional attribute – one that needs not be recognized by every router 1. optional transitive attribute – one that must be passed to the next router by the router that has not implemented this attribute 2. optional nontransitive attribute – one that must be discarded if the receiving router has not implemented it. 107

108 A session is a connection that is established between two BGP routers only for the sake of exchanging routing information.


Add a comment

Related presentations

Presentación que realice en el Evento Nacional de Gobierno Abierto, realizado los ...

In this presentation we will describe our experience developing with a highly dyna...

Presentation to the LITA Forum 7th November 2014 Albuquerque, NM

Un recorrido por los cambios que nos generará el wearabletech en el futuro

Um paralelo entre as novidades & mercado em Wearable Computing e Tecnologias Assis...

Microsoft finally joins the smartwatch and fitness tracker game by introducing the...

Related pages

Routing Protocols | LinkedIn

... and that I much prefer to use layer 3 routing protocols for ... The routing protocol enables a network to ... 9 network layers vi (routing protocols)
Read more

Network Layers | LinkedIn

View 1476 Network Layers posts, presentations, experts, ... preventing network attacks by designing security into every network and service from the start, ...
Read more

OSI Layers and Protocols - Documents

ISO Layers and Protocols The ISO-OSI ... addresses on each train car Network addressing; routing ... Et3003 sem2-1314-9 network layers vi (routing ...
Read more

12-2 Networking 12.1Introduction VxWorks Network ...

... VxWorks Network Configuration Routing Protocols ... layer driver and network protocol. ... Et3003 sem2-1314-9 network layers vi (routing ...
Read more

Introducing the TCP/IP Protocol Suite - System ...

Introducing the TCP/IP Protocol ... TCP/IP also combines other layers. Other network protocols, ... are two available routing protocols for TCP/IP networks.
Read more

TCP/IP Tutorial and Technical Overview - IBM Redbooks

vi TCP/IP Tutorial and Technical Overview ... 24 TCP/IP Tutorial and Technical Overview Protocol status can be ... network-layer protocol can differ from ...
Read more

CCIE Routing and Switching Lab Exam Version 5

exam which requires you to configure and troubleshoot a series of complex networks ... layer 2 protocols 1.1 ... routing protocol ...
Read more

CCNA Study Guide - Ring of Saturn Internetworking

Unix Vi Guide; Web. ... Routing Protocols is used to pass information about routing ... Identify the functions of the TCP/IP network-layer protocol.
Read more