2. cnp3-ebook
3. English
4. Zen

46 ../../exercises/network.rst:369
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Routes on E 11/10000 · 11
46 ../../glossary.rst:99
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ftp 3/10000 · 3
46 ../../principles/reliability.rst:213
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `framing` problem can be defined as : "`How does a sender encode frames so that the receiver can efficiently extract them from the stream of bits that it receives from the physical layer`". 193/10000 · 193
46 ../../principles/sharing.rst:254
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Dropping and marking packets is not the only possible reaction of a router that becomes congested. A router could also selectively delay packets belonging to some flows. There are different algorithms that can be used by a router to delay packets. If the objective of the router is to fairly distribute to bandwidth of an output link among competing flows, one possibility is to organize the buffers of the router as a set of queues. For simplicity, let us assume that the router is capable of supporting a fixed number of concurrent flows, say `N`. One of the queues of the router is associated to each flow and when a packet arrives, it is placed at the tail of the corresponding queue. All the queues are controlled by a `scheduler`. A `scheduler` is an algorithm that is run each time there is an opportunity to transmit a packet on the outgoing link. Various schedulers have been proposed in the scientific literature and some are used in real routers. 957/10000 · 957
46 ../../principles/transport.rst:120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The peer-to-peer model emerged during the last ten years as another possible architecture for networked applications. In the traditional client-server model, hosts act either as servers or as clients and a server serves a large number of clients. In the peer-to-peer model, all hosts act as both servers and clients and they play both roles. The peer-to-peer model has been used to develop various networked applications, ranging from Internet telephony to file sharing or Internet-wide filesystems. A detailed description of peer-to-peer applications may be found in [BYL2008]_. Surveys of peer-to-peer protocols and applications may be found in [AS2004]_ and [LCP2005]_. 672/10000 · 672
46 ../../principles/security.rst:453
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — SHA-2 is another family of cryptographic hash functions designed by the NIST. Different variants of SHA-2 can produce has values of 224, 256, 384 or 512 bits. 158/10000 · 158
46 ../../exercises/ipv6.rst:475
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``p:0002::/64`` used on the link ``B1-R5``. ``B1`` uses address ``p:0002::B1/64`` 81/10000 · 81
46 ../../exercises/routing-protocols.rst:542
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We have configured the following addresses on the hosts. 56/10000 · 56
46 ../../exercises/tcp-2.rst:642
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the round-trip-time is fixed and does not change during the lifetime of the TCP connection. We assume a fixed value of 100 milliseconds for the round-trip-time and a fixed value of 200 milliseconds for the retransmission timer. 227/10000 · 227
46 ../../protocols/bgp.rst:137
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Withdraw message` to indicate a BGP `UPDATE` message containing one route that is withdrawn 92/10000 · 92
46 ../../protocols/congestion.rst:219
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The TCP congestion control zoo 30/10000 · 30
46 ../../protocols/email.rst:220
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first computers used different techniques to represent characters in memory and on disk. During the 1960s, computers began to exchange information via tape or telephone lines. Unfortunately, each vendor had its own proprietary character set and exchanging data between computers from different vendors was often difficult. The 7 bits ASCII character table :rfc:`20` was adopted by several vendors and by many Internet protocols. However, ASCII became a problem with the internationalization of the Internet and the desire of more and more users to use character sets that support their own written language. A first attempt at solving this problem was the definition of the ISO-8859_ character sets by :term:`ISO`. This family of standards specified various character sets that allowed the representation of many European written languages by using 8 bits characters. Unfortunately, an 8-bits character set is not sufficient to support some widely used languages, such as those used in Asian countries. Fortunately, at the end of the 1980s, several computer scientists proposed to develop a standard that supports all written languages used on Earth today. The Unicode standard [Unicode]_ has now been adopted by most computer and software vendors. For example, Java always uses Unicode to manipulate characters, Python can handle both ASCII and Unicode characters. Internet applications are slowly moving towards complete support for the Unicode character sets, but moving from ASCII to Unicode is an important change that can have a huge impact on current deployed implementations. See, for example, the work to completely internationalize email :rfc:`4952` and domain names :rfc:`5890`. 1693/10000 · 1693
46 ../../protocols/ethernet.rst:180
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 40-100 Gbps 11/10000 · 11
46 ../../protocols/http.rst:170
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `User-Agent:` header provides information about the client that has generated the HTTP request. Some servers analyze this header line and return different headers and sometimes different documents for different user agents. 227/10000 · 227
46 ../../protocols/ipv6.rst:162
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the top half is divided in two smaller blocks, one for each small campus 72/10000 · 72
46 ../../protocols/ethernet.rst:172
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Thin coaxial cable, 185m 24/10000 · 24
46 ../../protocols/routing.rst:145
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — all routers update their routing table 38/10000 · 38
46 ../../protocols/tcp.rst:143
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the original TCP specification :rfc:`793`, each TCP entity maintained a clock to compute the initial sequence number (:term:`ISN`) placed in the `SYN` and `SYN+ACK` segments. This made the ISN predictable and caused a security issue. The typical security problem was the following. Consider a server that trusts a host based on its IP address and allows the system administrator to log in from this host without giving a password [#frlogin]_. Consider now an attacker who knows this particular configuration and is able to send IP packets having the client's address as source. He can send fake TCP segments to the server, but does not receive the server's answers. If he can predict the `ISN` that is chosen by the server, he can send a fake `SYN` segment and shortly after the fake `ACK` segment confirming the reception of the `SYN+ACK` segment sent by the server. Once the TCP connection is open, he can use it to send any command to the server. To counter this attack, current TCP implementations add randomness to the `ISN`. One of the solutions, proposed in :rfc:`1948` is to compute the `ISN` as :: 1109/10000 · 1109
46 ../../protocols/tls.rst:215
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the ``ServerHelloDone`` indicates that the server has sent all the messages for the first phase of the handshake. 113/10000 · 113
46 ../../protocols/wifi.rst:126
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — IEEE 802.11 RTS frame format 28/10000 · 28