Skip to content
DenseChip
Learn
PracticeCode labInterview

DenseChip

Navigate

Menu

LearnPracticeCode labInterview

Tools

All toolsSV editorCode repoResume
DenseChip

Practice, courses, and chip-design tools in one focused workspace.

LearnPracticeCode labInterviewToolsLearning paths

© 2026 DenseChip

AboutContactPrivacyTerms
Skip to lesson

Course contents

  • How to Use This Course
  • Reading Paths
  • Concept Map
  • How to Read the Diagrams
  • Part 0: What Is a Protocol?10
  • Part 1: Timing and Clocking11
  • Part 2: Encoding and Framing12
  • Part 3: Handshakes13
  • Part 4: Flow Control17
  • Part 5: Transactions19
  • Part 6: Concurrency and Performance17
  • Part 7: Ordering13
  • Part 8: Sharing and Arbitration12
  • Part 9: Deadlock and Liveness13
  • Part 10: Reliability and Recovery20
  • Part 11: Bring-Up and Link Management10
  • Part 12: Power8
  • Part 13: Shared State and Coherence9
  • Part 14: Security and Isolation7
  • Part 15: Specifying and Verifying11
  • Part 16: Protocols Dissected17
    • How to Dissect a Protocol
    • UART
    • SPI
    • I2C
    • APB
    • AHB
    • AXI4
    • AXI-Stream
    • PCI Express
    • DDR
    • CHI
    • Ethernet
    • USB
    • UCIe
    • CXL
    • Protocols Compared: Protocols Dissected
    • Drills: Protocols Dissected
  • Part 17: Capstones5
  • Part 18: Interview Preparation6
Loading lesson

‹Part 16: Protocols Dissected
  1. Topics
  2. First Principles of Hardware Protocols
  3. Part 16: Protocols Dissected
  4. Ethernet

Part 16 · Protocols Dissected · Senior (S)

Ethernet

Ethernet dissected through the twenty questions: frames with a CRC, dropped when bad or when buffers fill, recovery left to higher layers, with PAUSE and priority flow control as opt-in exceptions. Why a network built to lose packets became the most widely used link of all.

