Advertisement

The Three-Criteria Servers Replication and Topology Assignment Problem in Wide Area Networks

  • Marcin Markowski
  • Andrzej Kasprzak
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3982)

Abstract

The designing of wide area networks is usually an optimization process with accurately selected optimization criterion. The most utilized criterions are the quality of service in the network (indicated by average packet delay), the capacity cost (channel capacity leasing cost) and server costs (cost of connecting servers or replicas at nodes). This paper studies the problem of designing wide area networks with taking into account those three criteria. Then, the goal is select servers replica allocation at nodes, network topology, channel capacities and flow routes in order to minimize the linear combination of average delay per packet, capacity cost and server cost. The problem is NP-complete. An exact algorithm, based on the branch and bound method is proposed. Some computational results are reported and several properties of the considered problem are formulated.

Keywords

Channel Capacity Exact Algorithm Server Cost Typical Dependence 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Pioro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier, Morgan Kaufmann Publishers, San Francisco (2004)MATHGoogle Scholar
  2. 2.
    Walkowiak, K.: QoS Dynamic Routing in Content Delivery Network. In: Boutaba, R., Almeroth, K.C., Puigjaner, R., Shen, S., Black, J.P. (eds.) NETWORKING 2005. LNCS, vol. 3462, pp. 1120–1132. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    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
  4. 4.
    Radoslavov, P., Govindan, R., Estrin, D.: Topology-Informed Internet Replica Placement. Computer Communications 25(4), 384–392 (2002)CrossRefGoogle Scholar
  5. 5.
    Qiu, L., Padmanabhan, V.N., Voelker, G.M.: On the Placement of Web Server Replicas. In: Proc. of 20th IEEE INFOCOM, Anchorage, USA, pp. 1587–1596 (2001)Google Scholar
  6. 6.
    Kasprzak, A.: Topological Design of the Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)Google Scholar
  7. 7.
    Kang, C.G., Tan, H.H.: Combined channel allocation and routing algorithms in packed switched networks. Computer Communications 20, 1175–1190 (1997)CrossRefGoogle 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)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Marcin Markowski
    • 1
  • Andrzej Kasprzak
    • 1
  1. 1.Chair of Systems and Computer NetworksWroclaw University of TechnologyWroclawPoland

Personalised recommendations