Computer Science – Networking and Internet Architecture
Scientific paper
2005-08-02
Computer Science
Networking and Internet Architecture
To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-
Scientific paper
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.
Calderbank Robert A.
Chiang Mung
Lee Jang-Won
No associations
LandOfFree
Distributed Algorithms for Optimal Rate-Reliability Tradeoff in Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Distributed Algorithms for Optimal Rate-Reliability Tradeoff in Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Algorithms for Optimal Rate-Reliability Tradeoff in Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-615493