On this page

    Note

    Level: Senior (S) · Answers: How do real protocols answer the fifteen questions?

    Before this: PCI Express, Lossless or Lossy

    A switch receives frames from 48 ports and its output queue fills. It drops the next frame. A link takes a burst of noise and a frame's CRC fails. The receiver drops it. Neither event is reported to the sender at the Ethernet layer. This is not a defect: Ethernet was designed to drop, and to let protocols above it (TCP, or the application) decide what loss means. That one decision shapes nearly all its other answers.

    How does Ethernet answer each question, and what follows from choosing to be lossy?

    Constraints first: what Ethernet had to work with

    Constraint

    Ethernet

    C1 Distance and medium

    Metres to kilometres: copper, backplanes and fibre

    C2 Bandwidth and latency

    From megabits to hundreds of gigabits per second; latency varies with distance and switching

    C3 Wires

    A few pairs or fibres; serial

    C4 Topology

    Switched networks of any size (historically a shared medium, fact S16)

    C5 Who builds each side

    Thousands of vendors; IEEE 802.3; interoperability tested independently (fact S26)

    The preamble and start-of-frame delimiter find the frame; the addresses route it; the CRC-32 at the end decides whether it is kept or silently dropped.

    Ethernet's answers to the fifteen questions

    Each answer links to the lesson that explains the idea behind it.

    #

    Question

    Answer

    1

    When is the data valid?

    Clock embedded in the data and recovered; high-speed PHYs use 64b/66b blocks and scrambling (facts S9, S13) (1.4)

    2

    Where does a message start and end?

    Preamble and start-of-frame delimiter, then the frame, ended by the FCS and an interframe gap (facts S5, S10) (2.2)

    3

    Is the receiver ready?

    No per-frame handshake: senders transmit, receivers accept or drop (3.1)

    4

    How much may I send before I hear back?

    Lossy by default: full buffers drop frames. Optional PAUSE (802.3x) and priority flow control (802.1Qbb) make links lossless when enabled (facts S24, T12) (4.12)

    5

    What exactly is being asked?

    Frames, not requests: meaning and any request/response belong to higher layers (0.7)

    6

    How many requests can be in flight?

    Many frames in flight across the network; end-to-end windows (TCP) limit how many (fact T7) (4.9)

    7

    In what order do results become visible?

    In order on a single link; across a network, ordering and delivery are restored end to end by higher layers (7.2)

    8

    Who gets the wire?

    Switched full duplex today; classic shared Ethernet used CSMA/CD (fact S16) (8.1)

    9

    Why can it hang?

    Dropping frames prevents buffer deadlock; enabling PFC brings back pause storms and deadlock risk in large fabrics (fact T12) (9.6)

    10

    What if bits go wrong?

    CRC-32 detects errors and the frame is dropped; FEC corrects on high-speed lanes; retransmission is end to end (facts S5, S7, S17) (10.14)

    11

    How do the two sides agree at start-up?

    Auto-negotiation selects the highest common mode; backplanes also train equalisation (fact S26) (11.5)

    12

    How do we save power without losing data?

    Energy-Efficient Ethernet's Low Power Idle (fact S18) (12.2)

    13

    What if there are several copies of one value?

    Not applicable

    14

    Who is allowed to ask?

    MACsec encrypts and authenticates frames hop by hop (fact S20) (14.4)

    15

    How do we know it is correct?

    IEEE 802.3 conformance plus independent interoperability testing (fact S26) (15.8)

    The choices that define Ethernet

    • Lossy by design: drop on error, drop on congestion, and let the end points recover (the end-to-end argument, lesson 0.7).

    • Detection without correction at the frame level: a CRC-32 decides keep or drop; FEC appears only where the raw error rate demands it.

    • Losslessness as an option: PAUSE and PFC exist for traffic, such as RDMA, that cannot tolerate drops, at the cost of congestion spreading.

    What breaks

    A data-centre network (illustrative) enabled priority flow control to carry RDMA traffic without drops. A misbehaving server stopped draining its receive queue and kept sending PAUSE frames; pauses propagated switch by switch until large parts of the fabric stopped for that priority. Watchdogs that disable PFC on a port that pauses for too long, and careful limits on which traffic is lossless, contained it.

    Why this matters

    Senior lens. Ethernet is the clearest example of the end-to-end argument in hardware: the link does only what must be done per hop (framing, CRC, FEC) and leaves delivery guarantees to the end points. When a system needs losslessness on Ethernet, it buys it with flow control that spreads congestion; weigh that against designing the end points to tolerate loss.

    Interview

    Asked: "Ethernet drops frames. How do applications get reliable delivery?"

    Weak answer: Ethernet retries them.

    Strong answer: At the Ethernet layer, a frame with a bad CRC or no buffer space is simply dropped and nothing is reported. Reliability is end to end: TCP numbers bytes, acknowledges them, retransmits on loss and controls its window, so the network can stay simple and lossy. Where loss is unacceptable, as for RDMA over Ethernet, links are made lossless with priority flow control, which pauses a priority instead of dropping, at the risk of congestion spreading and pause storms.

    Follow-ups: (1) Why not retransmit at every hop like PCIe? (2) What goes wrong with PFC at scale?

    Check yourself Why does Ethernet not need link-level replay the way PCI Express does?

    It is designed to be lossy and relies on end-to-end recovery; occasional drops are acceptable to the layers above.

    Check yourself What does an Ethernet receiver do with a frame whose FCS fails?

    Drops it, usually counting the error; nothing is sent back.

    Key takeaways

    • Ethernet is lossy by design: bad or unbufferable frames are dropped, recovery is end to end.

    • Frames are found by preamble and SFD and checked by CRC-32; FEC on high-speed lanes.

    • PAUSE and PFC make links lossless when needed, at the cost of spreading congestion.

    Keep going

    Next: Lesson 16.13, USB. A host that schedules everything, and devices that speak only when asked.

    Related topics

    • Part 16 overview: Protocols Dissected

    Previous

    218 / 234

    Next: USB

    Up next

    Up nextUSB

    Sign in to save progress

    Practice this lessonReport an error

    See also

    • How to Dissect a Protocol
    • UART
    • SPI