Skip to main content
SpringerLink
Log in

The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

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

Included in the following conference series:

Abstract

This paper studies the problem of designing two-level hierarchical structure wide area network. The goal is to select gateways location, 2nd level network topology, channels capacities and flow routes in order to minimize the total average delay per packet in hierarchical network subject to budget constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also a heuristic algorithm is proposed. Some computational results 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

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. Kleinrock, L., Kamoun, F.: Optimal Clustering Structures for Hierarchical Topological Network Design of Large Computer Networks. Networks 10, 221–248 (1980)

    Article  MATH  MathSciNet  Google Scholar 

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

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

    Google Scholar 

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

    Chapter  Google Scholar 

  5. Liang, S.C., Yee, J.R.: Locating Internet Gateways to Minimize Nonlinear Congestion Costs. IEEE Transactions On Communications 42, 2740–2750 (1994)

    Article  Google Scholar 

  6. Liu, Z., Gu, Y., Medhi, D.: On Optimal Location of Switches/Routers and Interconnection. Technical Report, University of Missouri-Kansas City (1998)

    Google Scholar 

  7. Saha, D., Mukherjee, A.: On the multidensity gateway location problem for multilevel high speed network. Computer Communications 20, 576–585 (1997)

    Article  Google Scholar 

  8. Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)

    MATH  Google Scholar 

  9. Walkowiak, K.: A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks. In: Computational Optimization and Applications, vol. 27, pp. 149–171. Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  10. Markowski, M., Kasprzak, A.: An exact algorithm for host allocation, capacity and flow assignment problem in WAN. Internet Technologies. Applications and Societal Impact, pp. 73–82. Kluwer Academic Publishers, Boston (2002)

    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

    Przemyslaw Ryba & Andrzej Kasprzak

Authors
  1. Przemyslaw Ryba
    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 Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

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

    Osvaldo Gervasi

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

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

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

    David Taniar

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

    Antonio Laganá

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

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryba, P., Kasprzak, A. (2006). The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_115

Download citation

  • DOI: https://doi.org/10.1007/11751595_115

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34075-1

  • Online ISBN: 978-3-540-34076-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation