2. cnp3-ebook
3. English
4. Zen

128 ../../protocols/bgp.rst:450
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The layered structure of the global Internet 44/10000 · 44
128 ../../protocols/email.rst:252
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 61 2/10000 · 2
128 ../../protocols/ipv6.rst:409
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — FDDI 4/10000 · 4
128 ../../protocols/ethernet.rst:413
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Virtual Local Area Networks in a switched Ethernet network 58/10000 · 58
128 ../../protocols/tcp.rst:366
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A good setting of the retransmission timeout clearly depends on an accurate estimation of the round-trip-time of each TCP connection. The round-trip-time differs between TCP connections, but may also change during the lifetime of a single connection. For example, the figure below shows the evolution of the round-trip-time between two hosts during a period of 45 seconds. 373/10000 · 373
129 ../../bibliography.rst:329
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Scheifler, R., Gettys, J., `X Window System: The Complete Reference to Xlib <http://h30097.www3.hp.com/docs/base_doc/DOCUMENTATION/V51B_ACRO_SUP/XWINSYS.PDF>`_, X Protocol, ICCCM, XLFD, X Version 11, Release 4, Digital Press 224/10000 · 224
129 ../../glossary.rst:92
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Open Systems Interconnection. A set of networking standards developed by :term:`ISO` including the 7 layers OSI reference model. 128/10000 · 128
129 ../../principles/dv.rst:31
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a router boots, it does not know any destination in the network and its routing table only contains its local address(es). It thus sends to all its neighbors a distance vector that contains only its address at a distance of `0`. When a router receives a distance vector on link `l`, it processes it as follows. 315/10000 · 315
129 ../../principles/reliability.rst:465 • ../../principles/reliability.rst:482
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 000 3/10000 · 3
129 ../../principles/sharing.rst:793
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Let us consider the five station network depicted in figure :ref:`fig-tokenring` above and assume that station `S1` sends a token. If we neglect the propagation delay on the inter-station links, as each station introduces a one bit delay, the first bit of the frame would return to `S1` while it sends the fifth bit of the token. If station `S1` is powered off at that time, only the first five bits of the token will travel on the ring. To avoid this problem, there is a special station called the `Monitor` on each Token Ring. To ensure that the token can travel forever on the ring, this `Monitor` inserts a delay that is equal to at least 24 bit transmission times. If station `S3` was the `Monitor` in figure :ref:`fig-tokenring`, `S1` would have been able to transmit the entire token before receiving the first bit of the token from its upstream neighbor. 862/10000 · 862
129 ../../protocols/bgp.rst:454
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The domains on the Internet can be divided in about four categories according to their role and their position in the AS-level topology. 136/10000 · 136
129 ../../protocols/email.rst:254
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 11 2/10000 · 2
129 ../../protocols/ipv6.rst:409
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 4352 bytes 10/10000 · 10
129 ../../protocols/ethernet.rst:415
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — IEEE defined in the [IEEE802.1q]_ standard a special header to encode the VLAN identifiers. This 32 bit header includes a 12 bit VLAN field that contains the VLAN identifier of each frame. The format of the [IEEE802.1q]_ header is described below. 247/10000 · 247
129 ../../protocols/tcp.rst:372
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Evolution of the round-trip-time between two hosts 50/10000 · 50
129 ../../principles/transport.rst:764
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The last scenario is less likely, but it is important to consider it as well. The remote entity receives an old `CR` segment. It notes the connection attempt and acknowledges it by sending a `CA` segment. The initiating entity does not have a matching connection attempt and replies by sending a `REJECT`. Unfortunately, this segment never reaches the remote entity. Instead, the remote entity receives a retransmission of an older `CA` segment that contains the same sequence number as the first `CR` segment. This `CA` segment cannot be accepted by the remote entity as a confirmation of the transport connection as its acknowledgment number cannot have the same value as the sequence number of the first `CA` segment. 720/10000 · 720
130 ../../bibliography.rst:330
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Stone, J., Greenwald, M., Partridge, C., and Hughes, J., `Performance of checksums and CRC's over real data <https://dx.doi.org/10.1109/90.731187>`_. IEEE/ACM Transactions Networking 6, 5 (Oct. 1998), 529-543. 209/10000 · 209
130 ../../glossary.rst:138
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — OSPF 4/10000 · 4
130 ../../principles/dv.rst:54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The router iterates over all addresses included in the distance vector. If the distance vector contains a destination address that the router does not know, it inserts it inside its routing table via link `l` and at a distance which is the sum between the distance indicated in the distance vector and the cost associated to link `l`. If the destination was already known by the router, it only updates the corresponding entry in its routing table if either : 459/10000 · 459
130 ../../principles/reliability.rst:465 • ../../principles/reliability.rst:466 • ../../principles/reliability.rst:467 • ../../principles/reliability.rst:468 • ../../principles/reliability.rst:469 • ../../principles/reliability.rst:470 • ../../principles/reliability.rst:471 • ../../principles/reliability.rst:472 • ../../principles/reliability.rst:486 • ../../principles/reliability.rst:487 • ../../principles/reliability.rst:488 • ../../principles/reliability.rst:489
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1 1/10000 · 1