State dependent routing for multirate loss networks

An approach to adaptive routing in multirate networks using a Markov decision theoretic framework which maintains low computational complexity while still providing quite accurate routing information is proposed. In this approach, each link is modeled as a birth-death process to reduce the state space size and a policy iteration applied to achieve better network performance. The results show that routing algorithms based on this approach yield better performance than least-load path routing (LLP) without incurring any significant increase in computational complexity