The Life Starter
0 of 6 complete0%
Course Library · Lesson 4 of 6
Digital · Guided lesson

Compare transport needs

About 22 minutes · 6 reading + 16 practice and checks
Time includes reading, practice, and questions. Extra videos or further study are optional.
See this course’s project requirements

A labeled network model, packet journey, transport comparison, transfer calculation and evidence-based failure explanations.

Keep your working files in your own notebook or software. Save a private description, checklist, and work link in My Proof.

What to include

  • Labeled two-subnet network model.
  • Name/address/gateway explanation.
  • Packet and hop-limit trace.
  • Transport comparison and unit-checked delay calculation.
  • Two failure-card interpretations with limits.

Review and revise

Use these criteria to check your work and choose what to improve.

  • Device roles and paths are correct.
  • Addresses and prefixes are used consistently.
  • Calculations use stated units and assumptions.
  • Evidence supports the conclusions without live-system claims.
Open the full course project
Want more background?
Before you begin

The idea in everyday life

Follow a fictional library request through two small networks using supplied evidence only.

The idea

Transport behavior supports an application’s needs; no protocol choice removes every tradeoff.

Follow along

Compare transport needs — guided practice

Distinguish reliable ordered delivery from application goals that tolerate loss.

Use network-notes.md or paper. All addresses and outputs are fictional. Room A has laptop A at 192.0.2.10/24, printer P at 192.0.2.20/24 and a switch. Router R has A-side 192.0.2.1/24 and B-side 198.51.100.1/24. Room B has server S at 198.51.100.20/24 and its switch. A uses default gateway 192.0.2.1. A supplied DNS record maps catalog.example to 198.51.100.20. For this /24 exercise, matching first three octets means same subnet. No live network access, capture, scanning or device configuration is needed.

  1. 1. Read two application cards

    Card F: a file must arrive complete in order. Card V: a live position update becomes useless after 100 ms.

    You should see: The applications value different outcomes.

    Requirements come before protocol selection.

  2. 2. Match basic transport

    Write TCP for a reliable ordered byte-stream foundation in F; UDP may be a foundation for time-sensitive V with application rules.

    You should see: You have a reasoned starting point, not a universal prescription.

    Applications can add reliability over UDP; real systems use richer designs.

  3. 3. Sort supplied fragments

    A file’s fragments arrive 2,1,3. Reconstruct 1,2,3 before interpreting it.

    You should see: Arrival order differs from intended order.

    Reliable ordered transport hides some network disorder from applications.

  4. 4. Identify a limit

    Write that successful delivery does not prove the application accepted the content.

    You should see: Transport success and business success are distinct.

    An application may reject perfectly delivered data.

Now change one thing

Fragments arrive with sequence labels 3,1,2. Enter the first label after sorting into intended order.

Your work

What to finish

A two-application transport comparison and order trace.

Common mistake

Watch for this

Claiming UDP is always faster or that every real-time application uses only UDP.

How can I tell I understand it?

Complete the changed case, explain your result, and pass the three application checks.

Try 3 questions

Quick knowledge check

Answer all 3 questions. Get at least 2 right and the lesson completes automatically.

Not yet passed

You’ll get an explanation for each answer. Signed in? Your results save to your account.

1An archive download loses part of its contents. Which requirement is most directly violated?
2A game receives an old position after a newer position. What application concern matters?
3TCP reports delivered bytes. Does that prove a purchase was accepted by the application?
0 of 3 answeredApply the lesson to a short question, then review the explanation.
4
Finish this lesson

Pass the check. We’ll save the progress.

Answer all 3 questions above and get at least 2 right. You can review the explanations and try again.

Go to the knowledge check
Optional course overview video · same video as Lesson 1
CrashCourseComputer Networks: Crash Course Computer Science #28YouTube
Optional course overview

Computer Networks: Crash Course Computer Science #28

From CrashCourse. Watch here or open it on YouTube .

Optional course overview. Follow the written steps below at your own pace.
Tools, templates, and lesson sources

Tools and templates

Tools open in a new tab so you can keep your place here.

Sources and further reading

Explore the references behind this lesson.

Loyola University Chicago: An Overview of Networks
Source & access notes · checked 2026-09-12

Opened and inspected on 2026-09-12: Layers, packets, forwarding and capacity.

Access: Free public web page; no paid enrollment required.

Reuse: BY-NC-ND with additional electronic-use terms; link only, no copied diagrams or adapted book text.

Report a problem with this lesson

Tell us what went wrong. Please leave out personal information and private project contents.

No sign-in needed.