Exit Zen
90
../../glossary.rst:107
English
The Initial Sequence Number of a TCP connection is the sequence number chosen by the client ( resp. server) that is placed in the `SYN` (resp. `SYN+ACK`) segment during the establishment of the TCP connection.
0/2090 · 209
90
../../principles/network.rst:369 • ../../principles/network.rst:410 • ../../principles/network.rst:420 • ../../principles/network.rst:430 • ../../principles/network.rst:440
English
outgoing interface
0/180 · 18
90
../../principles/reliability.rst:310
English
the interactions between the user and the datalink layer entity are represented by using the classical `DATA.req` and the `DATA.ind` primitives
0/1430 · 143
90
../../principles/sharing.rst:418
English
Frame transmission on a shared bus
0/340 · 34
90
../../principles/security.rst:956
English
Bob computes :math:`S_{B}=A^{b} \mod p= 16^{13} \mod 23=3`
0/580 · 58
90
../../exercises/ipv6.rst:841
English
We first check with ``pingall`` whether the network works correctly.
0/680 · 68
90
../../exercises/routing-protocols.rst:1339
English
What is the path that packets follow from a host attached to ``AS8`` to a host attached to ``AS1`` ?
0/1000 · 100
90
../../protocols/bgp.rst:363
English
However, this import filter does not influence how `AS3` , for example, prefers some routes over others. If the link between `AS3` and `AS2` is less expensive than the link between `AS3` and `AS4`, `AS3` could send all its packets via `AS2` and `AS1` would receive packets over its expensive link. An important point to remember about `local-pref` is that it can be used to prefer some routes over others to send packets, but it has no influence on the routes followed by received packets.
0/4890 · 489
90
../../protocols/email.rst:242
English
W
0/100 · 1
90
../../protocols/ethernet.rst:359
English
200
0/100 · 3
90
../../protocols/ipv6.rst:343
English
When a host receives an IPv6 packet, it needs to determine which transport protocol (UDP, TCP, SCTP, ...) needs to handle the payload of the packet. This is the first role of the `Next header` field. The IANA_ which manages the allocation of Internet resources and protocol parameters, maintains an official list of transport protocols [#fianaprotocol]_. The following protocol numbers are reserved :
0/4000 · 400
90
../../protocols/ethernet.rst:336
English
the `identifier` of the switch that sent the `BPDU` (`T`)
0/570 · 57
90
../../protocols/tcp.rst:266
English
`snd.una` : the earliest sequence number that has been sent but has not yet been acknowledged
0/930 · 93
90
../../protocols/tls.rst:515
English
Footnotes
0/100 · 9
91
../../glossary.rst:36 • ../../glossary.rst:271
English
ISO
0/100 · 3
91
../../principles/network.rst:369 • ../../principles/network.rst:410 • ../../principles/network.rst:420 • ../../principles/network.rst:430 • ../../principles/network.rst:440
English
label
0/100 · 5
91
../../principles/reliability.rst:311
English
the interactions between the datalink layer entity and the framing sub-layer are represented by using `send` instead of `DATA.req` and `recvd` instead of `DATA.ind`
0/1640 · 164
91
../../principles/sharing.rst:420
English
Now that we have looked at how a frame is actually transmitted as an electrical signal on a shared bus, it is interesting to look in more detail at what happens when two hosts transmit a frame at almost the same time. This is illustrated in the figure below, where hosts A and B start their transmission at the same time (point `(1)`). At this time, if host C senses the channel, it will consider it to be free. This will not last a long time and at point `(2)` the electrical signals from both host A and host B reach host C. The combined electrical signal (shown graphically as the superposition of the two curves in the figure) cannot be decoded by host C. Host C detects a collision, as it receives a signal that it cannot decode. Since host C cannot decode the frames, it cannot determine which hosts are sending the colliding frames. Note that host A (and host B) will detect the collision after host C (point `(3)` in the figure below).
0/9430 · 943
91
../../principles/security.rst:958
English
Alice and Bob have agreed on the secret information :math:`3` without having sent it explicitly through the network. If the integers used are large enough and have good properties, then even Eve who can capture all the messages sent by Alice and Bob cannot recover the secret key that they have exchanged. There is no formal proof of the security of the algorithm, but mathematicians have tried to solve similar problems with integers during centuries without finding an efficient algorithm. As long as the integers that are used are random and large enough, the only possible attack for Eve is to test all possible integers that could have been chosen by Alice and Bob. This is computationally very expensive. This algorithm is widely used in security protocols to agree on a secret key.
0/7880 · 788
91
../../exercises/ipv6.rst:851
English
The problem can be detected by using :manpage:`traceroute6(8)`.
0/630 · 63