2. cnp3-ebook
3. English
4. Zen

108 ../../principles/network.rst:518
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Two virtual circuits pass through `R3`. They both need to be forwarded to `R4`, but `R4` expects `label=1` for packets belonging to the virtual circuit originated by `R2` and `label=0` for packets belonging to the other virtual circuit. `R3` could choose to leave the labels unchanged. 285/10000 · 285
108 ../../principles/reliability.rst:429
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Frames can be lost or unexpected frames can appear 50/10000 · 50
108 ../../principles/sharing.rst:674
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The main difficulty with CSMA/CA is when two or more devices transmit at the same time and cause collisions. This is illustrated in the figure below, assuming a fixed timeout after the transmission of a data frame. With CSMA/CA, the timeout after the transmission of a data frame is very small, since it corresponds to the SIFS plus the time required to transmit the acknowledgment frame. 388/10000 · 388
108 ../../principles/security.rst:1019
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A detailed explanation of the operation of the RSA algorithm is outside the scope of this e-book. Various tutorials such as the `RSA page <https://en.wikipedia.org/wiki/RSA_(cryptosystem)>`_ on wikipedia provide examples and tutorial information. 246/10000 · 246
108 ../../protocols/bgp.rst:413
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In this internetwork, there are four ASes. `AS0` advertises one route towards one prefix and we only analyze the routes towards this prefix. The routing preferences of `AS1`, `AS3` and `AS4` are the following : 210/10000 · 210
108 ../../protocols/email.rst:248 • ../../protocols/email.rst:250
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 8 1/10000 · 1
108 ../../protocols/ethernet.rst:393
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assume now that `Switch9` boots and immediately receives `Switch1` 's `BPDU` on port 1. `Switch9` computes its own `BPDU = <1,1,9,1>` (resp. `BPDU = <1,1,9,2>`) on port 1 (resp. port 2) and port 1 becomes the `Root` port of this switch. The `BPDU` is sent on port 2 of `Switch9` and reaches `Switch4`. `Switch4` compares the priority vectors. It notices that the last computed vector (i.e., `V[2] = <1,2,9,2,2>`) is better than `V[1] = <1,3,1,1,1>`. Thus, `Switch4`'s `BPDU` is recomputed and port 2 becomes the `Root` port of `Switch4`. `Switch4` compares its new `BPDU = <1,2,4,p>` with the last `BPDU` received on each port (except for the `Root` port). Port 1 becomes a `Blocked` port on `Switch4` because the `BPDU=<1,0,1,1>` received on this port is better. 763/10000 · 763
108 ../../protocols/ipv6.rst:380
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``00`` : if a node does not recognize this header, it can be safely skipped and the processing continues with the subsequent header 132/10000 · 132
108 ../../protocols/ethernet.rst:368
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To determine the state of its other ports, the switch compares its own `BPDU` with the last `BPDU` received on each port. Note that the comparison is done by using the `BPDUs` and not the `root priority vectors`. If the switch's `BPDU` is better than the last `BPDU` of this port, the port becomes a `Designated` port. Otherwise, the port becomes a `Blocked` port. 364/10000 · 364
108 ../../protocols/tcp.rst:329
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — From a performance point of view, one of the main limitations of the original TCP specification is the 16 bits `window` field in the TCP header. As this field indicates the current size of the receive window in bytes, it limits the TCP receive window at 65535 bytes. This limitation was not a severe problem when TCP was designed since at that time high-speed wide area networks offered a maximum bandwidth of 56 kbps. However, in today's network, this limitation is not acceptable anymore. The table below provides the rough [#faveragebandwidth]_ maximum throughput that can be achieved by a TCP connection with a 64 KBytes window in function of the connection's round-trip-time 679/10000 · 679
108 ../../bibliography.rst:144
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Modadugu, N. and Rescorla, E., 2004, February. `The Design and Implementation of Datagram TLS <https://www.ndss-symposium.org/wp-content/uploads/2017/09/Modadugu.pdf>`_. In NDSS. 178/10000 · 178
108 ../../principles/transport.rst:644
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The simplest approach to establish a transport connection would be to define two special control segments : `CR` (Connection Request) and `CA` (Connection Acknowledgment). The `CR` segment is sent by the transport entity that wishes to initiate a connection. If the remote entity wishes to accept the connection, it replies by sending a `CA` segment. The `CR` and `CA` segments contain `port numbers` that allow identifying the communicating applications. The transport connection is considered to be established once the `CA` segment has been received. At that point, data segments can be sent in both directions. 614/10000 · 614
109 ../../glossary.rst:261
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A minicomputer is a multi-user system that was typically used in the 1960s/1970s to serve departments. See the corresponding Wikipedia article for additional information : https://en.wikipedia.org/wiki/Minicomputer 214/10000 · 214
109 ../../principles/sharing.rst:680
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Collisions with CSMA/CA 23/10000 · 23
109 ../../principles/security.rst:1024
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A detailed explanation of the ECC cryptosystems is outside the scope of this e-book. A simple introduction may be found on `Andrea Corbellini's blog <http://andrea.corbellini.name/2015/05/17/elliptic-curve-cryptography-a-gentle-introduction/>`_. There have been deployments of ECC recently because ECC schemes usually require shorter keys than RSA and consume less CPU. 369/10000 · 369
109 ../../protocols/bgp.rst:415
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `AS1` prefers the path `AS3:AS0` over all other paths 53/10000 · 53
109 ../../protocols/email.rst:248
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — I 1/10000 · 1
109 ../../protocols/ethernet.rst:395
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — During the computation of the spanning tree, switches discard all received data frames, as at that time the network topology is not guaranteed to be loop-free. Once that topology has been stable for some time, the switches again start to use the MAC learning algorithm to forward data frames. Only the `Root` and `Designated` ports are used to forward data frames. Switches discard all the data frames received on their `Blocked` ports and never forward frames on these ports. 476/10000 · 476
109 ../../protocols/ipv6.rst:381
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``01`` : if a node does not recognize this header, the packet must be discarded 79/10000 · 79
109 ../../protocols/ethernet.rst:370
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The state of each port is important when considering the transmission of `BPDUs`. The root switch regularly sends its own `BPDU` over all of its (`Designated`) ports. This `BPDU` is received on the `Root` port of all the switches that are directly connected to the `root switch`. Each of these switches computes its own `BPDU` and sends this `BPDU` over all its `Designated` ports. These `BPDUs` are then received on the `Root` port of downstream switches, which then compute their own `BPDU`, etc. When the network topology is stable, switches send their own `BPDU` on all their `Designated` ports, once they receive a `BPDU` on their `Root` port. No `BPDU` is sent on a `Blocked` port. Switches listen for `BPDUs` on their `Blocked` and `Designated` ports, but no `BPDU` should be received over these ports when the topology is stable. The utilization of the ports for both `BPDUs` and data frames is summarized in the table below. 933/10000 · 933