2. cnp3-ebook
3. English
4. Zen

119 ../../principles/reliability.rst:449
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Some coding schemes allow the receiver to correct some transmission errors. For example, consider the coding scheme that encodes each source bit as follows : 157/10000 · 157
119 ../../principles/sharing.rst:752
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — During the 1970s and 1980s, there were huge debates in the networking community about the best suited Medium Access Control algorithms for Local Area Networks. The optimistic algorithms that we have described until now were relatively easy to implement when they were designed. From a performance perspective, mathematical models and simulations showed the ability of these optimistic techniques to sustain load. However, none of the optimistic techniques are able to guarantee that a frame will be delivered within a given delay bound and some applications require predictable transmission delays. The deterministic MAC algorithms were considered by a fraction of the networking community as the best solution to fulfill the needs of Local Area Networks. 755/10000 · 755
119 ../../principles/transport.rst:731
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The remote transport entity processes the `CR` segment and creates state for the connection attempt. At this stage, the remote entity does not yet know whether this is a new connection attempt or a duplicate segment. It returns a `CA` segment that contains an acknowledgment number to confirm the reception of the `CR` segment (`ack=x` in the figure below) and a sequence number (`seq=y` in the figure below) whose value is extracted from its transport clock. At this stage, the connection is not yet established. 513/10000 · 513
119 ../../protocols/bgp.rst:428
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This example shows that the convergence of BGP is unfortunately not always guaranteed as some interdomain routing policies may interfere with each other in complex ways. [GW1999]_ have shown that checking for global convergence is either NP-complete or NP-hard. See [GSW2002]_ for a more detailed discussion. 308/10000 · 308
119 ../../protocols/email.rst:250
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 43 2/10000 · 2
119 ../../protocols/ipv6.rst:404
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1500 bytes 10/10000 · 10
119 ../../protocols/ethernet.rst:382
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To illustrate the operation of the `Spanning Tree Protocol`, let us consider the simple network topology in the figure below. 125/10000 · 125
119 ../../protocols/tcp.rst:340
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To solve this problem, a backward compatible extension that allows TCP to use larger receive windows was proposed in :rfc:`1323`. Today, most TCP implementations support this option. The basic idea is that instead of storing `snd.wnd` and `rcv.wnd` as 16 bits integers in the :term:`TCB`, they should be stored as 32 bits integers. As the TCP segment header only contains 16 bits to place the window field, it is impossible to copy the value of `snd.wnd` in each sent TCP segment. Instead the header contains `snd.wnd >> S` where `S` is the scaling factor ( :math:`0 \le S \le 14`) negotiated during connection establishment. The client adds its proposed scaling factor as a TCP option in the `SYN` segment. If the server supports :rfc:`1323`, it places in the `SYN+ACK` segment the scaling factor that it uses when advertising its own receive window. The local and remote scaling factors are included in the :term:`TCB`. If the server does not support :rfc:`1323`, it ignores the received option and no scaling is applied. 1023/10000 · 1023
119 ../../bibliography.rst:158
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Rescorla, E., `Stanford Seminar - The TLS 1.3 protocol <https://www.youtube.com/watch?v=grRi-aFrbSE>`_, Nov. 2015 113/10000 · 113
120 ../../glossary.rst:296
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — NBMA 4/10000 · 4
120 ../../principles/network.rst:608
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — One of the objectives of the `control plane` in the network layer is to maintain the routing tables that are used on all routers. As indicated earlier, a routing table is a data structure that contains, for each destination address (or block of addresses) known by the router, the outgoing interface over which the router must forward a packet destined to this address. The routing table may also contain additional information such as the address of the next router on the path towards the destination or an estimation of the cost of this path. 545/10000 · 545
120 ../../principles/reliability.rst:451
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `1` is encoded as `111` 23/10000 · 23
120 ../../principles/transport.rst:733
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The initiating entity receives the `CA` segment. The acknowledgment number of this segment confirms that the remote entity has correctly received the `CR` segment. The transport connection is considered to be established by the initiating entity and the numbering of the data segments starts at sequence number `x`. Before sending data segments, the initiating entity must acknowledge the received `CA` segments by sending another `CA` segment. 444/10000 · 444
120 ../../protocols/bgp.rst:430
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fortunately, there are some operational guidelines [GR2001]_ [GGR2001]_ that can guarantee BGP convergence in the global Internet. To ensure that BGP will converge, these guidelines consider that there are two types of peering relationships : `customer->provider` and `shared-cost`. In this case, BGP convergence is guaranteed provided that the following conditions are fulfilled : 381/10000 · 381
120 ../../protocols/email.rst:250
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — r 1/10000 · 1
120 ../../protocols/ipv6.rst:405
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — WiFi 4/10000 · 4
120 ../../protocols/ethernet.rst:389
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A simple Spanning tree computed in a switched Ethernet network 62/10000 · 62
120 ../../protocols/tcp.rst:342
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — By using the window scaling extensions defined in :rfc:`1323`, TCP implementations can use a receive buffer of up to 1 GByte. With such a receive buffer, the maximum throughput that can be achieved by a single TCP connection becomes : 234/10000 · 234
120 ../../bibliography.rst:318
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Ristic, I., `Bulletproof SSL and TLS: Understanding and Deploying SSL/TLS and PKI to Secure Web Servers and Applications <https://books.google.be/books?id=fQOLBAAAQBAJ>`_, Feisty Duck, 2015 189/10000 · 189
120 ../../principles/sharing.rst:754
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Both the proponents of the deterministic and the opportunistic techniques lobbied to develop standards for Local Area networks that would incorporate their solution. Instead of trying to find an impossible compromise between these diverging views, the IEEE 802 committee that was chartered to develop Local Area Network standards chose to work in parallel on three different LAN technologies and created three working groups. The `IEEE 802.3 working group <http://www.ieee802.org/3/>`_ became responsible for CSMA/CD. The proponents of deterministic MAC algorithms agreed on the basic principle of exchanging special frames called tokens between devices to regulate the access to the transmission medium. However, they did not agree on the most suitable physical layout for the network. IBM argued in favor of Ring-shaped networks while the manufacturing industry, led by General Motors, argued in favor of a bus-shaped network. This led to the creation of the `IEEE 802.4 working group <http://www.ieee802.org/4/>`_ to standardize Token Bus networks and the `IEEE 802.5 working group <http://www.ieee802.org/5/>`_ to standardize Token Ring networks. Although these techniques are not widely used anymore today, the principles behind a token-based protocol are still important. 1277/10000 · 1277