2. cnp3-ebook
3. English
4. Zen

126 ../../protocols/ipv6.rst:408
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Token Ring 10/10000 · 10
126 ../../protocols/ethernet.rst:404
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another important advantage of Ethernet switches is the ability to create Virtual Local Area Networks (VLANs). A virtual LAN can be defined as a `set of ports attached to one or more Ethernet switches`. A switch can support several VLANs and it runs one MAC learning algorithm for each Virtual LAN. When a switch receives a frame with an unknown or a multicast destination, it forwards it over all the ports that belong to the same Virtual LAN but not over the ports that belong to other Virtual LANs. Similarly, when a switch learns a source address on a port, it associates it to the Virtual LAN of this port and uses this information only when forwarding frames on this Virtual LAN. 685/10000 · 685
126 ../../protocols/tcp.rst:362
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — TCP's retransmission timeout 28/10000 · 28
127 ../../glossary.rst:210
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The Network Time Protocol is defined in :rfc:`1305` 51/10000 · 51
127 ../../principles/dv.rst:15
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `R[d].time` is the timestamp of the last distance vector containing destination `d` 83/10000 · 83
127 ../../principles/reliability.rst:463
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Odd parity 10/10000 · 10
127 ../../principles/sharing.rst:784
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 802.5 token format 18/10000 · 18
127 ../../principles/transport.rst:755
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A second scenario is when the initiating entity sends a `CR` segment that does not reach the remote entity and receives a duplicate `CA` segment from a previous connection attempt. This duplicate `CA` segment cannot contain a valid acknowledgment for the `CR` segment as the sequence number of the `CR` segment was extracted from the transport clock of the initiating entity. The `CA` segment is thus rejected and the `CR` segment is retransmitted upon expiration of the retransmission timer. 492/10000 · 492
127 ../../protocols/bgp.rst:444
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Based on these studies and [ATLAS2009]_, the AS-level Internet topology can be summarized as shown in the figure below. 119/10000 · 119
127 ../../protocols/email.rst:252
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — s 1/10000 · 1
127 ../../protocols/ipv6.rst:408
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 4464 bytes 10/10000 · 10
127 ../../protocols/ethernet.rst:406
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The figure below illustrates a switched Ethernet network with three Virtual LANs. `VLAN2` and `VLAN3` only require a local configuration of switch `S1`. Host `C` can exchange frames with host `D`, but not with hosts that are outside of its VLAN. `VLAN1` is more complex as there are ports of this VLAN on several switches. To support such VLANs, local configuration is not sufficient anymore. When a switch receives a frame from another switch, it must be able to determine the VLAN in which the frame originated to use the correct MAC table to forward the frame. This is done by assigning an identifier to each Virtual LAN and placing this identifier inside the headers of the frames that are exchanged between switches. 721/10000 · 721
127 ../../protocols/tcp.rst:364
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In a go-back-n transport protocol such as TCP, the retransmission timeout must be correctly set in order to achieve good performance. On one hand, if the retransmission timeout expires too early, then bandwidth is wasted by retransmitting segments that have already been correctly received. On the other hand, if the retransmission timeout expires too late, then bandwidth is wasted because the sender is idle waiting for the expiration of its retransmission timeout. 467/10000 · 467
127 ../../bibliography.rst:327
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Subramanian, L., Agarwal, S., Rexford, J., Katz, R.. .. `Characterizing the Internet hierarchy from multiple vantage points <https://dx.doi.org/10.1109/INFCOM.2002.1019307>`_. In IEEE INFOCOM, 2002 197/10000 · 197
128 ../../bibliography.rst:328
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Sechrest, S., `An Introductory 4.4BSD Interprocess Communication Tutorial <http://docs.freebsd.org/44doc/psd/20.ipctut/paper.pdf>`_, 4.4BSD Programmer's Supplementary Documentation 180/10000 · 180
128 ../../glossary.rst:90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — OSI 3/10000 · 3
128 ../../principles/dv.rst:17
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A router that uses distance vector routing regularly sends its distance vector over all its interfaces. This distance vector is a summary of the router's routing table that indicates the distance towards each known destination. This distance vector can be computed from the routing table by using the pseudo-code below. 319/10000 · 319
128 ../../principles/reliability.rst:463
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Even parity 11/10000 · 11
128 ../../principles/sharing.rst:789
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The token is composed of three fields. First, the `Starting Delimiter` is the marker that indicates the beginning of a frame. The first Token Ring networks used Manchester coding and the `Starting Delimiter` contained both symbols representing `0` and symbols that do not represent bits. The last field is the `Ending Delimiter` which marks the end of the token. The `Access Control` field is present in all frames, and contains several flags. The most important is the `Token` bit that is set in token frames and reset in other frames. 536/10000 · 536
128 ../../principles/transport.rst:762
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Three-way handshake : recovery from a duplicate `CA` 52/10000 · 52