Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network
- Creators
- Soedarmadji, Edwin
- McEliece, Robert J.
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).
Additional Information
© 2007 IEEE. Issue Date: 24-28 June 2007; Date of Current Version: 13 August 2007. This work was supported by the Caltech Lee Center for Advanced Networking and NSF Grant No. CCF-0514881.Attached Files
Published - Soedarmadji2007p88132007_Ieee_International_Conference_On_Communications_Vols_1-14.pdf
Files
| Name | Size | Download all |
|---|---|---|
|
md5:b97ea5c53c0bcaf3f5c46fee3e30fe7e
|
266.5 kB | Preview Download |
Additional details
- Eprint ID
- 20442
- Resolver ID
- CaltechAUTHORS:20101015-111219862
- Caltech Lee Center for Advanced Networking
- NSF
- CCF-0514881
- Created
-
2010-10-15Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Series Name
- IEEE International Conference on Communications
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 9874727