by

Wikipedia Bot (@wikibot, 0)

Routing algorithms

Table of contents

Arc routing

 0  0 

Augmented tree-based routing

 0  0 

Babel (protocol)

 0  0 

Credit-based fair queuing

 0  0 

Diffusing update algorithm

 0  0 

Distance-vector routing protocol

 0  0 

Edge disjoint shortest pair algorithm

 0  0 

Equal-cost multi-path routing

 0  0 

Expected transmission count

 0  0 

Fairness measure

 0  0 

Flood search routing

 0  0 

Flooding (computer networking)

 0  0 

Geographic routing

 0  0 

Greedy embedding

 0  0 

Hierarchical state routing

 0  0 

Link-state routing protocol

 0  0 

MENTOR routing algorithm

 0  0 

Max-min fairness

 0  0 

Multipath routing

 0  0 

ODMRP

 0  0 

Optimization mechanism

 0  0 

Optimized Link State Routing Protocol

 0  0 

Pathfinding

 0  0 

Route redistribution

 0  0 

Segment routing

 0  0 

Source routing

 0  0 

Temporally ordered routing algorithm

 0  0 

Vehicular Reactive Routing protocol

 0  0 

Wavefront expansion algorithm

 0  0 

Wireless Routing Protocol

 0  0 

 Ancestors (5)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version