Study guide

16.3 Network Performance: Bandwidth, Latency, Load, and Estimating Needs

Praxis Computer Science 5652

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Praxis 5652 Exam Overview and ETS Pseudocode

1.1 Praxis 5652 Test Facts, Scoring, and Registration 1.2 Official ETS Pseudocode Notation and Tracing Strategy

2 Chapter 2: Impacts of Computing: Innovation, Access, and Effects

2.1 Computing for Creativity, Problem Solving, Communication, and Innovation 2.2 Equal Access, the Digital Divide, and Accessibility 2.3 Beneficial and Harmful Effects of Computing Innovations

3 Chapter 3: Impacts of Computing: Intellectual Property, Ethics, Privacy, and Security

3.1 Intellectual Property: Copyright, Open Source, and Creative Commons 3.2 Ethical and Unethical Computing Practices and Their Implications 3.3 Privacy, Security, Data Collection, and Local vs. Cloud Storage

4 Chapter 4: Algorithms and Computational Thinking: Abstraction, Decomposition, Number Bases, and Representation

4.1 Abstraction and Abstraction Hierarchies 4.2 Decomposition, Pattern Recognition, and Developing Algorithms 4.3 Number Bases: Binary, Octal, Decimal, and Hexadecimal 4.4 Algorithm Formats: Natural Language, Flowcharts, Pseudocode, and Tracing

5 Chapter 5: Algorithms: Efficiency, Limits of Computing, and Randomization

5.1 Algorithm Efficiency: Linear, Quadratic, Exponential, and Logarithmic Growth 5.2 Limits of Computing: Unsolvable Problems, Intractability, and Heuristics 5.3 Randomization, Random vs. Pseudorandom Numbers, and Scaling to a Range

6 Chapter 6: Algorithms: Searching, Sorting, and Recursion

6.1 Searching Algorithms: Linear Search and Binary Search 6.2 Sorting Algorithms: Tracing, Comparisons, Correctness, and Efficiency 6.3 Recursion: Base Cases, Tracing, Errors, and Iterative Equivalents

7 Chapter 7: Programming: Variables, Data Types, Strings, and Expressions

7.1 Variables, Data Types, and Type Conversion 7.2 Strings and String Operations 7.3 Operators, Precedence, Expressions, and Formulas 7.4 Boolean Expressions, Truth Tables, and Boolean Algebra

8 Chapter 8: Programming: Selection, Iteration, and Writing Code

8.1 Sequence and Selection: if, else, Chained and Nested Conditions 8.2 Iteration: for, while, do … while, and repeat … until Loops 8.3 Reading, Completing, and Modifying Code

9 Chapter 9: Programming: Procedures, Arrays, and Data Structures

9.1 Procedures, Parameters, Return Values, Nested Calls, and Scope 9.2 Arrays, Lists, and Two-Dimensional Arrays 9.3 Stacks, Queues, and Dictionaries (Maps)

10 Chapter 10: Programming: Correctness, Errors, Testing, and Code Quality

10.1 Program Correctness: Preconditions, Postconditions, Invariants, and Testing vs. Proof 10.2 Error Types and Debugging Techniques 10.3 Choosing Useful Test Cases: Boundaries, Partitions, Coverage, and Regression 10.4 Extensibility, Modifiability, and Reusability: Constants and Parameterization 10.5 Documentation, Code Reviews, Peer Feedback, and End-User Feedback

11 Chapter 11: Programming: Events, Usability, Input Validation, and APIs

11.1 Event-Driven Programming, Asynchronous Events, and Concurrency 11.2 Usability, Meaningful Error Messages, and Input Validation vs. Verification 11.3 Libraries and APIs: Reading Definitions, Making Calls, and Weighing Trade-offs

12 Chapter 12: Programming: Languages, Tools, Paradigms, and Object-Oriented Design

12.1 Low- and High-Level Languages, Compilers and Interpreters, and IDEs 12.2 Programming Paradigms: Procedural, Object-Oriented, and Others 12.3 Classes, Objects, Instance Variables, Methods, and Encapsulation 12.4 Inheritance, Polymorphism, and Overloading vs. Overriding

13 Chapter 13: Data: Bits, Encoding, Compression, and Encryption

13.1 Bits and Bytes: Why Binary, Storage Calculations, and Signed Integers 13.2 Encoding Text, Images, and Sound 13.3 Lossless and Lossy Compression: Run-Length Encoding, Huffman Coding, and Media Formats 13.4 Encoding vs. Encryption, Symmetric and Public-Key Encryption, and Their Trade-offs

14 Chapter 14: Data: Analysis Tools, Simulation, Storage, and Collection

14.1 Analyzing Data with Spreadsheets: Cleaning, Transforming, and Visualizing 14.2 Simulation and Modeling 14.3 Files, Databases, and Storage Requirements: Scale, Redundancy, and Backup 14.4 Collecting, Aggregating, and Generating Data: Public Data Sets, Surveys, Sensors, and Crowdsourcing

15 Chapter 15: Computing Systems: Hardware, Operating Systems, and Computing Environments

15.1 Hardware Components and the Fetch–Decode–Execute Cycle 15.2 Operating Systems, Software Components, and Resource Issues 15.3 Embedded Systems, the Internet of Things, and Types of Computing Systems 15.4 Local, Network, and Cloud Computing and Storage; How Binary Data Are Stored

16 Chapter 16: Networks, the Internet, the Web, and Cybersecurity

