Adaptive routing

from Wikipedia, the free encyclopedia

In network technology, adaptive routing describes the ability of routing algorithms to independently find a new route in order, for example, to bypass a damaged, overloaded or missing network element.

An example of a non-adaptive routing algorithm is static routing. In systems with static routing, the connections are permanently set based on estimates of the expected data volume. If the conditions in the network change at a later point in time - for example due to failure or overloading of a connection element - this can no longer be compensated in these systems.

With adaptive routing, on the other hand, metrics flow into the decision-making process (what is the best route?) At runtime . The routing algorithm reacts to the changed network. The best route can be the shortest, safest or most cost-saving route. Relevant network properties are included in the metrics, such as bandwidth , transmission delay or hop count .

Adaptive routing is implemented in LANs mainly at the router and bridge level. The goal is often to distribute the network load more evenly, i.e. also to include unused branch lines in the data transmission .

Compared to static routing, adaptive routing requires less administrative effort due to the independent information processing. Static routing, on the other hand, is often more stable, which is also due to the fact that the network is additionally loaded with routing information with adaptive routing. A mixed strategy is therefore used in many networks today.

The following network protocols support adaptive routing on OSI layer 3:

  • BGP4 (Border Gateway Protocol),
  • IGRP / EIGRP (Interior Gateway Routing Protocol) / (Enhanced Interior Gateway Routing Protocol),
  • IS-IS (Intermediate System to Intermediate System Protocol),
  • LISP (Locator / Identifier Separation Protocol),
  • OSPF (Open Shortest Path First),
  • RIP (Routing Information Protocol).

At OSI layer 2, protocols such as G.8032 and 802.1D ( Spanning Tree Protocol ) enable alternative paths to be used in the event of an error.

Web link

  • Routing , online resource of the Department of Computer Science, University of Oldenburg

Individual evidence

  1. ^ A b c d Andrew S. Tanenbaum, David J. Wetherall: Computer Networks . 5th edition. 2002, ISBN 978-3-86894-137-1 , pp. 421 f .
  2. cf. Computer networks (Department of Computer Science, University of Oldenburg)
  3. a b cf. Dynamic routing
  4. Routing method - static routing / dynamically adaptive routing
  5. Adaptive Routing