Skip to main content
SpringerLink
Log in

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

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3483))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MATH  MathSciNet  Google Scholar 

  2. Kasprzak, A.: Topological Design of the Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)

    Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Wolsey, L.A.: Integer Programming. Wiley Interscience, New York (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Marcin Markowski & Andrzej Kasprzak

Authors
  1. Marcin Markowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Kasprzak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Markowski, M., Kasprzak, A. (2005). The Web Replica Allocation and Topology Assignment Problem in Wide Area Networks: Algorithms and Computational Results. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_81

Download citation

  • DOI: https://doi.org/10.1007/11424925_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation