ROSE II for updating additive link state information

Many works have been reported to address the issue of updating link state information in order to effectively facilitate Quality-of-Service (QoS) routing. However, most of them, if not all, only consider concave metrics, e.g., bandwidth. In this paper, we first observe that due to the inherently different nature of additive and concave QoS metrics, directly applying existing link state update policies cannot provide satisfactory performance. As such, it is essential to consider the additive metrics of link state update for the purpose of reducing the protocol overhead and improving the accuracy of link state information. By applying the central limit theorem, the additive QoS constraint imposed on each link can be modeled as a normal random variable. Then, based on our previous proposal, ROSE, we present a high performance link state update policy, ROSE II. Via theoretical analysis and extensive simulations, we show that ROSE II greatly outperforms the state of the arts in terms of protocol overhead and the accuracy of the link state information for additive metrics.