AI Glossary / Mathematics and optimization / Intermediate

Communication network

Definition

A communication network is a collection of devices connected by links that allow them to exchange information. In an AI system, the exchanged information may include input data, predictions, model parameters, or training updates. The network provides the communication structure through which parts of a distributed system coordinate their work.

What it means

This is an infrastructure concept, distinct from the artificial neural network used as a predictive model. A communication network connects computational participants; a neural network describes mathematical transformations and learned parameters. A neural model can run across several devices connected by a communication network.

The supplied mathematics category is preserved, because graph models help analyze network structure. Systems and infrastructure are also relevant editorial categories. The network may be wired, wireless, local, or geographically distributed, and its logical communication pattern may differ from its physical connections.

How it works

A graph can represent devices as nodes and available communication links as edges. Directed edges distinguish one-way communication; weighted edges can represent quantities such as cost or delay when those meanings are explicitly defined.

A connected route makes communication possible in the graph model, but actual delivery also depends on protocols, available capacity, device operation, and other system conditions. Messages may take several hops, wait in queues, or need retransmission.

For AI workloads, useful properties include bandwidth, latency, reliability, and topology. Bandwidth concerns transfer capacity; latency concerns elapsed delay. A training system may exchange large updates, whereas an interactive inference service may be sensitive to small-message delays. The communication network constrains an algorithm's execution, but it does not specify the algorithm's mathematical update rule or guarantee its convergence.

Three practical examples

1. Distributed training: connect workers that exchange gradients or parameters, and account for communication costs when evaluating the benefit of adding more workers.

2. Federated learning: connect a coordinator and clients that retain local datasets while exchanging permitted model information.

3. AI inference: carry requests from an application to a model service and return responses, with end-to-end delay depending on both communication and computation.

Think of it this way

Think of a road system joining workplaces. The map shows possible routes, while traffic, road capacity, and travel rules affect actual delivery time. A shorter route is not always faster when it is congested.

The analogy does not mean data packets behave exactly like vehicles. Digital networks can divide messages, use different protocols, and retransmit information. The graph is an abstraction, so its edges must be interpreted before conclusions about performance are drawn.

Worked example

Consider four clients sending one model update each to a coordinator. Each update contains 5 million parameters, stored as 4 bytes per parameter. Ignoring metadata and compression, each client sends 20 million bytes, or 20 MB using decimal units.

The four updates total 80 MB. If a single shared coordinator link receives them at an effective 10 MB per second, transferring the total requires at least 80/10=8 seconds under the stated idealization. Four simultaneous senders do not create four times the capacity of that shared bottleneck.

If instead each client has a separate effective 10 MB-per-second path and the coordinator can receive all four concurrently at their combined rate, the transfer portion can take 20/10=2 seconds. That alternative depends on the aggregate receiving capacity and absence of another shared bottleneck.

Both calculations omit computation, protocol overhead, queueing, and startup delays. A nominal rate stated in megabits per second must also be converted: eight bits make one byte. The example is a capacity calculation, not a measured benchmark or a guarantee of round completion time.

Illustrative case study

Fictional case: an AI team adds training workers expecting a proportional reduction in processing time. Local computation becomes faster, but workers spend longer waiting for updates to pass through one shared link.

The team measures transfer volumes and synchronization delays, then compares changes to update frequency, placement, and communication design. It evaluates whether reduced communication affects learning quality before selecting an approach. The investigation shows why more compute alone may not improve a distributed workload when its communication requirements remain unchanged.

Common misconceptions and mistakes

Do not confuse a communication network with a neural network. Do not equate high bandwidth with low latency: a large transfer rate does not remove propagation, queueing, or processing delays.

A graph path does not guarantee continuous service or secure delivery. Similarly, encrypted links do not determine whether an application is permitted to share a particular dataset. Finally, the logical topology of a learning algorithm can differ from the physical routes through switches, routers, and other infrastructure.

Business use

Network design affects AI service responsiveness, training duration, operating costs, and resilience. Teams should understand what information crosses which connections and how the workload behaves when a participant or link becomes unavailable.

Useful evaluation combines realistic message sizes, client counts, timing requirements, and failure conditions. Measure the full workflow rather than inferring it from a connection's advertised rate. For distributed projects, ownership of connectivity and operational monitoring should be explicit alongside ownership of the model and data pipeline.

People also ask

Is a communication network the same as a neural network?

No. One connects devices for information exchange; the other is a computational model.

Does more bandwidth always make an AI service faster?

No. Computation, latency, synchronization, or another bottleneck may dominate the response time.

Can a network be represented mathematically?

Yes. Graphs represent participants and connections, with additional assumptions needed to model delays, capacity, and failures.

Check your understanding

Three clients each send 12 MB through one shared 6 MB-per-second receiving link. What ideal transfer-time lower bound follows?

Answer: The total is 36 MB, so at least 36/6=6 seconds is required for transfer under the stated capacity model. Overheads or other delays can increase the time.

Related terms

  • Latency
  • Message passing
  • Federated learning
  • Distributed system
  • graph topology
  • bandwidth
  • model update
  • network bottleneck

Learn next

distinguish physical connections from logical communication patterns, then compare bandwidth and latency using realistic message sizes. Study how synchronization and shared bottlenecks affect distributed training before interpreting compute-only performance estimates.

  • Latency

More in Mathematics and optimization

  • Absolute error loss - Absolute error loss measures a numerical prediction's error as the absolute difference between its predicted and reference values: L(y,y-hat)=|y-y-hat|.
  • Active-set method - An active-set method is an optimization approach that works with a changing subset of constraints believed to be tight at the solution.
  • Adjoint state method - The adjoint state method computes how a chosen objective changes when the parameters of a mathematical model change.
  • Σ-algebra
  • Algebraic connectivity - Algebraic connectivity is the second-smallest eigenvalue of a graph's Laplacian matrix.
  • Algorithm IMED - Algorithm IMED, short for Indexed Minimum Empirical Divergence, is a method for choosing actions in a stochastic multi-armed bandit problem.

Sources

Aalto Dictionary of Machine Learning, communication network, federated learning system, and message passing entries: https://aaltodictionaryofml.github.io/ADictML_Main.pdf . Relevant definitions were read. Scope is device communication infrastructure. Transfer calculations and the fictional bottleneck investigation are original, explicitly idealized examples.

Previous: Communication-avoiding algorithm Next: Community cloud

  • Home
  • Daily AI Updates
  • Blog
  • AIFBL Academy
  • AI Glossary
  • Products and Tools
  • Store
  • Free CFO AI Prompt Pack
  • About Shihan Sheriff
  • Privacy Policy
  • Terms of Use
  • Refund Policy
  • Cookie Policy
  • Earnings Disclaimer