DYNAMIC ROUTING.

0Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Dynamic Routing exploits the intelligence of digital switches by connecting all the software-controlled machines in a network to a central mini-computer, then letting the minicomputer calculate the best alternative routes for the calls offered to each possible destination from each intelligent switch, using data supplied every few seconds by the intelligent switches. This traffic routing strategy allows more efficient use of trunk capacity than can be achieved with fixed alternate routing, adapts quickly to unexpected shifts in the distribution of offered traffic, and increases network survivability in the event of transmission or switching equipment failures.

Cite

CITATION STYLE

APA

Cameron, H. (1981). DYNAMIC ROUTING. Telesis Ottawa, 8(4), 30–34. https://doi.org/10.1007/978-981-19-3029-4_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free