Optimal Content Retrieval Latency for Chunk Based Cooperative Content Replication in Delay Tolerant Networks
(2013) 9th Swedish National Computer Networking Workshop- Abstract
- Modern content distribution networks face an increasing multitude of content generators. In order to reach the minimal content retrieval latency in the content distribution networks, content shall be disseminated towards consumers based on its popularity taken from the content distribution networks. This, Combined with dividing media into chunks (heterogeneous valuation of information) and contact duration of the consumers with the access points in delay tolerant networks led us to a novel system for content management in large scale distributed systems.
In order to determine where to replicate content we formulated the problem as an integer programming problem. The cost function of this minimization problem is the accumulated... (More) - Modern content distribution networks face an increasing multitude of content generators. In order to reach the minimal content retrieval latency in the content distribution networks, content shall be disseminated towards consumers based on its popularity taken from the content distribution networks. This, Combined with dividing media into chunks (heterogeneous valuation of information) and contact duration of the consumers with the access points in delay tolerant networks led us to a novel system for content management in large scale distributed systems.
In order to determine where to replicate content we formulated the problem as an integer programming problem. The cost function of this minimization problem is the accumulated weighted communication delay among the content replication servers and also the main content server. Various practical constraints such as limited total budget for content replication in each service provider, limited storage size and downlink bandwidth of the content replication servers are considered. A centralized solution to the problem is derived which gives the performance bound for any decentralized content replication strategy for the presented scenarios. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/edc0cbda-33a6-4dd9-b69a-c531343dba55
- author
- Amani, Payam LU ; Bastani, Saeed LU and Landfeldt, Björn LU
- organization
- publishing date
- 2013-06-03
- type
- Contribution to conference
- publication status
- published
- subject
- conference name
- 9th Swedish National Computer Networking Workshop
- conference location
- Lund, Sweden
- conference dates
- 2013-06-03 - 2013-06-04
- language
- English
- LU publication?
- yes
- id
- edc0cbda-33a6-4dd9-b69a-c531343dba55
- date added to LUP
- 2019-09-22 21:53:47
- date last changed
- 2019-09-23 11:36:21
@misc{edc0cbda-33a6-4dd9-b69a-c531343dba55,
abstract = {{Modern content distribution networks face an increasing multitude of content generators. In order to reach the minimal content retrieval latency in the content distribution networks, content shall be disseminated towards consumers based on its popularity taken from the content distribution networks. This, Combined with dividing media into chunks (heterogeneous valuation of information) and contact duration of the consumers with the access points in delay tolerant networks led us to a novel system for content management in large scale distributed systems. <br/>In order to determine where to replicate content we formulated the problem as an integer programming problem. The cost function of this minimization problem is the accumulated weighted communication delay among the content replication servers and also the main content server. Various practical constraints such as limited total budget for content replication in each service provider, limited storage size and downlink bandwidth of the content replication servers are considered. A centralized solution to the problem is derived which gives the performance bound for any decentralized content replication strategy for the presented scenarios.}},
author = {{Amani, Payam and Bastani, Saeed and Landfeldt, Björn}},
language = {{eng}},
month = {{06}},
title = {{Optimal Content Retrieval Latency for Chunk Based Cooperative Content Replication in Delay Tolerant Networks}},
year = {{2013}},
}