A dynamic caching algorithm based on the pheromone for content distribution networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, Jeman | - |
dc.contributor.author | Joe, Inwhee | - |
dc.date.accessioned | 2022-07-16T12:16:47Z | - |
dc.date.available | 2022-07-16T12:16:47Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2012-12 | - |
dc.identifier.issn | 1865-0929 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/163999 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Springer Verlag | - |
dc.title | A dynamic caching algorithm based on the pheromone for content distribution networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Joe, Inwhee | - |
dc.identifier.doi | 10.1007/978-3-642-35600-1_9 | - |
dc.identifier.scopusid | 2-s2.0-84870829802 | - |
dc.identifier.bibliographicCitation | Communications in Computer and Information Science, v.351 CCIS, pp.61 - 67 | - |
dc.relation.isPartOf | Communications in Computer and Information Science | - |
dc.citation.title | Communications in Computer and Information Science | - |
dc.citation.volume | 351 CCIS | - |
dc.citation.startPage | 61 | - |
dc.citation.endPage | 67 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | CDN | - |
dc.subject.keywordPlus | Content distribution networks | - |
dc.subject.keywordPlus | Design method | - |
dc.subject.keywordPlus | Dynamic caching | - |
dc.subject.keywordPlus | End users | - |
dc.subject.keywordPlus | Fast response time | - |
dc.subject.keywordPlus | High bandwidth | - |
dc.subject.keywordPlus | Hit ratio | - |
dc.subject.keywordPlus | Media objects | - |
dc.subject.keywordPlus | Multicasts | - |
dc.subject.keywordPlus | pheromone | - |
dc.subject.keywordPlus | Segment-based | - |
dc.subject.keywordPlus | Streaming media | - |
dc.subject.keywordPlus | Computer applications | - |
dc.subject.keywordPlus | Grid computing | - |
dc.subject.keywordPlus | Information technology | - |
dc.subject.keywordPlus | Internet | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordAuthor | CDN | - |
dc.subject.keywordAuthor | pheromone | - |
dc.subject.keywordAuthor | segment based caching | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/978-3-642-35600-1_9 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.