Cache-less redundancy using hypergraph in information-centric network
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 th...
Main Authors: | , , |
---|---|
Format: | Article |
Published: |
American Scientific Publishers
2015
|
Subjects: |
_version_ | 1825803878533169152 |
---|---|
author | Abdulllahi, Ibrahim Che Mohamed Arif, Ahmad Suki Hassan, Suhaidi |
author_facet | Abdulllahi, Ibrahim Che Mohamed Arif, Ahmad Suki Hassan, Suhaidi |
author_sort | Abdulllahi, Ibrahim |
collection | UUM |
description | 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. |
first_indexed | 2024-07-04T06:05:10Z |
format | Article |
id | uum-17465 |
institution | Universiti Utara Malaysia |
last_indexed | 2024-07-04T06:05:10Z |
publishDate | 2015 |
publisher | American Scientific Publishers |
record_format | eprints |
spelling | uum-174652016-04-26T08:30:20Z https://repo.uum.edu.my/id/eprint/17465/ Cache-less redundancy using hypergraph in information-centric network Abdulllahi, Ibrahim Che Mohamed Arif, Ahmad Suki Hassan, Suhaidi QA76 Computer software 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. American Scientific Publishers 2015-11 Article PeerReviewed 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 http://www.aspbs.com/science/contents-science2015.htm#2111 |
spellingShingle | QA76 Computer software Abdulllahi, Ibrahim Che Mohamed Arif, Ahmad Suki Hassan, Suhaidi Cache-less redundancy using hypergraph in information-centric network |
title | Cache-less redundancy using hypergraph in information-centric network |
title_full | Cache-less redundancy using hypergraph in information-centric network |
title_fullStr | Cache-less redundancy using hypergraph in information-centric network |
title_full_unstemmed | Cache-less redundancy using hypergraph in information-centric network |
title_short | Cache-less redundancy using hypergraph in information-centric network |
title_sort | cache less redundancy using hypergraph in information centric network |
topic | QA76 Computer software |
work_keys_str_mv | AT abdulllahiibrahim cachelessredundancyusinghypergraphininformationcentricnetwork AT chemohamedarifahmadsuki cachelessredundancyusinghypergraphininformationcentricnetwork AT hassansuhaidi cachelessredundancyusinghypergraphininformationcentricnetwork |