DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Rhee, June-Koo | - |
dc.contributor.advisor | 이준구 | - |
dc.contributor.author | Lim, Kyong-Chun | - |
dc.contributor.author | 임경천 | - |
dc.date.accessioned | 2015-04-23T06:14:46Z | - |
dc.date.available | 2015-04-23T06:14:46Z | - |
dc.date.issued | 2014 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=569273&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/196801 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기및전자공학과, 2014.2, [ v, 42 p. ] | - |
dc.description.abstract | Content delivery network (CDN) with a high quality-of-service (QoS) requirement deals with three challenging problems: 1) a cache server deployment problem to determine where to locate cache servers, 2) a request routing problem to settle which cache server serves a user request, and 3) a content replication problem to decide which content is stored in a cache server. Cooperation among cache servers significantly improves the user QoS by increasing the cached content diversity of the network. Since the aforementioned problems are tightly coupled, we formulate a new CDN model which jointly considers all the three problems under the cooperative content replication with optimal solutions using integer linear programming. As the joint optimization problem is an NP-hard problem, we propose a greedy heuristic algorithm which is close to the optimal solution. Furthermore, we also suggest the dynamic algorithm determining request routing and stored contents with cache server positions obtained from the optimal solution. In the simulation part, we consider two scenarios for application of the algorithm, where the popularities of contents are identical and are different among nodes which are homogeneous and heterogeneous scenarios, respectively. The three kinds of simulations are conducted. First, the simulation on $2\times3$ grid and tree topologies at the homogeneous scenario is conducted. Second, the simulation on $2\times3$ grid and tree topologies at the heterogeneous scenario is conducted. By conducting four simulations, the performance between the cooperation and the non-cooperation models are compared and the performance of the heuristic algorithm is investigated. Third, the performance of the algorithm is investigated on the actual topology sampled from the Level 3 CDN network. In all three cases, the performance evaluations are conducted between optimal solution and solution from the dynamic algorithm. By increasing the cached content diversity in the network,... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | CDN | - |
dc.subject | 캐싱 협력 | - |
dc.subject | 요청 라우팅 | - |
dc.subject | 콘텐츠 캐싱 | - |
dc.subject | 캐시 포설 | - |
dc.subject | 최적화 | - |
dc.subject | optimization | - |
dc.subject | cache deployment | - |
dc.subject | content replication | - |
dc.subject | request routing | - |
dc.subject | cooperative caching | - |
dc.subject | 콘텐츠 전달망 | - |
dc.title | Joint optimization for cooperative content delivery network design | - |
dc.title.alternative | 캐시 협력 콘텐츠 전달망 디자인을 위한 공동 최적화 연구 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 569273/325007 | - |
dc.description.department | 한국과학기술원 : 전기및전자공학과, | - |
dc.identifier.uid | 020123568 | - |
dc.contributor.localauthor | Rhee, June-Koo | - |
dc.contributor.localauthor | 이준구 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.