### Abstract

The current framework of network utility maximization for distributed rate allocation assumes fixed channel code rates. However, by adapting the physical layer channel coding, different rate-reliability tradeoffs can be achieved on each link and for each end user. Consider a network where each user has a utility function that depends on both signal quality and data rate, and each link may provide a 'fatter' ('thinner') information 'pipe' by allowing a higher (lower) decoding error probability. We propose two distributed, pricing-based algorithms to attain optimal rate-reliability tradeoff, with an interpretation that each user provides its willingness to pay for reliability to the network and the network feeds back congestion prices to users. The proposed algorithms converge to a tradeoff point between rate and reliability, which is proved to be globally optimal for codes with sufficiently large codeword lengths and user utilities with sufficiently negative curvatures.

Original language | English |
---|---|

Title of host publication | Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05 |

Pages | 2246-2250 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2005 Dec 1 |

Event | 2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia Duration: 2005 Sep 4 → 2005 Sep 9 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

Volume | 2005 |

ISSN (Print) | 2157-8099 |

### Other

Other | 2005 IEEE International Symposium on Information Theory, ISIT 05 |
---|---|

Country | Australia |

City | Adelaide |

Period | 05/9/4 → 05/9/9 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics

### Cite this

*Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05*(pp. 2246-2250). [1523747] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2005). https://doi.org/10.1109/ISIT.2005.1523747

}

*Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05.*, 1523747, IEEE International Symposium on Information Theory - Proceedings, vol. 2005, pp. 2246-2250, 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australia, 05/9/4. https://doi.org/10.1109/ISIT.2005.1523747

**Distributed algorithms for optimal rate-reliability tradeoff in networks.** / Lee, Jang Won; Chiang, Mung; Calderbank, A. Robert.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Distributed algorithms for optimal rate-reliability tradeoff in networks

AU - Lee, Jang Won

AU - Chiang, Mung

AU - Calderbank, A. Robert

PY - 2005/12/1

Y1 - 2005/12/1

N2 - The current framework of network utility maximization for distributed rate allocation assumes fixed channel code rates. However, by adapting the physical layer channel coding, different rate-reliability tradeoffs can be achieved on each link and for each end user. Consider a network where each user has a utility function that depends on both signal quality and data rate, and each link may provide a 'fatter' ('thinner') information 'pipe' by allowing a higher (lower) decoding error probability. We propose two distributed, pricing-based algorithms to attain optimal rate-reliability tradeoff, with an interpretation that each user provides its willingness to pay for reliability to the network and the network feeds back congestion prices to users. The proposed algorithms converge to a tradeoff point between rate and reliability, which is proved to be globally optimal for codes with sufficiently large codeword lengths and user utilities with sufficiently negative curvatures.

AB - The current framework of network utility maximization for distributed rate allocation assumes fixed channel code rates. However, by adapting the physical layer channel coding, different rate-reliability tradeoffs can be achieved on each link and for each end user. Consider a network where each user has a utility function that depends on both signal quality and data rate, and each link may provide a 'fatter' ('thinner') information 'pipe' by allowing a higher (lower) decoding error probability. We propose two distributed, pricing-based algorithms to attain optimal rate-reliability tradeoff, with an interpretation that each user provides its willingness to pay for reliability to the network and the network feeds back congestion prices to users. The proposed algorithms converge to a tradeoff point between rate and reliability, which is proved to be globally optimal for codes with sufficiently large codeword lengths and user utilities with sufficiently negative curvatures.

UR - http://www.scopus.com/inward/record.url?scp=33749426116&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749426116&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2005.1523747

DO - 10.1109/ISIT.2005.1523747

M3 - Conference contribution

AN - SCOPUS:33749426116

SN - 0780391519

SN - 9780780391512

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2246

EP - 2250

BT - Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05

ER -