Jump to content

Deterministic routing

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Eastlaw (talk | contribs) at 19:12, 10 March 2009 (attribution tagging and general fixes using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In telecommunications, the term deterministic routing has the following meanings:

1. In a switched network, switching in which the routes between given pairs of nodes are pre-programmed, i.e., are determined, in advance of transmission.

Note: The routes used to complete a given call through a network are identified, in advance of transmission, in routing tables maintained in each switch database. The tables assign the trunks that are to be used to reach each switch code, area code, and International Access Prefix (IAP), usually with one or two alternate routes.

2. In a non-switched network, routing in which the routes between given pairs of nodes are determined in advance.

Note: The routes used to send a given message through a network are identified in advance in routing tables maintained in a database.

References

Public Domain This article incorporates public domain material from Federal Standard 1037C. General Services Administration. Archived from the original on 2022-01-22.