A Comparative Study of QoS Routing Schemes That Tolerate Imprecise State Information
In large networks, maintaining precise global network state information is almost impossible. Many factors, including no negligible propagation delay, infrequent link state update due to overhead concerns, link state update policy, resource reservation, and hierarchical topology aggregation, have impacts on the precision of the global network state information. To achieve efficient Quality of Service (QoS) routing, a practical routing algorithm must be able to make effective routing decisions in the presence of imprecise global network state information. This paper compare five QoS routing algorithms that were proposed to tolerate imprecise global network state information, safety-based routing, randomized routing, multi-path routing, localized routing, and static multi-path routing.