An exact algorithm for design of content delivery networks in MPLS environment

Content delivery network (CDN) is an efficient and inexpensive method to improve Internet service quality. In this paper we formulate an optimisation problem of replica location in a CDN using MPLS techniques. A novelty, comparing to previous work on this subject, is modelling the network flow as co...

Full description

Saved in:
Bibliographic Details
Published inJournal of Telecommunications and Information Technology no. 2
Main Author Krzysztof Walkowiak
Format Journal Article
LanguageEnglish
Published National Institute of Telecommunications 30.06.2004
Subjects
branch-andcut algorithm
content delivery network
optimization
Online AccessGet full text

Cover

More Information
Summary:Content delivery network (CDN) is an efficient and inexpensive method to improve Internet service quality. In this paper we formulate an optimisation problem of replica location in a CDN using MPLS techniques. A novelty, comparing to previous work on this subject, is modelling the network flow as connection-oriented and introduction of capacity constraint on network links to the problem. Since the considered optimisation problem is NP-complete, we propose and discuss exact algorithm based on the branch-and-cut and branch-and-bound methods. We present results of numerical experiments showing comparison of branch-and-cut and branch-and-bound methods.
ISSN:1509-4553
1899-8852
DOI:10.26636/jtit.2004.2.245