Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#235915] of Robert Calderbank

Papers Published

  1. Li, Y; Chiang, M; Calderbank, AR; Diggavi, SN, Optimal rate-reliability-delay tradeoff in networks with composite links, Ieee Transactions on Communications, vol. 57 no. 5 (2009), pp. 1390-1401, ISSN 0090-6778 [doi]
    (last updated on 2018/10/21)

    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. © 2009 IEEE.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320