Exit Zen
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/sharing.rst:615
English
Deterministic Medium Access Control algorithms
0/460 · 46
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
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/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
../../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
128
../../glossary.rst:217
English
NFS
0/100 · 3
128
../../principles/reliability.rst:429
English
Even parity
0/110 · 11
128
../../principles/transport.rst:690
English
Three-way handshake : recovery from a duplicate `CR`
0/520 · 52
129
../../glossary.rst:219
English
The Network File System is defined in :rfc:`1094`
0/490 · 49
129
../../principles/reliability.rst:431 • ../../principles/reliability.rst:448
English
000
0/100 · 3
129
../../principles/sharing.rst:621
English
The IEEE 802.5 Token Ring technology is defined in [IEEE802.5]_. We use Token Ring as an example to explain the principles of the token-based MAC algorithms in ring-shaped networks. Other ring-shaped networks include the defunct FDDI [Ross1989]_ or Resilient Pack Ring [DYGU2004]_ . A good survey of the early token ring networks may be found in [Bux1989]_ .
0/3580 · 358
129
../../principles/transport.rst:692
English
A second scenario is when the initiating entity sends a `CR` segment that does not reach the remote entity and receives a duplicate `CA` segment from a previous connection attempt. This duplicate `CA` segment cannot contain a valid acknowledgment for the `CR` segment as the sequence number of the `CR` segment was extracted from the transport clock of the initiating entity. The `CA` segment is thus rejected and the `CR` segment is retransmitted upon expiration of the retransmission timer.
0/4920 · 492
130
../../glossary.rst:220
English
NTP
0/100 · 3
130
../../principles/dv.rst:59
English
The first condition ensures that the router discovers the shortest path towards each destination. The second condition is used to take into account the changes of routes that may occur after a link failure or a change of the metric associated to a link.
0/2530 · 253
130
../../principles/reliability.rst:431 • ../../principles/reliability.rst:432 • ../../principles/reliability.rst:433 • ../../principles/reliability.rst:434 • ../../principles/reliability.rst:435 • ../../principles/reliability.rst:436 • ../../principles/reliability.rst:437 • ../../principles/reliability.rst:438 • ../../principles/reliability.rst:452 • ../../principles/reliability.rst:453 • ../../principles/reliability.rst:454 • ../../principles/reliability.rst:455
English
1
0/100 · 1
130
../../principles/sharing.rst:624
English
A Token Ring network is composed of a set of stations that are attached to a unidirectional ring. The basic principle of the Token Ring MAC algorithm is that two types of frames travel on the ring : tokens and data frames. When the Token Ring starts, one of the stations sends the token. The token is a small frame that represents the authorization to transmit data frames on the ring. To transmit a data frame on the ring, a station must first capture the token by removing it from the ring. As only one station can capture the token at a time, the station that owns the token can safely transmit a data frame on the ring without risking collisions. After having transmitted its frame, the station must remove it from the ring and resend the token so that other stations can transmit their own frames.
0/8020 · 802