A Caltech Library Service

Finding the Best QoS Path in a Gilbert Channel Network

Soedarmadji, Edwin (2008) Finding the Best QoS Path in a Gilbert Channel Network. In: IEEE Vehicular Technology Conference, 2008. IEEE , pp. 2646-2650. ISBN 978-1-4244-1644-8.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
URLURL TypeDescription*%26searchField%3DSearch+AllPublisherUNSPECIFIED
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.
Funding AgencyGrant Number
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number978-1-4244-1644-8
Record Number:CaltechAUTHORS:20100723-095210220
Persistent URL:
Official Citation:Soedarmadji, E.; , "Finding the Best QoS Path in a Gilbert Channel Network," Vehicular Technology Conference, 2008. VTC Spring 2008. IEEE, vol., no., pp.2646-2650, 11-14 May 2008 doi: 10.1109/VETECS.2008.580 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:19177
Deposited On:27 Jul 2010 23:44
Last Modified:08 Nov 2021 23:50

Repository Staff Only: item control page