Advertisement

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

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

Abstract

In the paper the problem of designing two-level hierarchical structure of wide area network 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 delay constraint. An approximate algorithm is proposed. Some results following from computational experiment are reported.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  1. 1.Chair of Systems and Computer NetworksWroclaw University of TechnologyWroclawPoland

Personalised recommendations