Abstract
In the paper the problem of designing two-level hierarchical structure of wide area network (WAN) is considered. The goal is to select gateways location, topology of 2ndlevel network, channel capacities and flow routes in order to minimize linear combination of the total average delay per packet and the total cost of leasing capacities of channels of 2ndlevel network, subject to budget constraint. An exact algorithm based on branch and bound method is proposed. Some results of computational experiments are reported. Relying on computational experiments, several properties of the considered problem, important from practical point of view, are formulated.
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.