16.1 Network Types and Wired and Wireless Communication 16.2 Network Hardware and Layered Network Models (OSI and TCP/IP) 16.3 Network Performance: Bandwidth, Latency, Load, and Estimating Needs 16.4 How the Internet Works: Protocols, IP Addressing, DNS, URLs, and Reliability 16.5 The Web: HTTP, HTML and Markup Languages, Browsers, Servers, and Clients 16.6 Cybersecurity: The Five Pillars, Strong Passwords, Security Strategies, and Trade-offs

16.3 Network Performance: Bandwidth, Latency, Load, and Estimating Needs

Key Takeaways Explain This Topic AI

Bandwidth is the maximum data rate of a connection, usually in bits per second (Mbps, Gbps); throughput is the rate actually achieved.

Latency is the delay for data to travel from sender to receiver, usually measured in milliseconds; it matters most for real-time uses such as video calls and online games.

Load is the amount of traffic on a network or server; as load approaches capacity, queues form, so latency rises and throughput per user falls.

To estimate bandwidth, multiply the rate per user by the number of simultaneous users: 30 students streaming at 5 Mbps need about 150 Mbps.

Data size = bit rate × time: a 2-hour stream at 4 Mbps is 4 × 7,200 = 28,800 megabits, or 3,600 megabytes (about 3.6 GB).

Last updated: September 2026

What this competency asks

ETS asks you to be familiar with factors that have an impact on network functionality :

Define basic terminology (for example, bandwidth, load, latency ).

Estimate the necessary bandwidth and data size for a given situation.

Identify critical resources for a given situation.

Key terms

  • Term Meaning Unit Analogy
  • Bandwidth Maximum data rate a link can carry bits per second (kbps, Mbps, Gbps) Number of lanes on a highway
  • Throughput Data rate actually achieved bits per second Cars that actually get through per minute
  • Latency Time for data to travel from source to destination milliseconds (ms) Travel time for one car
  • Round-trip time (RTT) Time to send a request and receive the reply, often measured by ping ms There and back
  • Load Amount of traffic, or demand, on a link or server Utilization, such as 80% How crowded the highway is
  • Jitter Variation in latency from packet to packet ms Travel times that are unpredictable
  • Packet loss Share of packets that never arrive % Cars that never make it

Bandwidth and latency are different. A satellite link can have high bandwidth, so large downloads go quickly once they start, but high latency, so every click waits. A connection can also have low latency with little bandwidth.

Where latency comes from

Propagation delay: signals travel at a finite speed. Light in fiber covers roughly 200 km per millisecond, so crossing a continent and back takes tens of milliseconds. Geostationary satellites add hundreds of milliseconds.

Transmission delay: the time to push all of a packet's bits onto the link. It is shorter with more bandwidth.

Queuing delay: time spent waiting in router buffers. It grows with load .

Processing delay: time for devices to examine and forward packets.

How load affects performance

As traffic approaches a link's capacity, packets wait in queues, so latency rises . Each user's throughput falls because users share the bandwidth. If buffers overflow, packets are dropped . That is why video buffers at 8 p.m., when everyone is streaming.

Estimating bandwidth

Total bandwidth ≈ bandwidth per user × number of simultaneous users (plus headroom).

  • Situation Estimate
  • 30 students each stream video at 5 Mbps 30 × 5 = 150 Mbps
  • 25 students on video calls at 2 Mbps each, both directions About 50 Mbps down and 50 Mbps up
  • A teacher livestreams to parents at 6 Mbps At least 6 Mbps of upload bandwidth

Leave headroom, often 20–30%, because other traffic shares the link and real throughput is below the advertised bandwidth. If the school's connection is 100 Mbps, the first scenario will not work well. That link is the bottleneck .

Estimating data size and transfer time

Data size = bit rate × time. Transfer time = data size ÷ throughput. Convert bytes to bits by multiplying by 8.

Example 1: A 2-hour lecture streams at 4 Mbps.

4 Mb/s × 7,200 s = 28,800 megabits. Dividing by 8 gives 3,600 MB, or about 3.6 GB .

Example 2: A 500 MB software update over a 50 Mbps connection.

500 MB × 8 = 4,000 megabits. 4,000 ÷ 50 = 80 seconds at best.

Example 3: A school backs up 2 TB of data nightly over a 1 Gbps link.

2 TB = 2,000,000 MB = 16,000,000 megabits. 16,000,000 ÷ 1,000 Mbps = 16,000 seconds, about 4.4 hours , at full speed with nothing else on the link.

Identifying critical resources

Different uses depend on different resources. Find the one that limits the task.

  • Use Critical resource(s) Why
  • Streaming high-definition video Download bandwidth Sustained high data rate
  • Video conferencing Latency, jitter, and upload bandwidth Real-time, two-way communication
  • Competitive online gaming Low latency and low jitter Small messages, but every millisecond of delay matters
  • Uploading a large video or nightly backups Upload bandwidth and time Large volume sent from the site
  • Sending an email Little of anything Small data; delays of seconds are acceptable
  • Remote surgery or robot control Very low latency and high reliability Delays or dropped packets are dangerous
  • A website expecting a traffic spike Server capacity and bandwidth at the server Load concentrates at one point
  • Online payments Reliability and security Transactions must complete correctly

Bottleneck thinking: throughput is limited by the slowest link on the path. That might be the Wi-Fi in the room, the school's Internet connection, or the server itself. Upgrading any other part does not help.

Improving performance

Add bandwidth where the bottleneck is, or reduce demand, for example with lower video resolution.

Reduce latency: use wired connections, serve content from nearby content delivery networks (CDNs) , and avoid satellite links for interactive uses.

Manage load: schedule backups and updates overnight, and use quality of service (QoS) settings to prioritize video calls over downloads.

Cache frequently used content locally.