On Inter-Domain Name Resolution for Information-Centric Networks

Abstract

Abstract. Information-centric networking (ICN) is a paradigm that aims to better reflect current Internet usage patterns by focusing on information, rather than on hosts. One of the most critical ICN functionalities is the efficient resolution/location of information objects i.e., name resolution. The vast size of the information object namespace calls for a highly scalable and efficient name resolution approach. Currently proposed solutions either rely on a DHT structure, thus ensuring load balancing and scalability at the cost of inefficient routing, or on hierarchical structures, thus preserving routing efficiency at the cost of limited scalability. In this paper, we study in detail the tradeoff between state/signaling overhead versus routing efficiency for a generic nameresolution system based on a novel DHT scheme with enhanced routing properties, and compare it to DONA, an ICN architecture based on hierarchical resolution and routing.

Cloud Computing for Global Name-Resolution in Information-centric Networks

“…There has been recently a lot of effort put on multi-level DHTs [12], [8], [11] for name resolution approaches. The motivation for such solutions is the scalability of hierarchical schemes and the load distribution properties of DHTs, with [10] also using Bloom-filter based aggregation techniques that fit the context of ICN.…”

“…A common point for such solutions is the organization of the hierarchy based on inter-domain relations, enhanced by DHT influenced characteristics with respect to the routing of requests for resolution. For instance, [12] leverages the inherent ability of the Pastry DHT to respect locality through the use of a proximity metric, resulting in short routes and route convergence. However, all DHT-inspired solutions suffer from violating BGP routing policies as overlay hops go back and forth across the topological hierarchy with solutions such as [12] trying to mitigate that particular issue.…”

“…For instance, [12] leverages the inherent ability of the Pastry DHT to respect locality through the use of a proximity metric, resulting in short routes and route convergence. However, all DHT-inspired solutions suffer from violating BGP routing policies as overlay hops go back and forth across the topological hierarchy with solutions such as [12] trying to mitigate that particular issue. Moreover, DHT-like routing increases hop stretch for resolution and, depending on data path formation, even for data routing as well.…”

“…Intuitively, the aggregation of routing information at the higher levels of the AS-level topology raises concerns on the ability of DONA to scale, especially when considering the huge size of the routing name space. In order to address these concerns, other approaches have taken advantage of the scalability properties of distributed hash tables (DHTs) [8], [11], [10], [12]. However, it has been shown that a significant penalty is payed for this scalability, expressed in highly stretched name-resolution paths, often also violating the underlying routing policies, even in the presence of extensive caching [12].…”

“…In order to address these concerns, other approaches have taken advantage of the scalability properties of distributed hash tables (DHTs) [8], [11], [10], [12]. However, it has been shown that a significant penalty is payed for this scalability, expressed in highly stretched name-resolution paths, often also violating the underlying routing policies, even in the presence of extensive caching [12]. This is in direct contrast to DONA (and similar approaches [13]) where name-resolution paths always follow shortest-path, BGP compliant routes.…”