Study on Utility Maximization Effectiveness in Packet Network Coding

Yang Guo; Yong Gang Ji; Jia Xu

doi:10.4028/www.scientific.net/AMM.182-183.2091

Paper Titles

An Ant Colony Algorithm Method for Multi-Objective Production System
p.2071

Two-Factor Authenticated Key Exchange Protocol in the Three-Party Setting
p.2075

Auto White Balance Algorithm in Digital Camera
p.2080

Corrective Maintenance Based Vulnerability Repair Procedure to Improve Web Application Security
p.2085

Study on Utility Maximization Effectiveness in Packet Network Coding
p.2091

A Study of Smart Bus Dynamic Transit System
p.2095

A Genetic Algorithm with Weight-Based Encoding for One-Dimensional Bin Packing Problem
p.2100

An Anti-Eavesdropping Network Coding Algorithm
p.2105

A Multi-Strategy Word Sense Disambiguation Method
p.2109

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 182-183Study on Utility Maximization Effectiveness in...

Study on Utility Maximization Effectiveness in Packet Network Coding

Abstract:

In this paper, the coding for multicast packet network call, the network utility maximiza- tion problem, when multicast call, given coding subgraph case modeling, Coded packet networks set up to maximize the effectiveness of modeling .Then use the duality theory, the distributed gradient projection algorithm that can solve the problem of modeling the network utility maximization

You might also be interested in these eBooks

Applied Mechanics and Mechatronics Automation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 182-183)

Pages:

2091-2094

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.182-183.2091

Citation:

Cite this paper

Online since:

June 2012

Authors:

Yang Guo, Yong Gang Ji, Jia Xu

Keywords:

Gradient Projection Algorithm, Network Coding, Network Utility Maximization

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] R. Ahlswede, N. Cai, S-Y.R. Li. etal. "Network information flow，IEEETrans. Inf. Theory vol. 46(4), 2000, pp.1204-216.

Google Scholar

[2] R. Koetter，M. M'edard，An algebraic approach to network coding,. IEEE/ACM Transaetions on Networking, vol. 11(10), 2003, pp.782-795.

DOI: 10.1109/tnet.2003.818197

Google Scholar

[3] T. Ho，M. M'edard,J. Shi, etal. On randomized networke oding, inproc. of 41st Atinual Allerton Confereneeon Communication, Control and ComPuting, Oet. 2003, pp.11-20.

Google Scholar

[4] T. Ho,M. M'edard，R. Koetter. An information-theoretic view of network anagement, IEEE Transaetions on information Theory, vol. 51(4), 2005, pp.1295-1312.

DOI: 10.1109/tit.2005.844062

Google Scholar

[5] D. Lun,N. Ratnakar,R. Koetter, etal, Aehieving minimum-cost multieast: A Decentralized appro- ach based on network coding, in proc. of IEEE INFOCOM, 2005, pp.1607-1617.

Google Scholar

[6] S. Boyd，L. Vandenberghe. Convex Optimization,. Cambridge University Press, (2004).

Google Scholar