The Web Replica Allocation and Topology Assignment Problem in Wide Area Networks: Algorithms and Computational Results

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


This paper studies the problem of designing wide area networks. In the paper the web replica allocation and topology assignment problem with budget constraint is considered. The goal is select web replica allocation at nodes, network topology, channel capacities and flow routes in order to minimize average delay per packet and web replica connecting cost at nodes subject to budget constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also an approximate algorithm is presented. Some computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.


Network Topology Channel Capacity Exact Algorithm Approximate Algorithm Wide Area Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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
  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: Internet Technologies, Application and Societal Impact, pp. 73–82. Kluwer Academic Publishers, Boston (2002)Google Scholar
  4. 4.
    Kasprzak, A.: Exact and Approximate Algorithms for Topological Design of Wide Area Networks with Non-simultaneous Single Commodity Flows. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2660, pp. 799–808. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Gola, M., Kasprzak, A.: Exact and Approximate Algorithms for Two-Criteria Topological Design Problem of WAN with Budget and Delay Constraints. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3045, pp. 611–620. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    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
  7. 7.
    Seonho, K., Miyoun, Y., Yongtae, S.: Placement Algorithm of Web Server Replicas. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3043, pp. 328–336. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Qiu, L., Padmanabhan, V.N., Voelker, G.M.: On the Placement of Web Server Replicas. In: Proceedings of 20th IEEE INFOCOM, Anchorage, pp. 1587–1596 (2001)Google Scholar
  9. 9.
    Wolsey, L.A.: Integer Programming. Wiley Interscience, New York (1998)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

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

Personalised recommendations