Abstract
The paper studied the problem of network utility maximization of coded packet network under delivery contracts constraint when coding subgraph was given.Based on the network utility maximization model proposed a distributed projection subgradient algorithm for this problem based on dual decomposition theory was developed and the sufficient condition that can make the algorithm converge to the globally optimal solutions was proved.In the end numerical example verifier the correctness of the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
