2. cnp3-ebook
3. English
4. Zen

14 ../../glossary.rst:12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ASCII 5/10000 · 5
15 ../../exercises/ex-sharing.rst:316
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An important part of the CSMA/CD algorithm is the exponential backoff. To illustrate the operation of this algorithm, let us consider a cable that has a length of one kilometer. The bandwidth of the network is set to 10 Mbps. Assume that when a collision occurs, host A always selects the highest possible random delay according to the exponential backoff algorithm while host B always selects the shortest one. In this network, the slot time is equal to the time required to transmit 100 bits. We further assume that a host can detect collision immediately (i.e. as soon as the other frame arrives). 600/10000 · 600
15 ../../exercises/sockets.rst:133
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As the ``sendto`` function is generic, this function will work correctly independently from the fact that the peer's address is defined as a path on the computer filesystem or a network address. 194/10000 · 194
15 ../../principles/network.rst:92
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `datagram` 10/10000 · 10
15 ../../principles/referencemodels.rst:96
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Network layer 17/10000 · 17
15 ../../principles/reliability.rst:52
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1 Mbps 6/10000 · 6
15 ../../bibliography.rst:21
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Abramson, N., `THE ALOHA SYSTEM: another alternative for computer communications <http://doi.acm.org/10.1145/1478462.1478502>`_. In Proceedings of the November 17-19, 1970, Fall Joint Computer Conference (Houston, Texas, November 17 - 19, 1970). AFIPS '70 (Fall). ACM, New York, NY, 281-285. 291/10000 · 291
15 ../../exercises/network.rst:110
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Is it possible to configure the link weights so that the packets sent by the router located in `Los Angeles` to router located in `New York` follow one path while the packets sent by the router located in `New York` to the router located in `Los Angeles` follow a completely different path ? 292/10000 · 292
15 ../../exercises/reliability.rst:32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The delay between the two hosts is `s` seconds in both directions 65/10000 · 65
15 ../../glossary.rst:14
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The American Standard Code for Information Interchange (ASCII) is a character-encoding scheme that defines a binary representation for characters. The ASCII table contains both printable characters and control characters. ASCII characters were encoded in 7 bits and only contained the characters required to write text in English. Other character sets such as Unicode have been developed later to support all written languages. 427/10000 · 427
15 ../../exercises/transport.rst:132
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Practice 8/10000 · 8
15 ../../principles/sharing.rst:152
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In the above network, the allocation of all flows would grow until `A1-A2` and `B1-B2` reach 5 Mbps. At this point, link `R1-R2` becomes congested and these two flows have reached their maximum. The allocation for flow `C1-C2` can increase until reaching 15 Mbps. At this point, link `R2-R3` is congested. To increase the bandwidth allocated to `C1-C2`, one would need to reduce the allocation to flow `B1-B2`. Similarly, the only way to increase the allocation to flow `B1-B2` would require a decrease of the allocation to `A1-A2`. 532/10000 · 532
15 ../../principles/transport.rst:58 • ../../principles/transport.rst:64
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bob : `What is the secret password ?` 37/10000 · 37
15 ../../protocols/dns.rst:53
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `RDLength` field is the length of the `RData` field that contains the information of the type specified in the `Type` field. 128/10000 · 128
15 ../../principles/security.rst:198
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In practice, there is a possibility of denial of service attacks as soon as there is a limited resource somewhere in the network. This resource can be the bandwidth of a link, but it could also be the computational power of a server, its memory or even the size of tables used by a given protocol implementation. Defending against real DoS attacks can be difficult, especially if the attacker controls a large number of sources that are used to launch the attacks. In terms of bandwidth, DoS attacks composed of a few Gbps to a few tens of Gbps of traffic are frequent on the Internet. In 2015, `github.com <http://www.github.com>`_ suffered from a distributed DoS that reached a top bandwidth of 400 Gbps according to some `reports <http://www.techworld.com/news/security/worlds-largest-ddos-attack-reached-400gbps-says-arbor-networks-3595715/>`_. 848/10000 · 848
15 ../../exercises/dns.rst:48
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When run without any parameter, `dig` queries one of the root DNS servers and retrieves the list of the names of all root DNS servers. For technical reasons, there are only 13 different root DNS servers. This information is also available as a text file from http://www.internic.net/zones/named.root. What are the IPv6 addresses of all these servers? 350/10000 · 350
15 ../../exercises/http.rst:50
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Footnotes 9/10000 · 9
15 ../../exercises/ipv6.rst:45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The forwarding paths used in a network depend on the forwarding tables installed in the network nodes. Sometimes, these forwarding tables must be configured manually. 166/10000 · 166
15 ../../exercises/lan.rst:93
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Most commercial Ethernet switches are able to run the Spanning tree protocol independently on each VLAN. What are the benefits of using per-VLAN spanning trees ? 161/10000 · 161
15 ../../exercises/routing-policies.rst:153
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — How is the reachability of these addresses affected when link `R1`-`R3` fails ? 79/10000 · 79