Exit Zen
34
../../protocols/routing.rst:103
English
`2001:db8:aaaa:0000::/64` at a distance of `1` and `2001:db8:aaaa:0001::/64` at a distance of `2` from `RA`
0/1070 · 107
34
../../protocols/rpc.rst:120
English
`code`: a number that indicates the type of error. Several error codes are defined in [JSON-RPC2]_. For example, `-32700` indicates an error in parsing the request, `-32602` indicates invalid parameters and `-32601` indicates that the method could not be found on the server. Other error codes are listed in [JSON-RPC2]_.
0/3210 · 321
34
../../protocols/ssh.rst:248
English
`ssh` is one example of a protocol that uses Message Authentication Codes (MAC) to authenticates the messages that are sent. A naive implementation of such a MAC would be to simply use a hash function like SHA-1. However, such a construction would not be safe from a security viewpoint. Internet protocols usually rely on the HMAC construction defined in :rfc:`2104`. It works with any hash function (`H`) and a key (`K`). As an example, let us consider HMAC with the SHA-1 hash function. SHA-1 uses 20 bytes blocks and the block size will play an important role in the operation of HMAC. We first require the key to be as long as the block size. Since this key is the output of the key generation algorithm, this is one parameter of this algorithm.
0/7490 · 749
34
../../protocols/tcp.rst:113 • ../../protocols/tcp.rst:118
English
the `SYN` flag set
0/180 · 18
34
../../protocols/tls.rst:140
English
Let us first discuss the negotiation of the cryptographic algorithms and parameters. Like all security protocols, TLS includes some agility in its design since new cryptographic algorithms appear over the years and some older algorithms become deprecated once cryptanalysts find flaws. The TLS handshakes starts with the ``ClientHello`` message that is sent by the client. This message carries the following information :
0/4210 · 421
34
../../protocols/wifi.rst:42
English
An 802.11 independent or adhoc network
0/380 · 38
35
../../bibliography.rst:109
English
Khanna, A. and Zinky, J. 1989. `The revised ARPANET routing metric <http://doi.acm.org/10.1145/75247.75252>`_. SIGCOMM Computer Communication Review 19, 4 (Aug. 1989), 45-56.
0/1740 · 174
35
../../glossary.rst:173
English
An eBGP session is a BGP session between two directly connected routers that belong to two different Autonomous Systems. Also called an external BGP session.
0/1570 · 157
35
../../exercises/ex-sharing.rst:633
English
Discussion questions
23/200 · 20
35
../../exercises/reliability.rst:77
English
Consider two high-end servers connected back-to-back by using a 10 Gbps interface. If the delay between the two servers is one millisecond, what is the throughput that can be achieved by a reliable protocol that is using 10,000 bits frames and a window of
0/2550 · 255
35
../../exercises/network.rst:328
English
What are the advantages and drawbacks of flat addresses versus hierarchical addresses ?
106/870 · 87
35
../../exercises/sockets.rst:287
English
The IPv6 address of the computer
30/320 · 32
35
../../principles/naming.rst:146
English
The official list of top-level domain names is maintained by :term:`IANA` at http://data.iana.org/TLD/tlds-alpha-by-domain.txt Additional information about these domains may be found at http://en.wikipedia.org/wiki/List_of_Internet_top-level_domains
297/2490 · 249
35
../../principles/referencemodels.rst:136
English
the Application layer
21/210 · 21
35
../../principles/reliability.rst:153
English
the `Physical layer service` may deliver `more` bits to the receiver than the bits sent by the sender
116/1010 · 101
35
../../principles/transport.rst:72
English
`Bell`: `0000111b`
0/180 · 18
35
../../exercises/dns.rst:115
English
You may obtain additional information about the root DNS servers from http://www.root-servers.org
0/970 · 97
35
../../exercises/ipv6.rst:332
English
on router ``R1``
0/160 · 16
35
../../exercises/routing-protocols.rst:434
English
As in the previous examples, we create the routers and associate one IPv6 prefix to each AS:
0/920 · 92
35
../../exercises/tcp-2.rst:293
English
We can use a similar code to demonstrate that the TCP stack performs a fast retransmit after having received three duplicate acknowledgments. This script is available from :download:`/exercises/packetdrill_scripts/frr.pkt`.
0/2230 · 223