Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Suppose you want to send some data using the BISYNC framing protocol, and the last 2 bytes of your data are DLE and ETX. What sequence of bytes would be transmitted immediately prior to the CRC?

Short Answer

Expert verified
DLE, DLE, ETX

Step by step solution

01

- Understand BISYNC Protocol

The BISYNC (Binary Synchronous) protocol uses special characters for communication control. The DLE (Data Link Escape) character is used to indicate that the following character is a control character rather than data.
02

- Identify Control Characters Sequence

When DLE is used in a data frame, it indicates that the next character should be interpreted differently. In the BISYNC protocol, if DLE is followed by ETX, it signifies the end of the text frame.
03

- Apply BISYNC Framing Rules

According to BISYNC rules, if DLE itself appears in the data, it must be doubled to distinguish it from a DLE used to indicate control sequences. Therefore, if the last two bytes of the data are DLE and ETX, we need to encode DLE by doubling it.
04

- Determine the Transmitted Sequence

Given that our last bytes are DLE and ETX, the transmitted sequence immediately prior to the CRC will have DLE doubled to indicate a data DLE. Thus, the sequence will be DLE, DLE, ETX.

Key Concepts

These are the key concepts you need to understand to accurately answer the question.

Data Link Escape (DLE) character
The Data Link Escape (DLE) character is vital in communication protocols like BISYNC. It signals that the next character holds special importance and should be treated differently from regular data characters.
DLE is primarily used to signify that the subsequent character is a control character. This way, the receiving end can appropriately interpret the sequence.
For example, if you have a data sequence where DLE appears followed by another character, you should anticipate a specific control sequence rather than typical data. This ensures that the transmitted data maintains integrity and follows the protocol's rules.

Here are some key points to remember about DLE:
  • DLE indicates that the following character is a control character.
  • It helps differentiate between control sequences and regular data.
  • In BISYNC, DLE, when followed by specific characters, holds special meanings.
End of Text (ETX) character
The End of Text (ETX) character is another significant control character in framing protocols. It denotes the end of a text or data frame.
In the context of BISYNC, when DLE is followed by ETX, it indicates the conclusion of the data sequence or frame. This helps the receiver understand where the data ends, making the communication more structured and error-free.
Understanding ETX is crucial in ensuring proper data interpretation and transmission. When sending data, especially using BISYNC, recognizing ETX helps in identifying the end of meaningful data.

Important aspects of ETX include:
  • Often used to signify the end of a text frame.
  • Interpreted specially when preceded by DLE.
  • Ensures proper framing and termination of data sequences.
CRC (Cyclic Redundancy Check)
The Cyclic Redundancy Check (CRC) is a powerful error-detecting mechanism used to ensure data integrity. In BISYNC and other communication protocols, CRC is appended at the end of data frames.
CRC works by performing polynomial division on the data to create a remainder. This remainder, or CRC code, is then transmitted with the data. The receiver performs the same CRC calculation and checks if the remainder matches the sent CRC. If they match, it means the data likely arrived without errors.
CRC is crucial in identifying and correcting errors that might occur during data transmission due to noise, interference, or other issues.

Key points about CRC include:
  • Used for error detection.
  • Calculates a remainder using polynomial division of data.
  • Ensures data integrity by verifying if transmitted and received data match.

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Suppose a \(100-\mathrm{Mbps}\) delayed-release token ring has 10 stations, a ring latency of \(30 \mu \mathrm{s}\), and an agreed-upon TTRT of \(350 \mu \mathrm{s}\). (a) How many synchronous frame bytes could each station send, assuming all are allocated the same amount? (b) Assume stations \(\mathrm{A}, \mathrm{B}, \mathrm{C}\) are in increasing order on the ring. Due to uniform synchronous traffic, the TRT without asynchronous data is \(300 \mu \mathrm{s}\). B sends a \(200-\mu \mathrm{s}(2.5-\mathrm{Kb})\) asynchronous frame. What TRT will \(\mathrm{A}, \mathrm{B}\), and \(\mathrm{C}\) then see on their next measurement? Who may transmit such a frame next?

Show that two-dimensional parity provides the receiver enough information to correct any 1-bit error (assuming the receiver knows only 1 bit is bad), but not any 2 -bit error.

Suppose \(A, B\), and \(C\) all make their first carrier sense, as part of an attempt to transmit, while a fourth station D is transmitting. Draw a timeline showing one possible sequence of transmissions, attempts, collisions, and exponential backoff choices. Your timeline should also meet the following criteria: (i) initial transmission attempts should be in the order \(A, B, C\), but successful transmissions should be in the order \(\mathrm{C}, \mathrm{B}, \mathrm{A}\), and (ii) there should be at least four collisions.

Coaxial cable Ethernet was limited to a maximum of \(500 \mathrm{~m}\) between repeaters, which regenerate the signal to \(100 \%\) of its original amplitude. Along one \(500-\mathrm{m}\) segment, the signal could decay to no less than \(14 \%\) of its original value \((8.5 \mathrm{~dB})\). Along \(1500 \mathrm{~m}\), then, the decay might be \((0.14)^{3}=0.3 \%\). Such a signal, even along \(2500 \mathrm{~m}\), is still strong enough to be read; why then are repeaters required every \(500 \mathrm{~m}\) ? $$ \begin{array}{l|l} \hline \text { Item } & \text { Delay } \\ \hline \text { Coaxial cable } & \text { propagation speed } .77 c \\ \text { Link/drop cable } & \text { propagation speed .65c } \\ \text { Repeaters } & \text { approximately 0.6 } \mu \text { s each } \\ \text { Transceivers } & \text { approximately 0.2 } \mu \text { s each } \\ \hline \end{array} $$

The text suggests that the sliding window protocol can be used to implement flow control. We can imagine doing this by having the receiver delay ACKs, that is, not send the ACK until there is free buffer space to hold the next frame. In doing so, each ACK would simultaneously acknowledge the receipt of the last frame and tell the source that there is now free buffer space available to hold the next frame. Explain why implementing flow control in this way is not a good idea.

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free