A randomized QoS routing algorithm on networks with inaccurate link-state information

The quality of network services is directly affected by QoS routing algorithms, and QoS routing algorithms rely heavily on network state information specifying the resource availability at network nodes and links. In practice, the network state information is not always accurate because it does not update in time. This paper proposes a randomized QoS routing algorithm on networks with inaccurate link-state information, and develops a simulation environment. Our algorithm reduces computational cost and protocol overhead. Experimental tests demonstrate that our algorithm performs very well in practice