2. cnp3-ebook
3. English
4. Zen

19 ../../protocols/rpc.rst:67
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A second popular method to encode data is the JavaScript Object Notation (JSON). This syntax was initially defined to allow applications written in JavaScript to exchange data, but it has now wider usages. JSON :rfc:`4627` is a text-based representation. The simplest data type is the integer. It is represented as a sequence of digits in ASCII. Strings can also be encoding by using JSON. A JSON string always starts and ends with a quote character (`"`) as in the C language. As in the C language, some characters (like `"` or `\\`) must be escaped if they appear in a string. :rfc:`4627` describes this in details. Booleans are also supported by using the strings `false` and `true`. Like XDR, JSON supports more complex data types. A structure or object is defined as a comma separated list of elements enclosed in curly brackets. :rfc:`4627` provides the following example as an illustration. 897/10000 · 897
19 ../../protocols/ssh.rst:151
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This is a slightly modified authenticated Diffie Hellman key exchange with two interesting points. The first point is that when the server authenticates the key exchange it does not provide a certificate. This is because ``ssh`` assumes that the client will store inside its cache the public key of the servers that it uses on a regular basis. This assumption is valid for a protocol like ``ssh`` because users typically use it to interact with a small number of servers, typically a few or a few tens. Storing this information does not require a lot of storage. In practice, most ``ssh`` clients will accept to connect to remote servers without knowing their public key before the connection. In this case, the client issues a warning to the user who can decide to accept or reject the key. This warning can be associated with a fingerprint of the key, either as a sequence of letters or as an ASCII art which can be posted on the web or elsewhere [#fdnsssh]_ by the system administrator of the server. If a client connects to a server whose public key does not match the stored one, a stronger warning is issued because this could indicate a man-in-the-middle attack or that the remote server has been compromised. It can also indicate that the server has been upgraded and that a new key has been generated during this upgrade. 1330/10000 · 1330
19 ../../protocols/tcp.rst:45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `Urgent pointer` is used to indicate that some data should be considered as urgent in a TCP bytestream. However, it is rarely used in practice and will not be described here. Additional details about the utilization of this pointer may be found in :rfc:`793`, :rfc:`1122` or [Stevens1994]_ 293/10000 · 293
19 ../../protocols/tls.rst:46
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 80 2/10000 · 2
19 ../../protocols/transport-service.rst:58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `2001:db8:0:0:8:800:200c:417a` is represented as `2001:db8::8:800:200c:417a` 77/10000 · 77
19 ../../protocols/udp.rst:64
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In most Unix variants, only processes having system administrator privileges can be bound to port numbers smaller than `1024`. Well-known servers such as :term:`DNS`, :term:`NTP` or :term:`RPC` use privileged port numbers. When a client needs to use UDP, it usually does not require a specific port number. In this case, the UDP implementation will allocate the first available port number in the ephemeral range. The range of registered port numbers should be used by servers. In theory, developers of network servers should register their port number officially through IANA [#fportnum]_, but few developers do this. 618/10000 · 618
19 ../../protocols/wifi.rst:23 • ../../protocols/wifi.rst:25
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 54 Mbps 7/10000 · 7
19 ../../exercises/reliability.rst:38
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — when the third and seventh frames are lost 42/10000 · 42
19 ../../principles/referencemodels.rst:135
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — There are different types of transport layers. The most widely used transport layers on the Internet are :term:`TCP`, that provides a reliable connection-oriented bytestream transport service, and :term:`UDP`, that provides an unreliable connection-less transport service. 272/10000 · 272
19 ../../bibliography.rst:27
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bhatia, M., Manral, V., Ohara, Y., `IS-IS and OSPF Difference Discussions <http://tools.ietf.org/html/draft-bhatia-manral-diff-isis-ospf-01>`_, work in progress, Internet draft, Jan. 2006 187/10000 · 187
20 ../../exercises/ex-sharing.rst:432
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In practice, a router is connected to multiple input links. The figure below shows an example with two hosts. 109/10000 · 109
20 ../../principles/naming.rst:114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To retrieve the mapping for host `h2.dom`, a client sends its query to the name server that is responsible for domain `.dom`. The name server directly answers the query. To retrieve a mapping for `h3.a.sdom1.dom` a DNS client first sends a query to the name server that is responsible for the `.dom` domain. This nameserver returns the nameserver that is responsible for the `sdom1.dom` domain. This nameserver can now be contacted to obtain the nameserver that is responsible for the `a.sdom1.dom` domain. This nameserver can be contacted to retrieve the mapping for the `h3.a.sdom1.dom` name. Thanks to this structure, it is possible for a DNS client to obtain the mapping of any host inside the `.dom` domain or any of its subdomains. To ensure that any DNS client will be able to resolve any fully qualified domain name, there are special nameservers that are responsible for the root of the domain name hierarchy. These nameservers are called :term:`root nameserver`. 972/10000 · 972
20 ../../principles/network.rst:102
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — its own network layer address 29/10000 · 29
20 ../../principles/referencemodels.rst:164
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Application layer 21/10000 · 21
20 ../../principles/reliability.rst:54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :math:`10^{12}` 15/10000 · 15
20 ../../bibliography.rst:29
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Beech, W., Nielsen, D., Taylor, J., `AX.25 Link Access Protocol for Amateur Packet Radio <http://www.tapr.org/pdf/AX25.2.2.pdf>`_, version 2.2, Revision: July 1998 164/10000 · 164
20 ../../exercises/network.rst:161
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assuming that the network uses source routing, what are the possible paths from `R1` to `R4` ? 94/10000 · 94
20 ../../exercises/reliability.rst:39
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — when every second acknowledgment is discarded due to transmission errors 72/10000 · 72
20 ../../glossary.rst:153
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — BGP 3/10000 · 3
20 ../../exercises/transport.rst:147
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — DATA segments contain a sequence number that is incremented for each byte transmitted 85/10000 · 85