Publications
Detailed Information
Routing and Caching in Information-Centric Networking
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 권태경 | - |
dc.contributor.author | 최훈규 | - |
dc.date.accessioned | 2017-07-13T07:09:16Z | - |
dc.date.available | 2017-07-13T07:09:16Z | - |
dc.date.issued | 2015-02 | - |
dc.identifier.other | 000000026665 | - |
dc.identifier.uri | https://hdl.handle.net/10371/119086 | - |
dc.description | 학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2015. 2. 권태경. | - |
dc.description.abstract | When the Internet was designed decades ago, main applications are resource
sharing such as remote login and file transfer. To support such applications, the key principle in the Internet architecture is point-to-point communications, and the key element is an IP address that identifies a host. Due to the flexible design of the Internet, a wide range of new applications and services have been introduced over the decades. The recent surge of Internet traffic is mainly attributed to applications such as web, P2P file sharing, and video streaming. In such applications, an end user is mostly interested in content itself, not in a particular host or its location. Over the past few years, there have been many efforts to address the above issues from a content centric perspective. Those proposals are collectively called Information Centric Networking (ICN), which is largely deemed as a clean-slate approach. Most of the ICN studies think of content as a key element and hence assume a new paradigm by shifting from host-oriented communications to content-oriented i communications. Consequently, instead of locator-based routing, most ICN proposals consider name-based routing, which decouples content production and consumption in time and space domains. The decoupling enhances content availability and naming persistency, and supports in-network caching, multicast and mobility. Most of ICN proposals use content names as routing entries, and thus the routing scalability is primary concern. ICN allows in-network caching as a built-in functionality. However, if network nodes make caching decisions individually, duplicate copies of the same content may exist among nearby nodes. To address these problems, this dissertation proposes a unified framework named Coordinated Routing and Caching (CoRC) that mitigates routing scalability and enhances the efficiency of the in-network storage. | - |
dc.description.tableofcontents | Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i
I. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 II. Design Principles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.1 How to Make FIBs Scalable? . . . . . . . . . . . . . . . . . . . . . 4 2.2 Where to Place the Cached Item? . . . . . . . . . . . . . . . . . . . 5 2.3 How to Coordinate between Routing and Caching? . . . . . . . . . 5 2.4 How to Reflect the Current Internet Infrastructure and Business? . . 6 III. RelatedWork . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 IV. CoRC: Coordinated Routing and Caching . . . . . . . . . . . . . . 9 4.1 Name Resolution . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.2 Routing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.2.1 Intra-domain Routing . . . . . . . . . . . . . . . . . . . . . 11 4.2.2 Inter-domain Routing . . . . . . . . . . . . . . . . . . . . . 12 4.3 Caching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 V. Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 5.1 Assigning PID prefix to RR . . . . . . . . . . . . . . . . . . . . . . 15 5.2 Hybrid Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 VI. Routing Scalability . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 6.1 AS-FIB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 6.2 PAR-FIB and PIB . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 6.3 Numbers of Entries of Three Tables . . . . . . . . . . . . . . . . . 22 VII. Network Performance . . . . . . . . . . . . . . . . . . . . . . . . . . 24 7.1 Performance Metrics . . . . . . . . . . . . . . . . . . . . . . . . . 24 7.2 Compared Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . 25 7.3 Experimental Setting . . . . . . . . . . . . . . . . . . . . . . . . . 26 7.4 Average Cache Hit Ratio . . . . . . . . . . . . . . . . . . . . . . . 27 7.5 Content Delivery Latency . . . . . . . . . . . . . . . . . . . . . . . 29 7.6 Traffic Load . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 7.7 Route Stretch vs. Topology . . . . . . . . . . . . . . . . . . . . . . 36 VIII.Packet Processing Time in a Router . . . . . . . . . . . . . . . . . . 38 8.1 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 8.2 Drop Rate vs. Interest Packet Rate . . . . . . . . . . . . . . . . . . 39 IX. Discussions and Future Work . . . . . . . . . . . . . . . . . . . . . . 41 9.1 Hashing by Publisher Name . . . . . . . . . . . . . . . . . . . . . 41 9.2 Dealing with Router Failure . . . . . . . . . . . . . . . . . . . . . 42 9.3 Resolution System and Multihoming . . . . . . . . . . . . . . . . . 42 X. Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 | - |
dc.format | application/pdf | - |
dc.format.extent | 3189137 bytes | - |
dc.format.medium | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | 서울대학교 대학원 | - |
dc.subject | Information-Centric Networking | - |
dc.subject | Content-Centric Networking | - |
dc.subject | Routing | - |
dc.subject | Caching | - |
dc.subject.ddc | 621 | - |
dc.title | Routing and Caching in Information-Centric Networking | - |
dc.type | Thesis | - |
dc.contributor.AlternativeAuthor | 정보 중심 네트워크에서의 라우팅 및 캐슁 | - |
dc.description.degree | Doctor | - |
dc.citation.pages | 48 | - |
dc.contributor.affiliation | 공과대학 전기·컴퓨터공학부 | - |
dc.date.awarded | 2015-02 | - |
- Appears in Collections:
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.