autorouting

Autorouting is the automatic generation of physical or logical routes by software, according to a set of constraints and objectives. It is commonly used in electronic design automation for printed circuit boards and, in a broader sense, in networking and routing systems to plan data paths.

In PCB design, autorouting converts a netlist and component placement into copper traces arranged on one or more layers. The tool must respect clearance, track width, impedance targets, thermal considerations, and manufacturing rules. Routing algorithms include maze routing, shortest-path approaches, and Steiner-tree methods, often combined with heuristics to reduce vias and overall length. The outcome is a tentative routing that downstream designers refine manually, adding layers, vias, and tune-ups. Design rule checks and electrical constraints are used to validate the result.

In networking and related domains, autorouting describes automatic path selection and reconfiguration of data routes. In traditional networks, routing protocols such as OSPF or BGP perform automatic route computation, while in software-defined networking and SD-WAN contexts, control planes dynamically adjust paths to balance load and respond to failures. Autorouting in this sense aims to optimize metrics such as latency, bandwidth, or reliability but can introduce suboptimal or unstable paths if configurations or policies conflict.

Overall, autorouting provides speed and repeatability for complex layouts, but is typically used in conjunction with manual review and adjustment to ensure adherence to design goals, aesthetics, and manufacturability.