QoS dynamic routing in content delivery networks

Authors:
Krzysztof Walkowiak
Affiliations:
Chair of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wroclaw, Poland
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 7
Cited 4

On the use and performance of content distribution networks

IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Some Approaches to Solve a Web Replica Location Problem in MPLS Networks

WITASI '02 Proceedings of the IFIP TC6/WG6.4 Workshop on Internet Technologies, Applications and Social Impact
Dynamic Online Routing Algorithm for MPLS Traffic Engineering

NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
QoS routing for anycast communications: motivation and an architecture for DiffServ networks

IEEE Communications Magazine
A survey of anycast in IPv6 networks

IEEE Communications Magazine
Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications

IEEE Journal on Selected Areas in Communications

An Exact Algorithm for the Servers Allocation, Capacity and Flow Assignment Problem with Cost Criterion and Delay Constraint in Wide Area Networks

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Anycasting in connection-oriented computer networks: Models, algorithms and results

International Journal of Applied Mathematics and Computer Science - Computational Intelligence in Modern Control Systems
Heuristic algorithm for anycast flow assignment in connection-oriented networks

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
The three-criteria servers replication and topology assignment problem in wide area networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, much research in quality of service (QoS) routing has focused on the unicast communication technique. However, Content Delivery Network (CDN) approach becomes popular because CDN enables effective and inexpensive improvement of Internet service quality. Therefore, we analyze in this paper a network processing two kinds of demands: content demands to CDN servers and standard unicast demands. Since MPLS defines effective mechanism for traffic engineering, we assume that the CDN is located in MPLS network. To examine the QoS performance of CDN-enabled MPLS network we propose new constraint-based algorithms for CDN server selection and evaluate relative performance of these algorithms and the most effective existing QoS unicast routing algorithms in terms of the demand rejection ratio.