Information-Centric Networking (ICN) is an innovative paradigm for the future internet architecture, which addresses IP network limitations in supporting content distribution and information access by decoupling conte...Information-Centric Networking (ICN) is an innovative paradigm for the future internet architecture, which addresses IP network limitations in supporting content distribution and information access by decoupling content from hosts and providing the ability to retrieve a content object by its name (identifier), rather than its storage location (IP address). Name resolution and routing is critical for content retrieval in ICN networks. In this research, we perform a comparative study of two widely used classes of ICN name resolution and routing schemes, namely flooding and Distributed Hash Table (DHT). We consider the flooding-based routing in Content-Centric Networks due to its wide acceptance. For the DHT scheme, we design a multi-level DHT that takes into account the underlying network topology and uses name aggregation to further reduce control overhead and improve network efficiency. Then, we compare the characteristics and performance of these two classes of name resolution and routing through extensive simulations. The evaluation results show that the performances of these two approaches are reliant on several factors, including network size, content location dynamics, and content popularity. Our study reveals insights into the design tradeoffs and offers guidelines for design strategies.展开更多
Information-Centric Networking (ICN) treat contents as the first class citizens and adopt content names for routing. However, ICN faces challenges of big data. The massive content names and location-independent naming...Information-Centric Networking (ICN) treat contents as the first class citizens and adopt content names for routing. However, ICN faces challenges of big data. The massive content names and location-independent naming bring scalability and efficiency challenges for content addressing. A scalable and efficient name-based routing scheme is a critical component for ICN. This paper proposes a novel Scalable Name-based Geometric Routing scheme, SNGR. To resolve the location-independent names to locations, SNGR utilizes a bi-level sloppy grouping design. To provide scalable location-dependent routing for name resolution, SNGR proposess a universal geometric routing framework. Our theoretical analyses guarantee the performance of SNGR. The experiments by simulation show that SNGR outperformances other similar routing schemes in terms of the scalability of routing table, the reliability to failures, as well as path stretch and latency in name resolution.展开更多
为了从根本上解决现有互联网存在的可扩展性、移动性和安全性等方面的问题,全新的未来互联网体系结构得到了广泛研究.其中,命名数据网络(named data networking,简称NDN)利用网内缓存和多路转发实现了基于层次化名字的高效数据传输,从...为了从根本上解决现有互联网存在的可扩展性、移动性和安全性等方面的问题,全新的未来互联网体系结构得到了广泛研究.其中,命名数据网络(named data networking,简称NDN)利用网内缓存和多路转发实现了基于层次化名字的高效数据传输,从根本上解决了现有互联网所面临的问题.内容的层次化名字具有数量庞大、结构复杂等特点,现有的基于IP的路由转发机制无法直接应用于NDN网络,需要有针对性地研究高效的层次化名字路由机制,保证海量网络内容的正常路由转发.路由聚合是缩减网络路由规模的主要措施.不同于现有的面向本地NDN路由表查表过程的优化,路由聚合需要全网协同处理,在不同网络节点上不断对聚合路由进行聚合.这对聚合路由标识和聚合路由可用性评估提出了诸多要求.为此,研究并提出了针对层次化名字路由的聚合机制,包括两个方面的工作:(1)构建了一种全新的计数布隆过滤器——堆叠布隆过滤器,该过滤器支持多过滤器合并,用于压缩表示被聚合路由名字;(2)给出了一种动态路由聚合机制,在保证NDN网络路由转发准确性的同时,缩小全网路由规模,最大程度地优化了路由转发效率.在真实网络拓扑上构建了仿真平台,经过实验验证,该路由聚合机制以可控的少量冗余转发为代价,有效地压缩了全网路由规模,提升了全网路由转发效率,保证了海量在线内容的高效路由转发,为NDN网络投入实际部署提供了前提.展开更多
文摘Information-Centric Networking (ICN) is an innovative paradigm for the future internet architecture, which addresses IP network limitations in supporting content distribution and information access by decoupling content from hosts and providing the ability to retrieve a content object by its name (identifier), rather than its storage location (IP address). Name resolution and routing is critical for content retrieval in ICN networks. In this research, we perform a comparative study of two widely used classes of ICN name resolution and routing schemes, namely flooding and Distributed Hash Table (DHT). We consider the flooding-based routing in Content-Centric Networks due to its wide acceptance. For the DHT scheme, we design a multi-level DHT that takes into account the underlying network topology and uses name aggregation to further reduce control overhead and improve network efficiency. Then, we compare the characteristics and performance of these two classes of name resolution and routing through extensive simulations. The evaluation results show that the performances of these two approaches are reliant on several factors, including network size, content location dynamics, and content popularity. Our study reveals insights into the design tradeoffs and offers guidelines for design strategies.
基金This research is supported in part by the National High-Tech Development 863 Program of China under Grant No. 2012AA012506, the National Science and Technology Pillar Program of China under Grant No. 2012BAH37B00, and the National Natural Science Foundation of China under Grant No. 61202457.
文摘Information-Centric Networking (ICN) treat contents as the first class citizens and adopt content names for routing. However, ICN faces challenges of big data. The massive content names and location-independent naming bring scalability and efficiency challenges for content addressing. A scalable and efficient name-based routing scheme is a critical component for ICN. This paper proposes a novel Scalable Name-based Geometric Routing scheme, SNGR. To resolve the location-independent names to locations, SNGR utilizes a bi-level sloppy grouping design. To provide scalable location-dependent routing for name resolution, SNGR proposess a universal geometric routing framework. Our theoretical analyses guarantee the performance of SNGR. The experiments by simulation show that SNGR outperformances other similar routing schemes in terms of the scalability of routing table, the reliability to failures, as well as path stretch and latency in name resolution.
文摘为了从根本上解决现有互联网存在的可扩展性、移动性和安全性等方面的问题,全新的未来互联网体系结构得到了广泛研究.其中,命名数据网络(named data networking,简称NDN)利用网内缓存和多路转发实现了基于层次化名字的高效数据传输,从根本上解决了现有互联网所面临的问题.内容的层次化名字具有数量庞大、结构复杂等特点,现有的基于IP的路由转发机制无法直接应用于NDN网络,需要有针对性地研究高效的层次化名字路由机制,保证海量网络内容的正常路由转发.路由聚合是缩减网络路由规模的主要措施.不同于现有的面向本地NDN路由表查表过程的优化,路由聚合需要全网协同处理,在不同网络节点上不断对聚合路由进行聚合.这对聚合路由标识和聚合路由可用性评估提出了诸多要求.为此,研究并提出了针对层次化名字路由的聚合机制,包括两个方面的工作:(1)构建了一种全新的计数布隆过滤器——堆叠布隆过滤器,该过滤器支持多过滤器合并,用于压缩表示被聚合路由名字;(2)给出了一种动态路由聚合机制,在保证NDN网络路由转发准确性的同时,缩小全网路由规模,最大程度地优化了路由转发效率.在真实网络拓扑上构建了仿真平台,经过实验验证,该路由聚合机制以可控的少量冗余转发为代价,有效地压缩了全网路由规模,提升了全网路由转发效率,保证了海量在线内容的高效路由转发,为NDN网络投入实际部署提供了前提.
