Skip to main content

Network resource allocation for competing multiple description transmissions

Publication ,  Journal Article
Li, Y; Tian, C; Diggavi, S; Chiang, M; Calderbank, A
Published in: IEEE Transactions on Communications
May 1, 2010

Providing real-time multimedia services over a besteffort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple description (MD) coding is one approach to transmit the media over diverse (multiple) paths to reduce the detrimental effects caused by path failures or delay. The novelty of this work is to investigate the resource allocation in a network, where there are several competing MD coded streams. This is done by considering a framework that chooses the operating points for asymmetric MD coding to maximize total quality of the users, while these streams are sent over multiple routing paths. The framework is based on the theoretical modeling where we consider two descriptions and high source coding rate region approximated within small constants. We study the joint optimization of multimedia (source) coding and congestion control in wired networks. These ideas are extended to joint source coding and channel coding in wireless networks. In both situations, we propose distributed algorithms for optimal resource allocation. In the presence of path loss and competing users, the service quality to any particular MD stream could be uncertain. In such circumstances it might be tempting to expect that we need greater redundancy in the MD streams to protect against such failures. However, one surprising aspect of our study reveals that for large number of users who compete for the same resources, the overall system could benefit through opportunistic (hierarchical) strategies. In general networks, our studies indicate that the user composition varies from conservative to opportunistic operating points, depending on the number of users and their network vantage points. © 2006 IEEE.

Duke Scholars

Published In

IEEE Transactions on Communications

DOI

ISSN

0090-6778

Publication Date

May 1, 2010

Volume

58

Issue

5

Start / End Page

1493 / 1504

Related Subject Headings

  • 4606 Distributed computing and systems software
  • 4009 Electronics, sensors and digital hardware
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0804 Data Format
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Li, Y., Tian, C., Diggavi, S., Chiang, M., & Calderbank, A. (2010). Network resource allocation for competing multiple description transmissions. IEEE Transactions on Communications, 58(5), 1493–1504. https://doi.org/10.1109/TCOMM.2010.05.080551
Li, Y., C. Tian, S. Diggavi, M. Chiang, and A. Calderbank. “Network resource allocation for competing multiple description transmissions.” IEEE Transactions on Communications 58, no. 5 (May 1, 2010): 1493–1504. https://doi.org/10.1109/TCOMM.2010.05.080551.
Li Y, Tian C, Diggavi S, Chiang M, Calderbank A. Network resource allocation for competing multiple description transmissions. IEEE Transactions on Communications. 2010 May 1;58(5):1493–504.
Li, Y., et al. “Network resource allocation for competing multiple description transmissions.” IEEE Transactions on Communications, vol. 58, no. 5, May 2010, pp. 1493–504. Scopus, doi:10.1109/TCOMM.2010.05.080551.
Li Y, Tian C, Diggavi S, Chiang M, Calderbank A. Network resource allocation for competing multiple description transmissions. IEEE Transactions on Communications. 2010 May 1;58(5):1493–1504.

Published In

IEEE Transactions on Communications

DOI

ISSN

0090-6778

Publication Date

May 1, 2010

Volume

58

Issue

5

Start / End Page

1493 / 1504

Related Subject Headings

  • 4606 Distributed computing and systems software
  • 4009 Electronics, sensors and digital hardware
  • 4006 Communications engineering
  • 1005 Communications Technologies
  • 0906 Electrical and Electronic Engineering
  • 0804 Data Format