Exit Zen
105
../../protocols/ethernet.rst:382
English
To illustrate the operation of the `Spanning Tree Protocol`, let us consider the simple network topology in the figure below.
0/1250 · 125
105
../../protocols/ipv6.rst:371
English
The `Hop-by-Hop Options` header was designed to make IPv6 easily extensible. In theory, this option could be used to define new fields that were not foreseen when IPv6 was designed. It is intended to be processed by both routers and hosts. Deploying an extension to a network protocol can be difficult in practice since some nodes already support the extensions while others still use the old version and do not understand the extension. To deal with this issue, the IPv6 designers opted for a Type-Length-Value encoding of these IPv6 options. The `Hop-by-Hop Options` header is encoded as shown below.
0/6030 · 603
105
../../protocols/ethernet.rst:362
English
The `Spanning Tree Protocol` uses its own terminology that we illustrate in the figure above. A switch port can be in three different states : `Root`, `Designated` and `Blocked`. All the ports of the `root` switch are in the `Designated` state. The state of the ports on the other switches is determined based on the `BPDU` received on each port.
0/3460 · 346
105
../../protocols/tcp.rst:310
English
in TCP/IP networks, most of the bytes are exchanged in long packets, usually packets containing about 1440 bytes of payload which is the default MSS for hosts attached to an Ethernet network, the most popular type of LAN
0/2200 · 220
106
../../glossary.rst:30
English
MAN
0/100 · 3
106
../../principles/network.rst:417
English
Since a packet received with `label=1` must be forwarded to `R5` with `label=1`, `R2`'s `label forwarding table` could contain :
0/1280 · 128
106
../../principles/reliability.rst:391
English
The datalink layer must deal with the transmission errors. In practice, we mainly have to deal with two types of errors in the datalink layer :
0/1430 · 143
106
../../principles/transport.rst:571
English
To support the connection-oriented service, the transport layer needs to include several mechanisms to enrich the connectionless network-layer service. We discuss these mechanisms in the following sections.
0/2060 · 206
106
../../principles/sharing.rst:477
English
In the second and third cases, both hosts have flipped different coins. The delay chosen by the host that defers its retransmission should be long enough to ensure that its retransmission will not collide with the immediate retransmission of the other host. However the delay should not be longer than the time necessary to avoid the collision, because if both hosts decide to defer their transmission, the network will be idle during this delay. The `slot time` is the optimal delay since it is the shortest delay that ensures that the first host will be able to retransmit its frame completely without any collision.
0/6180 · 618
106
../../principles/security.rst:1015
English
Footnotes
21/100 · 9
106
../../exercises/ipv6.rst:999
English
When :manpage:`traceroute6(8)` sends UDP segments, it uses the UDP source port as a way to remember the target hop for this specific UDP segment.
0/1450 · 145
106
../../protocols/bgp.rst:404
English
From an operational perspective, the above configuration is annoying since the network operators cannot easily predict which paths are chosen. Unfortunately, there are even more annoying BGP configurations. For example, let us consider the configuration below which is often named `Bad Gadget` [GW1999]_
0/3030 · 303
106
../../protocols/email.rst:246
English
p
0/100 · 1
106
../../protocols/ethernet.rst:389
English
A simple Spanning tree computed in a switched Ethernet network
0/620 · 62
106
../../protocols/ipv6.rst:376
English
The IPv6 `Hop-by-Hop Options` header
0/360 · 36
106
../../protocols/ethernet.rst:364
English
The `Spanning Tree Protocol` uses the ordering relationship to build the spanning tree. Each switch listens to `BPDUs` on its ports. When `BPDU = <R,c,T,p>` is received on port `q`, the switch computes the port's `root priority vector`: `V[q] = <R,c+cost[q],T,p,q>` , where `cost[q]` is the cost associated to the port over which the `BPDU` was received. The switch stores in a table the last `root priority vector` received on each port. The switch then compares its own `identifier` with the smallest `root identifier` stored in this table. If its own `identifier` is smaller, then the switch is the root of the spanning tree and is, by definition, at a distance `0` of the root. The `BPDU` of the switch is then `<R,0,R,p>`, where `R` is the switch `identifier` and `p` will be set to the port number over which the `BPDU` is sent.
0/8340 · 834
106
../../protocols/tcp.rst:315
English
`Recent measurements <http://www.caida.org/research/traffic-analysis/pkt_size_distribution/graphs.xml>`_ indicate that these packet size distributions are still valid in today's Internet, although the packet distribution tends to become bi-modal with small packets corresponding to TCP pure acknowledgments and large 1440-bytes packets carrying most of the user data [SMASU2012]_.
0/3800 · 380
107
../../glossary.rst:32
English
Metropolitan Area Network
0/250 · 25
107
../../principles/network.rst:427
English
Two virtual circuits pass through `R3`. They both need to be forwarded to `R4`, but `R4` expects `label=1` for packets belonging to the virtual circuit originated by `R2` and `label=0` for packets belonging to the other virtual circuit. `R3` could choose to leave the labels unchanged.
0/2850 · 285
107
../../principles/reliability.rst:393
English
Frames can be corrupted by transmission errors
0/460 · 46