2. cnp3-ebook
3. English
4. Zen

72 ../../principles/transport.rst:267
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The establishment of a connection can be modeled by using four primitives : `Connect.request`, `Connect.indication`, `Connect.response` and `Connect.confirm`. The `Connect.request` primitive is used to request the establishment of a connection. The main parameter of this primitive is the `address` of the destination user. The service provider delivers a `Connect.indication` primitive to inform the destination user of the connection attempt. If it accepts to establish a connection, it responds with a `Connect.response` primitive. At this point, the connection is considered to be established and the destination user can start sending SDUs over the connection. The service provider processes the `Connect.response` and will deliver a `Connect.confirm` to the user who initiated the connection. The delivery of this primitive terminates the connection establishment phase. At this point, the connection is considered to be open and both users can send SDUs. A successful connection establishment is illustrated below. 1021/10000 · 1021
72 ../../principles/security.rst:853
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Then, knowing Ted's public key, anyone can verify the validity of a certificate. When a user sends his/her public key, he/she must also attach the certificate to prove the link between his/her identity and the public key. In practice, certificates are more complex than this. Certificates will often be used to authenticate the server and sometimes to authenticate the client. 376/10000 · 376
72 ../../exercises/ipv6.rst:656
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We start by creating the objects that correspond to the static routes on the three routers. The second argument of the ``addDaemon`` method is a list of ``StaticRoute`` objects. Each of these objects is created by specifying an IP prefix and a nexthop. 252/10000 · 252
72 ../../exercises/routing-protocols.rst:993
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Our first example is a small Internet with 5 ASes. A subset of the script that configures this network is shown below. There is one host attached to each AS and this host has the same number as its AS. The entire script is available from :download:`/exercises/ipmininet_scripts/ebgp-bug.py`. 291/10000 · 291
72 ../../protocols/bgp.rst:291
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Origin of the routes advertised by a BGP router 47/10000 · 47
72 ../../protocols/email.rst:236
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 53 2/10000 · 2
72 ../../protocols/ethernet.rst:329
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Switches running the `Spanning Tree Protocol` exchange `BPDUs`. These `BPDUs` are always sent as frames with destination MAC address as the `ALL_BRIDGES` reserved multicast MAC address. Each switch has a unique 64 bit `identifier`. To ensure uniqueness, the lower 48 bits of the identifier are set to the unique MAC address allocated to the switch by its manufacturer. The high order 16 bits of the switch identifier can be configured by the network administrator to influence the topology of the spanning tree. The default value for these high order bits is 32768. 565/10000 · 565
72 ../../protocols/http.rst:383
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As illustrated above, a client can send several HTTP requests over the same persistent TCP connection. However, it is important to note that all of these HTTP requests are considered to be independent by the server. Each HTTP request must be self-contained. This implies that each request must include all the header lines that are required by the server to understand the request. The independence of these requests is one of the key design choices of HTTP. As a consequence of this design choice, when a server processes a HTTP request, it does not use any other information than what is contained in the request itself. This explains why the client adds its `User-Agent:` header in all of the HTTP requests that it sends over the persistent TCP connection. 759/10000 · 759
72 ../../protocols/ipv6.rst:259
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — All IPv6 hosts have several addresses 37/10000 · 37
72 ../../protocols/ethernet.rst:255
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Operation of Ethernet switches 30/10000 · 30
72 ../../protocols/tcp.rst:233
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The robustness principle 24/10000 · 24
72 ../../protocols/tls.rst:385
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Measurement studies that analyzed the evolution of TLS over the years have identified several important changes in the TLS ecosystem [KRA2018]_. First, the preferred cryptographic algorithms have changed. While RC4 was used by 60% of the connections in 2012, its usage has dropped since 2015. AEA started to be deployed in 2013 and is now used for more than 90% of the connections. The deployed versions of TLS have also changed. TLS 1.0 and TLS 1.1 are now rarely used. The deployment of TLS 1.2 started in 2013 and reached 70% of the connections in 2015. Version 1.3 of TLS, that is described below, is also widely deployed. 626/10000 · 626
72 ../../bibliography.rst:95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Ha, S., Rhee, I., and Xu, L., `CUBIC: a new TCP-friendly high-speed TCP variant <http://doi.acm.org/10.1145/1400097.1400105>`_. SIGOPS Operating Systems Review 42, 5 (Jul. 2008), 64-74. 185/10000 · 185
72 ../../principles/sharing.rst:456
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The pseudo-code below shows the operation of an ALOHANet terminal. We use this python syntax for all Medium Access Control algorithms described in this chapter. The algorithm is applied to each new frame that needs to be transmitted. It attempts to transmit a frame at most `max` times (`while loop`). Each transmission attempt is performed as follows. First, the frame is sent. Each frame is protected by a timeout. Then, the terminal waits for either a valid acknowledgment frame or the expiration of its timeout. If the terminal receives an acknowledgment, the frame has been delivered correctly and the algorithm terminates. Otherwise, the terminal waits for a random time and attempts to retransmit the frame. 714/10000 · 714
73 ../../glossary.rst:68
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a public internet, i.e. a network composed of different networks that are running :term:`IPv4` or :term:`IPv6` 110/10000 · 110
73 ../../principles/network.rst:423
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — These three solutions have advantages and drawbacks. With the first solution, routers remain simple and do not need to perform any fragmentation operation. This is important when routers are implemented mainly in hardware. However, hosts must be complex since they need to store the packets that they produce if they need to pass through a link that does not support large packets. This increases the buffering required on the hosts. 433/10000 · 433
73 ../../principles/reliability.rst:258
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `CR` : `0001101` b 18/10000 · 18
73 ../../principles/sharing.rst:475
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — [Abramson1970]_ analyzed the performance of ALOHANet under particular assumptions and found that ALOHANet worked well when the channel was lightly loaded. In this case, the frames are rarely retransmitted and the `channel traffic`, i.e. the total number of (correct and retransmitted) frames transmitted per unit of time is close to the `channel utilization`, i.e. the number of correctly transmitted frames per unit of time. Unfortunately, the analysis also reveals that the `channel utilization` reaches its maximum at :math:`\frac{1}{2 \times e}=0.186` times the channel bandwidth. At higher utilization, ALOHANet becomes unstable and the network collapses due to collided retransmissions. 692/10000 · 692
73 ../../principles/transport.rst:288
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The example above shows a successful connection establishment. However, in practice not all connections are successfully established. One reason is that the destination user may not agree, for policy or performance reasons, to establish a connection with the initiating user at this time. In this case, the destination user responds to the `Connect.indication` primitive by a `Disconnect.request` primitive that contains a parameter to indicate why the connection has been refused. The service provider will then deliver a `Disconnect.indication` primitive to inform the initiating user. 587/10000 · 587
73 ../../principles/security.rst:860
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A possible protocol could then be the following. Alice sends :math:`Cert(Alice_{pub},Ted)`. Bob replies with a random nonce. 124/10000 · 124