Exit Zen
134
../../principles/dv.rst:72
English
`B` and `D` process the received distance vector and update their routing table with a route towards `A`.
0/1050 · 105
134
../../principles/reliability.rst:434 • ../../principles/reliability.rst:451
English
100
0/100 · 3
134
../../principles/sharing.rst:640
English
The first problem faced by a Token Ring network is that as the token represents the authorization to transmit, it must continuously travel on the ring when no data frame is being transmitted. Let us assume that a token has been produced and sent on the ring by one station. In Token Ring networks, the token is a 24 bits frame whose structure is shown below.
0/3580 · 358
134
../../principles/transport.rst:713
English
Now that the transport connection has been established, it can be used to transfer data. To ensure a reliable delivery of the data, the transport protocol will include sliding windows, retransmission timers and `go-back-n` or `selective repeat`. However, we cannot simply reuse the techniques from the datalink because a transport protocol needs to deal with more types of errors than a reliable protocol in datalink layer. The first difference between the two layers is the transport layer must face with more variable delays. In the datalink layer, when two hosts are connected by a link, the transmission delay or the round-trip-time over the link is almost fixed. In a network that can span the globe, the delays and the round-trip-times can vary significantly on a per packet basis. This variability can be caused by two factors. First, packets sent through a network do not necessarily follow the same path to reach their destination. Second, some packets may be queued in the buffers of routers when the load is high and these queuing delays can lead to increased end-to-end delays. A second difference between the datalink layer and the transport layer is that a network does not always deliver packets in sequence. This implies that packets may be reordered by the network. Furthermore, the network may sometimes duplicate packets. The last issue that needs to be dealt with in the transport layer is the transmission of large SDUs. In the datalink layer, reliable protocols transmit small frames. Applications could generate SDUs that are much larger than the maximum size of a packet in the network layer. The transport layer needs to include mechanisms to fragment and reassemble these large SDUs.
0/17090 · 1709
135
../../glossary.rst:143
English
Open Shortest Path First. A link-state intradomain routing protocol that is often used in enterprise and ISP networks. OSPF is defined in and :rfc:`2328` and :rfc:`5340`
0/1710 · 171
135
../../principles/dv.rst:73
English
`D` sends its distance vector `[D=0,A=1]` to `A` and `E`. `E` can now reach `A` and `D`.
0/880 · 88
135
../../principles/reliability.rst:435 • ../../principles/reliability.rst:452
English
111
0/100 · 3
135
../../principles/sharing.rst:649
English
802.5 token format
0/180 · 18
135
../../principles/transport.rst:715
English
To deal with all these characteristics of the network layer, we need to adapt the techniques that we have introduced in the datalink layer.
0/1390 · 139
136
../../glossary.rst:57
English
packet
0/100 · 6
136
../../principles/dv.rst:74
English
`C` sends its distance vector `[C=0]` to `B` and `E`
0/520 · 52
136
../../principles/reliability.rst:436 • ../../principles/reliability.rst:453
English
110
0/100 · 3
136
../../principles/sharing.rst:654
English
The token is composed of three fields. First, the `Starting Delimiter` is the marker that indicates the beginning of a frame. The first Token Ring networks used Manchester coding and the `Starting Delimiter` contained both symbols representing `0` and symbols that do not represent bits. The last field is the `Ending Delimiter` which marks the end of the token. The `Access Control` field is present in all frames, and contains several flags. The most important is the `Token` bit that is set in token frames and reset in other frames.
0/5360 · 536
137
../../glossary.rst:59
English
a packet is the unit of information transfer in the network layer
0/650 · 65
137
../../principles/dv.rst:75
English
`E` sends its distance vector `[E=0,D=1,A=2,C=1]` to `D`, `B` and `C`. `B` can now reach `A`, `C`, `D` and `E`
0/1100 · 110
137
../../principles/reliability.rst:437 • ../../principles/reliability.rst:454
English
101
0/100 · 3
137
../../principles/sharing.rst:658
English
Let us consider the five station network depicted in figure :ref:`fig-tokenring` above and assume that station `S1` sends a token. If we neglect the propagation delay on the inter-station links, as each station introduces a one bit delay, the first bit of the frame would return to `S1` while it sends the fifth bit of the token. If station `S1` is powered off at that time, only the first five bits of the token will travel on the ring. To avoid this problem, there is a special station called the `Monitor` on each Token Ring. To ensure that the token can travel forever on the ring, this `Monitor` inserts a delay that is equal to at least 24 bit transmission times. If station `S3` was the `Monitor` in figure :ref:`fig-tokenring`, `S1` would have been able to transmit the entire token before receiving the first bit of the token from its upstream neighbor.
0/8620 · 862
138
../../glossary.rst:51
English
PBL
0/100 · 3
138
../../principles/dv.rst:76
English
`B` sends its distance vector `[B=0,A=1,C=1,D=2,E=1]` to `A`, `C` and `E`. `A`, `B`, `C` and `E` can now reach all five routers of this network.
0/1440 · 144
138
../../principles/reliability.rst:438 • ../../principles/reliability.rst:455
English
011
0/100 · 3