4

Tutun Juhana
Telecommunication Engineering

Network Layer (Part 7)

School of Electrical Engineering & Informatics
Inst...
UNICAST ROUTING PROTOCOLS
(RIP, OSPF, AND BGP)
INTRODUCTION

3
Cost or Metric
• A router is usually attached to several networks
 when it receives a packet, to which network
should it ...
Static versus Dynamic Routing Tables
• A static table is one with manual entries
• A dynamic table, on the other hand, is ...
Routing Protocol
• A routing protocol is a combination of rules and
procedures that lets routers in the internet inform
ea...
INTRA- AND INTER-DOMAIN
ROUTING
7
a group of networks and routers under the authority of a single administration

intra-domain routing

inter-domain routing...
9
DISTANCE VECTOR ROUTING

10
• This method sees an AS, with all routers
and networks, as a graph, a set of nodes
and lines (edges) connecting the nodes...
Bellman-Ford Algorithm

•
•

It looks circular
To solve the problem, we use iteration to create a shortest distance table
...
13
Distance Vector Routing Algorithm

14
15
16
17
18
19
20
Count to Infinity

21
• In distance vector routing, any decrease in cost
(good news) propagates quickly, but any
increase in cost (bad news) pro...
• Example of count to infinity
Two-Node Loop

23
A converged network

Source
http://technet.microsoft.com/en-s/library/cc940478.aspx
24

Another example
The solutions

25
Defining Infinity
• The first obvious
solution to count to
infinity is to redefine
infinity to a smaller
number
• Most imp...
Split Horizon

Split horizon helps reduce convergence time by not
allowing routers to advertise networks in the
direction ...
Source
http://technet.microsoft.com/en-s/library/cc940478.aspx
28
Split Horizon and Poison Reverse
Iit announces all networks. However, those networks learned in a
given direction are anno...
30
Three-Node Instability

31
RIP
Routing Information Protocol
32
RIP implements distance vector routing directly with some
considerations

33
34
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 destinat...
39
Timers in RIP

controls the
advertising of
regular update
messages

Governs the validity of a
route. If the timer is
reach...
41
RIP Version 2

• It supports
– Classless Addressing
– Authentication
– Multicasting  uses the all-router multicast
addres...
Encapsulation

43
LINK STATE ROUTING

