2. cnp3-ebook
3. English
4. Zen

32 ../../principles/referencemodels.rst:223
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the Application layer 21/10000 · 21
32 ../../principles/reliability.rst:128
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A similar reasoning applies when the clock of the sending host is slower than the clock of the receiving host. In this case, the receiver will sense more bits than the bits that have been transmitted by the sender. This is illustrated in the figure below where the second bit received on the right was not transmitted by the left host. 335/10000 · 335
32 ../../exercises/network.rst:282
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — At this point, a new link is added between `R1` and `R3`. What happens for the forwarding of packets ? 102/10000 · 102
32 ../../glossary.rst:168
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — eBGP 4/10000 · 4
32 ../../exercises/reliability.rst:62
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Implement a small software that computes the CRC-32 for a text file. Then, modify the contents of the file to change an even number of bits or an odd number of bits inside the file. When modifying the file, remember that an ASCII file is composed of 8 bits characters that are encoded by using the ASCII table that you can find at : http://en.wikipedia.org/wiki/ASCII . You can also write a small program that produces binary files that are a small variation of each other. 473/10000 · 473
32 ../../principles/sharing.rst:216
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As explained earlier, one of the first manifestation of congestion on network nodes is the saturation of the network links that leads to a growth in the occupancy of the buffers of the node. This growth of the buffer occupancy implies that some packets will spend more time in the buffer and thus in the network. If hosts measure the network delays (e.g. by measuring the round-trip-time between the transmission of a packet and the return of the corresponding acknowledgment) they could start to sense congestion. On low bandwidth links, a growth in the buffer occupancy can lead to an increase of the delays which can be easily measured by the end hosts. On high bandwidth links, a few packets inside the buffer will cause a small variation in the delay which may not necessarily be larger that the natural fluctuations of the delay measurements. 848/10000 · 848
32 ../../principles/transport.rst:85
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `carriage return` (`CR`) : `0001101b` 37/10000 · 37
32 ../../principles/security.rst:368
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a private key (:math:`K_{priv}`) that he needs to store in a secure manner and never reveal to anyone 101/10000 · 101
32 ../../exercises/dns.rst:101
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a client requests the mapping of a domain name into an IP address to its local resolver, the resolver may need to query a large number of nameservers starting from the root nameserver. The three exercises below show packet traces collected while the resolver was resolving the following names: `www.example.com`, `www.google.com` and `www.computer-networking.info`. If you understand how the DNS operates, you should be able to correctly reorder those packet traces. 471/10000 · 471
32 ../../exercises/ipv6.rst:296
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``p:24/64`` for the link between ``R2`` and ``R4``. On this subnet, ``R2`` uses address ``p:24::2`` while router ``R4`` uses address ``p:24::4`` 144/10000 · 144
32 ../../exercises/routing-protocols.rst:374
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The packet traces collected on the three routers of this example are available from :download:`/exercises/traces/ripng-r1-trace.pcap`, :download:`/exercises/traces/ripng-r2-trace.pcap` and :download:`/exercises/traces/ripng-r3-trace.pcap`. 239/10000 · 239
32 ../../exercises/tcp-2.rst:234
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A third scenario for the termination of a TCP connection is that the remote hosts sends its ``FIN`` first. This script is available from :download:`/exercises/packetdrill_scripts/remote-close.pkt`. 197/10000 · 197
32 ../../protocols/bgp.rst:106
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Simple exchange of BGP routes 29/10000 · 29
32 ../../protocols/congestion.rst:182
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If the router uses several queues served by a scheduler, the situation is different. If a large and a small flow are competing for bandwidth, the scheduler will already favor the small flow that is not using its fair share of the bandwidth. The queue for the small flow will be almost empty while the queue for the large flow will build up. On routers using such schedulers, a good way of marking the packets is to set a threshold on the occupancy of each queue and mark the packets that arrive in a particular queue as soon as its occupancy is above the configured threshold. 576/10000 · 576
32 ../../protocols/email.rst:175
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Content-Type:` header line indicates the type of data that is carried inside the message (see below). 106/10000 · 106
32 ../../protocols/ethernet.rst:173
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 10BaseT 7/10000 · 7
32 ../../protocols/http.rst:124
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a MIME document 15/10000 · 15
32 ../../protocols/http2.rst:230
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another feature of HTTP/2.0 is that it is possible to assign different priorities to different streams. A high priority stream should carry more `Data` frames than a lower priority ones. The HTTP/2.0 specification defines `Priority` frames which can be used for this purpose. 275/10000 · 275
32 ../../protocols/ipv6.rst:120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``ff01:0:0:0:0:0:0:101`` is represented as ``ff01::101`` 58/10000 · 58
32 ../../protocols/ethernet.rst:97
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — does not reorder the transmitted frames 39/10000 · 39