TY - JOUR
T1 - Optimal rate-reliability-delay tradeoff in networks with composite links
AU - Li, Ying
AU - Chiang, Mung
AU - Calderbank, A. Robert
AU - Diggavi, Suhas N.
N1 - Funding Information:
This work was in part supported by NSF Grant 0720570 and ONR Grant N00014-07-1-0864. Part of this paper was presented at IEEE INFOCOM 2007. Digital Object Identifier 10.1109/TCOMM.2009.05.070198
PY - 2009
Y1 - 2009
N2 - Networks need to accommodate diverse applications with different Quality-of-Service (QoS) requirements. New ideas at the physical layer are being developed for this purpose, such as diversity embedded coding, which is a technique that combines high rates with high reliability. We address the problem of how to fully utilize different rate-reliability characteristics at the physical layer to support different types of traffic over a network and to jointly maximize their utilities. We set up a new framework based on utility maximization for networks with composite links, meaning that each link consists of sub-links that can attain different rate-reliability characteristics simultaneously. We incorporate delay, in addition to rate and reliability, into the utility functions. To accommodate different types of traffic, we propose distributed algorithms converging to the optimal rate-reliability-delay tradeoff based on capacity division and priority queueing. Numerical results show that compared with traditional codes, the new codes can provide higher network utilities for all traffic types simultaneously. The results also show that priority queueing achieves higher network utility than capacity division.
AB - Networks need to accommodate diverse applications with different Quality-of-Service (QoS) requirements. New ideas at the physical layer are being developed for this purpose, such as diversity embedded coding, which is a technique that combines high rates with high reliability. We address the problem of how to fully utilize different rate-reliability characteristics at the physical layer to support different types of traffic over a network and to jointly maximize their utilities. We set up a new framework based on utility maximization for networks with composite links, meaning that each link consists of sub-links that can attain different rate-reliability characteristics simultaneously. We incorporate delay, in addition to rate and reliability, into the utility functions. To accommodate different types of traffic, we propose distributed algorithms converging to the optimal rate-reliability-delay tradeoff based on capacity division and priority queueing. Numerical results show that compared with traditional codes, the new codes can provide higher network utilities for all traffic types simultaneously. The results also show that priority queueing achieves higher network utility than capacity division.
KW - Channel coding
KW - Communication systems
KW - Networks
KW - Optimization methods
KW - Resource management
UR - http://www.scopus.com/inward/record.url?scp=66849111509&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=66849111509&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2009.05.070198
DO - 10.1109/TCOMM.2009.05.070198
M3 - Article
AN - SCOPUS:66849111509
SN - 0090-6778
VL - 57
SP - 1390
EP - 1401
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 5
ER -