Din, Ikram Ud and Hassan, Suhaidi and Habbal, Adib M. Monzer (2016) Redundancy Elimination in the Future Internet. In: Proceedings of the International Conference on Computing, Mathematics and Statistics (iCMS 2015). Springer, Singapore, pp. 67-73. ISBN 978-981-10-2770-3

PDF Restricted to Registered users only Download (200kB) | Request a copy

Abstract

Information-Centric Networking (ICN), also called Content-Centric Networking, is the most ascendant architecture for the Future Internet.In ICN, network nodes cache contents for a time before forwarding them to the end users.One of the applicable proposals to in-network caching, called Networking Named Content (NNC), suggests that caching contents at every node along the path can improve caching gain in terms of hit rate and content retrieval delay. However, storing content items at every node along the path can increase the chances of redundancy. Some strategies investigated that caching contents at only one intermediate node along the path can reduce the chances of redundancy. In addition, some strategies suggested that storing only popular contents can do better in performance, especially in reduced content redundancy. In this paper, we present a scheme, named Content Placement Mechanism (CPM), based on popularity of the contents that is suitable for redundancy elimination.

Item Type:	Book Section
Uncontrolled Keywords:	Information-centric networking Redundancy Caching Content placement
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	School of Computing
Depositing User:	Mrs. Norazmilah Yaakub
Date Deposited:	11 Nov 2018 03:38
Last Modified:	11 Nov 2018 03:38
URI:	https://repo.uum.edu.my/id/eprint/25169

Actions (login required)

View Item