Routing in the PSTN¶
Establish a telephone call by analyzing a called-party number and selecting successive circuit groups through switching and carrier domains, with controlled alternatives for congestion, failure, portability, and service translation.
Core Idea¶
Routing in the public switched telephone network (PSTN) is the call-establishment practice by which a called-party number is interpreted and a succession of switching nodes and circuit groups is selected until the destination network, exchange, and subscriber interface can be reached. The routed object is a call attempt requiring an end-to-end connection; the forwarding resources are trunks or circuit groups between telephone exchanges and carrier interconnects. ITU-T E.170 defines traffic routing as choosing a circuit group for a call attempt or traffic stream at an exchange, with the objective of establishing a successful connection between exchanges.[1]
The called number serves as both identifier and routing input. E.164 structures international public telecommunication numbers for geographic areas, global services, networks, and other scopes, and specifies digit analysis needed for successful routing.[2] A switch analyzes a sufficient leading digit string, applies route and service data, selects an eligible outgoing circuit group, and offers the call. A later switch repeats the operation. If the called line is local, the terminating exchange can complete toward the subscriber; otherwise the call crosses another trunk or carrier boundary.
The practice is not limited to a single shortest-path table. A route set may include direct, alternate, overflow, time-dependent, carrier-selected, or dynamically nominated paths. Availability, congestion, cost, service rules, and downstream state can affect selection. Number portability and nongeographic services may insert a database translation: the public number remains stable while a routing number or serving-network identity directs the actual connection.[3][4]
The invariant is number-conditioned circuit selection toward telephone termination. Physical and software implementations have evolved, but the abstraction remains recognizable wherever PSTN call control interprets telephone numbering and selects bearer-path resources across exchanges and administrative domains.
Structural Signature¶
The pattern has nine mandatory roles:
- Originating call attempt with a calling endpoint and a dialed/called-party number.
- Telephone numbering plan, usually an E.164-compatible national and international structure whose prefixes support digit analysis.
- Routing context, including the current exchange, originating carrier, service class, time, regulatory or commercial policy, and available number translations.
- Route data mapping analyzed digits or translated routing information to one or more outgoing route choices.
- Switching nodes, each capable of call processing and onward offering.
- Circuit groups or trunks joining adjacent switches, possibly across operator interconnect points.[1]
- Route-selection order, such as preferred direct route followed by controlled alternatives.
- Admission state, including circuit availability, reservation threshold, congestion, failure, or management restriction.
- Termination condition, where the destination network/exchange and ultimately the called interface are unambiguously reached.
The processing loop is:
collect sufficient digits → normalize and analyze the number → query translation data if the number does not directly reveal present routing → derive an eligible route set → test preferred circuit group and admission state → seize a circuit or try an allowed alternative → signal the next switch → repeat until termination or return a defined failure treatment.
The identity tolerates centralized route-plan computation and decentralized dynamic choice. It also tolerates packetized transport inside modern carrier cores, provided the operation being described is still PSTN/telephone call routing from number analysis to a selected call path. It does not turn ordinary IP packet forwarding into PSTN routing.
What It Is Not¶
It is not the telephone numbering plan. E.164 supplies address structure and digit-analysis semantics; routing adds topology, route tables, trunks, availability, policy, and successive switch decisions.
It is not SS7 signaling routing. Signaling messages may travel on a logically separate packet network to control call setup. Their routing by point codes or global-title translation is not the same as selecting the bearer circuit path for the call.
It is not IP routing or Voice over IP routing in general. Routers forward packets using network-layer prefixes and protocols; SIP proxies route sessions using URIs and service logic. PSTN interworking can involve both, but this node requires telephone-number analysis tied to telephone call termination and carrier switching resources.
It is not call forwarding. Forwarding is a subscriber/service feature that replaces or supplements the intended destination. Once a new destination number is produced, PSTN routing carries the resulting call.
It is not least-cost routing alone. Cost can rank routes, but network routing also manages success probability, congestion, failure, quality, regulation, interconnect agreements, and resource preservation.
It is not number portability. Portability breaks the former inference from number prefix to serving carrier and supplies routing information; it modifies the routing process without replacing it.
Scope of Application¶
The abstraction covers local, national, and international circuit-switched telephone call routing; routing across multiple carrier networks; fixed and mobile interconnection where public telephone numbering is used; nongeographic and freephone translation; carrier selection; number portability; traffic-engineered direct and alternate routes; and management responses to congestion and failure.
ITU-T separates numbering recommendations, traffic routing, international routing plans, ISDN routing, interconnection between public mobile and fixed networks, and network-management controls into related standards.[5] That division confirms a mature recurring domain rather than one vendor algorithm.
Dynamic Alternative Routing (DAR) illustrates a specialized branch. A call first attempts a direct route; if blocked, it tries a currently nominated two-link alternative. When that alternative fails, a new tandem is selected. The method uses limited local load information, and trunk reservation protects direct traffic from excessive indirect overflow. Cambridge researchers document its deployment in British Telecom's trunk network and its purpose of improving robustness and network utilization.[6][7]
Modern networks may emulate circuits or translate E.164 numbers into other routable identifiers. The scope line is functional: when the system is selecting telephone call routes and terminations from public-number semantics, this abstraction applies; when it is merely routing the underlying packets, a packet-routing abstraction applies.
Clarity¶
The first diagnostic asks: what is being forwarded and what selects the next hop? If an individual packet and IP prefix select a router interface, the case is packet routing. If a call attempt and called-number/service analysis select a circuit group, trunk, carrier, or telephone serving node, it is PSTN routing.
The second asks whether a number is identifying, addressing, or routing at that stage. A portable E.164 number identifies the subscriber service but may no longer directly identify the serving network. A database query returns a routing number or network identity without changing what the caller dialed.[3] Keeping these roles separate prevents the prefix from being treated as a permanent physical locator.
Finally, route choice and circuit choice differ. E.170 treats routing as selection of a circuit group; choosing an individual free circuit within that group is a subordinate switching operation.[1]
Manages Complexity¶
The PSTN joins huge numbers of endpoints without a full mesh of direct physical links. Hierarchical and service-aware number analysis compresses destination knowledge: a switch need not store one route per subscriber when a prefix, carrier, or service class can share treatment. Route groups compress multiple physical circuits into one selectable capacity pool.
Alternative routing handles uncertain demand and failures without requiring global recomputation for every call. Trunk reservation prevents an indirect call from consuming the last capacity on links needed by their direct traffic. Database translation isolates user-facing number stability from network rearrangement. Interconnect route policies allow independent carriers to cooperate without exposing all internal topology.
Abstract Reasoning¶
The signature supports several predictions:
- More specific digit matches must override broader prefix routes when both apply, or exceptional destinations will follow generic paths.
- Portability makes prefix-only routing incomplete; a serving-network lookup or routing-number mechanism is required where number ownership has moved.
- Unrestricted alternate routing can reduce total carried traffic because one indirect call consumes multiple trunk groups and can displace several direct calls. Reservation or bounded path length protects scarce capacity.[7]
- Mutual overflow plans can create instability or circular attempts; alternatives require loop prevention and finite attempt ordering.
- A direct route can be preferred even when an indirect path exists because it uses fewer scarce circuit resources and reduces exposure to intermediate failure.
- A route-plan error often affects a prefix or service class systematically, while a circuit failure affects the subset whose alternatives are exhausted.
These deductions operate at call-routing level. They do not imply how the separate signaling network or packet transport will route its own messages.
Knowledge Transfer¶
Within telephony, the identity transfers literally among national routing plans, carrier interconnects, mobile-fixed gateways, freephone services, portability arrangements, and legacy-to-next-generation interworking. The particular route key can shift from geographic prefix to database-derived routing number while the core loop remains.
The structural skeleton transfers more broadly as prime:network_traversal: resolve a destination, select an admissible next edge, respond to unavailable edges, and continue toward termination. Failover, Load Balancing, Address Resolution, and Resource Pooling are also portable. Telephone numbers, circuit groups, seizure, call blocking, interconnect settlements, and E.164 service logic do not transfer literally; they justify the domain-specific node.
Examples¶
Ordinary geographic call. An originating exchange receives an E.164 national number. Digit analysis selects a route group toward the destination area or carrier. Intermediate switches continue based on their route data. The terminating exchange recognizes the subscriber as local and completes toward the line. The called number, not the caller's return path, drives the sequence.
Ported number. A customer keeps the same public number after changing provider. Prefix analysis first reaches or queries a node able to obtain routing information. The returned routing number identifies the recipient network or exchange, after which the call continues there. ITU's portability supplement distinguishes normal routing toward a serving exchange from subsequent routing using obtained routing numbers.[3]
Freephone call. A nongeographic number cannot be routed solely as a location prefix. Intelligent Network service logic queries data that translate the dialed service number into a treatment or routable destination; the switch then applies ordinary route selection. ITU describes the Intelligent Network as supporting 800-number translation, portability, forwarding, and related services.[4]
Dynamic alternative route. A direct London–Manchester circuit group is full. The origin tries a nominated two-link route through a tandem exchange, subject to reservation thresholds on both links. If the attempt fails, a different tandem becomes the nomination for a future blocked call. This adapts to load with limited local information.[6]
Structural Tensions¶
Efficiency versus resilience. Direct routes minimize circuit use, while alternatives keep calls completing under load or failure. Diagnostic: does overflow improve completion without consuming capacity needed for direct calls?
Stable public number versus changing network location. Portability and service numbers preserve caller-facing identity while destroying simple prefix locality. Diagnostic: which translation makes the stable number routable now?
Central optimization versus local adaptation. Central plans coordinate topology and policy, while local dynamic algorithms react faster to transient state. Diagnostic: which information must be globally consistent and which decision can safely use local load?
Revenue cost versus technical quality. Least-cost choices can conflict with delay, reliability, regulation, and interconnect obligations. Diagnostic: is the route ranking optimizing the declared service objective or only settlement price?
Overflow freedom versus network protection. More alternatives appear to increase success but can cause long paths, mutual overflow, or congestion collapse. Diagnostic: are path length, attempt count, loops, and trunk reservation bounded?
Structural–Framed Character¶
PSTN routing is mixed-structural. Its graph traversal, prefix matching, resource admission, fallback, and termination roles are formally clear and recur across operators. The behavior is non-evaluative: a call either follows an eligible route or does not.
Its operational identity nevertheless depends on instituted numbering plans, carrier boundaries, tariff and regulatory policies, switch standards, service databases, and circuit-switching vocabulary. Remove those features and only generic network traversal remains. This makes the node strongly structured within telecommunications but not a prime.
Structural Core vs. Domain Accent¶
The skeletal core is destination-directed Network Traversal under capacity constraints: resolve an address, choose the next eligible edge, handle failure or congestion, and stop at the destination. Failover and Resource Pooling explain important variants.
The domain accent is substantial: E.164 digits, called-party semantics, exchanges, circuit groups, seizure and blocking, carrier interconnects, number portability, Intelligent Network translation, trunk reservation, and end-to-end telephone call setup. This residual recurs across real telephone networks and supports distinctive reasoning. It clears the domain-specific bar. The cross-domain part is already carried by Network Traversal, so prime promotion fails.
Instantiates / Related Primes¶
Routing in the PSTN instantiates prime:network_traversal: successive switching nodes choose eligible edges toward a resolved destination. The minimal proposal-only DAG parent is Network Traversal by strict subsumption.
Address Resolution is related where numbers are translated into serving-network routes. Failover and Load Balancing describe alternative selection; Resource Pooling describes the capacity benefit of multiple paths; Hierarchy explains prefix aggregation. Return Path is not a parent because PSTN routing is destination-forward and does not require a response path.
Relationships to Other Abstractions¶
Current abstraction Routing in the PSTN Domain-specific
Parents (1) — more general patterns this builds on
-
Routing in the PSTN is a kind of Network Traversal Prime
Routing in the PSTN instantiates
prime:network_traversal: successive switching nodes choose eligible edges toward a resolved destination.The minimal proposal-only DAG parent is Network Traversal by strict subsumption. Address Resolution is related where numbers are translated into serving-network routes. Failover and Load Balancing describe alternative selection; Resource Pooling describes the capacity benefit of multiple paths; Hierarchy explains prefix aggregation. Return Path is not a parent because PSTN routing is destination-forward and does not require a response path.
Hierarchy path (1) — routes to 1 parentless root
- Routing in the PSTN → Network Traversal → Network → Reservoir-Flux Network → Conservation Laws → Invariance
Neighborhood in Abstraction Space¶
Routing in the PSTN sits in a sparse region of the domain-specific corpus (93rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Administrative Distance — 0.79
- Tier 1 Network — 0.79
- BCMP network — 0.78
- Network scheduler — 0.77
- Complete Streets — 0.77
Computed from structural-signature embeddings · 2026-09-08
Not to Be Confused With¶
- Telephone numbering plan: address structure and allocation, not path selection.
- SS7 signaling routing: packet/message routing in the control network.
- IP routing: per-packet next-hop forwarding by network-layer addresses.
- SIP routing: session signaling by SIP URIs and proxy rules, although it may interwork with E.164.
- Call forwarding: a service that substitutes another destination before or during routing.
- Number portability: identity preservation and routing-data translation for moved numbers.
- Least-cost routing: one route-ranking policy rather than the whole network practice.
- Carrier selection: user or policy choice of provider, one input to route selection.
- Return Path: routing back toward a source, not called-number-conditioned setup toward termination.
References¶
[1] ITU-T, Recommendation E.170, “Traffic routing”, 1992. registry ↩a ↩b ↩c
[2] ITU-T, Recommendation E.164, “The international public telecommunication numbering plan”, current edition 2026. registry ↩
[3] ITU-T, E.164 Supplement 2, “Number Portability”, 1998. registry ↩a ↩b ↩c
[4] ITU-T, “Intelligent networks”. registry ↩a ↩b
[5] ITU-T, E-series Recommendations index, including E.170–E.173 routing plans. registry ↩
[6] R. J. Gibbens, F. P. Kelly, and P. B. Key, “Dynamic Alternative Routing”, in Routing in Communication Networks, 1995. registry ↩a ↩b
[7] R. J. Gibbens and F. P. Kelly, “Dynamic routing in fully connected networks”, IMA Journal of Mathematical Control and Information 7 (1990), 77–111. registry ↩a ↩b