cnp3-ebook - English @ Weblate

Exit Zen

25 ../../protocols/routing.rst:78

	English For example, the network shown in the figure below has been divided into three areas : `area 0`, containing routers `RA`, `RB`, `RC` and `RD`, `area 1`, containing routers `R1`, `R3`, `R4`, `R5` and `RA`, and `area 2` containing `R7`, `R8`, `R9`, `R10`, `RB` and `RC`. OSPF areas are identified by a 32 bit integer, which is sometimes represented as an IP address. Among the OSPF areas, `area 0`, also called the `backbone area`, has a special role. The backbone area groups all the area border routers (routers `RA`, `RB` and `RC` in the figure below) and the routers that are directly connected to the backbone routers but do not belong to another area (router `RD` in the figure below). An important restriction imposed by OSPF is that the path between two routers that belong to two different areas (e.g. `R1` and `R8` in the figure below) must pass through the backbone area. 880/10000 · 880
25 ../../protocols/rpc.rst:103

	English `method`: a string that contains the name of the procedure which is invoked 75/10000 · 75
25 ../../protocols/ssh.rst:208

	English a key used by the client (resp. server) to initialize the negotiated encryption scheme (if required by this scheme) 115/10000 · 115
25 ../../protocols/tcp.rst:52

	English the `URG` flag is used together with the `Urgent pointer` 57/10000 · 57
25 ../../protocols/tls.rst:77

	English In the remaining parts of this chapter, we assume that the TLS session starts immediately after the establishment of the TCP connection. This corresponds to the deployments on web servers. We focus our presentation of TLS on this very popular use case. TLS is a complex protocol that supports other features than the one used by web servers. A more detailed presentation of TLS may be found in [KPS2002]_ and [Ristic2015]_. 423/10000 · 423
25 ../../protocols/udp.rst:89

	English Footnotes 9/10000 · 9
25 ../../protocols/wifi.rst:25

	English 802.11g 7/10000 · 7
25 ../../principles/naming.rst:127

	English In addition to being more human friendly, using names instead of addresses inside applications has several important benefits. To understand them, let us consider a popular application that provides information stored on servers. This application involves clients and servers. The server provides information upon requests from client processes. A first deployment of this application would be to rely only on addresses. In this case, the server process would be installed on one host and the clients would connect to this server to retrieve information. Such a deployment has several drawbacks : 596/10000 · 596
25 ../../principles/network.rst:193

	English The computation of the forwarding tables of all the routers inside a network is a key element for the correct operation of the network. This computation can be carried out by using either distributed or centralized algorithms. These algorithms provide different performance, may lead to different types of paths, but their composition must lead to valid paths. 360/10000 · 360
25 ../../bibliography.rst:35

	English Bush, R., `FidoNet: technology, tools, and history <http://doi.acm.org/10.1145/163381.163383>`_. Communications ACM 36, 8 (Aug. 1993), 31-35. 141/10000 · 141
25 ../../principles/sharing.rst:197

	English The performance of network nodes (either routers or switches) can be characterized by two key metrics : 103/10000 · 103
26 ../../exercises/ex-sharing.rst:561

	English Assume now that `R1` is using round-robin scheduling instead of a FIFO buffer. One queue is used to store the packets sent by `A` and another for the packets sent by `B`. `A` sends one 1000 bits packet every second while `B` sends packets at 10 Mbps. What is the round-trip-time measured by each of these two hosts if each of the two queues of `R1` can store 5 packets ? 370/10000 · 370
26 ../../exercises/sockets.rst:229

	English The following program connects a socket to a remote address, sends a message and waits for a reply. 99/10000 · 99
26 ../../principles/naming.rst:129

	English if the server process moves to another physical server, all clients must be informed about the new server address 113/10000 · 113
26 ../../principles/network.rst:195

	English In a network, a path can be defined as the list of all intermediate routers for a given source destination pair. For a given source/destination pair, the path can be derived by first consulting the forwarding table of the router attached to the source to determine the next router on the path towards the chosen destination. Then, the forwarding table of this router is queried for the same destination... The queries continue until the destination is reached. In a network that has valid forwarding tables, all the paths between all source/destination pairs contain a finite number of intermediate routers. However, if forwarding tables have not been correctly computed, two types of invalid paths can occur. 709/10000 · 709
26 ../../principles/referencemodels.rst:206

	English transport layer entities exchange segments 44/10000 · 44
26 ../../principles/reliability.rst:66

	English every millisecond, record the voltage applied on the electrical wire. If the voltage is set to ``+5V``, record the reception of bit `1`. Otherwise, record the reception of bit `0` 179/10000 · 179
26 ../../bibliography.rst:36

	English Bux, W., `Token-ring local-area networks and their performance <http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=18625>`_, Proceedings of the IEEE, Vol 77, No 2, p. 238-259, Feb. 1989 187/10000 · 187
26 ../../exercises/network.rst:219

	English `R1->R2->R4` and `R3->R2->R5->R4` 33/10000 · 33
26 ../../exercises/reliability.rst:52

	English the 16 bits or the 32 bits Cyclical Redundancy Checks (CRC) that are often used on disks, in zip archives and in datalink layer protocols. See http://rosettacode.org/wiki/CRC-32 for CRC-32 implementations in various languages. 226/10000 · 226

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.