2. cnp3-ebook
3. English
4. Zen

47 ../../protocols/tcp.rst:147
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — where `M` is the current value of the TCP clock and `H` is a cryptographic hash function. `localhost` and `remotehost` (resp. `localport` and `remoteport` ) are the IP addresses (port numbers) of the local and remote host and `secret` is a random number only known by the server. This method allows the server to use different ISNs for different clients at the same time. `Measurements <http://lcamtuf.coredump.cx/newtcp/>`_ performed with the first implementations of this technique showed that it was difficult to implement it correctly, but today's TCP implementation now generate good ISNs. 594/10000 · 594
47 ../../protocols/tls.rst:220
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — At this point, it is time to describe the TLS key exchange. TLS supports different key exchange mechanisms that can be negotiated as part of the selection of the cipher suite. We focus on two of them to highlight their differences: 231/10000 · 231
47 ../../protocols/wifi.rst:129
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The 802.11 service 18/10000 · 18
47 ../../principles/network.rst:300
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another technique called `source routing` can be used to automatically compute forwarding tables. It has been used in interconnecting Token Ring networks and in some wireless networks. Intuitively, `source routing` enables a destination to automatically discover the paths from a given source towards itself. This technique requires nodes to encode information inside some packets. For simplicity, let us assume that the `data plane` supports two types of packets : 465/10000 · 465
47 ../../principles/sharing.rst:319
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A very simple scheduler is the `round-robin scheduler`. This scheduler serves all the queues in a round-robin fashion. If all flows send packets of the same size, then the round-robin scheduler fairly allocates the bandwidth among the different flows. Otherwise, it favors flows that are using larger packets. Extensions to the `round-robin scheduler` have been proposed to provide a fair distribution of the bandwidth with variable-length packets [SV1995]_ but these are outside the scope of this chapter. 506/10000 · 506
48 ../../exercises/sockets.rst:345
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The message mentioned above will be transmitted starting from the upper 32-bits word in network byte order. The first field is encoded in 16 bits. It is followed by eight one bit flags (`A-H`), a 24 bits field whose high order byte is shown in the first line and the two low order bytes appear in the second line followed by two one byte fields. This ASCII representation is frequently used when defining binary protocols. We will use it for all the binary protocols that are discussed in this book. 499/10000 · 499
48 ../../bibliography.rst:67
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Wikipedia, `Dijkstra's algorithm <https://en.wikipedia.org/wiki/Dijkstra's_algorithm>`_ 87/10000 · 87
48 ../../exercises/network.rst:372 • ../../exercises/network.rst:373 • ../../exercises/network.rst:374 • ../../exercises/network.rst:375 • ../../exercises/network.rst:376
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 0 1/10000 · 1
48 ../../glossary.rst:190
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — FTP 3/10000 · 3
48 ../../principles/network.rst:302
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `data packets` 18/10000 · 18
48 ../../principles/reliability.rst:217
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bit rate and bandwidth 22/10000 · 22
48 ../../principles/sharing.rst:340
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Distributing the load across the network 40/10000 · 40
48 ../../principles/security.rst:469
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Cryptographic protocols 23/10000 · 23
48 ../../exercises/ipv6.rst:478
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Can you configure the forwarding tables of the six routers to achieve the following network objectives : 104/10000 · 104
48 ../../exercises/routing-protocols.rst:569
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Note that the path preferred by ``AS3`` to reach ``AS1`` is different. 70/10000 · 70
48 ../../exercises/tcp-2.rst:644
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the transmission delay for a TCP acknowledgment is negligible 61/10000 · 61
48 ../../protocols/bgp.rst:143
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — From a conceptual point of view, a BGP router connected to `N` BGP peers, can be described as being composed of four parts as shown in the figure below. 152/10000 · 152
48 ../../protocols/congestion.rst:223
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `NewReno` (:rfc:`3782`), which was proposed as an improvement of the fast recovery mechanism in the `Reno` implementation. 122/10000 · 122
48 ../../protocols/email.rst:227
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Base64` divides the sequence of bytes to be encoded into groups of three bytes (with the last group possibly being partially filled). Each group of three bytes is then divided into four six-bit fields and each six bit field is encoded as a character from the table below. 272/10000 · 272
48 ../../protocols/ethernet.rst:192 • ../../protocols/ethernet.rst:308
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Footnotes 9/10000 · 9