Exit Zen
100
../../glossary.rst:153
English
IXP
0/100 · 3
100
../../principles/network.rst:377
English
East
0/100 · 4
100
../../principles/reliability.rst:344
English
The datalink entity can then be modeled as a finite state machine, containing two states for the receiver and two states for the sender. The figure below provides a graphical representation of this state machine with the sender above and the receiver below.
0/2570 · 257
100
../../principles/transport.rst:553
English
a `multiplexing technique` that enables several applications running on one host to exchange information with another host
0/1220 · 122
100
../../principles/sharing.rst:468
English
The last innovation introduced by CSMA/CD is the computation of the retransmission timeout. As for ALOHA, this timeout cannot be fixed, otherwise hosts could become synchronized and always retransmit at the same time. Setting such a timeout is always a compromise between the network access delay and the amount of collisions. A short timeout would lead to a low network access delay but with a higher risk of collisions. On the other hand, a long timeout would cause a long network access delay but a lower risk of collisions. The `binary exponential back-off` algorithm was introduced in CSMA/CD networks to solve this problem.
0/6290 · 629
100
../../principles/security.rst:988
English
To safely use the Diffie-Hellman key exchange, Alice and Bob must use an `authenticated` exchange. Some of the information sent by Alice or Bob must be signed with a public key known by the other user. In practice, it is often important for Alice to authenticate Bob. If Bob has a certificated signed by Ted, the authenticated key exchange could be organized as follows.
0/3700 · 370
100
../../exercises/ipv6.rst:967
English
To correctly understand the operation of IPv6, it is sometimes important to remember the packet format and how the different fields are used.
0/1410 · 141
100
../../protocols/bgp.rst:394
English
The disagree internetwork
0/250 · 25
100
../../protocols/email.rst:244
English
57
0/100 · 2
100
../../protocols/ethernet.rst:375
English
Blocked
0/100 · 7
100
../../protocols/ipv6.rst:364
English
`Routing` header. This option is processed by some nodes.
0/570 · 57
100
../../protocols/ethernet.rst:357
English
1 Gbps
0/100 · 6
100
../../protocols/tcp.rst:289
English
In a transport protocol such as TCP that offers a bytestream, a practical issue that was left as an implementation choice in :rfc:`793` is to decide when a new TCP segment containing data must be sent. There are two simple and extreme implementation choices. The first implementation choice is to send a TCP segment as soon as the user has requested the transmission of some data. This allows TCP to provide a low delay service. However, if the user is sending data one byte at a time, TCP would place each user byte in a segment containing 20 bytes of TCP header [#fnagleip]_. This is a huge overhead that is not acceptable in wide area networks. A second simple solution would be to only transmit a new TCP segment once the user has produced MSS bytes of data. This solution reduces the overhead, but at the cost of a potentially very high delay.
0/8480 · 848
101
../../glossary.rst:155
English
Internet eXchange Point. A location where routers belonging to different domains are attached to the same Local Area Network to establish peering sessions and exchange packets. See http://www.euro-ix.net/ or https://en.wikipedia.org/wiki/List_of_Internet_exchange_points_by_size for a partial list of IXPs.
0/3060 · 306
101
../../principles/network.rst:380
English
If this node receives a packet with `label=2`, it forwards the packet on its `West` interface and sets the `label` of the outgoing packet to `2`. If the received packet's `label` is set to `3`, then the packet is forwarded over the `East` interface and the `label` of the outgoing packet is set to `2`. If a packet is received with a label field set to `1`, the packet is discarded since the corresponding `label forwarding table` entry is invalid.
0/4480 · 448
101
../../principles/transport.rst:557
English
To exchange data, the transport protocol encapsulates the SDU produced by its user inside a `segment`. The `segment` is the unit of transfer of information in the transport layer. Transport layer entities always exchange segments. When a transport layer entity creates a segment, this segment is encapsulated by the network layer into a packet which contains the segment as its payload and a network header. The packet is then encapsulated in a frame to be transmitted in the datalink layer.
0/4910 · 491
101
../../principles/sharing.rst:470
English
To understand `binary exponential back-off`, let us consider a collision caused by exactly two hosts. Once it has detected the collision, a host can either retransmit its frame immediately or defer its transmission for some time. If each colliding host flips a coin to decide whether to retransmit immediately or to defer its retransmission, four cases are possible :
0/3670 · 367
101
../../principles/security.rst:995
English
Alice chooses a secret integer : :math:`a` and sends :math:`A= g^{a} \mod p` to Bob
0/830 · 83
101
../../exercises/ipv6.rst:971
English
The `Next Header` of the IPv6 packet indicates the type of the header that follows the IPv6 packet. IANA_ maintains a list of all the assigned values of this header at https://www.iana.org/assignments/protocol-numbers/protocol-numbers.xhtml
0/2400 · 240
101
../../protocols/bgp.rst:396
English
In this internetwork, we focus on the route towards `2001:db8::1234/48` which is advertised by `AS1`. Let us also assume that `AS3` (resp. `AS4`) prefers, e.g. for economic reasons, a route learned from `AS4` (`AS3`) over a route learned from `AS1`. When `AS1` sends `U(2001:db8::1234/48,AS1)` to `AS3` and `AS4`, three sequences of exchanges of BGP messages are possible :
0/3730 · 373