Abstract
The information-centric network (ICN) is a new paradigm shift from the traditional IP-based network architecture. In the ICN architecture, any node can have a storage capacity to store contents. Hence, the content allocation algorithm has been actively studied. However, many researches have proposed heuristic content allocation algorithms without considering the system-wise performance. In this paper, we study a content allocation algorithm to minimize the sum of the average end-to-end service times of client nodes. Numerical results show that the proposed content allocation algorithm significantly decreases the sum of the average end-to-end service times of client nodes.
Original language | English |
---|---|
Title of host publication | 30th International Conference on Information Networking, ICOIN 2016 |
Publisher | IEEE Computer Society |
Pages | 135-140 |
Number of pages | 6 |
ISBN (Electronic) | 9781509017249 |
DOIs | |
Publication status | Published - 2016 Mar 7 |
Event | 30th International Conference on Information Networking, ICOIN 2016 - Kota Kinabalu, Malaysia Duration: 2016 Jan 13 → 2016 Jan 15 |
Publication series
Name | International Conference on Information Networking |
---|---|
Volume | 2016-March |
ISSN (Print) | 1976-7684 |
Other
Other | 30th International Conference on Information Networking, ICOIN 2016 |
---|---|
Country/Territory | Malaysia |
City | Kota Kinabalu |
Period | 16/1/13 → 16/1/15 |
Bibliographical note
Funding Information:The work was supported in part by Mid-career Researcher Program through NRF grant funded by the MSIP, Korea (2013R1A2A2A01069053).
Publisher Copyright:
© 2016 IEEE.
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Information Systems