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, channel capacities and flow routes in order to minimize total cost of leasing capacities of channels of 2nd level network, subject to constraint on maximal acceptable value of average packet delay in hierarchical network. An exact algorithm is proposed. Some results of computational experiments are reported. Based on computational experiments, several properties of the considered problem, important from practical point of view, are formulated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kleinrock, L., Kamoun, F.: Optimal Clustering Structures for Hierarchical Topological Network Design of Large Computer Networks. Networks 10, 221–248 (1980)
Liu, Z., Gu, Y., Medhi, D.: On Optimal Location of Switches/Routers and Interconnection. Technical Report, University of Missouri-Kansas City (1998)
Saha, D., Mukherjee, A.: On the multidensity gateway location problem for multilevel high speed network. Computer Communications 20, 576–585 (1997)
Liang, S.C., Yee, J.R.: Locating Internet Gateways to Minimize Nonlinear Congestion Costs. IEEE Transactions On Communications 42, 2740–2750 (1994)
Ryba, P., Kasprzak, A.: An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2006. LNCS, vol. 3991, pp. 100–107. Springer, Heidelberg (2006)
Ryba, P., Kasprzak, A.: The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results, In: Gavrilova, M., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganà, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3982, pp. 1100–1109. Springer, Heidelberg (2006)
Kasprzak, A.: Topological Design of the Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)
Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: an Approach to Store-and-Forward Communication Network Design. Networks 3, 97–133 (1973)
Markowski, M., Kasprzak, A.: An exact algorithm for host allocation, capacity and flow assignment problem in WAN. In: WITASI 2002, pp. 73–82. Kluwer Academic Publ, Dordrecht (2002)
Walkowiak, K.: A New Method of Primary Routes Selection for Local Restoration. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 1024–1035. Springer, Heidelberg (2004)
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., 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)
Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryba, P., Kasprzak, A. (2007). An Exact Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment Problem in Two-Level Hierarchical Wide Area Networks. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74484-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-74484-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74482-5
Online ISBN: 978-3-540-74484-9
eBook Packages: Computer ScienceComputer Science (R0)