44
Each node in the domain
has the entire topology
of the domain  use
Dijkstra algorithm to
build a routing table
The routin...
The whole topology can be compiled from the partial knowledge of each
node (it knows the state (type, condition, and cost)...
BUILDING ROUTING TABLES

47
48
Creation of Link State Packet (LSP)
• A link state packet (LSP) carries (among others
huge information)
1.
2.
3.
4.

The n...
• LSPs are generated on two occasions:
– When there is a change in the topology of the
domain
– On a periodic basis
• Much...
Flooding of LSPs

51
Formation of Shortest Path Tree:
Dijkstra Algorithm
• After receiving all LSPs, each node will
have a copy of the whole to...
Dijkstra algorithm

53
54
55
56
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 containe...
• Routers inside an area flood the area with
routing information
• At the border of an area, special routers
called area b...
•

All of the areas inside an autonomous
system must be connected to a special
area called the backbone area
–

The backbo...
62
If, because of some problem, the
connectivity between a backbone and an
area is broken, a virtual link between routers
mus...
Metric
• The OSPF protocol allows the
administrator to assign a cost, called the
metric, to each route
• The metric can be...
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

•
•

It is not efficient  each router...
• While there is a metric from each node to the designated
router, there is no metric from the designated router to
any ot...
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 ...
Graphical Representation

71
OSPF Packets

72
Common Header

73
Link State Update Packet

74
Router Link LSA

75
76
77
78
Network Link LSA

79
80
81
82
Summary Link to Network LSA

The summary link to network LSA is used by the area border router to
announce the existence o...
84
Summary Link to AS Boundary Router LSA

85
86
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...
Database Description Message

90
Link State Request Packet

91
Link State Acknowledgment Packet

92
Encapsulation

93
PATH VECTOR ROUTING

94
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
eac...
Loop Prevention
The instability of distance vector routing and
the creation of loops can be avoided in path
vector routing...
Aggregation

99
Policy Routing
When a router receives a message, it can
check the path. If one of the autonomous
systems listed in the pat...
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 h...
Multihomed AS
• A multihomed AS has more than one
connection to other ASs, but it is still only
a source or sink for data ...
Transit AS
A transit AS is a multihomed AS that also
allows transient traffic. Good examples of
transit ASs are national a...
CIDR
BGP uses classless interdomain routing
addresses. In other words, BGP uses a
prefix to define a destination address. ...
Path Attributes
• Well-known attribute
– One that every BGP router must recognize
1. Well-known mandatory attribute
– one ...
A session is a connection that is established between two BGP
routers only for the sake of exchanging routing information....
109
Upcoming SlideShare
Loading in …5
×

Network layer Part 7

870 views

Published on

Published in: Education, Technology
  • Be the first to comment

  • Be the first to like this

Network layer Part 7

  1. 1. 4 Tutun Juhana Telecommunication Engineering Network Layer (Part 7) School of Electrical Engineering & Informatics Institut Teknologi Bandung Computer Networks
  2. 2. UNICAST ROUTING PROTOCOLS (RIP, OSPF, AND BGP)
  3. 3. INTRODUCTION 3
  4. 4. 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
  5. 5. 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
  6. 6. 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
  7. 7. INTRA- AND INTER-DOMAIN ROUTING 7
  8. 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 8
  9. 9. 9
  10. 10. DISTANCE VECTOR ROUTING 10
  11. 11. • 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
  12. 12. 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. 2. 3. The shortest distance and the cost between a node and itself is initialized to 0. 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) The algorithm repeat as shown in Figure 11.4 until there is no more change in the shortest distance vector. 12
  13. 13. 13
  14. 14. Distance Vector Routing Algorithm 14
  15. 15. 15
  16. 16. 16
  17. 17. 17
  18. 18. 18
  19. 19. 19
  20. 20. 20
  21. 21. Count to Infinity 21
  22. 22. • 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
  23. 23. • Example of count to infinity Two-Node Loop 23
  24. 24. A converged network Source http://technet.microsoft.com/en-s/library/cc940478.aspx 24 Another example
  25. 25. The solutions 25
  26. 26. Defining Infinity • The first obvious solution to count to infinity is to redefine infinity to a smaller number • 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 26
  27. 27. Split Horizon Split horizon helps reduce convergence time by not allowing routers to advertise networks in the direction from which those networks were learned 27
  28. 28. Source http://technet.microsoft.com/en-s/library/cc940478.aspx 28
  29. 29. Split Horizon and Poison Reverse 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) 29
  30. 30. 30
  31. 31. Three-Node Instability 31
  32. 32. RIP Routing Information Protocol 32
  33. 33. RIP implements distance vector routing directly with some considerations 33
  34. 34. 34
  35. 35. RIP Message Format 35
  36. 36. Requests and Responses 36
  37. 37. 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
  38. 38. 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
  39. 39. 39
  40. 40. Timers in RIP 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. 40
  41. 41. 41
  42. 42. 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
  43. 43. Encapsulation 43
  44. 44. LINK STATE ROUTING 44
  45. 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 45
  46. 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) 46
  47. 47. BUILDING ROUTING TABLES 47
  48. 48. 48
  49. 49. Creation of Link State Packet (LSP) • A link state packet (LSP) carries (among others huge information) 1. 2. 3. 4. The node identity The list of links A sequence number 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
  50. 50. • 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
  51. 51. Flooding of LSPs 51
  52. 52. 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
  53. 53. Dijkstra algorithm 53
  54. 54. 54
  55. 55. 55
  56. 56. 56
  57. 57. Calculation of Routing Table from Shortest Path Tree 57
  58. 58. OSPF Open Shortest Path First 58
  59. 59. 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
  60. 60. • 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
  61. 61. • 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
  62. 62. 62
  63. 63. 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
  64. 64. 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
  65. 65. Types of Links In OSPF terminology, a connection is called a link 65
  66. 66. Point-to-Point Link There is no need to assign a network address to this type of link 66
  67. 67. Transient Link • A transient link is a network with several routers attached to it • • 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 67 designated router
  68. 68. • 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
  69. 69. Stub Link • A special case of the transient network • The link is only onedirectional, from the router to the network 69
  70. 70. 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
  71. 71. Graphical Representation 71
  72. 72. OSPF Packets 72
  73. 73. Common Header 73
  74. 74. Link State Update Packet 74
  75. 75. Router Link LSA 75
  76. 76. 76
  77. 77. 77
  78. 78. 78
  79. 79. Network Link LSA 79
  80. 80. 80
  81. 81. 81
  82. 82. 82
  83. 83. Summary Link to Network LSA The summary link to network LSA is used by the area border router to announce the existence of other networks outside the area 83
  84. 84. 84
  85. 85. Summary Link to AS Boundary Router LSA 85
  86. 86. 86
  87. 87. External Link LSA 87
  88. 88. Other Packets • They are not used as LSAs, but are essential to the operation of OSPF 88
  89. 89. Hello Message • OSPF uses the hello message to create neighborhood relationships and to test the reachability of neighbors 89
  90. 90. Database Description Message 90
  91. 91. Link State Request Packet 91
  92. 92. Link State Acknowledgment Packet 92
  93. 93. Encapsulation 93
  94. 94. PATH VECTOR ROUTING 94
  95. 95. Path vector routing is exterior routing protocol proved to be useful for interdomain or inter-AS routing 95
  96. 96. Reachability 96
  97. 97. Routing Tables • A path vector routing table for each router can be created if ASs share their reachability list with each other 97
  98. 98. 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
  99. 99. Aggregation 99
  100. 100. 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
  101. 101. BGP Border Gateway Protocol An interdomain routing protocol 101
  102. 102. Types of Autonomous Systems • Stub AS • Multihomed AS • Transit AS 102
  103. 103. 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
  104. 104. 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
  105. 105. 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
  106. 106. 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
  107. 107. 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 107 it.
  108. 108. A session is a connection that is established between two BGP routers only for the sake of exchanging routing information. 108
  109. 109. 109

×