Exit Zen
13
../../protocols/ipv6.rst:89
English
TUBA proposed in :rfc:`1347` and :rfc:`1561`
0/440 · 44
13
../../protocols/ppp.rst:34 • ../../protocols/ethernet.rst:192 • ../../protocols/ethernet.rst:308 • ../../protocols/wifi.rst:157
English
Footnotes
0/100 · 9
13
../../protocols/ppp.rst:37
English
The IANA maintains the registry of all assigned PPP protocol fields at : http://www.iana.org/assignments/ppp-numbers
0/1160 · 116
13
../../protocols/routing.rst:40
English
RIP routers periodically exchange RIP messages. The format of these messages is shown below. A RIP message is sent inside a UDP segment whose destination port is set to `521`. A RIP message contains several fields. The `command` field indicates whether the RIP message is a request or a response. When a router boots, its routing table is empty and it cannot forward any packet. To speedup the discovery of the network, it can send a request message to the RIP IPv6 multicast address, ``FF02::9``. All RIP routers listen to this multicast address and any router attached to the subnet will reply by sending its own routing table as a sequence of RIP messages. In steady state, routers multicast one of more RIP response messages every 30 seconds. These messages contain the distance vectors that summarize the router's routing table. The current version of RIP is version 2 defined in :rfc:`2453` for IPv4 and :rfc:`2080` for IPv6.
0/9310 · 931
13
../../protocols/rpc.rst:34
English
The eXternal Data Representation (XDR) Standard, defined in :rfc:`1832` is an early specification that describes how information exchanged during Remote Procedure Calls should be encoded before being transmitted through a network. Since the transport service enables transfering a block of bytes (with the connectionless service) or a stream of bytes (by using the connection-oriented service), XDR maps each datatype onto a sequence of bytes. The caller encodes each data in the appropriate sequence and the callee decodes the received information. Here are a few examples extracted from :rfc:`1832` to illustrate how this encoding/decoding can be performed.
0/6590 · 659
13
../../protocols/ssh.rst:89
English
The IANA_ maintains a `list of the cryptographic algorithms <http://www.iana.org/assignments/ssh-parameters/ssh-parameters.xhtml#ssh-parameters-16>`_ that can be used by ``ssh`` implementations. For each type of algorithm, the client provides an ordered list of the algorithms that it supports and agrees to use. The server compares the received list with its own list. The outcome of the negotiation is a set of four algorithms [#fnull]_ that will be combined for this session.
0/4780 · 478
13
../../protocols/tcp.rst:37
English
the `source and destination ports`. The source and destination ports play an important role in TCP, as they allow the identification of the connection to which a TCP segment belongs. When a client opens a TCP connection, it typically selects an ephemeral TCP port number as its source port and contacts the server by using the server's port number. All the segments that are sent by the client on this connection have the same source and destination ports. The server sends segments that contain as source (resp. destination) port, the destination (resp. source) port of the segments sent by the client (see figure :ref:`fig-tcpports`). A TCP connection is always identified by four pieces of information :
0/7060 · 706
13
../../protocols/tls.rst:44
English
143
0/100 · 3
13
../../protocols/transport-service.rst:47
English
Textual representation of IPv6 addresses
0/400 · 40
13
../../protocols/udp.rst:55
English
a 16 bits length field
0/220 · 22
13
../../protocols/wifi.rst:22
English
0.9 Mbps
0/100 · 8
14
../../bibliography.rst:48
English
Clark D., `The Design Philosophy of the DARPA Internet Protocols <https://dx.doi.org/10.1145/205447.205458>`_, Computer Communications Review 18:4, August 1988, pp. 106-114
0/1720 · 172
14
../../exercises/ex-sharing.rst:290
English
Consider again a network that uses CSMA/CD. This time, the bandwidth is set to 1 Gbps and the cable has a length of two kilometers. When a collision occurs, consider that the hosts B and C retransmit immediately while host A waits for the next slot.
0/2490 · 249
14
../../exercises/reliability.rst:34
English
The bandwidth of the two directions of the link is set to `B` bits per second
79/770 · 77
14
../../exercises/network.rst:103
English
Assume that the routers located in `Denver` and `Kansas City` need to exchange lots of packets. Can you configure the link metrics such that the link between these two routers does not carry any packet sent by another router in the network ?
272/2410 · 241
14
../../exercises/sockets.rst:122
English
In the following example, a C program is sending the bytes ``'h'``, ``'e'``, ``'l'``, ``'l'`` and ``'o'`` to a remote process located at address ``peer_addr``, using the already created socket ``sock``.
202/2020 · 202
14
../../exercises/transport.rst:126
English
Practice
9/100 · 8
14
../../principles/naming.rst:77
English
The Domain Name System was created at a time when the Internet was mainly used in North America. The initial design assumed that all domain names would be composed of letters and digits :rfc:`1035`. As Internet usage grew in other parts of the world, it became important to support non-ASCII characters. For this, extensions have been proposed to the Domain Name System :rfc:`3490`. In a nutshell, the solution that is used to support Internationalized Domain Names works as follows. First, it is possible to use most of the Unicode characters to encode domain names and hostnames, with a few exceptions (for example, the dot character cannot be part of a name since it is used as a separator). Once a domain name has been encoded as a series of Unicode characters, it is then converted into a string that contains the ``xn--`` prefix and a sequence of ASCII characters. More details on these algorithms can be found in :rfc:`3490` and :rfc:`3492`.
1139/9480 · 948
14
../../principles/referencemodels.rst:56
English
The `Datalink layer` builds on the service provided by the underlying physical layer. The `Datalink layer` allows two hosts that are directly connected through the physical layer to exchange information. The unit of information exchanged between two entities in the `Datalink layer` is a frame. A frame is a finite sequence of bits. Some `Datalink layers` use variable-length frames while others only use fixed-length frames. Some `Datalink layers` provide a connection-oriented service while others provide a connectionless service. Some `Datalink layers` provide reliable delivery while others do not guarantee the correct delivery of the information.
751/6530 · 653
14
../../principles/network.rst:74
English
To send one byte of information to host `B`, host `A` needs to place this information inside a `packet`. In addition to the data being transmitted, the packet also contains either the addresses of the source and the destination nodes or information that indicates the path that needs to be followed to reach the destination.
329/3240 · 324