Exit Zen
38
../../bibliography.rst:120
English
Leboudec, J.-Y., `Rate Adaptation Congestion Control and Fairness : a tutorial <http://ica1www.epfl.ch/PS_files/LEB3132.pdf>`_, Dec. 2008
0/1370 · 137
38
../../glossary.rst:159
English
EIGRP
0/100 · 5
38
../../exercises/ex-sharing.rst:643
English
Slotted ALOHA improves the performance of ALOHA by dividing the time in slots. However, this basic idea raises two interested questions. First how would you enforce the duration of these slots ? Second, should a slot include the time to transmit a data frame or the time to transmit a data frame and the corresponding acknowledgment ?
0/3340 · 334
38
../../exercises/reliability.rst:81
English
hundred frames
11/140 · 14
38
../../exercises/network.rst:360
English
Destination
11/110 · 11
38
../../exercises/sockets.rst:301
English
Now, we have built everything we need to send a message to the remote program. The ``create_socket_and_send_message`` function below assembles all the building blocks we created until now in order to send the message ``"hello"`` to the program running on port ``55555`` on the computer identified by the ``::1`` IPv6 address.
369/3250 · 325
38
../../principles/naming.rst:152
English
It is interesting to note that to prevent any homograph attack, Google Inc. registered the `g00gle.com` domain name but does not apparently use it.
166/1470 · 147
38
../../principles/referencemodels.rst:139
English
the Link layer which combines the functions of the physical and datalink layers of our five-layer reference model
130/1130 · 113
38
../../principles/network.rst:138
English
Another interesting point that is worth being discussed is when the forwarding tables are computed. A widely used solution is to compute the entries of the forwarding tables for all destinations on all routers. This ensures that each router has a valid route towards each destination. These entries can be updated when an event occurs and the network topology changes. A drawback of this approach is that the forwarding tables can become large in large networks since each router must always maintain one entry for each destination inside its forwarding table.
0/5600 · 560
38
../../principles/reliability.rst:167
English
Manchester encoding
20/190 · 19
38
../../principles/transport.rst:82
English
A simple BNF specification
0/260 · 26
38
../../principles/sharing.rst:167
English
If the buffer's occupancy continues to grow, it will overflow and packets will need to be discarded. Discarding packets during congestion is the second possible reaction of a network node to congestion. Before looking at how a node can discard packets, it is interesting to discuss qualitatively the impact of the buffer occupancy on the reliable delivery of data through a network. This is illustrated by the figure below, adapted from [Jain1990]_.
0/4490 · 449
38
../../principles/security.rst:393
English
Several public key encryption schemes have been proposed. Two of them have reached wide deployment :
0/1000 · 100
38
../../exercises/ipv6.rst:384
English
on router ``R5``
0/160 · 16
38
../../exercises/routing-protocols.rst:438
English
``AS3`` is assigned ``2001:cafe:3::/48``
0/400 · 40
38
../../exercises/tcp-2.rst:411
English
The examples above have demonstrated how TCP retransmits lost segments. However, they did not consider the interactions with the congestion control scheme since the use a large initial congestion window. We now set the initial congestion window to two MSS-sized segments and use the ``tcpi_snd_cwnd`` and ``tcpi_snd_ssthresh`` variables from ``TCP_INFO`` to explore the evolution of the TCP congestion control scheme. Our first script looks at the evolution of the congestion window during a slow-start when there are no losses. This script is available from :download:`/exercises/packetdrill_scripts/slow-start.pkt`.
0/6170 · 617
38
../../protocols/bgp.rst:125
English
`NOTIFICATION` : this message is used to terminate a BGP session, usually because an error has been detected by the BGP peer. A router that sends or receives a `NOTIFICATION` message immediately shutdowns the corresponding BGP session.
0/2350 · 235
38
../../protocols/congestion.rst:201
English
:math:`area=(\frac{W}{2})^2 + \frac{1}{2} \times (\frac{W}{2})^2 = \frac{3 \times W^2}{8}`
0/900 · 90
38
../../protocols/email.rst:186
English
The email message below, copied from :rfc:`2046` shows a MIME message containing two parts that are both in plain text and encoded using the ASCII character set. The string `simple boundary` is defined in the `Content-Type:` header as the marker for the boundary between two successive parts. Another example of MIME messages may be found in :rfc:`2046`.
0/3540 · 354
38
../../protocols/ethernet.rst:176
English
100Base-FX
0/100 · 10