MARC보기
LDR03366nmm uu200457 4500
001000000331952
00520240805165718
008181129s2018 |||||||||||||||||c||eng d
020 ▼a 9780438019775
035 ▼a (MiAaPQ)AAI10826350
035 ▼a (MiAaPQ)ucla:16832
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 248032
0820 ▼a 004
1001 ▼a Abani, Noor.
24510 ▼a Caching Strategies for Private and Efficient Content Retrieval in Information-Centric Networks.
260 ▼a [S.l.] : ▼b University of California, Los Angeles., ▼c 2018
260 1 ▼a Ann Arbor : ▼b ProQuest Dissertations & Theses, ▼c 2018
300 ▼a 123 p.
500 ▼a Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
500 ▼a Adviser: MARIO GERLA.
5021 ▼a Thesis (Ph.D.)--University of California, Los Angeles, 2018.
520 ▼a In the recent years, we have witnessed an explosive growth of content on the Internet (storage, retrieval, delivery). Consequently, the usage of computer networking shifted from sharing hardware and processing resources, as its purpose was in th
520 ▼a Information Centric Networking (ICN) is a proposal for a future network architecture to better adapt to the current needs of users connected to the Internet. ICN shifts from the current host-centric TCP/IP architecture to one where content is th
520 ▼a Disposing of the end-to-end principle that keeps end-to-end transactions unaware of resources and content available along the path, ICN leverages in-network caching to make content distribution more efficient by reducing network traffic, downloa
520 ▼a In current ICN implementations, the default caching strategy is one where each router caches every piece of content that passes through it. It has been shown in previous work that such a universal mode of caching is inefficient, highly redundant
520 ▼a This thesis addresses the aforementioned limitations by designing caching strategies that aim at reducing redundancy, replacement rates and protect user privacy. The problem is first formulated as an optimization problem that finds the optimal s
520 ▼a In addition to its inefficiency, universal caching has also caused the emergence of several privacy risks. Timing attacks are one such privacy breach where attackers use timing analysis of data retrievals to analyze users' interests in particula
520 ▼a Lastly, we also design a proactive caching strategy for ICN where user content is prefetched and cached before it is requested. Previously, proactive caching has been considered for edge networks only. In this thesis, we design a proactive cachi
520 ▼a The end goal of this thesis is a better understanding of the limitations of a universal caching policy, in addition to designing both reactive and proactive caching strategies that, in comparison, provide more efficient content retrieval, while
590 ▼a School code: 0031.
650 4 ▼a Computer science.
690 ▼a 0984
71020 ▼a University of California, Los Angeles. ▼b Computer Science 0201.
7730 ▼t Dissertation Abstracts International ▼g 79-10B(E).
773 ▼t Dissertation Abstract International
790 ▼a 0031
791 ▼a Ph.D.
792 ▼a 2018
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T14998869 ▼n KERIS
980 ▼a 201812 ▼f 2019
990 ▼a 관리자