Redundancy Elimination in the Future Internet
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 Na...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Language: | English |
| Published: |
Springer
2016
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/25169/1/iCMS%202015%2067%2073.pdf |
| _version_ | 1825805236251394048 |
|---|---|
| author | Din, Ikram Ud Hassan, Suhaidi Habbal, Adib M. Monzer |
| author2 | Ahmad, Abd-Razak |
| author_facet | Ahmad, Abd-Razak Din, Ikram Ud Hassan, Suhaidi Habbal, Adib M. Monzer |
| author_sort | Din, Ikram Ud |
| collection | UUM |
| description | 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. |
| first_indexed | 2024-07-04T06:28:59Z |
| format | Book Section |
| id | uum-25169 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:28:59Z |
| publishDate | 2016 |
| publisher | Springer |
| record_format | eprints |
| spelling | uum-251692018-11-11T03:38:55Z https://repo.uum.edu.my/id/eprint/25169/ Redundancy Elimination in the Future Internet Din, Ikram Ud Hassan, Suhaidi Habbal, Adib M. Monzer QA75 Electronic computers. Computer science 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. Springer Ahmad, Abd-Razak Liew, Kee Kor Ahmad, Illiasaak Idrus, Zanariah 2016 Book Section PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/25169/1/iCMS%202015%2067%2073.pdf 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 http://doi.org/10.1007/978-981-10-2772-7_7 doi:10.1007/978-981-10-2772-7_7 doi:10.1007/978-981-10-2772-7_7 |
| spellingShingle | QA75 Electronic computers. Computer science Din, Ikram Ud Hassan, Suhaidi Habbal, Adib M. Monzer Redundancy Elimination in the Future Internet |
| title | Redundancy Elimination in the Future Internet |
| title_full | Redundancy Elimination in the Future Internet |
| title_fullStr | Redundancy Elimination in the Future Internet |
| title_full_unstemmed | Redundancy Elimination in the Future Internet |
| title_short | Redundancy Elimination in the Future Internet |
| title_sort | redundancy elimination in the future internet |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/25169/1/iCMS%202015%2067%2073.pdf |
| work_keys_str_mv | AT dinikramud redundancyeliminationinthefutureinternet AT hassansuhaidi redundancyeliminationinthefutureinternet AT habbaladibmmonzer redundancyeliminationinthefutureinternet |