Link State Update Policies for Quality of Service Routing
Bojan Leković, Piet Van Mieghem · 2001
Quality of service (QoS) routing provides increased network utilization compared to the classical best-effort routing. However, effective QoS routing algorithms require frequent distribution of the link state information, which can impose a significant burden on the network resources. In this paper we investigate the triggering link state update policies with respect to the performance measures: link blocking, update error and average time between successive updates. In order to limit the excessive number of link state advertisement messages (LSA) we use two concepts: hold-down timer and moving average filtering. Using simulations, based on the topology independent “local view” simulation model, we compare the triggering link state update policies under both concepts. Our results show that the moving average outperforms the widely accepted hold-down timer concept.