컨텐트 중심 네트워킹을 위한 효율적인 라우팅 및 캐시 관리 기법
Efficient Routing and Cache Management for Content-Centric Networking
- 주제(키워드) 컨텐트 중심 네트워킹 , 라우팅 , 캐시 관리 , Content Centric Networking , Routing , Forwarding , Cache Management
- 발행기관 아주대학교
- 지도교수 고영배
- 발행년도 2014
- 학위수여년월 2014. 2
- 학위명 박사
- 학과 및 전공 일반대학원 컴퓨터공학과
- 실제URI http://www.dcollection.net/handler/ajou/000000016233
- 본문언어 영어
- 저작권 아주대학교 논문은 저작권에 의해 보호받습니다.
초록/요약
Content-Centric Networking (CCN) is a new, redesigned communication networking architecture of the Internet to replace traditional host-centric communication with content-centric communication. CCN proposes an architecture which is centered on the content itself, without regard to where it is physically located. The CCN architecture includes an in-network caching and a content-based routing as main features where every content has its own name as an identifier. Although content-centric networking embraces caching and content-based routing, there is little work on the comprehensive interaction between them. Most ongoing research on content-centric networking is centered on independent research item among emerging contents analysis, content naming, caching technology, and content-oriented routing. Therefore, we have an aim for synergy between cache management and content-based routing. To reliably evaluate CCN performances, we developed OPNET CCN Simulator which is easy to configure diverse network environments. It covers most functionality of existing CCN simulators and overcome their drawbacks by providing GUI-based configuration, heterogeneous cache management and CCN topology generator software that allows users to generate diverse Internet-like topologies with node naming. Then, we propose the lightweight prefix-based routing protocol with a consideration of the complexity of the longest-prefix matching in CCN. The proposed scheme limits the area of route discovery to reduce the number of entries in the routing table and FIB with aggregation mechanism. Furthermore, the LPR provides a method of using inter-hierarchical connections to reduce overall route lengths. As an interactive mechanism between cache replacement and cache-aware routing, the pheromone-based cache replacement and forwarding algorithm is proposed with a new metric, pheromone. This metric represents a degree of content concentration for a particular category. In addition, the metric is utilized to diverse the cached contents in the local area and to forward Interest to a router which has been expected to cache the required content. Then, the forwarding algorithm leads to concentrate contents of the particular category in the router even if cache miss occurs. In addition, the cache capacity-aware content centric networking is proposed for an interaction between cache replication and cache-aware routing. This proposal considers cache capacity as a main metric which is a supportable caching space and can be defined with a willingness degree by the previous proposal. The proposed scheme is composed of a selective caching and a cache-aware routing algorithm which provides deterministic cache-awareness without any control message. Then, with analysis about CCN performance under flash crowd, the CC-CCN mechanism is extended with flash crowd detection and related confrontational procedures to reduce network impact by flash crowd. Simulation studies for each proposed scheme show that content-based routing mechanisms in both sides of server-aware and cache-aware routing need little control overhead and help cache hit ratio to be improved. In addition, a synergy effect between the proposed cache management algorithms and the cache-aware routing makes significant caching performance improvement and network load reduction even in flash crowd effect.
more목차
CHAPTER I INTRODUCTION １
I.A. Background １
I.B. Summary of the Thesis ２
CHAPTER II RELATED WORK ６
II.A. Taxonomy in Content-Centric Networking ６
II.B. In-network Caching ８
II.C. Content-based Routing １１
II.D. Position of Proposed Schemes １２
CHAPTER III LIGHTWEIGHT PREFIX-BASED ROUTING １３
III.A. Introduction １３
III.B. Problem Definition １５
III.C. Lightweight Prefix-based Routing (LPR) １８
III.C.1. Neighbor Discovery １８
III.C.2. Lightweight Route Discovery ２０
III.C.3. FIB Construction and Prefix-based Routing ２２
III.D. Performance Evaluation ２４
III.D.1. Simulation Environments ２４
III.D.2. Simulation Results ２６
CHAPTER IV PHEROMONE-BASED CACHE REPLACEMENT AND FORWARDING ２９
IV.A. Introduction ２９
IV.B. Problem Definition ３０
IV.C. Pheromone-based CCN (P-CCN) ３３
IV.C.1. Pheromone Estimation and Propagation ３４
IV.C.2. Pheromone-based Cache Replacement ３６
IV.C.3. Pheromone-based Forwarding ３８
IV.D. Performance Evaluation ４３
IV.D.1. Simulation Environments ４３
IV.D.2. Simulation Results ４５
CHAPTER V CACHE CAPACITY-AWARE CCN ４８
V.A. Introduction ４８
V.B. Problem Definition ４９
V.C. Cache Capacity-aware CCN (CC-CCN) ５４
V.C.1. Cache Capacity Estimation ５４
V.C.2. Selective Caching ５７
V.C.3. Cache-aware Routing ５９
V.D. Performance Evaluation ６１
V.D.1. Simulation Environments ６１
V.D.2. Simulation Results ６２
CHAPTER VI CONCLUSION AND FUTURE WORKS ６８
APPENDIX: OPNET CCN SIMULATOR ７２
A. Introduction ７２
B. Problem Definition ７２
C. OPNET CCN Simulator ７４
1. Node Models ７５
2. System Parameter Management ７８
3. CCN Topology Generation ７９
D. Verification of OPNET CCN Simulator ８０
1. CCN Traffic Generator ８０
2. CCN Route Support and Forwarding Engine ８２
3. Content Store (Cache Management) ８３
