An Exact Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment Problem in Two-Level Hierarchical Wide Area Networks

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4707)


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.


WAN Hierarchical Network Algorithm Branch and Bound 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kleinrock, L., Kamoun, F.: Optimal Clustering Structures for Hierarchical Topological Network Design of Large Computer Networks. Networks 10, 221–248 (1980)zbMATHCrossRefGoogle Scholar
  2. 2.
    Liu, Z., Gu, Y., Medhi, D.: On Optimal Location of Switches/Routers and Interconnection. Technical Report, University of Missouri-Kansas City (1998)Google Scholar
  3. 3.
    Saha, D., Mukherjee, A.: On the multidensity gateway location problem for multilevel high speed network. Computer Communications 20, 576–585 (1997)CrossRefGoogle Scholar
  4. 4.
    Liang, S.C., Yee, J.R.: Locating Internet Gateways to Minimize Nonlinear Congestion Costs. IEEE Transactions On Communications 42, 2740–2750 (1994)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Kasprzak, A.: Topological Design of the Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)Google Scholar
  8. 8.
    Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: an Approach to Store-and-Forward Communication Network Design. Networks 3, 97–133 (1973)CrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  1. 1.Wroclaw University of Technology, Chair of Systems and Computer Networks, Wybrzeze Wyspianskiego 27, 50-370 WroclawPoland

Personalised recommendations