TU Darmstadt / ULB / TUbiblio

Object Replication Strategies in Content Distribution Networks

Kangasharju, Jussi and Roberts, James and Ross, Keith (2001):
Object Replication Strategies in Content Distribution Networks.
In: Proceedings of the 6th Web Caching and Content Distribution Workshop, Boston, MA, USA, June 20-22,
[Conference or Workshop Item]

Abstract

Recently the Internet has witnessed the emergence of content distribution networks (CDNs). In this paper we study the problem of optimally replicating objects in CDN servers. In our model, each Internet Autonomous System (AS) is a node with finite storage capacity for replicating objects. The optimization problem is to replicate objects so that when clients fetch objects from the nearest CDN server with the requested object, the average number of ASs traversed is minimized. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. We develop four natural heuristics and compare them numerically using real Internet topology data. We find that the best results are obtained with heuristics that have all the CDN servers cooperating in making the replication decisions. We also develop a model for studying the benefits of cooperation between nodes, which provides insight into peer-to-peer content distribution.

Item Type: Conference or Workshop Item
Erschienen: 2001
Creators: Kangasharju, Jussi and Roberts, James and Ross, Keith
Title: Object Replication Strategies in Content Distribution Networks
Language: German
Abstract:

Recently the Internet has witnessed the emergence of content distribution networks (CDNs). In this paper we study the problem of optimally replicating objects in CDN servers. In our model, each Internet Autonomous System (AS) is a node with finite storage capacity for replicating objects. The optimization problem is to replicate objects so that when clients fetch objects from the nearest CDN server with the requested object, the average number of ASs traversed is minimized. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. We develop four natural heuristics and compare them numerically using real Internet topology data. We find that the best results are obtained with heuristics that have all the CDN servers cooperating in making the replication decisions. We also develop a model for studying the benefits of cooperation between nodes, which provides insight into peer-to-peer content distribution.

Title of Book: Proceedings of the 6th Web Caching and Content Distribution Workshop, Boston, MA, USA, June 20-22
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Telecooperation
Date Deposited: 31 Dec 2016 12:59
Identification Number: KangasharjuJ:CDNrepl
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details