Exit Zen
118
../../protocols/tcp.rst:337
English
1.05 Mbps
0/100 · 9
119
../../glossary.rst:23
English
a transmission mode where an information is sent efficiently to `all` the receivers that belong to a given group
0/1120 · 112
119
../../principles/dv.rst:7
English
Distance vector routing
0/230 · 23
119
../../principles/reliability.rst:414
English
Some coding schemes allow the receiver to correct some transmission errors. For example, consider the coding scheme that encodes each source bit as follows :
0/1570 · 157
119
../../principles/transport.rst:664
English
This `transport clock` can now be combined with an exchange of three segments, called the `three way handshake`, to detect duplicates. This `three way handshake` occurs as follows :
0/1810 · 181
119
../../principles/sharing.rst:559
English
Detailed example with CSMA/CA
0/290 · 29
119
../../protocols/bgp.rst:428
English
This example shows that the convergence of BGP is unfortunately not always guaranteed as some interdomain routing policies may interfere with each other in complex ways. [GW1999]_ have shown that checking for global convergence is either NP-complete or NP-hard. See [GSW2002]_ for a more detailed discussion.
0/3080 · 308
119
../../protocols/email.rst:250
English
43
0/100 · 2
119
../../protocols/ipv6.rst:404
English
1500 bytes
0/100 · 10
119
../../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
119
../../protocols/tcp.rst:340
English
To solve this problem, a backward compatible extension that allows TCP to use larger receive windows was proposed in :rfc:`1323`. Today, most TCP implementations support this option. The basic idea is that instead of storing `snd.wnd` and `rcv.wnd` as 16 bits integers in the :term:`TCB`, they should be stored as 32 bits integers. As the TCP segment header only contains 16 bits to place the window field, it is impossible to copy the value of `snd.wnd` in each sent TCP segment. Instead the header contains `snd.wnd >> S` where `S` is the scaling factor ( :math:`0 \le S \le 14`) negotiated during connection establishment. The client adds its proposed scaling factor as a TCP option in the `SYN` segment. If the server supports :rfc:`1323`, it places in the `SYN+ACK` segment the scaling factor that it uses when advertising its own receive window. The local and remote scaling factors are included in the :term:`TCB`. If the server does not support :rfc:`1323`, it ignores the received option and no scaling is applied.
0/10230 · 1023
120
../../glossary.rst:250
English
nameserver
0/100 · 10
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