Exit Zen
120
../../principles/dv.rst:9
English
Distance vector routing is a simple distributed routing protocol. Distance vector routing allows routers to automatically discover the destinations reachable inside the network as well as the shortest path to reach each of these destinations. The shortest path is computed based on `metrics` or `costs` that are associated to each link. We use `l.cost` to represent the metric that has been configured for link `l` on a router.
0/4270 · 427
120
../../principles/reliability.rst:416
English
`1` is encoded as `111`
0/230 · 23
120
../../principles/transport.rst:666
English
The initiating transport entity sends a `CR` segment. This segment requests the establishment of a transport connection. It contains a port number (not shown in the figure) and a sequence number (`seq=x` in the figure below) whose value is extracted from the `transport clock`. The transmission of the `CR` segment is protected by a retransmission timer.
0/3540 · 354
120
../../principles/sharing.rst:562
English
The pseudo-code below summarizes the operation of a CSMA/CA device. The values of the SIFS, DIFS, EIFS and :math:`slotTime` depend on the underlying physical layer technology [IEEE802.11]_
0/1880 · 188
120
../../protocols/bgp.rst:430
English
Fortunately, there are some operational guidelines [GR2001]_ [GGR2001]_ that can guarantee BGP convergence in the global Internet. To ensure that BGP will converge, these guidelines consider that there are two types of peering relationships : `customer->provider` and `shared-cost`. In this case, BGP convergence is guaranteed provided that the following conditions are fulfilled :
0/3810 · 381
120
../../protocols/email.rst:250
English
r
0/100 · 1
120
../../protocols/ipv6.rst:405
English
WiFi
0/100 · 4
120
../../protocols/ethernet.rst:389
English
A simple Spanning tree computed in a switched Ethernet network
0/620 · 62
120
../../protocols/tcp.rst:342
English
By using the window scaling extensions defined in :rfc:`1323`, TCP implementations can use a receive buffer of up to 1 GByte. With such a receive buffer, the maximum throughput that can be achieved by a single TCP connection becomes :
0/2340 · 234
121
../../glossary.rst:252
English
A server that implements the DNS protocol and can answer queries for names inside its own domain.
0/970 · 97
121
../../principles/dv.rst:11
English
Each router maintains a routing table. The routing table `R` can be modeled as a data structure that stores, for each known destination address `d`, the following attributes :
0/1750 · 175
121
../../principles/reliability.rst:417
English
`0` is encoded as `000`
0/230 · 23
121
../../principles/transport.rst:668
English
The remote transport entity processes the `CR` segment and creates state for the connection attempt. At this stage, the remote entity does not yet know whether this is a new connection attempt or a duplicate segment. It returns a `CA` segment that contains an acknowledgment number to confirm the reception of the `CR` segment (`ack=x` in the figure below) and a sequence number (`seq=y` in the figure below) whose value is extracted from its transport clock. At this stage, the connection is not yet established.
0/5130 · 513
121
../../principles/sharing.rst:590
English
Another problem faced by wireless networks is often called the `hidden station problem`. In a wireless network, radio signals are not always propagated same way in all directions. For example, two devices separated by a wall may not be able to receive each other's signal while they could both be receiving the signal produced by a third host. This is illustrated in the figure below, but it can happen in other environments. For example, two devices that are on different sides of a hill may not be able to receive each other's signal while they are both able to receive the signal sent by a station at the top of the hill. Furthermore, the radio propagation conditions may change with time. For example, a truck may temporarily block the communication between two nearby devices.
0/7810 · 781
121
../../protocols/bgp.rst:432
English
The topology composed of all the directed `customer->provider` peering links is a graph that does not contain any cycle
0/1190 · 119
121
../../protocols/email.rst:250
English
60
0/100 · 2
121
../../protocols/ipv6.rst:405
English
2272 bytes
0/100 · 10
121
../../protocols/ethernet.rst:391
English
Assume that `Switch4` is the first to boot. It sends its own `BPDU = <4,0,4,1>` (resp. `BPDU = <4,0,4,2>`) on port 1 (resp. port 2). When `Switch1` boots, it sends `BPDU = <1,0,1,1>`. This `BPDU` is received by `Switch4`, which updates its `BPDU` and root priority vector tables and computes a new `BPDU = <1,3,4,1>` (resp. `BPDU = <1,3,4,2>`) on port 1 (resp. port 2). Indeed, there is only one root priority vector and hence, it is the best one. Port 1 of `Switch4` becomes the `Root` port while its second port is still in the `Designated` state.
0/5490 · 549
121
../../protocols/tcp.rst:347
English
8590 Gbps
0/100 · 9
122
../../glossary.rst:165
English
NAT
0/100 · 3