2. cnp3-ebook
3. English
4. Zen

38 ../../exercises/ex-sharing.rst:643
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Slotted ALOHA improves the performance of ALOHA by dividing the time in slots. However, this basic idea raises two interested questions. First how would you enforce the duration of these slots ? Second, should a slot include the time to transmit a data frame or the time to transmit a data frame and the corresponding acknowledgment ? 334/10000 · 334
38 ../../exercises/sockets.rst:292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A program can use the ``struct sockaddr_in6`` to represent IPv6 socket addresses. The following program creates a ``struct sockaddr_in6`` that identifies the program that reserved the port number ``55555`` on the computer identified by the ``::1`` IPv6 address. 261/10000 · 261
38 ../../bibliography.rst:55
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Donahoo, M., Calvert, K., `TCP/IP Sockets in C: Practical Guide for Programmers <http://books.google.com/books?id=dmt_mERzxV4C>`_ , Morgan Kaufman, 2009 152/10000 · 152
38 ../../exercises/network.rst:337
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — What are the advantages and drawbacks of flat addresses versus hierarchical addresses ? 87/10000 · 87
38 ../../glossary.rst:311
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Ethernet 8/10000 · 8
38 ../../exercises/reliability.rst:74
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — hundred frames 14/10000 · 14
38 ../../principles/referencemodels.rst:235
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Compared to the five layers reference model explained above, the :term:`OSI` reference model defined in [X200]_ is divided in seven layers. The four lower layers are similar to the four lower layers described above. The OSI reference model refined the application layer by dividing it in three layers : 302/10000 · 302
38 ../../principles/network.rst:230
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Computing forwarding tables 27/10000 · 27
38 ../../principles/reliability.rst:167
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Manchester encoding 19/10000 · 19
38 ../../principles/sharing.rst:236
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — By combining different answers to these questions, network researchers have developed different packet discard mechanisms. 122/10000 · 122
38 ../../principles/transport.rst:99
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The example above defines several terminals and two commands : `usercommand` and `passwordcommand`. The `ALPHA` terminal contains all letters in upper and lower case. In the `ALPHA` rule, `%x41` corresponds to ASCII character code 41 in hexadecimal, i.e. capital `A`. The `CR` and `LF` terminals correspond to the carriage return and linefeed control characters. The `CRLF` rule concatenates these two terminals to match the standard end of line termination. The `DIGIT` terminal contains all digits. The `SP` terminal corresponds to the white space characters. The `usercommand` is composed of two strings separated by white space. In the ABNF rules that define the messages used by Internet applications, the commands are case-insensitive. The rule `"user"` corresponds to all possible cases of the letters that compose the word between brackets, e.g. `user`, `uSeR`, `USER`, `usER`, ... A `username` contains at least one letter and up to 8 letters. User names are case-sensitive as they are not defined as a string between brackets. The `password` rule indicates that a password starts with a letter and can contain any number of letters or digits. The white space and the control characters cannot appear in a `password` defined by the above rule. 1253/10000 · 1253
38 ../../principles/security.rst:393
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Several public key encryption schemes have been proposed. Two of them have reached wide deployment : 100/10000 · 100
38 ../../exercises/ipv6.rst:384
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — on router ``R5`` 16/10000 · 16
38 ../../exercises/routing-protocols.rst:438
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``AS3`` is assigned ``2001:cafe:3::/48`` 40/10000 · 40
38 ../../exercises/tcp-2.rst:411
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The examples above have demonstrated how TCP retransmits lost segments. However, they did not consider the interactions with the congestion control scheme since the use a large initial congestion window. We now set the initial congestion window to two MSS-sized segments and use the ``tcpi_snd_cwnd`` and ``tcpi_snd_ssthresh`` variables from ``TCP_INFO`` to explore the evolution of the TCP congestion control scheme. Our first script looks at the evolution of the congestion window during a slow-start when there are no losses. This script is available from :download:`/exercises/packetdrill_scripts/slow-start.pkt`. 617/10000 · 617
38 ../../protocols/bgp.rst:125
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `NOTIFICATION` : this message is used to terminate a BGP session, usually because an error has been detected by the BGP peer. A router that sends or receives a `NOTIFICATION` message immediately shutdowns the corresponding BGP session. 235/10000 · 235
38 ../../protocols/congestion.rst:201
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :math:`area=(\frac{W}{2})^2 + \frac{1}{2} \times (\frac{W}{2})^2 = \frac{3 \times W^2}{8}` 90/10000 · 90
38 ../../protocols/email.rst:186
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The email message below, copied from :rfc:`2046` shows a MIME message containing two parts that are both in plain text and encoded using the ASCII character set. The string `simple boundary` is defined in the `Content-Type:` header as the marker for the boundary between two successive parts. Another example of MIME messages may be found in :rfc:`2046`. 354/10000 · 354
38 ../../protocols/ethernet.rst:176
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 100Base-FX 10/10000 · 10
38 ../../protocols/http.rst:158
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `Content-Length:` header is the :term:`MIME` header that indicates the length of the MIME document in bytes. 112/10000 · 112