Abstract
The paper presents the exact algorithm for capacity and flow assignment and hosts allocation problem in wide area computer networks. The problem consists in selection of flow routes, channel capacities and hosts allocation at nodes in order to minimize the total average delay per packet and the connecting cost of the hosts at nodes subject to budget constraint. The branch and bound method to construct the exact algorithm for solving the considered problem is used.Keywordscomputer networksCFA problemwide area networknetwork design
Sign-in/Register to access full text options 
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.
