CaltechAUTHORS
Published October 2006 | Version public
Book Section - Chapter Metadata-only

Minimum worst-case-erasure QoS routing

Creators

  • 1. ROR icon California Institute of Technology

Abstract

In communication networks where (1) some nodes are capable of correcting up to a maximum number of erasure, and (2) the nodes are connected by the q-ary Symmetric Erasure Channels parametrized by their Bit Erasure Ratios (BER); it is often possible to find the path with minimum (zero) worst possible erasure. We introduce (1) the BER and Worst-Case Erasure (WCE) metrics and (2) an algebra equipped with a total ordering that allows us to compute and compare the path lengths from its edges' lengths, and ultimately measure edge QoS. We use these metrics with a generalized Dijkstra's Algorithm to compute the minimum WCE path.

Additional Information

© 2006 IEEE. Issue Date: Oct. 2006. Date of Current Version: 12 February 2007. The author would like to convey his appreciation to Prof. Robert J. McEliece for valuable discussions and guidance, as well as useful suggestions that have improved this manuscript, and to the anonymous referees for their insightful comments.

Additional details

Identifiers

Eprint ID
24550
Resolver ID
CaltechAUTHORS:20110726-135006039

Dates

Created
2011-07-27
Created from EPrint's datestamp field
Updated
2021-11-09
Created from EPrint's last_modified field

Caltech Custom Metadata

Other Numbering System Name
INSPEC Accession Number
Other Numbering System Identifier
9297742