2. cnp3-ebook
3. English
4. Zen

102 ../../protocols/email.rst:246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — H 1/10000 · 1
102 ../../protocols/ethernet.rst:375 • ../../protocols/ethernet.rst:375 • ../../protocols/ethernet.rst:376
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — no 2/10000 · 2
102 ../../protocols/ipv6.rst:366
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Authentication` header. This option is processed only by hosts. 64/10000 · 64
102 ../../protocols/ethernet.rst:358
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 2000 4/10000 · 4
102 ../../protocols/tcp.rst:303
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first rule ensures that a TCP connection used for bulk data transfer always sends full TCP segments. The second rule sends one partially filled TCP segment every round-trip-time. 182/10000 · 182
102 ../../principles/network.rst:494
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To create these virtual circuits, we need to configure the `label forwarding tables` of all routers. For simplicity, assume that a label forwarding table only contains two entries. Assume that `R5` wants to receive the packets from the virtual circuit created by `R1` (resp. `R2`) with `label=1` (`label=0`). `R4` could use the following `label forwarding table`: 363/10000 · 363
102 ../../bibliography.rst:135
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Mathis, M., Semke, J., Mahdavi, J., and Ott, T. 1997. `The macroscopic behavior of the TCP congestion avoidance algorithm <http://doi.acm.org/10.1145/263932.264023>`_. SIGCOMM Computer Communication Review 27, 3 (Jul. 1997), 67-82. 231/10000 · 231
102 ../../principles/transport.rst:613
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Compared to the connectionless network layer service, the transport layer service allows several applications running on a host to exchange SDUs with several other applications running on remote hosts. Let us consider two hosts, e.g. a client and a server. The network layer service allows the client to send information to the server, but if an application running on the client wants to contact a particular application running on the server, then an additional addressing mechanism is required. The network layer address identifies a host, but it is not sufficient to differentiate the applications running on a host. `Port numbers` provides this additional addressing. When a server application is launched on a host, it registers a `port number`. This `port number` will be used by the clients to contact the server process. 829/10000 · 829
103 ../../glossary.rst:32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Metropolitan Area Network 25/10000 · 25
103 ../../principles/reliability.rst:407
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Services and protocols 22/10000 · 22
103 ../../principles/sharing.rst:649
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Carrier Sense Multiple Access with Collision Avoidance` (CSMA/CA) Medium Access Control algorithm was designed for the popular WiFi wireless network technology [IEEE802.11]_. CSMA/CA also senses the transmission channel before transmitting a frame. Furthermore, CSMA/CA tries to avoid collisions by carefully tuning the timers used by CSMA/CA devices. 356/10000 · 356
103 ../../principles/transport.rst:615
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The figure below shows a typical usage of port numbers. The client process uses port number `1234` while the server process uses port number `5678`. When the client sends a request, it is identified as originating from port number `1234` on the client host and destined to port number `5678` on the server host. When the server process replies to this request, the server's transport layer returns the reply as originating from port `5678` on the server host and destined to port `1234` on the client host. 507/10000 · 507
103 ../../principles/security.rst:1000
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Alice checks the signature (with :math:`Bob_{pub}`) and the certificate and computes :math:`S_{A}=B^{a} \mod p` 111/10000 · 111
103 ../../exercises/ipv6.rst:987
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Network engineers often rely on :manpage:`ping6(8)` to verify the reachability of a remote host or router. :manpage:`ping6(8)` sends ICMPv6 echo request messages and analyzes the received ICMPv6 echo responses. Each echo request message contains an identifier and a sequence number that is returned in the response. 316/10000 · 316
103 ../../protocols/bgp.rst:399
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `AS4` first sends `U(2001:db8:1234/48,AS4:AS1)` to `AS3`. `AS3` has learned two routes towards `2001:db8:1234/48`. It runs its BGP decision process and selects the route via `AS4` and does not advertise a route to `AS4` 219/10000 · 219
103 ../../protocols/email.rst:246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 24 2/10000 · 2
103 ../../protocols/ethernet.rst:376
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Root 4/10000 · 4
103 ../../protocols/ipv6.rst:367
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Encapsulating Security Payload`. This option is processed only by hosts. 73/10000 · 73
103 ../../protocols/ethernet.rst:359
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 100 Gbps 8/10000 · 8
103 ../../protocols/tcp.rst:307
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This algorithm, called the Nagle algorithm, takes a few lines of code in all TCP implementations. These lines of code have a huge impact on the packets that are exchanged in TCP/IP networks. Researchers have analyzed the distribution of the packet sizes by capturing and analyzing all the packets passing through a given link. These studies have shown several important results : 379/10000 · 379