Math @ Duke

Publications [#235850] of Robert Calderbank
Papers Published
 Lee, JW; Chiang, M; Calderbank, AR, Distributed algorithms for optimal ratereliability tradeoff in networks,
IEEE International Symposium on Information Theory  Proceedings, vol. 2005
(2005),
pp. 22462250 [doi]
(last updated on 2018/05/26)
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 ratereliability 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, pricingbased algorithms to attain optimal ratereliability 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.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

