2. cnp3-ebook
3. principles/network
4. English
5. Zen

117 ../../principles/network.rst:600 • ../../principles/linkstate.rst:379
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Footnotes 9/10000 · 9
118 ../../principles/network.rst:601
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We will see later a more detailed description of Multiprotocol Label Switching, a networking technology that is capable of using one or more labels. 148/10000 · 148
119 ../../principles/network.rst:606
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The control plane 17/10000 · 17
120 ../../principles/network.rst:608
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — One of the objectives of the `control plane` in the network layer is to maintain the routing tables that are used on all routers. As indicated earlier, a routing table is a data structure that contains, for each destination address (or block of addresses) known by the router, the outgoing interface over which the router must forward a packet destined to this address. The routing table may also contain additional information such as the address of the next router on the path towards the destination or an estimation of the cost of this path. 545/10000 · 545
121 ../../principles/network.rst:610
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In this section, we discuss the main techniques that can be used to maintain the forwarding tables in a network. 112/10000 · 112
122 ../../principles/dv.rst:7
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Distance vector routing 23/10000 · 23
123 ../../principles/dv.rst:9
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Distance vector routing is a simple distributed routing protocol. Distance vector routing allows routers to automatically discover the destinations reachable inside the network as well as the shortest path to reach each of these destinations. The shortest path is computed based on `metrics` or `costs` that are associated to each link. We use `l.cost` to represent the metric that has been configured for link `l` on a router. 427/10000 · 427
124 ../../principles/dv.rst:11
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Each router maintains a routing table. The routing table `R` can be modeled as a data structure that stores, for each known destination address `d`, the following attributes : 175/10000 · 175
125 ../../principles/dv.rst:13
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `R[d].link` is the outgoing link that the router uses to forward packets towards destination `d` 96/10000 · 96
126 ../../principles/dv.rst:14
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `R[d].cost` is the sum of the metrics of the links that compose the shortest path to reach destination `d` 106/10000 · 106
127 ../../principles/dv.rst:15
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `R[d].time` is the timestamp of the last distance vector containing destination `d` 83/10000 · 83
128 ../../principles/dv.rst:17
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A router that uses distance vector routing regularly sends its distance vector over all its interfaces. This distance vector is a summary of the router's routing table that indicates the distance towards each known destination. This distance vector can be computed from the routing table by using the pseudo-code below. 319/10000 · 319
129 ../../principles/dv.rst:31
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a router boots, it does not know any destination in the network and its routing table only contains its local address(es). It thus sends to all its neighbors a distance vector that contains only its address at a distance of `0`. When a router receives a distance vector on link `l`, it processes it as follows. 315/10000 · 315
130 ../../principles/dv.rst:54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The router iterates over all addresses included in the distance vector. If the distance vector contains a destination address that the router does not know, it inserts it inside its routing table via link `l` and at a distance which is the sum between the distance indicated in the distance vector and the cost associated to link `l`. If the destination was already known by the router, it only updates the corresponding entry in its routing table if either : 459/10000 · 459
131 ../../principles/dv.rst:56
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the cost of the new route is smaller than the cost of the already known route `((V[d].cost + l.cost) < R[d].cost)` 114/10000 · 114
132 ../../principles/dv.rst:57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the new route was learned over the same link as the current best route towards this destination `(R[d].link == l)` 114/10000 · 114
133 ../../principles/dv.rst:59
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first condition ensures that the router discovers the shortest path towards each destination. The second condition is used to take into account the changes of routes that may occur after a link failure or a change of the metric associated to a link. 253/10000 · 253
134 ../../principles/dv.rst:61
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To understand the operation of a distance vector protocol, let us consider the network of five routers shown below. 115/10000 · 115
135 ../../principles/dv.rst:117
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assume that router `A` is the first to send its distance vector `[A=0]`. 72/10000 · 72
136 ../../principles/dv.rst:119
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `B` and `D` process the received distance vector and update their routing table with a route towards `A`. 105/10000 · 105