5.1 Introduction to the Network-layer Control Plane — Transcript

Full transcript

1. 0:00[Music]
2. 0:10well we're ready to move
3. 0:11into the control plane chapter 5 in our
4. 0:14textbook
5. 0:15we're going to be staying in the network
6. 0:17layer but we're going to shift our focus
7. 0:19from the data plane which we studied in
8. 0:21chapter 4 into the control plane
9. 0:24and in making this shift we're going to
10. 0:25be moving from looking at
11. 0:27individual routers in the in the data
12. 0:30plane that
13. 0:30per router function moving packets from
14. 0:33input ports
15. 0:34to output ports to a more network-wide
16. 0:36view looking at problems of routing for
17. 0:38example
18. 0:39how to determine paths from source to
19. 0:41destination
20. 0:43and we'll also look at issues of network
21. 0:44management and network configuration
22. 0:46i think you're going to really enjoy
23. 0:48this chapter a lot because there's been
24. 0:49a lot of innovation
25. 0:51in the network control plane
26. 0:52particularly in the last five to ten
27. 0:54years
28. 0:55with the introduction of software
29. 0:56defined networking which we'll cover
30. 0:58in our discussion here so i think you're
31. 1:00going to really enjoy this stay tuned
32. 1:03so as always our approach will be to
33. 1:05start with principles but then also to
34. 1:07cover
35. 1:08practice as well so starting with
36. 1:10principles we're going to begin by
37. 1:11looking at routing algorithms and we'll
38. 1:13see
39. 1:14that they're basically two types of
40. 1:16routing algorithms more
41. 1:18centralized link state dijkstra-like
42. 1:20algorithms
43. 1:21and then more distributed bellman ford
44. 1:23type algorithms and we'll cover both of
45. 1:25those
46. 1:26i think it's fair to say that just about
47. 1:28every internet routing algorithm
48. 1:30either adopts a link-state dijkstra-like
49. 1:32algorithm or a distributed
50. 1:34bellman ford type of approach in terms
51. 1:36of principles we'll then take a look at
52. 1:38the concept of software-defined network
53. 1:41controllers the platform where routing
54. 1:43and other network and management
55. 1:44configuration
56. 1:46activities happen and then finally we'll
57. 1:48cover some of the principles involved
58. 1:50in network management and also network
59. 1:53configuration
60. 1:54management and then we'll take a look at
61. 1:57seeing our principles in practice in
62. 1:59today's internet
63. 2:00take a look at how dijkstra's algorithm
64. 2:02and the bellman ford algorithm
65. 2:04are implemented in the open shortest
66. 2:06path first protocol
67. 2:08ospf the border gateway protocol bgp
68. 2:11respectively
69. 2:12when we look at the implementation of
70. 2:14software-defined networking we'll look
71. 2:15at the open flow protocol
72. 2:17the protocol that really got sdn started
73. 2:20and then we'll take a look at two open
74. 2:22source controller platforms the open
75. 2:24daylight controller odl
76. 2:25and the onos controller we'll wrap up
77. 2:27our principles and practice study of the
78. 2:29control plane
79. 2:30by looking at the internet control
80. 2:32message protocol icmp
81. 2:34and the simple network management
82. 2:35protocol snmp
83. 2:37and the netconf protocol that helps with
84. 2:39both network control and configuration
85. 2:41management
86. 2:43now as we make our way through the
87. 2:45network control plane we're going to be
88. 2:46interleaving
89. 2:47both principles in practice following
90. 2:50this introduction we're going to take a
91. 2:51look first at
92. 2:52routing algorithms we're going to take a
93. 2:54look at both the link state
94. 2:56and the distance vector algorithms that
95. 2:57we talked about before
96. 2:59the dijkstra-like algorithms and the
97. 3:01bellman-ford type of algorithms
98. 3:03then we're going to look at the
99. 3:04embodiment of these algorithms
100. 3:06in internet protocols we're going to
101. 3:09take a look at open
102. 3:10shortest path first ospf which takes a
103. 3:13link state approach to routing
104. 3:15within a network that's sometimes called
105. 3:18intra
106. 3:19domain routing for routing within a
107. 3:21network then we're going to take a look
108. 3:23at bgp the border gateway protocol
109. 3:26that's an inter domain routing algorithm
110. 3:30it's for routing
111. 3:31among and between administrative systems
112. 3:34between
113. 3:34networks and we've seen already of
114. 3:37course that the internet is a network of
115. 3:39networks and it's
116. 3:40bgp that's going to allow all of the
117. 3:43networks that comprise
118. 3:45the global internet to actually route to
119. 3:47and from
120. 3:48each other for that reason bgp sometimes
121. 3:50called the glue
122. 3:52that holds the internet together so
123. 3:54following routing algorithms and routing
124. 3:56protocols we're then going to take a
125. 3:57look
126. 3:58at software-defined networking we're
127. 4:00going to look at the principles involved
128. 4:02in logically centralized controllers
129. 4:04for sdn then we're going to take a look
130. 4:07at two
131. 4:08sdn controllers in particular odl the
132. 4:11open daylight controller
133. 4:13and the onos network controller then
134. 4:16we're going to look at the internet
135. 4:17control message protocol icmp i'm going
136. 4:20to wrap up with a discussion
137. 4:22of network management and also a little
138. 4:24bit on network configuration
139. 4:26we'll look at snmp the simple network
140. 4:28management protocol
141. 4:29and netconf and yang and as we proceed
142. 4:33through the control plane function of
143. 4:35the network layer chapter 5
144. 4:36it'd be a good idea to keep in mind the
145. 4:39distinction between
146. 4:40forwarding to covered in chapter 4 and
147. 4:42routing which we'll be covering now
148. 4:45forwarding is the router local data
149. 4:47plane function of moving packets from a
150. 4:49router's input port
151. 4:50to a router's output port it's a local
152. 4:53function
153. 4:54routing determines the path taken by
154. 4:55packets from source to destination
155. 4:57a network-wide function and in this
156. 5:00chapter we'll study
157. 5:01two basic approaches for implementing
158. 5:03routing
159. 5:05the per router control plane has a piece
160. 5:07of the control plane in
161. 5:08each and every router the routing
162. 5:11algorithms typically
163. 5:12implemented in a distributed manner as
164. 5:14shown here
165. 5:16and in the sdn approach the control
166. 5:19computations are logically centralized
167. 5:21that is they're done in the sdn
168. 5:23controller and then their result
169. 5:25for example the forwarding tables are
170. 5:27pushed out to and then
171. 5:29installed at the individual routers note
172. 5:31that here the routers
173. 5:33don't interact with each other to
174. 5:34actually compute the paths we'll take a
175. 5:38look at both of these shortly
176. 5:39but let me remind you here that the
177. 5:41algorithms for computing
178. 5:43a shortest or least cost path dijkstra's
179. 5:46algorithm for example
180. 5:47are the same in either approach it's how
181. 5:50they're
182. 5:50implemented whether in each and every
183. 5:52router or
184. 5:53in a logically centralized sdn approach
185. 5:56that differs
186. 5:58well that concludes a quick overview of
187. 6:00what we're going to be covering here
188. 6:02in the control plane in our study of the
189. 6:04control plane you know teaching the
190. 6:06control plane teaching the data plane
191. 6:08and also teaching the transport layer
192. 6:10are three of my favorite things to teach
193. 6:12in a networking course
194. 6:14so i think you're going to really enjoy
195. 6:18this
196. 6:32you