The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results
- 897 Downloads
This paper studies the problem of designing two-level hierarchical structure wide area network. The goal is to select gateways location, 2nd level network topology, channels capacities and flow routes in order to minimize the total average delay per packet in hierarchical network subject to budget constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also a heuristic algorithm is proposed. Some computational results are reported. Based on computational experiments, several properties of the considered problem, important from practical point of view, are formulated.
Unable to display preview. Download preview PDF.
- 3.Kasprzak, A.: Topological Design of the Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)Google Scholar
- 4.Markowski, M., Kasprzak, A.: The Web Replica Allocation and Topology Assignment Problem in Wide Area Networks: Algorithms and Computational Results. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3483, pp. 772–781. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 6.Liu, Z., Gu, Y., Medhi, D.: On Optimal Location of Switches/Routers and Interconnection. Technical Report, University of Missouri-Kansas City (1998)Google Scholar
- 9.Walkowiak, K.: A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks. In: Computational Optimization and Applications, vol. 27, pp. 149–171. Kluwer Academic Publishers, Dordrecht (2004)Google Scholar
- 10.Markowski, M., Kasprzak, A.: An exact algorithm for host allocation, capacity and flow assignment problem in WAN. Internet Technologies. Applications and Societal Impact, pp. 73–82. Kluwer Academic Publishers, Boston (2002)Google Scholar