2. cnp3-ebook
3. English
4. Zen

17 ../../protocols/bgp.rst:60
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The second rule ensures that the customer domain receives a route towards all destinations that are reachable via its provider. The first rule allows the prefixes of the customer domain to be distributed throughout the Internet. 228/10000 · 228
17 ../../protocols/congestion.rst:98
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Controlling congestion without losing data 42/10000 · 42
17 ../../protocols/dnssec.rst:173
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `NSEC` record is used when non-existent domain names are queried. Its usage will be explained later 103/10000 · 103
17 ../../protocols/email.rst:103
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Other header lines appear in most email messages. The `Subject:` header line allows the sender to indicate the topic discussed in the email. Three types of header lines can be used to specify the recipients of a message : 221/10000 · 221
17 ../../protocols/ethernet.rst:97
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — does not reorder the transmitted frames 39/10000 · 39
17 ../../protocols/http.rst:80
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The third part of the URI is the path to the document. This path is structured as filenames on a Unix host (but it does not imply that the files are indeed stored this way on the server). If the path is not specified, the server will return a default document. The last two optional parts of the URI are used to provide a query parameter and indicate a specific part (e.g. a section in an article) of the requested document. Sample URIs are shown below. 453/10000 · 453
17 ../../protocols/http2.rst:109
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — With `pipelining`, the client sends the five requests immediately and receives the five responses after 200 msec. The figure below illustrates the benefits of `pipelining`. 172/10000 · 172
17 ../../protocols/ipv6.rst:95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — IPv6 addresses are encoded as a 128 bits field 46/10000 · 46
17 ../../protocols/ethernet.rst:12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Ethernet was designed in the 1970s at the Palo Alto Research Center [Metcalfe1976]_. The first prototype [#fethernethistory]_ used a coaxial cable as the shared medium and 3 Mbps of bandwidth. Ethernet was improved during the late 1970s and in the 1980s, Digital Equipment, Intel and Xerox published the first official Ethernet specification [DIX]_. This specification defines several important parameters for Ethernet networks. The first decision was to standardize the commercial Ethernet at 10 Mbps. The second decision was the duration of the `slot time`. In Ethernet, a long `slot time` enables networks to span a long distance but forces the host to use a larger minimum frame size. The compromise was a `slot time` of 51.2 microseconds, which corresponds to a minimum frame size of 64 bytes. 798/10000 · 798
17 ../../protocols/routing.rst:58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A note on timers 16/10000 · 16
17 ../../protocols/rpc.rst:58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In some situations, it is necessary to encode fixed or variable length arrays. XDR :rfc:`1832` supports such arrays. For example, the encoding below corresponds to a variable length array containing n elements. The encoded representation starts with an integer that contains the number of elements and follows with all elements in sequence. It is also possible to encode a fixed-length array. In this case, the first integer (the `n` field) is missing. 452/10000 · 452
17 ../../protocols/ssh.rst:140
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the server generates the random number :math:`b`. It then computes :math:`B=g^{b} \mod p`, :math:`K=B^{a} \mod p` and signs with its private key :math:`hash(V_{Client} || V_{Server} || KEX\_INIT_{Client} || KEX\_INIT_{Server} || Server_{pub} || A || B || K )` where :math:`V_{Server}` (resp. :math:`V_{Client}`) is the initial messages sent by the client (resp. server), :math:`KEX\_INIT_{Client}` (resp. :math:`KEX\_INIT_{Server}`) is the key exchange message sent by the client (resp. server) and :math:`A`, :math:`B` and :math:`K` are the messages of the Diffie Hellman key exchange 586/10000 · 586
17 ../../protocols/tcp.rst:42
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the port chosen by the server 29/10000 · 29
17 ../../protocols/tls.rst:45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 563 3/10000 · 3
17 ../../protocols/transport-service.rst:53
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `fe80:0:0:0:219:e3ff:fed7:1204` 31/10000 · 31
17 ../../protocols/udp.rst:61
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the ephemeral port numbers ( officially [#fephemeral]_ 49152 <= port <= 65535 ) 79/10000 · 79
17 ../../protocols/wifi.rst:23
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 5 GHz 5/10000 · 5
17 ../../exercises/network.rst:114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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`? 217/10000 · 217
17 ../../exercises/reliability.rst:35
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consider a go-back-n sender and a go-back receiver that are directly connected with a 10 Mbps link that has a propagation delay of 100 milliseconds. Assume that the retransmission timer is set to three seconds. If the window has a length of 4 frames, draw a time-sequence diagram showing the transmission consisting of 10 data frames (each frame contains 10000 bits): 367/10000 · 367
17 ../../exercises/sockets.rst:139
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Operating systems allow assigning an address to a socket using the ``bind`` system call. This is useful when you want to receive messages from another program to which you announced your socket address. Once the address is assigned to the socket, the program can receive data from others using system calls such as ``recv`` and ``read``. Note that we can use the ``read`` system call as the operating system provides a socket as a file descriptor. 447/10000 · 447