OPC UA modern architecture in SCADA systems - Time & Space Complexity

Time Complexity: OPC UA modern architecture

O(n)

Understanding Time Complexity

We want to understand how the time needed to process data in an OPC UA system changes as the number of devices or data points grows.

How does the system handle more data without slowing down too much?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

// OPC UA server processes data from multiple nodes
function processNodes(nodes) {
  for (let node of nodes) {
    readData(node);
    processData(node);
  }
}

function readData(node) {
  // Simulate reading data from a node
}

function processData(node) {
  // Simulate processing data for a node
}

This code reads and processes data from each node connected to the OPC UA server one by one.

Identify Repeating Operations

Look for loops or repeated actions.

• Primary operation: Looping through each node to read and process data.
• How many times: Once for every node in the input list.

How Execution Grows With Input

As the number of nodes increases, the time to process grows in a straight line.

Input Size (n)	Approx. Operations
10	10 reads + 10 processes = 20 operations
100	100 reads + 100 processes = 200 operations
1000	1000 reads + 1000 processes = 2000 operations

Pattern observation: Doubling the nodes doubles the work needed.

Final Time Complexity

Time Complexity: O(n)

This means the time to handle data grows directly with the number of nodes.

Common Mistake

[X] Wrong: "Processing more nodes takes the same time because the server is fast."

[OK] Correct: Each node adds work, so more nodes always mean more time needed.

Interview Connect

Understanding how processing time grows with data size shows you can design systems that scale well and keep things running smoothly.

Self-Check

"What if the processData function also loops through a list inside each node? How would the time complexity change?"