Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network

— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure channel model, the necessary and sufficient conditions defined in [2] for the Generalized Dijkstra’s Algorithm (GDA) can be used with a constrained non-negative-mean AWGN channel. The generalization allowed the computation of the worst-case QoS metric value for a given edge weight density. The worst-case value can then be used as the routing metric in networks where some nodes have error correcting capabilities. The result is an optimal worst-case QoS routing algorithm that uses the Generalized Dijkstra’s Algorithm as a subroutine with a polynomial time complexity of O(V 3 ).

• Type: Conference
• Year: 2007
• Where: ICC
• Authors: Edwin Soedarmadji, Robert J. McEliece
• Keywords: Communications, ICC 2007, Optimal Worst-case Qos, QoS Routing Algorithm, Worst-case Qos