Loading...
Please wait, while we are loading the content...
Optimal worst-case qos routing in constrained awgn channel network.
| Content Provider | CiteSeerX |
|---|---|
| Author | Soedarmadji, Edwin Mceliece, Robert J. |
| Abstract | Abstract — 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). I. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Optimal Worst-case Qos Routing Constrained Awgn Channel Network Generalized Dijkstra Algorithm Q-ary Erasure Channel Model Sufficient Condition Metric Definition Q-ary Symmetric Worst-case Value Constrained Non-negative-mean Awgn Channel Optimal Worst-case Qos Routing Algorithm Edge Weight Density Worst-case Qos Metric Value Polynomial Time Complexity Optimal Worst-case Qos |
| Content Type | Text |
