Exit Zen
29
../../exercises/tcp-2.rst:167
English
Another example is the simultaneous establishment of a TCP connection. The TCP stack sends a ``SYN`` and receives a ``SYN`` in response instead of a ``SYN+ACK``. It then acknowledges the received ``SYN`` and retransmits its own ``SYN``. The connection becomes established upon reception of the fourth segment. This script is available from :download:`/exercises/packetdrill_scripts/dual.pkt`.
0/3920 · 392
29
../../protocols/bgp.rst:97
English
The Border Gateway Protocol
0/270 · 27
29
../../protocols/congestion.rst:177
English
routers that have a single FIFO queue
0/370 · 37
29
../../protocols/dnssec.rst:331
English
Footnotes
0/100 · 9
29
../../protocols/email.rst:170
English
To solve this problem, the IETF_ developed the Multipurpose Internet Mail Extensions (:term:`MIME`). These extensions were carefully designed to allow Internet email to carry non-ASCII characters and binary files without breaking the email servers that were deployed at that time. This requirement for backward compatibility forced the MIME designers to develop extensions to the existing email message format :rfc:`822` instead of defining a completely new format that would have been better suited to support the new types of emails.
0/5350 · 535
29
../../protocols/ethernet.rst:171
English
Thick coaxial cable, 500m
0/250 · 25
29
../../protocols/http.rst:120
English
The response sent by the server also contains three parts :
0/590 · 59
29
../../protocols/http2.rst:224
English
The HTTP/2.0 streams can provide performance benefits, but they also increase the complexity of the implementations since an HTTP/2.0 receiver must be able to simultaneously process frames that correspond to different web objects. This complexity mainly resides on the client side. The HTTP/2.0 protocol includes several techniques that enable clients to manage the utilization of the HTTP/2.0 session.
0/4020 · 402
29
../../protocols/ipv6.rst:115
English
``fe80:0:0:0:219:e3ff:fed7:1204``
0/330 · 33
29
../../protocols/ethernet.rst:92
English
What is the Ethernet service ?
0/300 · 30
29
../../protocols/routing.rst:94
English
Let us first consider OSPF routing inside `area 2`. All routers in the area learn a route towards `2001:db8:1234::/48` and `2001:db8:5678::/48`. The two area border routers, `RB` and `RC`, create network summary advertisements. Assuming that all links have a unit link metric, these would be:
0/2920 · 292
29
../../protocols/rpc.rst:113
English
Upon reception of this JSON structure, the callee parses the object, locates the corresponding method and passes the parameters. This method returns a response which is also encoded as a JSON structure. This response contains the following fields:
0/2470 · 247
29
../../protocols/ssh.rst:225
English
``padding length`` : this is the number of random bytes that have been added at the end of the message.
0/1030 · 103
29
../../protocols/tcp.rst:57
English
the `TCP Header Length` (THL) or `Data Offset` field is a four bits field that indicates the size of the TCP header in 32 bit words. The maximum size of the TCP header is thus 64 bytes.
0/1850 · 185
29
../../protocols/tls.rst:98
English
Securely negotiate the cryptographic algorithms that will be used by the client and the server over the TLS session
0/1150 · 115
29
../../protocols/wifi.rst:26
English
74 Mbps
0/100 · 7
30
../../bibliography.rst:97
English
Jung, J., Sit, E., Balakrishnan, H., and Morris, R. 2002. `DNS performance and the effectiveness of caching <https://dx.doi.org/10.1109/TNET.2002.803905>`_. IEEE/ACM Transactions Networking 10, 5 (Oct. 2002), 589-603.
0/2170 · 217
30
../../glossary.rst:54 • ../../glossary.rst:211 • ../../glossary.rst:232
English
DNS
0/100 · 3
30
../../exercises/ex-sharing.rst:591
English
Consider the simple network depicted in the figure below.
0/570 · 57
30
../../principles/network.rst:116
English
A second type of problem may exist in networks using the datagram organization. Consider a path that contains a cycle. For example, router `R1` sends all packets towards destination `D` via router `R2`. Router `R2` forwards these packets to router `R3` and finally router `R3`'s forwarding table uses router `R1` as its nexthop to reach destination `D`. In this case, if a packet destined to `D` is received by router `R1`, it will loop on the `R1 -> R2 -> R3 -> R1` cycle and will never reach its final destination. As in the black hole case, the destination is not reachable from all sources in the network. In practice the loop problem is more annoying than the black hole problem because when a packet is caught in a forwarding loop, it unnecessarily consumes bandwidth. In the black hole case, the problematic packet is quickly discarded. We will see later that network layer protocols include techniques to minimize the impact of such forwarding loops.
0/9580 · 958