Total views : 360
Selective Placement of Caches for Hash-Based Off-Path Caching in ICN
In-network caching has evidently emerged as an indispensable core functionality of ICN. Of the various types of caching techniques, off-path caching turns out to be a potential technique. With a view to improve the performance of hash-based off-path caching, the aim of the paper is to ensure profitable, economic and selective placement of caches such that the final cache allocation tends to reduce simultaneously average retrieval delay and maximum internal link-stress. To achieve the same, we propose simple yet elegant heuristic algorithm to strategically identify and exclude the bad node-positions for placement of caches. More specifically, for a given topology, the algorithm computes cost (in terms of delay) for all the nodes and prepares a cost based descending ordered list of nodes. Further, iteratively, increasing number of nodes, in sequence, from the cost-based ordered list of nodes are debarred from caching thereby resulting in family of solutions. A solution represents a selective cache allocation map corresponding to the number of debarred nodes. Moreover, every iterative solution reduces average retrieval delay and seeks opportunistic reduction in maximum internal linkstress. Comparing the solutions graphically would enable network operators to finally select (as per desire) one cache allocation map for a given network topology for hash-based off-path caching. In a way, the selected cache allocation map for the considered topology implies that it is better to place the caches at the core of the network as compared to edge.
Content Centric Networking, In-Network Caching, Information Centric Networking, Off-Path Caching, Selective Cache Placement.
- Zhang L, Estrin D, Burke J, Jacobson V, Thornton JD, Smetters DK, Zhang B, Tsudik G, Massey D, Papadopoulos C, Abdelzaher T. Named data networking (ndn) project. Tech. Report NDN-0001, Xerox Palo Alto Research Center-PARC. 2010 Oct 31.
- Kalla A, Sharma SK. A constructive review of in-network caching: A core functionality of ICN. 2016 International Conference on Computing Communication and Automation (ICCCA) IEEE. 2016 Apr 29.
- Kalla A, Sharma S. Exploring off-path caching with edge caching in Information Centric Networking. 2016 International Conference on Computational Techniques in Information and Communication Technologies (ICCTICT), IEEE. 2016 Mar 11.p. 630–5.
- Saucez D, Kalla A, Barakat C, Turletti T. Minimizing bandwidth on peering links with deflection in named data networking. INRIA Sophia Antipolis Mediterranee. Tech Rep. 2012 Mar.[Online].Available from: http://hal.inria.fr/hal-00684453
- Saino L, Psaras I, Pavlou G. Hash-routing schemes for information centric networking. Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking, ACM. 2013 Aug 12; 27–32.
- Li C, Okamura K. Cluster-based In-networking Caching for Content-Centric Networking. International Journal of Computer Science and Network Security (IJCSNS). 2014 Nov 1; 14(11):1.
- Saha S, Lukyanenko A, Yla-Jaaski A. Cooperative caching through routing control in information-centric networks. In INFOCOM, 2013 Proceedings IEEE. 2013 Apr 14; 100–4.
- Wang S, Bi J, Wu J. Collaborative caching based on hash-routing for information-centric networking. ACM SIGCOMM Computer Communication Review, ACM. 2013 Aug 12; 43(4):535–6.
- Salah H, Strufe T. CoMon: An architecture for coordinated caching and cache-aware routing in CCN. In2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC). 2015 Jan 9. p. 663–70.
- Thar K, Ullah S, Hong CS. Consistent hashing based cooperative caching and forwarding in content centric network. 2014 16th Asia-Pacific Network Operations and Management Symposium (APNOMS), IEEE. 2014 Sep 17; 1–4.
- Perino D, Varvello M. A reality check for content centric networking. In Proceedings of the ACM SIGCOMM workshop on Information-centric networking. 2011 Aug 19; 44–9.
- Wang Y, Li Z, Tyson G, Uhlig S, Xie G. Optimal cache allocation for content-centric networking. In 2013 21st IEEE International Conference on Network Protocols (ICNP). 2013 Oct 7. p. 1–10.
- Araldo A, Mangili M, Martignon F, Rossi D. Cost-aware caching: optimizing cache provisioning and object placement in ICN. 2014 IEEE Global Communications Conference 2014 Dec 8. p. 1108–13.
- Azimdoost B, Farhadi G, Abani N, Ito A. Optimal in-network cache allocation and content placement. In 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), IEEE. 2015 Apr 26. p. 263–8.
- Rosensweig EJ, Kurose J. Breadcrumbs: Efficient, best-effort content location in cache networks. INFOCOM 2009, IEEE. 2009 Apr 19; 2631–5.
- Li Z, Simon G. Time-shifted tv in content centric networks: The case for cooperative in-network caching. 2011 IEEE International Conference on Communications (ICC), IEEE. 2011 Jun 5. p. 1–6.
- Lee M, Cho K, Park K, Kwon T, Choi Y. Scan: Scalable content routing for content-aware networking. In2011 IEEE International Conference on Communications (ICC), IEEE. 2011 Jun 5. p. 1–5.
- Guo S, Xie H, Shi G. Collaborative forwarding and caching in content centric networks. InInternational Conference on Research in Networking, Springer Berlin Heidelberg. 2012 May 21. p. 41–55.
- Wang JM, Zhang J, Bensaou B. Intra-AS cooperative caching for content-centric networks. In Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking, ACM. 2013 Aug 12; 61–6.
- Zhang G, Wang X, Gao Q, Liu Z. A Hybrid ICN Cache Coordination Scheme Based on Role Division between Cache Nodes. In 2015 IEEE Global Communications Conference (GLOBECOM), IEEE. 2015 Dec 6. p. 1–6.
- Rath HK, Panigrahi B, Simha A. On Cooperative On-Path and Off-Path Caching Policy for Information Centric Networks (ICN). In 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA), IEEE. 2016 Mar 23. p. 842–9.
- Spring N, Mahajan R, Wetherall D. Measuring ISP topologies with Rocketfuel. ACM SIGCOMM Computer Communication Review. 2002 Oct 1; 32(4):133–45.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.