277 0

A Dynamic Caching Algorithm based on the Pheromone for Content Distribution Networks

Title
A Dynamic Caching Algorithm based on the Pheromone for Content Distribution Networks
Author
조인휘
Keywords
CDN; segment based caching; pheromone
Issue Date
2012-12
Publisher
Springer Science and Business Media
Citation
Communications in computer and information science, 2012, 351, P.61-67
Abstract
A content distribution network (CDN) is a system to improve the delivery of content to the end users on the Internet, in which popular content may be cached or replicated at a number of servers, placed closer to some client populations. The design of a CDN consists of defining which content should be replicated at each server, the number of servers, where they should be placed in the network, which server a client’s requests should be sent to, and how server responses should be routed to the clients. CDNs were originally designed for traditional web files. However, given the increase in streaming media content on the Internet, the development of efficient CDN design methods that take into account the special characteristics of media objects, is of great interest. These characteristics include sustained high bandwidth requirements and faster response time by multicast delivery. The main goal of this paper is to propose an algorithm for designing a streaming media CDN with the efficient byte hit ratio and fast response time. We propose the segment-based dynamic caching mechanism with the pheromone that is defined a kind of lifetime of each segment. We evaluate this algorithm in simulations using CDNsim.
URI
https://link.springer.com/chapter/10.1007%2F978-3-642-35600-1_9http://hdl.handle.net/20.500.11754/50451
ISSN
1865-0929
DOI
10.1007/978-3-642-35600-1_9
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE(컴퓨터소프트웨어학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE