Abstract
The paper deals with the problem of simultaneously assignment of server’s allocation, channel capacities and flow routes in the wide area network in order to minimize the criterion composed of the leasing capacity cost and the building cost of the network. An exact algorithm, based on the branch and bound method, is proposed to solve the problem. Some interesting features, observed during the computational experiments are reported.
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.
