2. cnp3-ebook
3. English
4. Zen

6 ../../exercises/routing-protocols.rst:83
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We use this mininet_ topology to collect packet traces that show the packets that OSPF routers exchange. For this, we add the following ``post_build`` method that IPMininet_ starts after having constructed the network and before launching the daemons. It simply starts tcpdump_ on each router to collect the first 100 OSPF packets that they send/receive. 354/10000 · 354
6 ../../exercises/tcp-2.rst:20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Let us start with a very simple example that uses packetdrill_ to open a TCP connection on a server running on the Linux kernel. A packetdrill_ script is a sequence of lines that are executed one after the other. There are three main types of lines in a packetdrill_ script. 274/10000 · 274
6 ../../exercises/tcp.rst:52
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — With your knowledge of TCP, you should now be able to reorder all the segments exchanged over a TCP connection. 111/10000 · 111
6 ../../exercises/trace.rst:28
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The ``-6`` parameter passed to curl_ forces the utilization of IPv6. curl_ returns an HTML page that indicates that https must be used instead of http to access this web site. 175/10000 · 175
6 ../../protocols/bgp.rst:21
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Domains need to be interconnected to allow a host inside a domain to exchange IP packets with hosts located in other domains. From a physical perspective, domains can be interconnected in two different ways. The first solution is to directly connect a router belonging to the first domain with a router inside the second domain. Such links between domains are called private interdomain links or `private peering links`. In practice, for redundancy or performance reasons, distinct physical links are usually established between different routers in the two domains that are interconnected. 590/10000 · 590
6 ../../protocols/congestion.rst:22
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A key question that must be answered by any congestion control scheme is how congestion is detected. The first implementations of the TCP congestion control scheme opted for a simple and pragmatic approach : packet losses indicate congestion. If the network is congested, router buffers are full and packets are discarded. In wired networks, packet losses are mainly caused by congestion. In wireless networks, packets can be lost due to transmission errors and for other reasons that are independent of congestion. TCP already detects segment losses to ensure a reliable delivery. The TCP congestion control scheme distinguishes between two types of congestion : 663/10000 · 663
6 ../../protocols/dnssec.rst:51
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — DNS header 10/10000 · 10
6 ../../protocols/email.rst:50
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — protocols, that allow hosts and servers to exchange email messages 66/10000 · 66
6 ../../protocols/ethernet.rst:49
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The fourth part of the Ethernet frame is the payload. The minimum length of the payload is 46 bytes to ensure a minimum frame size, including the header of 512 bits. The Ethernet payload cannot be longer than 1500 bytes. This size was found reasonable when the first Ethernet specification was written. At that time, Xerox had been using its experimental 3 Mbps Ethernet that offered 554 bytes of payload and :rfc:`1122` required a minimum MTU of 572 bytes for IPv4. 1500 bytes was large enough to support these needs without forcing the network adapters to contain overly large memories. Furthermore, simulations and measurement studies performed in Ethernet networks revealed that CSMA/CD was able to achieve a very high utilization. This is illustrated in the figure below based on [SH1980]_, which shows the channel utilization achieved in Ethernet networks containing different numbers of hosts that are sending frames of different sizes. 943/10000 · 943
6 ../../protocols/http.rst:16
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `FTP` was very popular in the 1990s and early 2000s, but today it has mostly been superseded by more recent protocols. Authenticated access to files is mainly done by using the Secure Shell (ssh_) protocol defined in :rfc:`4251` and supported by clients such as scp_ or sftp_. Nowadays, anonymous access is mainly provided by web protocols. 340/10000 · 340
6 ../../protocols/http2.rst:50
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — These reverse proxies can also be used to spread the load among different servers. In the above example, consider that a server needs 10 milliseconds to process each request and that it must handle them sequentially. Such a server cannot support more than 100 requests per second. If the service becomes popular, then the content provider will need to deploy several servers. These servers could serve the same reverse proxy. 425/10000 · 425
6 ../../protocols/ipv6.rst:65
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A local area network 20/10000 · 20
6 ../../protocols/ppp.rst:15
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — While SLIP was implemented and used in some environments, it had several limitations discussed in :rfc:`1055`. The `Point-to-Point Protocol` (PPP) was designed shortly after and is specified in :rfc:`1548`. PPP aims to support IP and other network layer protocols over various types of serial lines. PPP is in fact a family of three protocols that are used together : 367/10000 · 367
6 ../../protocols/ppp.rst:18
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `Link Control Protocol` that is used to negotiate options and authenticate the session by using username and password or other types of credentials 151/10000 · 151
6 ../../protocols/routing.rst:21
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The second class of routing protocols are the `interdomain routing protocols` (sometimes also called the exterior gateway protocols or :term:`EGP`). The objective of an interdomain routing protocol is to distribute routing information between domains. For scalability reasons, an interdomain routing protocol must distribute aggregated routing information and considers each domain as a black box. 397/10000 · 397
6 ../../protocols/rpc.rst:14
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The callee accesses the parameters and performs the requested computation 73/10000 · 73
6 ../../protocols/ssh.rst:62
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The :term:`ssh` protocol runs directly above the TCP protocol. Once the TCP bytestream has been established, the client and the server exchange messages. The first message exchanged is an ASCII line that announces the version of the protocol and the version of the software implementation used by the client and the server. These two lines are useful when debugging interoperability problems and other issues. 409/10000 · 409
6 ../../protocols/tcp.rst:18
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Most file transfer protocols ( :term:`ftp`, peer-to-peer file sharing applications , ...) 89/10000 · 89
6 ../../protocols/tls.rst:41
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Application 11/10000 · 11
6 ../../protocols/transport-service.rst:15
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The connectionless transport service allows networked application to exchange messages. Several networked applications may be running at the same time on a single host. Each of these applications must be able to exchange SDUs with remote applications. To enable these exchanges of SDUs, each networked application running on a host is identified by the following information : 376/10000 · 376