2. cnp3-ebook
3. English
4. Zen

35 ../../exercises/sockets.rst:290
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An IPv6 address often identifies a computer and not a program running on the computer. In order to identify a specific program running on a specific computer, we use a *port number* in addition to the IPv6 address. A program using an IPv6 socket is this identified using : 272/10000 · 272
35 ../../principles/naming.rst:148
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The official list of top-level domain names is maintained by :term:`IANA` at http://data.iana.org/TLD/tlds-alpha-by-domain.txt Additional information about these domains may be found at http://en.wikipedia.org/wiki/List_of_Internet_top-level_domains 249/10000 · 249
35 ../../principles/network.rst:223
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An alternative to manually computed forwarding tables is to use a network management platform that tracks the network status and can push new forwarding tables on the routers when it detects any modification to the network topology. This solution gives some flexibility to the network managers in computing the paths inside their network. However, this solution only works if the network management platform is always capable of reaching all routers even when the network topology changes. This may require a dedicated network that allows the management platform to push information on the forwarding tables. Openflow is a modern example of such solutions [MAB2008]_. In a nutshell, Openflow is a protocol that enables a network controller to install specific entries in the forwarding tables of remote routers and much more. 825/10000 · 825
35 ../../bibliography.rst:50
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Clark D., `The Design Philosophy of the DARPA Internet Protocols <https://dx.doi.org/10.1145/205447.205458>`_, Computer Communications Review 18:4, August 1988, pp. 106-114 172/10000 · 172
35 ../../exercises/network.rst:332
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Would this network work correctly with port-forwarding tables if : 66/10000 · 66
35 ../../glossary.rst:149
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Exterior Gateway Protocol. Synonym of interdomain routing protocol 66/10000 · 66
35 ../../exercises/reliability.rst:70
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Consider two high-end servers connected back-to-back by using a 10 Gbps interface. If the delay between the two servers is one millisecond, what is the throughput that can be achieved by a reliable protocol that is using 10,000 bits frames and a window of 255/10000 · 255
35 ../../principles/referencemodels.rst:226
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the Link layer which combines the functions of the physical and datalink layers of our five-layer reference model 113/10000 · 113
35 ../../principles/reliability.rst:153
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `Physical layer service` may deliver `more` bits to the receiver than the bits sent by the sender 101/10000 · 101
35 ../../principles/sharing.rst:230
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Discarding packets is one of the signals that the network nodes can use to inform the hosts of the current level of congestion. Buffers on network nodes are usually used as FIFO queues to preserve packet ordering. Several `packet discard mechanisms` have been proposed for network nodes. These techniques basically answer two different questions : 347/10000 · 347
35 ../../principles/transport.rst:89
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The :term:`ASCII` characters are encoded as a seven bits field, but transmitted as an eight-bits byte whose high order bit is usually set to `0`. Bytes are always transmitted starting from the high order or most significant bit. 228/10000 · 228
35 ../../exercises/dns.rst:115
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — You may obtain additional information about the root DNS servers from http://www.root-servers.org 97/10000 · 97
35 ../../exercises/ipv6.rst:332
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — on router ``R1`` 16/10000 · 16
35 ../../exercises/routing-protocols.rst:434
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As in the previous examples, we create the routers and associate one IPv6 prefix to each AS: 92/10000 · 92
35 ../../exercises/tcp-2.rst:293
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We can use a similar code to demonstrate that the TCP stack performs a fast retransmit after having received three duplicate acknowledgments. This script is available from :download:`/exercises/packetdrill_scripts/frr.pkt`. 223/10000 · 223
35 ../../protocols/bgp.rst:118
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In practice, to establish a BGP session between routers `R1` and `R2` in the figure above, the network administrator of `AS3` must first configure on `R1` the IP address of `R2` on the `R1-R2` link and the AS number of `R2`. Router `R1` then regularly tries to establish the BGP session with `R2`. `R2` only agrees to establish the BGP session with `R1` once it has been configured with the IP address of `R1` and its AS number. For security reasons, a router never establishes a BGP session that has not been manually configured on the router. 544/10000 · 544
35 ../../protocols/email.rst:180
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Content-Type: multipart/mixed`. This header line indicates that the MIME message contains several independent parts. For example, such a message may contain a part in plain text and a binary file. 197/10000 · 197
35 ../../protocols/ethernet.rst:174
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 10 Mb/s over optical fiber 26/10000 · 26
35 ../../protocols/http.rst:152
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `HEAD` method is a variant of the `GET` method that allows the retrieval of the header lines for a given URI without retrieving the entire document. It can be used by a client to verify if a document exists, for instance. 225/10000 · 225
35 ../../protocols/http2.rst:237
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Detecting whether a server supports HTTP/2.0 44/10000 · 44