Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1582379.1582419acmconferencesArticle/Chapter ViewAbstractPublication PagesiwcmcConference Proceedingsconference-collections
research-article

Rate control for network coding based multicast: a hierarchical decomposition approach

Published: 21 June 2009 Publication History

Abstract

In this work we consider the rate control issue for network coding based multicast among multiple sessions, which can be formulated as a network utility maximization problem. To solve the problem we propose a distributed optimization decomposition approach, which is different from the previous work in the literature in that (1) it is a hierarchical decomposition approach where the primal problem is decomposed recursively, until an independent rate control module is obtained and the decomposed subproblems can be solved by the distributed max-flow algorithm and we emphasize the layered functionality allocation of decomposed subproblems following the framework of "Layering as Optimization Decompositions"; (2) we first separate the primal problem by relaxing the capacity constraint among sessions; (3) to implement end-to-end control, we separate the independent rate control module at end node from the operation in the interior of the network. In this work we intend to propose not only a rate control algorithm but also a possible choice of network architecture for network coding based communication with rate control capability.

References

[1]
R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, 46(4):1204--1216, 2000.
[2]
D. Bertsekas. Nonlinear Optimization. Athena Scientific, Belmont, MA, 1999.
[3]
D. Bertsekas and J. Tsitsikilis. Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Englewood Cliffs, NJ, 1989.
[4]
L. Chen, T. Ho, S. H. Low, M. Chiang, and J. C. Doyle. Optimization based rate control for multicast with network coding. Proceedings - IEEE INFOCOM, pages 1163--1171, 2007.
[5]
M. Chiang, S. Low, A. Calderbank, and J. Doyle. Layering as optimization decomposition: A mathematical theory of network architectures. Proceedings of the IEEE, 95(1):255--312, Jan. 2007.
[6]
P. A. Chou, Y. Wu, and K. Jain. Practical network coding. Proc. 51st Allerton Conference on Communication, Control, and Computing, 2005.
[7]
A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. JACM: Journal of the ACM, 35, 1988.
[8]
T. Ho, R. Koetter, M. Medard, D. R. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. IEEE International Symposium on Information Theory - Proceedings, pages 442--, 2003.
[9]
T. Ho, M. Medard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong. A random linear network coding approach to multicast. IEEE Transactions on Information Theory, 52(10):4413--4430, 2006.
[10]
S. Jaggi, P. A. Chou, and K. Jain. Low complexity algebraic multicast network codes. IEEE International Symposium on Information Theory - Proceedings, pages 368 -, 2003.
[11]
S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. M. Tolhuizen. Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory, 51(6):1973--1982, 2005.
[12]
F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33--37, 1997.
[13]
F. P. Kelly, A. K. Maulloo, and D. K. H. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237--252, 1998.
[14]
R. Koetter and M. Medard. An algebraic approach to network coding. IEEE/ACM Transactions on Networking, 11(5):782--795, 2003.
[15]
S.-Y. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Transactions on Information Theory, 49(2):371--381, 2003.
[16]
D. S. Lun, N. Ratnakar, R. Koetter, M. Medard, E. Ahmed, and H. Lee. Achieving minimum-cost multicast: A decentralized approach based on network coding. Proceedings - IEEE INFOCOM, 3:1608--1617, 2005.
[17]
D. S. Lun, N. Ratnakar, M. Medard, R. Koetter, D. R. Karger, T. Ho, E. Ahmed, and F. Zhao. Minimum-cost multicast over coded packet networks. IEEE Transactions on Information Theory, 52(6):2608--2623, 2006.
[18]
D. P. Palomar and M. Chiang. Alternative decompositions for distributed maximization of network utility: Framework and applications. INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, pages 1--13, April 2006.
[19]
D. P. Palomar and M. Chiang. A tutorial on decomposition methods for network utility maximization. IEEE Journal on Selected Areas in Communications, 24(8):1439--1451, 2006.
[20]
P. Sanders, S. Egner, and L. Tolhuizen. Polynomial time algorithms for network information flow. Annual ACM Symposium on Parallel Algorithms and Architectures, pages 286--294, 2003.
[21]
Y. Wu, M. Chiang, and S.-Y. Kung. Distributed utility maximization for network coding based multicasting: A critical cut approach. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2006 4th International Symposium on, pages 1--6, April 2006.
[22]
Y. Wu and S.-Y. Kung. Distributed utility maximization for network coding based multicasting: A shortest path approach. IEEE Journal on Selected Areas in Communications, 24(8):1475--1488, 2006.
[23]
Y. Xi and E. M. Yeh. Distributed algorithms for minimum cost multicast with network coding. IEEE NetCod Workshop, Apr 2006.
[24]
R. W. Yeung. Multilevel diversity coding with distortion. IEEE Trans. Inf. Theory, 41(2):412--422, Mar 1995.

Cited By

View all
  • (2011)Cross-layer designs in coded wireless fading networks with multicastIEEE/ACM Transactions on Networking10.1109/TNET.2011.210901019:5(1276-1289)Online publication date: 1-Oct-2011

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
IWCMC '09: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
June 2009
1561 pages
ISBN:9781605585697
DOI:10.1145/1582379
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 June 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. network coding
  2. optimization decomposition
  3. rate control

Qualifiers

  • Research-article

Funding Sources

Conference

IWCMC '09
Sponsor:

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2011)Cross-layer designs in coded wireless fading networks with multicastIEEE/ACM Transactions on Networking10.1109/TNET.2011.210901019:5(1276-1289)Online publication date: 1-Oct-2011

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media