ABSTRACT
This chapter describes the algorithms that are organized around the research of Fultz, who consolidated an excellent taxonomy for classifying network routing algorithms. The transition from topological classifications to routing algorithms is easily understood, since there is a noticeable overlap between classifying networks according to the type of routing algorithms used and according to their topological structure. Deterministic algorithms derive routes according to some prespecified rule that is generally designed to optimize a particular topological configuration. The simplest of all deterministic routine algorithms, and perhaps of all routing algorithms, is flooding. Fixed routing techniques, another category of deterministic routing, assume the existence of fixed topologies and known traffic patterns. Split-traffic routing, sometimes referred to as traffic bifurcation, allows traffic to flow on more than one path between a given source and destination. Stochastic algorithms operate as probabilistic decision rules as opposed to deterministic rules. Random routing algorithms assume that each node knows only its own identity.
