eprintid: 1500862 rev_number: 39 eprint_status: archive userid: 608 dir: disk0/01/50/08/62 datestamp: 2016-06-21 17:28:20 lastmod: 2021-09-20 00:09:57 status_changed: 2016-10-31 14:52:10 type: article metadata_visibility: show creators_name: Sourlas, V creators_name: Psaras, I creators_name: Saino, L creators_name: Pavlou, G title: Efficient Hash-routing and Domain Clustering Techniques for Information-Centric Networks ispublished: pub divisions: UCL divisions: B04 divisions: C05 divisions: F46 keywords: Information-centric networks; Cache aware routing; Off-path in-network caching; Nodal clustering/partitioning; Hash routing note: Copyright © 2016 Elsevier B.V. All rights reserved. This is the preprint version of the article published in Computer Networks; the final Version of Record is available at http://dx.doi.org/10.1016/j.comnet.2016.04.001 abstract: Hash-routing is a well-known technique used in server-cluster environments to direct content requests to the responsible servers hosting the requested content. In this work, we look at hash-routing from a different angle and apply the technique to Information-Centric Networking (ICN) environments, where in-network content caches serve as temporary storage for content. In particular, edge-domain routers re-direct requests to in-network caches, more often than not off the shortest path, according to the hash-assignment function. Although the benefits of this off-path in-network caching scheme are significant (e.g., high cache hit rate with minimal co-ordination overhead), the basic scheme comes with disadvantages. That is, in case of very large domains the off-path detour of requests might increase latency to prohibitive levels. In order to deal with extensive detour delays, we investigate nodal/domain clustering techniques, according to which large domains are split in clusters, which in turn apply hash-routing in the subset of nodes of each cluster. We model and evaluate the behaviour of nodal clustering and report significant improvement in delivery latency, which comes at the cost of a slight decrease in cache hit rates (i.e., up to 50% improvement in delivery latency for less than 10% decrease in cache hit rate compared to the original hash-routing scheme applied in the whole domain). date: 2016-07-05 date_type: published official_url: http://dx.doi.org/10.1016/j.comnet.2016.04.001 oa_status: green full_text_type: other language: eng primo: open primo_central: open_green verified: verified_manual elements_id: 1136853 doi: 10.1016/j.comnet.2016.04.001 lyricists_name: Pavlou, George lyricists_name: Psaras, Ioannis lyricists_name: Saino, Lorenzo lyricists_name: Sourlas, Vasilis lyricists_id: GPAVL62 lyricists_id: IPSAR42 lyricists_id: LSAIN33 lyricists_id: VSOUR37 actors_name: Sourlas, Vasileios actors_id: VSOUR37 actors_role: owner full_text_status: public publication: Computer Networks volume: 103 pagerange: 67-83 issn: 1389-1286 citation: Sourlas, V; Psaras, I; Saino, L; Pavlou, G; (2016) Efficient Hash-routing and Domain Clustering Techniques for Information-Centric Networks. Computer Networks , 103 pp. 67-83. 10.1016/j.comnet.2016.04.001 <https://doi.org/10.1016/j.comnet.2016.04.001>. Green open access document_url: https://discovery.ucl.ac.uk/id/eprint/1500862/1/Sourlas%20et%20al%202016%20Efficient%20hash-routing%20and%20domain%20clustering%20techniques%20for%20information-centric%20networks.pdf