Zero trust network architecture in Computer Networks - Time & Space Complexity
When analyzing zero trust network architecture, we want to understand how the system's checks and verifications grow as the network size increases.
We ask: How does the effort to verify users and devices change when more devices join the network?
Analyze the time complexity of this simplified verification process in zero trust:
for each device in network:
verify device identity
check device security posture
for each access request from device:
verify user credentials
check access permissions
log access attempt
This code snippet shows how zero trust verifies every device and every access request individually.
Look at what repeats as the network grows:
- Primary operation: Verifying each device and each access request.
- How many times: Once per device, and once per access request from that device.
As the number of devices (n) increases, and each device makes multiple access requests (m), the total checks grow.
| Input Size (devices n) | Approx. Operations (n * m) |
|---|---|
| 10 devices, 5 requests each | 50 checks |
| 100 devices, 5 requests each | 500 checks |
| 1000 devices, 5 requests each | 5000 checks |
Pattern observation: The total verification work grows proportionally with both the number of devices and their requests.
Time Complexity: O(n * m)
This means the time to verify grows directly with the number of devices and how many requests each makes.
[X] Wrong: "Verification time stays the same no matter how many devices or requests there are."
[OK] Correct: Each device and request needs separate checks, so more devices or requests mean more work.
Understanding how zero trust scales helps you explain real network security challenges clearly and confidently.
What if the system cached verification results for devices? How would that change the time complexity?