Abstract
The problem of routing and flow control in a computer communication network is formulated as a mixed integer nonlinear programming problem. The Lagrangian relaxation method is used to decompose the problem into subproblems that are relatively easier to solve than the original problem. An algorithm is then developed which can obtain an optimal solution to the problem.
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.
