2. cnp3-ebook
3. English
4. Zen

112 ../../protocols/tcp.rst:334
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 524 Mbps 8/10000 · 8
112 ../../principles/network.rst:533
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — R1's label forwarding table 27/10000 · 27
112 ../../bibliography.rst:148
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Nelson, T. H., `Complex information processing: a file structure for the complex, the changing and the indeterminate <http://doi.acm.org/10.1145/800197.806036>`_. In Proceedings of the 1965 20th National Conference (Cleveland, Ohio, United States, August 24 - 26, 1965). L. Winner, Ed. ACM '65. ACM, New York, NY, 84-100. 321/10000 · 321
113 ../../glossary.rst:122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A TCP option used by a TCP entity in SYN segments to indicate the Maximum Segment Size that it is able to receive. 114/10000 · 114
113 ../../principles/network.rst:537 • ../../principles/network.rst:539
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ->R3 4/10000 · 4
113 ../../principles/reliability.rst:438
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — random bit creations and random bit removals where bits have been added or removed due to transmission errors 109/10000 · 109
113 ../../principles/sharing.rst:725
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Another problem faced by wireless networks is often called the `hidden station problem`. In a wireless network, radio signals are not always propagated same way in all directions. For example, two devices separated by a wall may not be able to receive each other's signal while they could both be receiving the signal produced by a third host. This is illustrated in the figure below, but it can happen in other environments. For example, two devices that are on different sides of a hill may not be able to receive each other's signal while they are both able to receive the signal sent by a station at the top of the hill. Furthermore, the radio propagation conditions may change with time. For example, a truck may temporarily block the communication between two nearby devices. 781/10000 · 781
113 ../../principles/transport.rst:715
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `transport clock` is implemented as a `k` bits counter and its clock cycle is such that :math:`2^k \times cycle >> MSL`. Furthermore, the `transport clock` counter is incremented every clock cycle and after each connection establishment. This clock is illustrated in the figure below. 288/10000 · 288
113 ../../protocols/bgp.rst:421
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `AS1` sends `U(p, AS1:AS0)` to `AS3` and `AS4`. `AS4` selects the path via `AS1` since this is its preferred path. `AS3` still uses the direct path. 148/10000 · 148
113 ../../protocols/email.rst:248
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — q 1/10000 · 1
113 ../../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
113 ../../protocols/ipv6.rst:391
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Destinations Option` header uses the same format as the `Hop-by-Hop Options` header. It has some usages, e.g. to support mobile nodes :rfc:`6275`, but these are outside the scope of this document. 201/10000 · 201
113 ../../protocols/ethernet.rst:373
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Handles data frames 19/10000 · 19
113 ../../protocols/tcp.rst:335 • ../../protocols/tcp.rst:348
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 10 msec 7/10000 · 7
113 ../../bibliography.rst:150
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Nygren E, Sitaraman RK, Sun J., `The Akamai network: a platform for high-performance Internet applications <https://doi.org/10.1145/1842733.1842736>`_. ACM SIGOPS Operating Systems Review. 2010 Aug 17;44(3):2-19. 212/10000 · 212
114 ../../glossary.rst:21
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — multicast 9/10000 · 9
114 ../../principles/network.rst:542
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The figure below shows the path followed by the packets on the `R1->R3->R4->R2->R5` path in red with on each arrow the label used in the packets. 145/10000 · 145
114 ../../principles/reliability.rst:440
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The only solution to protect against transmission errors is to add redundancy to the frames that are sent. `Information Theory` defines two mechanisms that can be used to transmit information over a transmission channel affected by random errors. These two mechanisms add redundancy to the transmitted information, to allow the receiver to detect or sometimes even correct transmission errors. A detailed discussion of these mechanisms is outside the scope of this chapter, but it is useful to consider a simple mechanism to understand its operation and its limitations. 570/10000 · 570
114 ../../principles/sharing.rst:732
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The hidden station problem 26/10000 · 26
114 ../../principles/transport.rst:716
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the `transport clock` must continue to be incremented even if the transport entity stops or reboots 99/10000 · 99