Exit Zen
124
../../protocols/tcp.rst:350
English
17 Gbps
0/100 · 7
125
../../glossary.rst:312
English
A Non Broadcast Mode Multiple Access Network is a subnetwork that supports multiple hosts/routers but does not provide an efficient way of sending broadcast frames to all devices attached to the subnetwork. ATM subnetworks are an example of NBMA networks.
0/2550 · 255
125
../../principles/dv.rst:17
English
A router that uses distance vector routing regularly sends its distance vector over all its interfaces. This distance vector is a summary of the router's routing table that indicates the distance towards each known destination. This distance vector can be computed from the routing table by using the pseudo-code below.
0/3190 · 319
125
../../principles/reliability.rst:426
English
To understand `error detection codes`, let us consider two devices that exchange bit strings containing `N` bits. To allow the receiver to detect a transmission error, the sender converts each string of `N` bits into a string of `N+r` bits. Usually, the `r` redundant bits are added at the beginning or the end of the transmitted bit string, but some techniques interleave redundant bits with the original bits. An `error detection code` can be defined as a function that computes the `r` redundant bits corresponding to each string of `N` bits. The simplest error detection code is the parity bit. There are two types of parity schemes : even and odd parity. With the `even` (resp. `odd`) parity scheme, the redundant bit is chosen so that an even (resp. odd) number of bits are set to `1` in the transmitted bit string of `N+r` bits. The receiver can easily recompute the parity of each received bit string and discard the strings with an invalid parity. The parity scheme is often used when 7-bit characters are exchanged. In this case, the eighth bit is often a parity bit. The table below shows the parity bits that are computed for bit strings containing three bits.
0/11720 · 1172
125
../../principles/transport.rst:680
English
Three-way handshake
0/190 · 19
125
../../principles/sharing.rst:611
English
The utilization of the reservations with CSMA/CA is an optimization that is useful when collisions are frequent. If there are few collisions, the time required to transmit the RTS and CTS frames can become significant and in particular when short frames are exchanged. Some devices only turn on RTS/CTS after transmission errors.
0/3290 · 329
125
../../protocols/bgp.rst:440
English
From a theoretical perspective, these guidelines should be verified automatically to ensure that BGP will always converge in the global Internet. However, such a verification cannot be performed in practice because this would force all domains to disclose their routing policies (and few are willing to do so) and furthermore the problem is known to be NP-hard [GW1999].
0/3700 · 370
125
../../protocols/email.rst:252
English
b
0/100 · 1
125
../../protocols/ipv6.rst:407
English
102 or 81 bytes
0/150 · 15
125
../../protocols/ethernet.rst:402
English
Virtual LANs
0/120 · 12
125
../../protocols/tcp.rst:357
English
These throughputs are acceptable in today's networks. However, there are already servers having 10 Gbps interfaces... Early TCP implementations had fixed receiving and sending buffers [#ftcphosts]_. Today's high performance implementations are able to automatically adjust the size of the sending and receiving buffer to better support high bandwidth flows [SMM1998]_.
0/3680 · 368
126
../../glossary.rst:298
English
network-byte order
0/180 · 18
126
../../principles/dv.rst:31
English
When a router boots, it does not know any destination in the network and its routing table only contains its local address(es). It thus sends to all its neighbors a distance vector that contains only its address at a distance of `0`. When a router receives a distance vector on link `l`, it processes it as follows.
0/3150 · 315
126
../../principles/reliability.rst:429
English
3 bits string
0/130 · 13
126
../../principles/transport.rst:682
English
Thanks to the three way handshake, transport entities avoid duplicate transport connections. This is illustrated by considering the three scenarios below.
0/1540 · 154
126
../../principles/sharing.rst:615
English
Deterministic Medium Access Control algorithms
0/460 · 46
126
../../protocols/bgp.rst:442
English
In practice, researchers and operators expect that these guidelines are verified [#fgranularity]_ in most domains. Thanks to the large amount of BGP data that has been collected by operators and researchers [#fbgpdata]_, several studies have analyzed the AS-level topology of the Internet. [SARK2002]_ is one of the first analysis. More recent studies include [COZ2008]_ and [DKF+2007]_
0/3860 · 386
126
../../protocols/email.rst:252
English
44
0/100 · 2
126
../../protocols/ipv6.rst:408
English
Token Ring
0/100 · 10
126
../../protocols/ethernet.rst:404
English
Another important advantage of Ethernet switches is the ability to create Virtual Local Area Networks (VLANs). A virtual LAN can be defined as a `set of ports attached to one or more Ethernet switches`. A switch can support several VLANs and it runs one MAC learning algorithm for each Virtual LAN. When a switch receives a frame with an unknown or a multicast destination, it forwards it over all the ports that belong to the same Virtual LAN but not over the ports that belong to other Virtual LANs. Similarly, when a switch learns a source address on a port, it associates it to the Virtual LAN of this port and uses this information only when forwarding frames on this Virtual LAN.
0/6850 · 685