Finding the Best QoS Path in a Gilbert Channel Network
- Creators
- Soedarmadji, Edwin
Abstract
Many different types of modern wired and wireless communication links can be mathematically described as discrete- time Gilbert channels. In this extended abstract, we present an exact method of calculating the best path in a network of discrete- time Gilbert channels, each of which is defined as a Markov chain with two states. In the "Good" state of the chain, the channel produces no erasure, and in the "Bad" state of the chain, the channel produces an erasure. Our method relies on a modified version of the Dijkstra's algorithm, which we customize to operate on sets of Gilbert channel parameters, instead of real numbers. We prove that the Gilbert channels obeys a certain set of algebraic properties which makes it compatible with our algorithm.
Additional Information
© 2008 IEEE. Issue Date: 11-14 May 2008; Date of Current Version: 20 May 2008. This work is supported by the Caltech Lee Center for Advanced Networking and NSF Grant No. CCF-0514881. The author would like to thank Prof. Robert J. McEliece for useful discussions and his continued support for this research.Attached Files
Published - Soedarmadji2008p87012008_Ieee_67Th_Vehicular_Technology_Conference-Spring_Vols_1-7.pdf
Files
Name | Size | Download all |
---|---|---|
md5:da59b626135a818fce601cf76d05ba44
|
128.5 kB | Preview Download |
Additional details
- Eprint ID
- 19082
- Resolver ID
- CaltechAUTHORS:20100715-120532113
- Caltech Lee Center for Advanced Networking
- CCF-0514881
- NSF
- Created
-
2010-08-06Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 10032664