cnp3-ebook/principles/network

Exit Zen

14 ../../principles/network.rst:74
	English To send one byte of information to host `B`, host `A` needs to place this information inside a `packet`. In addition to the data being transmitted, the packet also contains either the addresses of the source and the destination nodes or information that indicates the path that needs to be followed to reach the destination.
	French Pour envoyer un byte d'information vers l'hôte `B`, l'hôte `A` doit placer cette information à l'intérieur d'un `paquet`. En plus des données transmises, le paquet contient également soit l'adresse de la source et celle du noeud destinataire, soit des informations qui indiquent le chemin à prendre pour atteindre la destination. 329/3240 · 324 Needs editing
15 ../../principles/network.rst:76
	English There are two possible organizations for the network layer :
	French Il y a deux organisations possibles pour la couche réseau : 59/600 · 60 Needs editing
16 ../../principles/network.rst:78
	English `datagram`
	French les `datagram` 14/100 · 10 Needs editing
17 ../../principles/network.rst:79
	English `virtual circuits`
	French les `circuits virtuels` 23/180 · 18 Needs editing
18 ../../principles/network.rst:83
	English The datagram organization
	French L'organisation `datagram` 25/250 · 25 Needs editing
19 ../../principles/network.rst:85
	English The first and most popular organization of the network layer is the datagram organization. This organization is inspired by the organization of the postal service. Each host is identified by a `network layer address`. To send information to a remote host, a host creates a packet that contains:
	French La première organisation, et la plus populaire, de la couche réseau est l'organisation par `datagram`. Cette organisation s'inspire de l'organisation du service postal. Chaque hôte est identifié par une `adresse sur la couche réseau`. Afin d'envoyer de l'information à un hôte distant, un hôte crée un paquet qui contient  : 324/2940 · 294 Needs editing
20 ../../principles/network.rst:87
	English the network layer address of the destination host
	French l'adresse de l'hôte de destination sur la couche réseau 55/490 · 49 Needs editing
21 ../../principles/network.rst:88
	English its own network layer address
	French sa propre adresse sur la couche réseau 38/290 · 29 Needs editing
22 ../../principles/network.rst:89
	English the information to be sent
	French l'information à envoyer 23/260 · 26 Needs editing
23 ../../principles/network.rst:91
	English To understand the datagram organization, let us consider the figure below. A network layer address, represented by a letter, has been assigned to each host and router. To send some information to host `J`, host `A` creates a packet containing its own address, the destination address and the information to be exchanged.
	French Pour comprendre l'organisation par datagram, considérons la figure ci-dessous. Une adresse sur la couche réseau, représentée par une lettre, a été assignée à chaque hôte et routeur. Pour envoyer de l'information à l'hôte `J`, l'hôte `A` crée un paquet contenant sa propre adresse, l'adresse de destination et l'information à échanger. 334/3200 · 320 Needs editing
25 ../../principles/network.rst:102
	English With the datagram organization, routers use `hop-by-hop forwarding`. This means that when a router receives a packet that is not destined to itself, it looks up the destination address of the packet in its `forwarding table`. A `forwarding table` is a data structure that maps each destination address (or set of destination addresses) to the outgoing interface over which a packet destined to this address must be forwarded to reach its final destination. The router consults its forwarding table to forward each packet that it handles.
	French Avec l'organisation datagram, les routeurs utilisent le `hop-by-hop forwarding`. Cela signifie que lorsqu'un routeur reçoit un paquet qui ne lui est pas destiné, il va chercher l'adresse de destination du paquet dans sa `table de forwarding`. Une `table de forwarding` (forwarding table) est une structure de données qui associe à chaque adresse de destination une interface de sortie qu'un paquet destiné à cette adresse doit suivre pour atteindre sa destination finale. Le retoueur consulte sa forwarding table pour transférer chaque paquet à traiter. 553/5370 · 537 Needs editing
26 ../../principles/network.rst:104
	English The figure illustrates some possible forwarding tables in this network. By inspecting the forwarding tables of the different routers, one can find the path followed by packets sent from a source to a particular destination. In the example above, host `A` sends its packet to router `R1`. `R1` consults its forwarding table and forwards the packet towards `R2`. Based on its own table, `R2` decides to forward the packet to `R5` that can deliver it to its destination. Thus, the path from `A` to `J` is `A -> R1 -> R2 -> R5 -> J`.
	French La figure illustre quelques forwarding tables possibles dans ce réseau. En inspectant les forwarding tables des différents routeurs, on peut trouver le chemin suivi par les paquets envoyés depuis une source vers une destination particulière. Dans l'exemple ci-dessus, l'hôte `A` envoie son paquet au routeur `R1`. `R1` consulte sa forwarding tables et transmet le paquet vers `R2`. En se basant sur sa propre table, `R2` décide de transmettre le paquet à `R5` qui peut le livrer à sa destination. Ainsi, le chemin de `A` à `J` est `A -> R1 -> R2 -> R5 -> J`. 558/5290 · 529 Needs editing
40 ../../principles/network.rst:143
	English Computing forwarding tables
	French Le calcul des tables de forwarding 34/270 · 27 Needs editing
92 ../../principles/network.rst:371 • ../../principles/network.rst:412 • ../../principles/network.rst:414 • ../../principles/network.rst:422 • ../../principles/network.rst:432 • ../../principles/network.rst:442
	English 0
	French 0 1/100 · 1 Needs editing
114 ../../principles/linkstate.rst:128 • ../../principles/network.rst:505
	English Footnotes
	French Notes de pied de page 21/100 · 9 Needs editing
The translation has come to an end.

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.