Exit Zen
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
126
../../protocols/tcp.rst:362
English
TCP's retransmission timeout
0/280 · 28
127
../../glossary.rst:300
English
Internet protocol allow to transport sequences of bytes. These sequences of bytes are sufficient to carry ASCII characters. The network-byte order refers to the Big-Endian encoding for 16 and 32 bits integer. See https://en.wikipedia.org/wiki/Endianness
0/2530 · 253
127
../../principles/dv.rst:54
English
The router iterates over all addresses included in the distance vector. If the distance vector contains a destination address that the router does not know, it inserts it inside its routing table via link `l` and at a distance which is the sum between the distance indicated in the distance vector and the cost associated to link `l`. If the destination was already known by the router, it only updates the corresponding entry in its routing table if either :
0/4590 · 459
127
../../principles/reliability.rst:429
English
Odd parity
0/100 · 10
127
../../principles/transport.rst:684
English
The first scenario is when the remote entity receives an old `CR` segment. It considers this `CR` segment as a connection establishment attempt and replies by sending a `CA` segment. However, the initiating host cannot match the received `CA` segment with a previous connection attempt. It sends a control segment (`REJECT` in the figure below) to cancel the spurious connection attempt. The remote entity cancels the connection attempt upon reception of this control segment.
0/4760 · 476
127
../../principles/sharing.rst:617
English
During the 1970s and 1980s, there were huge debates in the networking community about the best suited Medium Access Control algorithms for Local Area Networks. The optimistic algorithms that we have described until now were relatively easy to implement when they were designed. From a performance perspective, mathematical models and simulations showed the ability of these optimistic techniques to sustain load. However, none of the optimistic techniques are able to guarantee that a frame will be delivered within a given delay bound and some applications require predictable transmission delays. The deterministic MAC algorithms were considered by a fraction of the networking community as the best solution to fulfill the needs of Local Area Networks.
0/7550 · 755
127
../../protocols/bgp.rst:444
English
Based on these studies and [ATLAS2009]_, the AS-level Internet topology can be summarized as shown in the figure below.
0/1190 · 119
127
../../protocols/email.rst:252
English
s
0/100 · 1
127
../../protocols/ipv6.rst:408
English
4464 bytes
0/100 · 10