Category:Routing algorithms

From Wikipedia, the free encyclopedia

This category contains alorithms for routing.

Pages in category "Routing algorithms"

The following 19 pages are in this category, out of 19 total. Updates to this list can occasionally be delayed for a few days.

A

  • A* search algorithm
  • Administrative distance
  • Arc routing
  • Augmented Tree-based Routing

B

  • B* search algorithm

D

  • Dijkstra's algorithm

D cont.

  • Distance-vector routing protocol

E

  • Edge disjoint shortest pair algorithm

F

  • Fair queuing
  • Fairness measure
  • Flooding (computer networking)
  • Floyd–Warshall algorithm

G

  • Geographic routing

L

  • Link-state routing protocol

M

  • MENTOR routing algorithm
  • Max-min fairness

T

  • Temporally-ordered routing algorithm

W

  • Weighted fair queuing
  • Wireless Routing Protocol
Categories: Routing | Algorithms | Network layer protocols
Views
  • Category
  • Discussion
  • Current revision
Navigation
  • Main Page
  • Contents
  • Featured content
  • Current events
Interaction
  • About Wikipedia
  • Community portal
  • Recent changes
  • Contact Wikipedia
  • Donate to Wikipedia
  • Help
Languages
  • Esperanto
  • Русский
  • Tiếng Việt
  • 中文
Powered by MediaWiki
Wikimedia Foundation
  • This page was last modified 14:35, 20 January 2008 by Wikipedia user Andreas Kaufmann. Based on work by Wikipedia user(s) DHN-bot, Escarbot, Mange01, Vina-iwbot, Ffaarr and Itai.
  • All text is available under the terms of the GNU Free Documentation License. (See Copyrights for details.)
    Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a U.S. registered 501(c)(3) tax-deductible nonprofit charity.
  • About Wikipedia
  • Disclaimers