Adaptive routing in Burroughs network architecture

  • Authors:
  • J. L. Rosenberg;S. A. Gruchevsky;D. M. Piscitello

  • Affiliations:
  • Unisys Corporation, Southeastern, PA;Unisys Corporation, Southeastern, PA;Unisys Corporation, Southeastern, PA

  • Venue:
  • SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

The routing function used for Burroughs Network Architecture (BNA) to determine the best routes for traffic through the network is known as the Burroughs Integrated Adaptive Routing System, or BIAS™1Based on the algorithm devised for the MERIT Computer Network [3], BIAS™ is a decentralized, deterministic system which adapts to changes in network topology automatically. The Current BIAS™ routing architecture incorporates improvements [1] in the original algorithm which significantly reduce the recovery time from failures of nodes or links and is virtually loop-free, even during recovery from those failures.BIAS™ automatically re-determines the best routes for traffic throughout the network in response to the following changes to the network topology:a node (an end system or intermediate system) is added to the network;a node is removed from the network;the cost of transiting a node is changed;a logical link (LAN, leased or switched circuit, X.25 virtual circuit) is added to the network;a link is removed from the network; and/orthe cost of transiting a link is changed.