mailto:uumlib@uum.edu.my 24x7 Service; AnyTime; AnyWhere

Cache-less redundancy using hypergraph in information-centric network

Abdulllahi, Ibrahim and Che Mohamed Arif, Ahmad Suki and Hassan, Suhaidi (2015) Cache-less redundancy using hypergraph in information-centric network. Advanced Science Letters, 21 (11). pp. 3546-3551. ISSN 1936-6612

Full text not available from this repository. (Request a copy)

Abstract

Information dissemination has been the practice of today’s Internet with media data overtaking the ordinary textual information. A need to subscribe to Information-centric network has been seen as an option to provide better manageability of the future Internet. Caching is therefore assumed to be the most beneficial practice for fast delivery of information, saving cost and efficient bandwidth utilization. However, in the popular caching strategy, content and path redundancy has necessitated an extension for mitigating their effects. This paper provides an approach of mitigating high content and path redundancy in information-centric network using hypergraph properties of arcs and clustering. A comparison of some popular cache deployment strategies was analyzed based on simulation results. The paper proposes a cache deployment strategy using hypergraph with less content and path redundancy to improve content delivery in ICN.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA76 Computer software
Divisions: School of Computing
Depositing User: Dr. Ahmad Suki Che Mohamed Arif
Date Deposited: 08 Mar 2016 07:21
Last Modified: 26 Apr 2016 08:30
URI: https://repo.uum.edu.my/id/eprint/17465

Actions (login required)

View Item View Item