SettingsRouting algorithms
A* search algorithm
In computer science, A* is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes.
In computer science, A* is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes.
Administrative distance
Administrative distance is the measure used by Cisco routers to select the best path when there are two or more different routes to the same destination from two different routing protocols.
Administrative distance is the measure used by Cisco routers to select the best path when there are two or more different routes to the same destination from two different routing protocols.
Arc routing
Arc routing defines a routing problem regarding the route, not the nodes.
Arc routing defines a routing problem regarding the route, not the nodes.
Augmented Tree-based Routing
Augmented Tree-based Routing protocol, first proposed in Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks, Proc.
Augmented Tree-based Routing protocol, first proposed in Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks, Proc.
Augmented tree-based routing
Augmented rree-based routing protocol, first proposed in Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks, Proc.
Augmented rree-based routing protocol, first proposed in Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks, Proc.
B*
In computer science, B* is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node.
In computer science, B* is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node.
Babel (protocol)
The Babel routing protocol is a distance-vector routing protocol for Internet Protocol packet-switched networks that is designed to be robust and efficient on both wireless mesh networks and wi...
The Babel routing protocol is a distance-vector routing protocol for Internet Protocol packet-switched networks that is designed to be robust and efficient on both wireless mesh networks and wi...
Credit-based fair queuing
Credit-based fair queuing is a computationally efficient alternative to fair queueing.
Credit-based fair queuing is a computationally efficient alternative to fair queueing.
Diffusing update algorithm
DUAL, the Diffusing Update ALgorithm, is the algorithm used by Cisco's EIGRP routing protocol to ensure that a given route is recalculated globally whenever it might cause a ro...
DUAL, the Diffusing Update ALgorithm, is the algorithm used by Cisco's EIGRP routing protocol to ensure that a given route is recalculated globally whenever it might cause a ro...
Dijkstra's algorithm
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a g...
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a g...
Distance-vector routing protocol
In computer communication theory relating to packet-switched networks, a distance-vector routing protocol is one of the two major classes of routing protocols, the other major class being the li...
In computer communication theory relating to packet-switched networks, a distance-vector routing protocol is one of the two major classes of routing protocols, the other major class being the li...
Edge disjoint shortest pair algorithm
Edge disjoint shortest pair algorithm is an algorithm in computer network routing.
Edge disjoint shortest pair algorithm is an algorithm in computer network routing.
Expected Transmission Count
The ETX metric, or Expected Transmission Count, is a measure of the quality of a path between two nodes in a wireless packet data network.
The ETX metric, or Expected Transmission Count, is a measure of the quality of a path between two nodes in a wireless packet data network.
Fairness measure
Fairness measures or metrics are used in network engineering to determine whether users or applications are receiving a fair share of system resources.
Fairness measures or metrics are used in network engineering to determine whether users or applications are receiving a fair share of system resources.
Flooding (computer networking)
Flooding is a simple routing algorithm in which every incoming packet is sent through every outgoing link.
Flooding is a simple routing algorithm in which every incoming packet is sent through every outgoing link.
Flooding algorithm
A flooding algorithm is an algorithm for distributing material to every part of a connected network.
A flooding algorithm is an algorithm for distributing material to every part of a connected network.
Floyd-Warshall algorithm
In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm) is a graph analysis...
In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm) is a graph analysis...
Floyd–Warshall algorithm
In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm) is a graph analysis...
In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm) is a graph analysis...
Geographic routing
Geographic routing (also called georouting or position-based routing) is a routing principle that relies on geographic position information.
Geographic routing (also called georouting or position-based routing) is a routing principle that relies on geographic position information.
Hierarchical state routing
Hierarchical state routing (HSR), proposed in Scalable Routing Strategies for Ad Hoc Wireless Networks by Iwata et al.
Hierarchical state routing (HSR), proposed in Scalable Routing Strategies for Ad Hoc Wireless Networks by Iwata et al.
IDA*
IDA* is a variant of the A* search algorithm which uses iterative deepening to keep the memory usage lower than in A*.
IDA* is a variant of the A* search algorithm which uses iterative deepening to keep the memory usage lower than in A*.
Link-state routing protocol
A link-state routing protocol is one of the two main classes of routing protocols used in packet switching networks for computer communications (the other is the distance-vector routing protocol).
A link-state routing protocol is one of the two main classes of routing protocols used in packet switching networks for computer communications (the other is the distance-vector routing protocol).
Max-min fairness
In communication networks and multiplexing, a division of the bandwidth resources is said to be max-min fair when: firstly, the minimum data rate that a dataflow achieves is maximized; secondly,...
In communication networks and multiplexing, a division of the bandwidth resources is said to be max-min fair when: firstly, the minimum data rate that a dataflow achieves is maximized; secondly,...
MCOP
Multi-Constrained Optimal Path Selection or MCOP is a network path selection problem.
Multi-Constrained Optimal Path Selection or MCOP is a network path selection problem.
MENTOR routing algorithm
The MENTOR routing algorithm is an algorithm for use in routing of mesh networks, specifically pertaining to their initial topology.
The MENTOR routing algorithm is an algorithm for use in routing of mesh networks, specifically pertaining to their initial topology.
ODMRP
On-Demand Multicast Routing Protocol is a protocol for routing multicast and unicast traffic throughout Ad-hoc wireless mesh networks.
On-Demand Multicast Routing Protocol is a protocol for routing multicast and unicast traffic throughout Ad-hoc wireless mesh networks.
Optimized Link State Routing Protocol
The Optimized Link State Routing Protocol (OLSR) is an IP routing protocol optimized for mobile ad-hoc networks, which can also be used on other wireless ad-hoc networks.
The Optimized Link State Routing Protocol (OLSR) is an IP routing protocol optimized for mobile ad-hoc networks, which can also be used on other wireless ad-hoc networks.
Suurballe's algorithm
In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted directed graph, so that both paths connect t...
In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted directed graph, so that both paths connect t...
Temporally-ordered routing algorithm
The Temporally-Ordered Routing Algorithm (TORA) is an algorithm for routing data across Wireless Mesh Networks or Mobile ad-hoc networks.
The Temporally-Ordered Routing Algorithm (TORA) is an algorithm for routing data across Wireless Mesh Networks or Mobile ad-hoc networks.
Vehicular Reactive Routing protocol
Vehicular Reactive Routing protocol (VRR) is a reactive routing protocol with geographical features which is specifically designed for Wireless Access for the Vehicular Environment (WAVE) standa...
Vehicular Reactive Routing protocol (VRR) is a reactive routing protocol with geographical features which is specifically designed for Wireless Access for the Vehicular Environment (WAVE) standa...
Weighted fair queuing
Weighted fair queuing (WFQ) is a data packet scheduling technique allowing different scheduling priorities to statistically multiplexed data flows.
Weighted fair queuing (WFQ) is a data packet scheduling technique allowing different scheduling priorities to statistically multiplexed data flows.
Wireless Routing Protocol
The Wireless Routing Protocol (WRP) is a proactive unicast routing protocol for mobile ad-hoc networks (MANETs).
The Wireless Routing Protocol (WRP) is a proactive unicast routing protocol for mobile ad-hoc networks (MANETs).