msgid "" msgstr "" "Project-Id-Version: English (cnp3-ebook)\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2026-04-18 22:23+0200\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: English \n" "Language: en\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Plural-Forms: nplurals=2; plural=n != 1;\n" "X-Generator: Weblate 5.14.3\n" #: ../../exercises/network.rst:8 #, read-only msgid "" "This is an unpolished draft of the third edition of this e-book. If you find " "any error or have suggestions to improve the text, please create an issue " "via https://github.com/CNP3/ebook/issues?milestone=2 or help us by providing " "pull requests to close the existing issues." msgstr "" "This is an unpolished draft of the third edition of this e-book. If you find " "any error or have suggestions to improve the text, please create an issue " "via https://github.com/CNP3/ebook/issues?milestone=2 or help us by providing " "pull requests to close the existing issues." #: ../../exercises/network.rst:12 #, read-only msgid "Building a network" msgstr "Building a network" #: ../../exercises/network.rst:15 #, read-only msgid "Multiple-choice questions" msgstr "Multiple-choice questions" #: ../../exercises/network.rst:21 #, read-only msgid "Open questions" msgstr "Open questions" #: ../../exercises/network.rst:23 #, read-only msgid "" "In your daily life, you also use hierarchical and flat address spaces. Can " "you provide examples of these two types of addresses and discuss the " "benefits of using a hierarchical or flat addressing space in their " "particular context ?" msgstr "" "In your daily life, you also use hierarchical and flat address spaces. Can " "you provide examples of these two types of addresses and discuss the " "benefits of using a hierarchical or flat addressing space in their " "particular context ?" #: ../../exercises/network.rst:25 #, read-only msgid "" "The network below uses port forwarding with flat addresses. The network " "boots and all hosts start one after the other. Explain at each step how the " "packets are forwarded and how the port forwarding tables of the network " "nodes are modified. Host `C` sends a packet to host `B`. Some time later, " "host `A` sends a packet to host `C`. Finally, host `B` sends a packet to " "host `A`." msgstr "" "The network below uses port forwarding with flat addresses. The network " "boots and all hosts start one after the other. Explain at each step how the " "packets are forwarded and how the port forwarding tables of the network " "nodes are modified. Host `C` sends a packet to host `B`. Some time later, " "host `A` sends a packet to host `C`. Finally, host `B` sends a packet to " "host `A`." #: ../../exercises/network.rst:51 #, read-only msgid "" "Same question as above, but the network is modified as shown in the figure " "below." msgstr "" "Same question as above, but the network is modified as shown in the figure " "below." #: ../../exercises/network.rst:76 #, read-only msgid "" "Routing protocols used in data networks only use positive link weights. What " "would happen with a distance vector routing protocol in the network below " "that contains a negative link weight ?" msgstr "" "Routing protocols used in data networks only use positive link weights. What " "would happen with a distance vector routing protocol in the network below " "that contains a negative link weight ?" #: ../../exercises/network.rst:95 #, read-only msgid "" "When a network specialist designs a network, one of the problems that he " "needs to solve is to set the metrics the links in his network. In the USA, " "the Abilene network interconnects most of the research labs and " "universities. The figure below shows the topology of this network in 2009." msgstr "" "When a network specialist designs a network, one of the problems that he " "needs to solve is to set the metrics the links in his network. In the USA, " "the Abilene network interconnects most of the research labs and " "universities. The figure below shows the topology of this network in 2009." #: ../../exercises/network.rst:101 #, read-only msgid "The Abilene network" msgstr "The Abilene network" #: ../../exercises/network.rst:103 #, read-only msgid "" "In this network, assume that all the link weights are set to 1. What is the " "paths followed by a packet sent by the router located in `Los Angeles` to " "reach :" msgstr "" "In this network, assume that all the link weights are set to 1. What is the " "paths followed by a packet sent by the router located in `Los Angeles` to " "reach :" #: ../../exercises/network.rst:105 #, read-only msgid "the router located in `New York`" msgstr "the router located in `New York`" #: ../../exercises/network.rst:106 #, read-only msgid "the router located in `Washington` ?" msgstr "the router located in `Washington` ?" #: ../../exercises/network.rst:108 #, read-only msgid "" "Is it possible to configure the link metrics so that the packets sent by the " "router located in `Los Angeles` to the routers located in respectively `New " "York` and `Washington` do not follow the same path ?" msgstr "" "Is it possible to configure the link metrics so that the packets sent by the " "router located in `Los Angeles` to the routers located in respectively `New " "York` and `Washington` do not follow the same path ?" #: ../../exercises/network.rst:110 #, read-only msgid "" "Is it possible to configure the link weights so that the packets sent by the " "router located in `Los Angeles` to router located in `New York` follow one " "path while the packets sent by the router located in `New York` to the " "router located in `Los Angeles` follow a completely different path ?" msgstr "" "Is it possible to configure the link weights so that the packets sent by the " "router located in `Los Angeles` to router located in `New York` follow one " "path while the packets sent by the router located in `New York` to the " "router located in `Los Angeles` follow a completely different path ?" #: ../../exercises/network.rst:112 #, read-only msgid "" "Assume that the routers located in `Denver` and `Kansas City` need to " "exchange lots of packets. Can you configure the link metrics such that the " "link between these two routers does not carry any packet sent by another " "router in the network ?" msgstr "" "Assume that the routers located in `Denver` and `Kansas City` need to " "exchange lots of packets. Can you configure the link metrics such that the " "link between these two routers does not carry any packet sent by another " "router in the network ?" #: ../../exercises/network.rst:114 #, read-only msgid "" "In the five nodes network shown below, can you configure the link metrics so " "that the packets sent by router `R5` to router `R1` use link `R3->R1` while " "the packets sent by router `R3` use links `R3->R2` and `R2->R1`?" msgstr "" "In the five nodes network shown below, can you configure the link metrics so " "that the packets sent by router `R5` to router `R1` use link `R3->R1` while " "the packets sent by router `R3` use links `R3->R2` and `R2->R1`?" #: ../../exercises/network.rst:138 #, read-only msgid "" "In the five nodes network shown above, can you configure the link weights so " "that the packets sent by router `R5` (resp. `R4`) follow the `R5->R3->R1` " "path (resp. `R4->R2->R3->R1`) ?" msgstr "" "In the five nodes network shown above, can you configure the link weights so " "that the packets sent by router `R5` (resp. `R4`) follow the `R5->R3->R1` " "path (resp. `R4->R2->R3->R1`) ?" #: ../../exercises/network.rst:141 #: ../../exercises/network.rst:163 #: ../../exercises/network.rst:193 #: ../../exercises/network.rst:225 #, read-only msgid "Consider the network shown in the figure below." msgstr "Consider the network shown in the figure below." #: ../../exercises/network.rst:161 #, read-only msgid "" "Assuming that the network uses source routing, what are the possible paths " "from `R1` to `R4` ?" msgstr "" "Assuming that the network uses source routing, what are the possible paths " "from `R1` to `R4` ?" #: ../../exercises/network.rst:185 #, read-only msgid "" "The network operator uses would like to have the following paths in this " "network :" msgstr "" "The network operator uses would like to have the following paths in this " "network :" #: ../../exercises/network.rst:187 #, read-only msgid "`R3->R2->R4->R5` and `R1->R2->R5`" msgstr "`R3->R2->R4->R5` and `R1->R2->R5`" #: ../../exercises/network.rst:189 #, read-only msgid "" "Is it possible to achieve these paths and if so what are the required " "forwarding tables ?" msgstr "" "Is it possible to achieve these paths and if so what are the required " "forwarding tables ?" #: ../../exercises/network.rst:191 #: ../../exercises/network.rst:223 #, read-only msgid "Same question with virtual circuits." msgstr "Same question with virtual circuits." #: ../../exercises/network.rst:217 #: ../../exercises/network.rst:247 #, read-only msgid "The network operator would like to use the following paths :" msgstr "The network operator would like to use the following paths :" #: ../../exercises/network.rst:219 #, read-only msgid "`R1->R2->R4` and `R3->R2->R5->R4`" msgstr "`R1->R2->R4` and `R3->R2->R5->R4`" #: ../../exercises/network.rst:221 #, read-only msgid "" "Are these paths possible with link-state or distance vector routing ? If so, " "how do you configure the link weights? If not, explain your answer." msgstr "" "Are these paths possible with link-state or distance vector routing ? If so, " "how do you configure the link weights? If not, explain your answer." #: ../../exercises/network.rst:249 #, read-only msgid "`R1->R5->R4` and `R3->R2->R4`" msgstr "`R1->R5->R4` and `R3->R2->R4`" #: ../../exercises/network.rst:256 #, read-only msgid "Discussion questions" msgstr "Discussion questions" #: ../../exercises/network.rst:259 #, read-only msgid "" "The network below uses port forwarding tables. It has been running for " "several hours and all hosts have exchanged packets. What is the content of " "the port forwarding tables ?" msgstr "" "The network below uses port forwarding tables. It has been running for " "several hours and all hosts have exchanged packets. What is the content of " "the port forwarding tables ?" #: ../../exercises/network.rst:282 #, read-only msgid "" "At this point, a new link is added between `R1` and `R3`. What happens for " "the forwarding of packets ?" msgstr "" "At this point, a new link is added between `R1` and `R3`. What happens for " "the forwarding of packets ?" #: ../../exercises/network.rst:285 #, read-only msgid "" "The network below uses port forwarding tables. What happens if host `A` " "moves by removing its link with `R1` and replacing it with a link with `R3`? " "How should networks using port forwarding deal with such mobile hosts ?" msgstr "" "The network below uses port forwarding tables. What happens if host `A` " "moves by removing its link with `R1` and replacing it with a link with `R3`? " "How should networks using port forwarding deal with such mobile hosts ?" #: ../../exercises/network.rst:308 #, read-only msgid "" "Some hosts need to be multihomed, i.e. attached to two different network " "nodes as shown in the figure below." msgstr "" "Some hosts need to be multihomed, i.e. attached to two different network " "nodes as shown in the figure below." #: ../../exercises/network.rst:332 #, read-only msgid "Would this network work correctly with port-forwarding tables if :" msgstr "Would this network work correctly with port-forwarding tables if :" #: ../../exercises/network.rst:334 #, read-only msgid "Host `A` uses the same flat address for both links." msgstr "Host `A` uses the same flat address for both links." #: ../../exercises/network.rst:335 #, read-only msgid "Host `A` uses a different flat address on each of its links" msgstr "Host `A` uses a different flat address on each of its links" #: ../../exercises/network.rst:337 #, read-only msgid "" "What are the advantages and drawbacks of flat addresses versus hierarchical " "addresses ?" msgstr "" "What are the advantages and drawbacks of flat addresses versus hierarchical " "addresses ?" #: ../../exercises/network.rst:341 #, read-only msgid "" "Let us now consider the transient problems that mainly happen when the " "network topology changes. For this, consider the network topology shown in " "the figure below and assume that all routers use a distance vector protocol " "that uses split horizon." msgstr "" "Let us now consider the transient problems that mainly happen when the " "network topology changes. For this, consider the network topology shown in " "the figure below and assume that all routers use a distance vector protocol " "that uses split horizon." #: ../../exercises/network.rst:365 #, read-only msgid "" "If you compute the routing tables of all routers in this network, you would " "obtain a table such as the table below :" msgstr "" "If you compute the routing tables of all routers in this network, you would " "obtain a table such as the table below :" #: ../../exercises/network.rst:369 #, read-only msgid "Destination" msgstr "Destination" #: ../../exercises/network.rst:369 #, read-only msgid "Routes on A" msgstr "Routes on A" #: ../../exercises/network.rst:369 #, read-only msgid "Routes on B" msgstr "Routes on B" #: ../../exercises/network.rst:369 #, read-only msgid "Routes on C" msgstr "Routes on C" #: ../../exercises/network.rst:369 #, read-only msgid "Routes on D" msgstr "Routes on D" #: ../../exercises/network.rst:369 #, read-only msgid "Routes on E" msgstr "Routes on E" #: ../../exercises/network.rst:372 #, read-only msgid "A" msgstr "A" #: ../../exercises/network.rst:372 #: ../../exercises/network.rst:373 #: ../../exercises/network.rst:374 #: ../../exercises/network.rst:375 #: ../../exercises/network.rst:376 #, read-only msgid "0" msgstr "0" #: ../../exercises/network.rst:372 #, read-only msgid "1 via A" msgstr "1 via A" #: ../../exercises/network.rst:372 #: ../../exercises/network.rst:374 #, read-only msgid "2 via B" msgstr "2 via B" #: ../../exercises/network.rst:372 #: ../../exercises/network.rst:376 #, read-only msgid "3 via C" msgstr "3 via C" #: ../../exercises/network.rst:372 #, read-only msgid "4 via D" msgstr "4 via D" #: ../../exercises/network.rst:373 #, read-only msgid "B" msgstr "B" #: ../../exercises/network.rst:373 #: ../../exercises/network.rst:373 #, read-only msgid "1 via B" msgstr "1 via B" #: ../../exercises/network.rst:373 #: ../../exercises/network.rst:375 #, read-only msgid "2 via C" msgstr "2 via C" #: ../../exercises/network.rst:373 #, read-only msgid "3 via D" msgstr "3 via D" #: ../../exercises/network.rst:374 #, read-only msgid "C" msgstr "C" #: ../../exercises/network.rst:374 #: ../../exercises/network.rst:374 #, read-only msgid "1 via C" msgstr "1 via C" #: ../../exercises/network.rst:374 #: ../../exercises/network.rst:376 #, read-only msgid "2 via D" msgstr "2 via D" #: ../../exercises/network.rst:375 #, read-only msgid "D" msgstr "D" #: ../../exercises/network.rst:375 #, read-only msgid "3 via B" msgstr "3 via B" #: ../../exercises/network.rst:375 #: ../../exercises/network.rst:375 #, read-only msgid "1 via D" msgstr "1 via D" #: ../../exercises/network.rst:376 #, read-only msgid "E" msgstr "E" #: ../../exercises/network.rst:376 #, read-only msgid "4 via B" msgstr "4 via B" #: ../../exercises/network.rst:376 #, read-only msgid "1 via E" msgstr "1 via E" #: ../../exercises/network.rst:379 #, read-only msgid "" "Distance vector protocols can operate in two different modes : `periodic " "updates` and `triggered updates`. `Periodic updates` is the default mode for " "a distance vector protocol. For example, each router could advertise its " "distance vector every thirty seconds. With the `triggered updates` a router " "sends its distance vector when its routing table changes " "(and periodically when there are no changes)." msgstr "" "Distance vector protocols can operate in two different modes : `periodic " "updates` and `triggered updates`. `Periodic updates` is the default mode for " "a distance vector protocol. For example, each router could advertise its " "distance vector every thirty seconds. With the `triggered updates` a router " "sends its distance vector when its routing table changes " "(and periodically when there are no changes)." #: ../../exercises/network.rst:381 #, read-only msgid "" "Consider a distance vector protocol using split horizon and `periodic " "updates`. Assume that the link `B-C` fails. `B` and `C` update their local " "routing table but they will only advertise it at the end of their period. " "Select one ordering for the `periodic updates` and every time a router " "sends its distance vector, indicate the vector sent to each neighbor and " "update the table above. How many periods are required to allow the network " "to converge to a stable state ?" msgstr "" "Consider a distance vector protocol using split horizon and `periodic " "updates`. Assume that the link `B-C` fails. `B` and `C` update their local " "routing table but they will only advertise it at the end of their period. " "Select one ordering for the `periodic updates` and every time a router " "sends its distance vector, indicate the vector sent to each neighbor and " "update the table above. How many periods are required to allow the network " "to converge to a stable state ?" #: ../../exercises/network.rst:383 #, read-only msgid "" "Consider the same distance vector protocol, but now with `triggered updates`" ". When link `B-C` fails, assume that `B` updates its routing table " "immediately and sends its distance vector to `A` and `D`. Assume that both " "`A` and `D` process the received distance vector and that `A` sends its own " "distance vector, ... Indicate all the distance vectors that are exchanged " "and update the table above each time a distance vector is sent by a router " "(and received by other routers) until all routers have learned a new route " "to each destination. How many distance vector messages must be exchanged " "until the network converges to a stable state ?" msgstr "" "Consider the same distance vector protocol, but now with `triggered updates`" ". When link `B-C` fails, assume that `B` updates its routing table " "immediately and sends its distance vector to `A` and `D`. Assume that both " "`A` and `D` process the received distance vector and that `A` sends its own " "distance vector, ... Indicate all the distance vectors that are exchanged " "and update the table above each time a distance vector is sent by a router " "(and received by other routers) until all routers have learned a new route " "to each destination. How many distance vector messages must be exchanged " "until the network converges to a stable state ?" #: ../../exercises/network.rst:385 #, read-only msgid "" "Consider again the network shown above. After some time, link state routing " "converges and all routers compute the same routing tables as above." msgstr "" "Consider again the network shown above. After some time, link state routing " "converges and all routers compute the same routing tables as above." #: ../../exercises/network.rst:387 #, read-only msgid "" "An important difference between OSPF and RIP is that OSPF routers flood link " "state packets that allow the other routers to recompute their own routing " "tables while RIP routers exchange distance vectors. Consider that link `B-C` " "fails and that router `B` is the first to detect the failure. At this point, " "`B` cannot reach anymore `C`, `D` and `E`. `C` cannot reach `B` and `A` " "anymore." msgstr "" "An important difference between OSPF and RIP is that OSPF routers flood link " "state packets that allow the other routers to recompute their own routing " "tables while RIP routers exchange distance vectors. Consider that link `B-C` " "fails and that router `B` is the first to detect the failure. At this point, " "`B` cannot reach anymore `C`, `D` and `E`. `C` cannot reach `B` and `A` " "anymore." #: ../../exercises/network.rst:389 #, read-only msgid "" "Router `B` will flood its updated link state packet through the entire " "network and all routers will recompute their forwarding table. Upon " "reception of a link state packet, routers usually first flood the received " "link-state packet and then recompute their forwarding table. Assume that `B` " "is the first to recompute its forwarding table, followed by `D`, `A`, `C` " "and finally `E`." msgstr "" "Router `B` will flood its updated link state packet through the entire " "network and all routers will recompute their forwarding table. Upon " "reception of a link state packet, routers usually first flood the received " "link-state packet and then recompute their forwarding table. Assume that `B` " "is the first to recompute its forwarding table, followed by `D`, `A`, `C` " "and finally `E`." #: ../../exercises/network.rst:391 #, read-only msgid "" "After each update of a forwarding table, verify which pairs of routers are " "able to exchange packets. Provide your answer using a table similar to the " "one shown above." msgstr "" "After each update of a forwarding table, verify which pairs of routers are " "able to exchange packets. Provide your answer using a table similar to the " "one shown above."