Deterministic routing

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

 This article incorporates public domain material from the General Services Administration document "Federal Standard 1037C".

This article related to telecommunications is a stub. You can help Wikipedia by expanding it.v · Categories: Telecommunications Telecommunications stubs Wikimedia Foundation. 2010. Игры ⚽ Поможем решить контрольную работу Detector (disambiguation) D4 framing standard Look at other dictionaries: Hybrid routing — is the routing of telephone calls in which numbering plans and routing tables are used to permit the collocation, in the same area code, of switches using a deterministic routing scheme with switches using a non deterministic routing scheme, such …   Wikipedia Flood search routing — Flood search routing: In a telephone network, non deterministic routing in which a dialed number received at a switch is transmitted to all switches, i.e., flooded, in the area code directly connected to that switch; if the dialed number is not… …   Wikipedia Equal-cost multi-path routing — ECMP can also stand for Electronic Countermeasure Pod.Equal cost multi path routing (ECMP) is a routing strategy where next hop packet forwarding to a single destination can occur over multiple best paths which tie for top place in routing metric …   Wikipedia Tapestry (DHT) — Tapestry is a distributed hash table which provides a decentralized object location, routing, and multicasting infrastructure for distributed applications. It is composed of a peer to peer overlay network offering efficient, scalable, self… …   Wikipedia IP traceback — is a name given to any method for reliably determining the origin of a packet on the Internet. The datagram nature of the Internet makes it difficult to determine the originating host of a packet – the source id supplied in an IP packet can be… …   Wikipedia IPv6 — Internet protocol suite Application layer BGP DHCP DNS FTP …   Wikipedia List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …   Википедия Reconfigurable computing — is a computer architecture combining some of the flexibility of software with the high performance of hardware by processing with very flexible high speed computing fabrics like field programmable gate arrays (FPGAs). The principal difference… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”