Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  extend the optimal worst-case QoS routing algorithm and metric definition given in [1].  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 allod the computation of the worst-case QoS metric value for a given edge ight 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 ).
['Edwin Soedarmadji', 'Robert J. McEliece']
I am writing a research paper on a idea Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network
[{"from": "human", "value": "I am writing a research paper on a idea Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  extend the optimal worst-case QoS routing algorithm and metric definition given in [1].  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 allod the computation of the worst-case QoS metric value for a given edge ight 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 )."}]