Internet Research Task Force (IRTF) K. Pentikousis, Ed.
Request for Comments: 7945 Travelping
Category: Informational B. Ohlman
ISSN: 2070-1721 Ericsson
E. Davies
Trinity College Dublin
S. Spirou
Intracom Telecom
G. Boggia
Politecnico di Bari
September 2016
Internet Research Task Force (IRTF) K. Pentikousis, Ed.
Request for Comments: 7945 Travelping
Category: Informational B. Ohlman
ISSN: 2070-1721 Ericsson
E. Davies
Trinity College Dublin
S. Spirou
Intracom Telecom
G. Boggia
Politecnico di Bari
September 2016
Information-Centric Networking: Evaluation and Security Considerations
以信息为中心的网络：评估和安全注意事项
Abstract
摘要
This document presents a number of considerations regarding evaluating Information-Centric Networking (ICN) and sheds some light on the impact of ICN on network security. It also surveys the evaluation tools currently available to researchers in the ICN area and provides suggestions regarding methodology and metrics.
本文档介绍了有关评估以信息为中心的网络（ICN）的一些注意事项，并阐明了ICN对网络安全的影响。它还调查了ICN领域研究人员目前可用的评估工具，并提供了有关方法和指标的建议。
Status of This Memo
关于下段备忘
This document is not an Internet Standards Track specification; it is published for informational purposes.
本文件不是互联网标准跟踪规范；它是为了提供信息而发布的。
This document is a product of the Internet Research Task Force (IRTF). The IRTF publishes the results of Internet-related research and development activities. These results might not be suitable for deployment. This RFC represents the consensus of the <insert_name> Research Group of the Internet Research Task Force (IRTF). Documents approved for publication by the IRSG are not a candidate for any level of Internet Standard; see Section 2 of RFC 7841.
本文件是互联网研究工作组（IRTF）的产品。IRTF发布互联网相关研究和开发活动的结果。这些结果可能不适合部署。本RFC代表了互联网研究工作组（IRTF）的<insert_name>研究小组的共识。IRSG批准发布的文件不适用于任何级别的互联网标准；见RFC 7841第2节。
Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at http://www.rfc-editor.org/info/rfc7945.
有关本文件当前状态、任何勘误表以及如何提供反馈的信息，请访问http://www.rfc-editor.org/info/rfc7945.
Copyright Notice
版权公告
Copyright (c) 2016 IETF Trust and the persons identified as the document authors. All rights reserved.
版权所有（c）2016 IETF信托基金和确定为文件作者的人员。版权所有。
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document.
本文件受BCP 78和IETF信托有关IETF文件的法律规定的约束(http://trustee.ietf.org/license-info)自本文件出版之日起生效。请仔细阅读这些文件，因为它们描述了您对本文件的权利和限制。
Table of Contents
目录
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Evaluation Considerations . . . . . . . . . . . . . . . . . . 4
2.1. Topology Selection . . . . . . . . . . . . . . . . . . . . 5
2.2. Traffic Load . . . . . . . . . . . . . . . . . . . . . . . 6
2.3. Choosing Relevant Metrics . . . . . . . . . . . . . . . . 10
2.3.1. Traffic Metrics . . . . . . . . . . . . . . . . . . . 13
2.3.2. System Metrics . . . . . . . . . . . . . . . . . . . . 14
2.4. Resource Equivalence and Trade-Offs . . . . . . . . . . . 16
3. ICN Security Aspects . . . . . . . . . . . . . . . . . . . . . 16
3.1. Authentication . . . . . . . . . . . . . . . . . . . . . . 17
3.2. Authorization, Access Control, and Logging . . . . . . . . 18
3.3. Privacy . . . . . . . . . . . . . . . . . . . . . . . . . . 19
3.4. Changes to the Network Security Threat Model . . . . . . . 20
4. Evaluation Tools . . . . . . . . . . . . . . . . . . . . . . . 21
4.1. Open-Source Implementations . . . . . . . . . . . . . . . 21
4.2. Simulators and Emulators . . . . . . . . . . . . . . . . . 22
4.2.1. ndnSIM . . . . . . . . . . . . . . . . . . . . . . . . 22
4.2.2. ccnSIM . . . . . . . . . . . . . . . . . . . . . . . . 23
4.2.3. Icarus Simulator . . . . . . . . . . . . . . . . . . . 23
4.3. Experimental Facilities . . . . . . . . . . . . . . . . . 24
4.3.1. Open Network Lab (ONL) . . . . . . . . . . . . . . . . 24
4.3.2. POINT Testbed . . . . . . . . . . . . . . . . . . . . 25
4.3.3. CUTEi: Container-Based ICN Testbed . . . . . . . . . . 25
5. Security Considerations . . . . . . . . . . . . . . . . . . . 25
6. Informative References . . . . . . . . . . . . . . . . . . . . 26
Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . 37
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 38
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Evaluation Considerations . . . . . . . . . . . . . . . . . . 4
2.1. Topology Selection . . . . . . . . . . . . . . . . . . . . 5
2.2. Traffic Load . . . . . . . . . . . . . . . . . . . . . . . 6
2.3. Choosing Relevant Metrics . . . . . . . . . . . . . . . . 10
2.3.1. Traffic Metrics . . . . . . . . . . . . . . . . . . . 13
2.3.2. System Metrics . . . . . . . . . . . . . . . . . . . . 14
2.4. Resource Equivalence and Trade-Offs . . . . . . . . . . . 16
3. ICN Security Aspects . . . . . . . . . . . . . . . . . . . . . 16
3.1. Authentication . . . . . . . . . . . . . . . . . . . . . . 17
3.2. Authorization, Access Control, and Logging . . . . . . . . 18
3.3. Privacy . . . . . . . . . . . . . . . . . . . . . . . . . . 19
3.4. Changes to the Network Security Threat Model . . . . . . . 20
4. Evaluation Tools . . . . . . . . . . . . . . . . . . . . . . . 21
4.1. Open-Source Implementations . . . . . . . . . . . . . . . 21
4.2. Simulators and Emulators . . . . . . . . . . . . . . . . . 22
4.2.1. ndnSIM . . . . . . . . . . . . . . . . . . . . . . . . 22
4.2.2. ccnSIM . . . . . . . . . . . . . . . . . . . . . . . . 23
4.2.3. Icarus Simulator . . . . . . . . . . . . . . . . . . . 23
4.3. Experimental Facilities . . . . . . . . . . . . . . . . . 24
4.3.1. Open Network Lab (ONL) . . . . . . . . . . . . . . . . 24
4.3.2. POINT Testbed . . . . . . . . . . . . . . . . . . . . 25
4.3.3. CUTEi: Container-Based ICN Testbed . . . . . . . . . . 25
5. Security Considerations . . . . . . . . . . . . . . . . . . . 25
6. Informative References . . . . . . . . . . . . . . . . . . . . 26
Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . 37
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 38
Information-Centric Networking (ICN) is a networking concept that arose from the desire to align the operation model of a network with the model of its typical use. For TCP/IP networks, this implies changing the mechanisms of data access and transport from a host-to-host model to a user-to-information model. The premise is that the effort invested in changing models will be offset, or even surpassed, by the potential of a "better" network. However, such a claim can be validated only if it is quantified.
以信息为中心的网络（ICN）是一个网络概念，它源于将网络的运行模式与其典型使用模式相协调的愿望。对于TCP/IP网络，这意味着改变从主机到主机模型到用户到信息模型的数据访问和传输机制。前提是，投资于改变模式的努力将被“更好”网络的潜力所抵消，甚至超过。然而，只有对此类索赔进行量化，才能对其进行验证。
Different ICN approaches are evaluated in the peer-reviewed literature using a mixture of theoretical analysis, simulation and emulation techniques, and empirical (testbed) measurements. The specific methodology employed may depend on the experimentation goal, e.g., whether one wants to evaluate scalability, quantify resource utilization, or analyze economic incentives. In addition, though, we observe that ease and convenience of setting up and running experiments can sometimes be a factor in published evaluations. As discussed in [RFC7476], the development phase that ICN is going through and the plethora of approaches to tackle the hardest problems make this a very active and growing research area but, on the downside, it also makes it more difficult to compare different proposals on an equal footing.
在同行评审的文献中，使用混合的理论分析、模拟和仿真技术以及经验（试验台）测量对不同的ICN方法进行了评估。所采用的具体方法可能取决于实验目标，例如，是否要评估可扩展性、量化资源利用率或分析经济激励。此外，尽管如此，我们观察到设置和运行实验的简易性和便利性有时可能是已发表评估的一个因素。正如[RFC7476]中所讨论的，ICN正在经历的开发阶段以及解决最困难问题的大量方法使其成为一个非常活跃和不断增长的研究领域，但其缺点是，它也使得在平等的基础上比较不同的提案变得更加困难。
Performance evaluation using actual network deployments has the advantage of realistic workloads and reflects the environment where the service or protocol is to be deployed. In the case of ICN, however, it is not currently clear what qualifies as a "realistic workload". Trace-based analysis of ICN is in its infancy, and more work is needed towards defining characteristic workloads for ICN evaluation studies. Accordingly, the experimental process and the evaluation methodology per se are actively being researched for different ICN architectures. Numerous factors affect the experimental results, including the topology selected; the background traffic that an application is being subjected to; network conditions such as available link capacities, link delays, and loss-rate characteristics throughout the selected topology; failure and disruption patterns; node mobility; and the diversity of devices used.
使用实际网络部署的性能评估具有实际工作负载的优势，并反映了服务或协议部署的环境。然而，就ICN而言，目前尚不清楚什么是“实际工作量”。基于痕迹的ICN分析尚处于起步阶段，需要更多的工作来定义ICN评估研究的特征工作量。因此，针对不同的ICN架构，正在积极研究实验过程和评估方法本身。影响实验结果的因素很多，包括选择的拓扑结构；应用程序正受到的背景通信量；网络条件，例如整个选定拓扑中的可用链路容量、链路延迟和丢失率特性；故障和中断模式；节点移动性；以及所用设备的多样性。
The goal of this document is to summarize evaluation guidelines and tools alongside suggested data sets and high-level approaches. We expect this to be of interest to the ICN community as a whole, as it can assist researchers and practitioners alike to compare and contrast different ICN designs, as well as with the state of the art in host-centric solutions, and identify the respective strengths and weaknesses. We note that, apart from the technical evaluation of the
本文件的目标是总结评估指南和工具以及建议的数据集和高级别方法。我们希望ICN社区整体对此感兴趣，因为它可以帮助研究人员和从业者比较和对比不同的ICN设计以及以主机为中心的解决方案的最新水平，并确定各自的优势和劣势。我们注意到，除了对
functionality of an ICN architecture, the future success of ICN will be largely driven by its deployability and economic viability. Therefore, ICN evaluations should assess incremental deployability in the existing network environment together with a view of how the technical functions will incentivize deployers to invest in the capabilities that allow the architecture to spread across the network.
作为ICN体系结构的功能，ICN未来的成功在很大程度上取决于其可部署性和经济可行性。因此，ICN评估应评估现有网络环境中的增量部署能力，同时考虑技术功能将如何激励部署人员投资于允许体系结构在网络中传播的能力。
This document has been produced by the IRTF Information-Centric Networking Research Group (ICNRG). The main objective of the ICNRG is to couple ongoing ICN research in the above areas with solutions that are relevant for evolving the Internet at large. The ICNRG produces documents that provide guidelines for experimental activities in the area of ICN so that different, alternative solutions can be compared consistently, and information sharing can be accomplished for experimental deployments. This document incorporates input from ICNRG participants and their corresponding text contributions; it has been reviewed by several ICNRG active participants (see the Acknowledgments), and represents the consensus of the research group. That said, note that this document does not constitute an IETF standard; see also [RFC5743].
本文件由IRTF信息中心网络研究小组（ICNRG）编制。ICNRG的主要目标是将上述领域正在进行的ICN研究与发展互联网相关的解决方案结合起来。ICNRG编制文件，为ICN领域的实验活动提供指南，以便一致地比较不同的替代解决方案，并为实验部署实现信息共享。本文件纳入了ICNRG参与者的投入及其相应的文本贡献；它已经过ICNRG的几个积极参与者的审查（见致谢），代表了研究小组的共识。尽管如此，请注意，本文件不构成IETF标准；另见[RFC5743]。
The remainder of this document is organized as follows. Section 2 presents various techniques and considerations for evaluating different ICN architectures. Section 3 discusses the impact of ICN on network security. Section 4 surveys the tools currently available to ICN researchers.
本文件的其余部分组织如下。第2节介绍了评估不同ICN体系结构的各种技术和注意事项。第3节讨论了ICN对网络安全的影响。第4节调查了ICN研究人员目前可用的工具。
It is clear that the way we evaluate IP networks will not be directly applicable to evaluating ICN. In IP, the focus is on the performance and characteristics of end-to-end connections between a source and a destination. In ICN, the "source" responding to a request can be any ICN node in the network and may change from request to request. This makes it difficult to use concepts like delay and throughput in a traditional way. In addition, evaluating resource usage in ICN is a more complicated task, as memory used for caching affects delays and use of transmission resources; see the discussion on resource equivalents in Section 2.4.
很明显，我们评估IP网络的方法不会直接适用于评估ICN。在IP中，重点是源和目标之间的端到端连接的性能和特性。在ICN中，响应请求的“源”可以是网络中的任何ICN节点，并且可以根据请求而变化。这使得以传统方式使用延迟和吞吐量等概念变得困难。此外，评估ICN中的资源使用情况是一项更复杂的任务，因为用于缓存的内存会影响延迟和传输资源的使用；参见第2.4节中关于资源等价物的讨论。
There are two major types of evaluations of ICN that we see a need to make. One type is to compare ICN to traditional networking, and the other type is to compare different ICN implementations and approaches against each other.
我们认为有必要对ICN进行两种主要类型的评估。一种是将ICN与传统网络进行比较，另一种是将不同的ICN实现和方法相互比较。
In this section, we detail some of the functional components needed when evaluating different ICN implementations and approaches.
在本节中，我们将详细介绍评估不同ICN实现和方法时所需的一些功能组件。
There's a wealth of earlier work on topology selection for simulation and performance evaluation of host-centric networks. While the classic dumbbell topology is regarded as inappropriate for ICN, most ICN studies so far have been based on that earlier work for host-centric networks [RFC7476]. However, there is no single topology that can be used to easily evaluate all aspects of ICN. Therefore, one should choose from a range of topologies depending on the focus of the evaluation.
在以主机为中心的网络的仿真和性能评估中，有大量关于拓扑选择的早期工作。虽然经典的哑铃拓扑被认为不适合ICN，但到目前为止，大多数ICN研究都是基于早期针对以主机为中心的网络的工作[RFC7476]。然而，没有一种拓扑可以用来轻松评估ICN的所有方面。因此，应根据评估的重点从一系列拓扑中进行选择。
For scalability and resilience studies, there is a wide range of synthetic topologies, such as the Barabasi-Albert model [Barabasi99] and the Watts-Strogatz small-world topology [Watts98]. These allow experiments to be performed whilst controlling various key parameters (e.g., node degree). These synthetic topologies are appropriate in the general case, as there are no practical assurances that a future information-centric network will have the same topology as any of today's networks.
对于可伸缩性和恢复力研究，有多种合成拓扑，如Barabasi-Albert模型[Barabasi99]和Watts-Strogatz小世界拓扑[Watts98]。这些允许在控制各种关键参数（例如节点度）的同时进行实验。这些合成拓扑在一般情况下是合适的，因为无法实际保证未来以信息为中心的网络将具有与当今任何网络相同的拓扑。
When studies look at cost (e.g., transit cost) or migration to ICN, realistic topologies should be used. These can be inferred from Internet traces, such as the CAIDA Macroscopic Internet Topology Data Kit (http://www.caida.org/data/active/internet-topology-data-kit) and Rocketfuel (http://www.cs.washington.edu/research/networking/rocketfuel). A problem is the large size of the topology (approximately 45K Autonomous Systems, close to 200K links), which may limit the scalability of the employed evaluation tool. Katsaros et al. [Katsaros15] address this problem by using scaled down topologies created following the methodology described in [Dimitropoulos09].
当研究着眼于成本（如运输成本）或向ICN迁移时，应使用现实的拓扑结构。这些可以从互联网跟踪中推断出来，例如CAIDA宏观互联网拓扑数据包(http://www.caida.org/data/active/internet-topology-data-kit)还有火箭燃料(http://www.cs.washington.edu/research/networking/rocketfuel). 一个问题是拓扑的大尺寸（大约45K个自治系统，接近200K个链路），这可能会限制所用评估工具的可伸缩性。Katsaros等人[Katsaros15]通过使用按照[Dimitropoulos09]中所述方法创建的缩小拓扑来解决此问题。
Studies that focus on node or content mobility can benefit from topologies and their dynamic aspects as used in the Delay-Tolerant Networking (DTN) community. As mentioned in [RFC7476], DTN traces are available to be used in such ICN evaluations.
关注节点或内容移动性的研究可以受益于延迟容忍网络（DTN）社区中使用的拓扑及其动态方面。如[RFC7476]所述，DTN记录道可用于此类ICN评估。
As with host-centric topologies, defining just a node graph will not be enough for most ICN studies. The experimenter should also clearly define and list the respective matrices that correspond to the network, storage, and computation capacities available at each node as well as the delay characteristics of each link [Montage]. Real values for such parameters can be taken from existing platforms such as iPlane (http://iplane.cs.washington.edu). Synthetic values could be produced with specific tools [Kaune09].
与以主机为中心的拓扑一样，仅定义节点图对于大多数ICN研究来说是不够的。实验者还应明确定义并列出与每个节点可用的网络、存储和计算能力以及每个链路的延迟特征相对应的矩阵【蒙太奇】。此类参数的实际值可从现有平台（如iPlane）获取(http://iplane.cs.washington.edu). 可使用特定工具生成合成值[Kaune09]。
In this subsection, we provide a set of common guidelines, in the form of what we will refer to as a content catalog for different scenarios. This catalog, which is based on previously published work, can be used to evaluate different ICN proposals, for instance, on routing, congestion control, and performance, and can be considered as other kinds of ICN contributions emerge. As we are still lacking ICN-specific traffic workloads, we can currently only extrapolate from today's workloads. A significant challenge then relates to the identification of the applications contributing to the observed traffic (e.g., Web or peer-to-peer), as well as to the exact amount of traffic they contribute to the overall traffic mixture. Efforts in this direction can take heed of today's traffic mix comprising Web, peer-to-peer file sharing, and User-Generated Content (UGC) platforms (e.g., YouTube), as well as Video on Demand (VoD) services. Publicly available traces for these include those from web sites such as the MultiProbe Framework <http://multiprobe.ewi.tudelft.nl/multiprobe.html>, <http://an.kaist.ac.kr/traces/IMC2007.html> (see also [Cha07]), and the UMass Trace Repository <http://traces.cs.umass.edu/index.php/Network/Network>.
在本小节中，我们提供了一组通用指南，其形式为我们将称为不同场景的内容目录。此目录基于先前发布的工作，可用于评估不同的ICN方案，例如路由、拥塞控制和性能，并可被视为其他类型ICN的贡献。由于我们仍然缺乏特定于ICN的流量工作负载，我们目前只能从今天的工作负载进行推断。然后，一个重大的挑战涉及到对观察到的流量（例如，Web或对等）有贡献的应用程序的识别，以及它们对整个流量混合有贡献的确切流量。这方面的努力可以关注当今的流量组合，包括Web、点对点文件共享、用户生成内容（UGC）平台（如YouTube）以及视频点播（VoD）服务。公开可用的跟踪包括来自诸如MultiProbe框架等网站的跟踪<http://multiprobe.ewi.tudelft.nl/multiprobe.html>, <http://an.kaist.ac.kr/traces/IMC2007.html>（另请参见[Cha07]），以及UMass跟踪存储库<http://traces.cs.umass.edu/index.php/Network/Network>.
Taking a more systematic approach, and with the purpose of modeling the traffic load, we can resort to measurement studies that investigate the composition of Internet traffic, such as [Labovitz10] and [Maier09]. In [Labovitz10], a large-scale measurement study was performed, with the purpose of studying the traffic crossing inter-domain links. The results indicate the dominance of Web traffic, amounting to 52% over all measured traffic. However, Deep Packet Inspection (DPI) techniques reveal that 25-40% of all HTTP traffic actually carries video traffic. Results from DPI techniques also reveal the difficulty in correctly identifying the application type in the case of P2P traffic: mapping observed port numbers to well-known applications shows P2P traffic constituting only 0.85% of overall traffic, while DPI raises this percentage to 18.32% [Labovitz10]. Relevant studies on a large ISP show that the percentage of P2P traffic ranges from 17% to 19% of overall traffic [Maier09]. Table 1 provides an overview of these figures. The "other" traffic type denotes traffic that cannot be classified in any of the first three application categories, and it consists of unclassified traffic and traffic heavily fragmented into several applications (e.g., 0.17% DNS traffic).
采用更系统的方法，为了对流量负载进行建模，我们可以求助于调查互联网流量组成的测量研究，如[Labovitz10]和[Maier09]。在[Labovitz10]中，进行了大规模测量研究，目的是研究跨域链路的流量。结果表明，网络流量占主导地位，占所有测量流量的52%。然而，深度数据包检查（DPI）技术显示，所有HTTP流量中有25-40%实际承载视频流量。DPI技术的结果还揭示了在P2P流量情况下正确识别应用程序类型的困难：将观察到的端口号映射到知名应用程序显示，P2P流量仅占总流量的0.85%，而DPI将此百分比提高到18.32%[Labovitz10]。对大型ISP的相关研究表明，P2P流量占总流量的比例从17%到19%不等[Maier09]。表1概述了这些数字。“其他”流量类型表示无法在前三个应用程序类别中进行分类的流量，它包括未分类流量和严重分散到多个应用程序中的流量（例如，0.17%的DNS流量）。
Traffic Type | Ratio
=====================
Web | 31-39%
---------------------
P2P | 17-19%
---------------------
Video | 13-21%
---------------------
Other | 29-31%
=====================
Traffic Type | Ratio
=====================
Web | 31-39%
---------------------
P2P | 17-19%
---------------------
Video | 13-21%
---------------------
Other | 29-31%
=====================
Table 1: Traffic Type Ratios of Total Traffic [Labovitz10] [Maier09]
表1：总交通量的交通类型比率[Labovitz10][Maier09]
The content catalog for each type of traffic can be characterized by a specific set of parameters:
每种类型的流量的内容目录都可以由一组特定的参数表示：
a) the cardinality of the estimated content catalog
a) 估计内容目录的基数
b) the size of the exchanged contents (either chunks or entire named information objects)
b) 交换内容的大小（块或整个命名信息对象）
c) the popularity of objects (expressed in their request frequency)
c) 对象的流行程度（以其请求频率表示）
In most application types, the popularity distribution follows some power law, indicating that a small number of information items trigger a large proportion of the entire set of requests. The exact shape of the power law popularity distribution directly impacts the performance of the underlying protocols. For instance, highly skewed popularity distributions (e.g., a Zipf-like distribution with a high slope value) favor the deployment of caching schemes, since caching a very small set of information items can dramatically increase the cache hit ratio.
在大多数应用程序类型中，流行度分布遵循某种幂律，这表明少量信息项会触发整个请求集的很大一部分。幂律流行度分布的精确形状直接影响底层协议的性能。例如，高度倾斜的流行度分布（例如，具有高斜率值的类Zipf分布）有利于部署缓存方案，因为缓存非常小的一组信息项可以显著提高缓存命中率。
Several studies in the past few years have stated that Zipf's law is the discrete distribution that best represents the request frequency in a number of application scenarios, ranging from the Web to VoD services. The key aspect of this distribution is that the frequency of a content request is inversely proportional to the rank of the content itself, i.e., the smaller the rank, the higher the request frequency. If M denotes the content catalog cardinality and 1 <= i <= M denotes the rank of the i-th most popular content, we can express the probability of requesting the content with rank "i" as:
过去几年的几项研究表明，Zipf定律是离散分布，最能代表从Web到VoD服务的许多应用场景中的请求频率。这种分布的关键方面是，内容请求的频率与内容本身的排名成反比，即排名越小，请求频率越高。如果M表示内容目录基数，1<=i<=M表示第i个最流行内容的排名，我们可以将请求排名为“i”的内容的概率表示为：
P(X=i) = (1 / i^(alpha)) / C, with C = SUM(1 / j^(alpha)), alpha > 0
where the sum is obtained considering all values of j, 1 <= j <= M.
P(X=i) = (1 / i^(alpha)) / C, with C = SUM(1 / j^(alpha)), alpha > 0
where the sum is obtained considering all values of j, 1 <= j <= M.
A recent analysis of HTTP traffic showed that content popularity is better reflected by a trimodal distribution model in which the head and tail of a Zipf distribution (with slope value 0.84) are replaced by two discrete Weibull distributions with shape parameter values 0.5 and 0.24, respectively [IMB2014].
最近对HTTP流量的分析表明，内容受欢迎程度更好地反映在三峰分布模型中，其中Zipf分布（斜率值为0.84）的头部和尾部分别被形状参数值为0.5和0.24的两个离散Weibull分布所取代[IMB2014]。
A variation of the Zipf distribution, termed the Mandelbrot-Zipf distribution was suggested [Saleh06] to better model environments where nodes can locally store previously requested content. For example, it was observed that peer-to-peer file-sharing applications typically exhibited a 'fetch-at-most-once' style of behavior. This is because peers tend to persistently store the files they download, a behavior that may also be prevalent in ICN.
Zipf分布的一种变体，称为Mandelbrot-Zipf分布[Saleh06]，用于更好地模拟节点可以本地存储先前请求的内容的环境。例如，据观察，对等文件共享应用程序通常表现出“最多一次获取”的行为方式。这是因为对等方倾向于持久存储他们下载的文件，这一行为在ICN中也很普遍。
Popularity can also be characterized in terms of:
受欢迎程度还可以从以下方面来描述：
a) The temporal dynamics of popularity, i.e., how requests are distributed in time. The popularity distribution expresses the number of requests submitted for each information item participating into a certain workload. However, they do not describe how these requests are distributed in time. This aspect is of primary importance when considering the performance of caching schemes since the ordering of the requests obviously affects the contents of a cache. For example, with a Least Frequently Used (LFU) cache replacement policy, if all requests for a certain item are submitted close in time, the item is unlikely to be evicted from the cache, even by a (globally) more popular item whose requests are more evenly distributed in time. The temporal ordering of requests gains even more importance when considering workloads consisting of various applications, all competing for the same cache space.
a) 流行性的时间动态，即请求如何在时间上分布。流行度分布表示为参与特定工作负载的每个信息项提交的请求数。但是，它们并没有描述这些请求是如何及时分发的。在考虑缓存方案的性能时，这一方面非常重要，因为请求的顺序显然会影响缓存的内容。例如，使用最不常用（LFU）缓存替换策略，如果某个项目的所有请求都及时提交，则该项目不太可能从缓存中逐出，即使是请求在时间上分布更均匀的（全局）更流行的项目。在考虑由各种应用程序组成的工作负载时，请求的时间顺序变得更加重要，所有应用程序都在争夺相同的缓存空间。
b) The spatial locality of popularity i.e., how requests are distributed throughout a network. The importance of spatial locality relates to the ability to avoid redundant traffic in the network. If requests are highly localized in some area of the entire network, then similar requests can be more efficiently served with mechanisms such as caching and/or multicast, i.e., the concentration of similar requests in a limited area of the network allows increasing the perceived cache hit ratios at caches in the area and/or the traffic savings from the use of multicast. Table 2 provides an overview of distributions that can be used to model each of the identified traffic types i.e., Web, Video (based on YouTube measurements), and P2P (based on BitTorrent measurements). These distributions are the outcome of a series of modeling efforts based on measurements of real traffic workloads ([Breslau99] [Mahanti00] [Busari02] [Arlitt97] [Barford98] [Barford99] [Hefeeda08] [Guo07] [Bellissimo04] [Cheng08]
b) 流行性的空间位置，即请求如何在整个网络中分布。空间局部性的重要性与避免网络中冗余流量的能力有关。如果请求在整个网络的某个区域高度本地化，则类似的请求可以通过缓存和/或多播等机制更有效地服务，即。，将类似请求集中在网络的有限区域中允许增加该区域中的缓存处的感知缓存命中率和/或通过使用多播来节省流量。表2概述了可用于对每种已识别流量类型建模的发行版，即Web、视频（基于YouTube测量）和P2P（基于BitTorrent测量）。这些分布是基于实际流量工作负载测量的一系列建模工作的结果（[Breslau99][Mahanti00][Busari02][Arlitt97][Barford98][Barford99][Hefeeda08][Guo07][Bellissimo04][Cheng08]
[Cheng13]). A tool for the creation of synthetic workloads following these models, and also allowing the generation of different traffic mixes, is described in [Katsaros12].
[13]）。[Katsaros12]中描述了一种工具，用于根据这些模型创建合成工作负载，并允许生成不同的流量混合。
| Object Size | Temporal Locality | Popularity Distribution
=====================================================================
Web | Concatenation | Ordering via the | Zipf: p(i)=K/i^a
| of Lognormal | Least Recently Used | i: popularity rank
| (body) and | (LRU) stack model | N: total items
| Pareto (tail) | [Busari02] | K: 1/Sum(1/i^a)
| [Barford98] | | a: distribution slope
| [Barford99] | Exact timing via | values 0.64-0.84
| | exponential | [Breslau99] [Mahanti00]
| | distribution |
| | [Arlitt97] |
---------------------------------------------------------------------
VoD | Duration/size: | No analytical models | Weibull: k=0.513,
| Concatenated | | lambda=6010
| normal; most | Random distribution |
| videos | across total | Gamma: k=0.372,
| ~330 kbit/s | duration | theta=23910
| [Cheng13] | | [Cheng08]
---------------------------------------------------------------------
P2P | Wide variation | Mean arrival rate of | Mandelbrot-Zipf
| on torrent | 0.9454 torrents/hour | [Hefeeda08]:
| sizes | Peers in a swarm | p(i)=K/((i+q)/a)
| [Hefeeda08]. | arrive as | q: plateau factor,
| No analytical | l(t)= l0*e^(-t/tau) | 5 to 100.
| models exist: | l0: initial arrival | Flatter head than in
| Sample a real | rate (87.74 average) | Zipf-like distribution
| BitTorrent | tau: object | (where q=0)
| distribution | popularity |
| [Bellissimo04] | (1.16 average)* |
| or use fixed | [Guo07] |
| value | |
=====================================================================
| Object Size | Temporal Locality | Popularity Distribution
=====================================================================
Web | Concatenation | Ordering via the | Zipf: p(i)=K/i^a
| of Lognormal | Least Recently Used | i: popularity rank
| (body) and | (LRU) stack model | N: total items
| Pareto (tail) | [Busari02] | K: 1/Sum(1/i^a)
| [Barford98] | | a: distribution slope
| [Barford99] | Exact timing via | values 0.64-0.84
| | exponential | [Breslau99] [Mahanti00]
| | distribution |
| | [Arlitt97] |
---------------------------------------------------------------------
VoD | Duration/size: | No analytical models | Weibull: k=0.513,
| Concatenated | | lambda=6010
| normal; most | Random distribution |
| videos | across total | Gamma: k=0.372,
| ~330 kbit/s | duration | theta=23910
| [Cheng13] | | [Cheng08]
---------------------------------------------------------------------
P2P | Wide variation | Mean arrival rate of | Mandelbrot-Zipf
| on torrent | 0.9454 torrents/hour | [Hefeeda08]:
| sizes | Peers in a swarm | p(i)=K/((i+q)/a)
| [Hefeeda08]. | arrive as | q: plateau factor,
| No analytical | l(t)= l0*e^(-t/tau) | 5 to 100.
| models exist: | l0: initial arrival | Flatter head than in
| Sample a real | rate (87.74 average) | Zipf-like distribution
| BitTorrent | tau: object | (where q=0)
| distribution | popularity |
| [Bellissimo04] | (1.16 average)* |
| or use fixed | [Guo07] |
| value | |
=====================================================================
* Random ordering of swarm births (first request). For each swarm, calculate a different tau. Based on average tau and object popularity. Exponential decay rule for subsequent requests.
* 群体出生的随机排序（第一个请求）。对于每个群，计算不同的tau。基于平均tau和对象流行度。后续请求的指数衰减规则。
Table 2: Overview of Traffic Type Models
表2：交通类型模型概述
Table 3 summarizes the content catalog. With this shared point of reference, the use of the same set of parameters (depending on the scenario of interest) among researchers will be eased, and different proposals could be compared on a common base.
表3总结了内容目录。有了这一共同的参考点，研究人员之间使用相同的参数集（取决于感兴趣的场景）将变得容易，不同的建议可以在一个共同的基础上进行比较。
Traffic | Catalog | Mean Object Size | Popularity Distribution
Load | Size | [Zhou11] [Fri12] | [Cha07] [Fri12] [Yu06]
|[Goog08] | [Marciniak08] | [Breslau99] [Mahanti00]
|[Zhang10a]| [Bellissimo04] |
|[Cha07] | [Psaras11] |
|[Fri12] | [Carofiglio11] |
| | |
| | |
| | |
===================================================================
Web | 10^12 | Chunk: 1-10 KB | Zipf with
| | | 0.64 <= alpha <= 0.83
-------------------------------------------------------------------
File | 5x10^6 | Chunk: 250-4096 KB | Zipf with
sharing | | Object: ~800 MB | 0.75 <= alpha <= 0.82
-------------------------------------------------------------------
UGC | 10^8 | Object: ~10 MB | Zipf, alpha >= 2
-------------------------------------------------------------------
VoD | 10^4 | Object: ~100 MB | Zipf, 0.65 <= alpha <= 1
(+HLS) | | ~1 KB (*) |
(+DASH) | | ~5.6 KB (*) |
===================================================================
Traffic | Catalog | Mean Object Size | Popularity Distribution
Load | Size | [Zhou11] [Fri12] | [Cha07] [Fri12] [Yu06]
|[Goog08] | [Marciniak08] | [Breslau99] [Mahanti00]
|[Zhang10a]| [Bellissimo04] |
|[Cha07] | [Psaras11] |
|[Fri12] | [Carofiglio11] |
| | |
| | |
| | |
===================================================================
Web | 10^12 | Chunk: 1-10 KB | Zipf with
| | | 0.64 <= alpha <= 0.83
-------------------------------------------------------------------
File | 5x10^6 | Chunk: 250-4096 KB | Zipf with
sharing | | Object: ~800 MB | 0.75 <= alpha <= 0.82
-------------------------------------------------------------------
UGC | 10^8 | Object: ~10 MB | Zipf, alpha >= 2
-------------------------------------------------------------------
VoD | 10^4 | Object: ~100 MB | Zipf, 0.65 <= alpha <= 1
(+HLS) | | ~1 KB (*) |
(+DASH) | | ~5.6 KB (*) |
===================================================================
UGC = User-Generated Content VoD = Video on Demand HLS = HTTP Live Streaming DASH = Dynamic Adaptive Streaming over HTTP
UGC=用户生成内容VoD=视频点播HLS=HTTP实时流媒体DASH=HTTP上的动态自适应流媒体
(*) Using adaptive video streaming (e.g., HLS and DASH), with an optimal segment length (10 s for HLS and 2 s for DASH) and a bitrate of 4500 kbit/s [RFC7933] [Led12]
（*）使用自适应视频流（例如HLS和DASH），具有最佳段长（HLS为10秒，DASH为2秒）和4500 kbit/s的比特率[RFC7933][Led12]
Table 3: Content Catalog
表3：内容目录
Quantification of network performance requires a set of standard metrics. These metrics should be broad enough so they can be applied equally to host-centric and information-centric (or other) networks. This will allow reasoning about a certain ICN approach in relation to an earlier version of the same approach, to another ICN approach, or to the incumbent host-centric approach. It will therefore be less difficult to gauge optimization and research direction. On the other hand, the metrics should be targeted to network performance only and should avoid unnecessary expansion into the physical and application layers. Similarly, at this point, it is more important to capture as metrics only the main figures of merit and to leave more esoteric and less frequent cases for the future.
网络性能的量化需要一组标准指标。这些指标应该足够广泛，以便能够平等地应用于以主机为中心和以信息为中心（或其他）的网络。这将允许就某一ICN方法与同一方法的早期版本、另一ICN方法或现有的以主机为中心的方法进行推理。因此，衡量优化和研究方向的难度将降低。另一方面，指标应仅针对网络性能，并应避免不必要地扩展到物理层和应用层。类似地，在这一点上，更重要的是仅获取主要的功绩指标，并将更深奥、更不频繁的案例留给未来。
To arrive at a set of relevant metrics, it would be beneficial to look at the metrics used in existing ICN approaches, such as Content-Centric Networking (CCN) [Jacobson09] [VoCCN] [Zhang10b], NetInf [4WARD6.1] [4WARD6.3] [SAIL-B2] [SAIL-B3], PURSUIT [PRST4.5], COMET [CMT-D5.2] [CMT-D6.2], Connect [Muscariello11] [Perino11], and CONVERGENCE [Detti12] [Blefari-Melazzi12] [Salsano12]. The metrics used in these approaches fall into two categories: metrics for the approach as a whole, and metrics for individual components (name resolution, routing, and so on). Metrics for the entire approach are further subdivided into traffic and system metrics. It is important to note that the various approaches do not name or define metrics consistently. This is a major problem when trying to find metrics that allow comparison between approaches. For the purposes of exposition, we have tried to smooth over differences by classifying similarly defined metrics under the same name. Also, due to space constraints, we have chosen to report here only the most common metrics between approaches. For more details, the reader should consult the references for each approach.
为了获得一套相关的指标，最好看看现有ICN方法中使用的指标，例如以内容为中心的网络（CCN）[Jacobson09][VoCCN][Zhang10b]、NetInf[4WARD6.1][4WARD6.3][SAIL-B2][SAIL-B3]、PURSUIT[PRST4.5]、COMET[CMT-D5.2][CMT-D6.2]、Connect[Muscariello11][Perino11]和CONVERGENCE[Detti12][Blefari-Melazzi12][Salsano12]。这些方法中使用的指标分为两类：整体方法的指标和单个组件的指标（名称解析、路由等）。整个方法的指标进一步细分为流量指标和系统指标。需要注意的是，各种方法没有一致地命名或定义指标。在试图找到允许方法之间进行比较的指标时，这是一个主要问题。为了便于说明，我们尝试平滑不同的ces通过将类似定义的度量分类为同一名称。此外，由于篇幅限制，我们选择在此仅报告不同方法之间最常见的度量。有关更多详细信息，读者应参考每种方法的参考资料。
Traffic metrics in existing ICN approaches are summarized in Table 4. These are metrics for evaluating an approach mainly from the perspective of the end user, i.e., the consumer, provider, or owner of the content or service. Depending on the level where these metrics are measured, we have made the distinction into user, application, and network-level traffic metrics. So, for example, network-level metrics are mostly focused on packet characteristics, whereas user-level metrics can cover elements of human perception. The approaches do not make this distinction explicitly, but we can see from the table that CCN and NetInf have used metrics from all levels, PURSUIT and COMET have focused on lower-level metrics, and Connect and CONVERGENCE opted for higher-level metrics. Throughput and download time seem to be the most popular metrics altogether.
表4总结了现有ICN方法中的流量指标。这些是主要从最终用户（即，内容或服务的消费者、提供者或所有者）的角度评估方法的指标。根据测量这些指标的级别，我们将其分为用户级、应用程序级和网络级流量指标。因此，例如，网络级别的度量主要集中在数据包特征上，而用户级别的度量可以覆盖人类感知的元素。这些方法没有明确区分这一点，但我们可以从表中看出，CCN和NetInf使用了所有级别的指标，PURSUIT和COMET专注于较低级别的指标，而Connect和CONVERGENCE则选择了较高级别的指标。吞吐量和下载时间似乎是最流行的指标。
User | Application | Network
======================================================
Download | Goodput | Startup | Throughput | Packet
time | | latency | | delay
==================================================================
CCN | x | x | | x | x
------------------------------------------------------------------
NetInf | x | | x | x | x
------------------------------------------------------------------
PURSUIT | | | x | x | x
------------------------------------------------------------------
COMET | | | x | x |
------------------------------------------------------------------
Connect | x | | | |
------------------------------------------------------------------
CONVERGENCE | x | x | | |
==================================================================
User | Application | Network
======================================================
Download | Goodput | Startup | Throughput | Packet
time | | latency | | delay
==================================================================
CCN | x | x | | x | x
------------------------------------------------------------------
NetInf | x | | x | x | x
------------------------------------------------------------------
PURSUIT | | | x | x | x
------------------------------------------------------------------
COMET | | | x | x |
------------------------------------------------------------------
Connect | x | | | |
------------------------------------------------------------------
CONVERGENCE | x | x | | |
==================================================================
Table 4: Traffic Metrics Used in ICN Evaluations
表4:ICN评估中使用的流量指标
While traffic metrics are more important for the end user, the owner or operator of the networking infrastructure is normally more interested in system metrics, which can reveal the efficiency of an approach. The most common system metrics used are: protocol overhead, total traffic, transit traffic, cost savings, router cost, and router energy consumption.
虽然流量指标对最终用户更为重要，但网络基础设施的所有者或运营商通常对系统指标更感兴趣，这可以揭示方法的效率。最常用的系统指标是：协议开销、总流量、传输流量、成本节约、路由器成本和路由器能耗。
Besides the traffic and systems metrics that aim to evaluate an approach as a whole, all surveyed approaches also evaluate the performance of individual components. Name resolution, request/data routing, and data caching are the most typical components, as summarized in Table 5. Forwarding Information Base (FIB) size and path length, i.e., the routing component metrics, are almost ubiquitous among approaches, perhaps due to the networking background of the involved researchers. That might be also the reason for the sometimes decreased focus on traffic and system metrics, in favor of component metrics. It can certainly be argued that traffic and system metrics are affected by component metrics; however, no approach has made the relationship clear. With this in mind and taking into account that traffic and system metrics are readily useful to end users and network operators, we will restrict ourselves to those in the following subsections.
除了旨在评估整个方法的流量和系统指标外，所有调查的方法还评估单个组件的性能。如表5所示，名称解析、请求/数据路由和数据缓存是最典型的组件。转发信息库（FIB）大小和路径长度，即路由组件度量，在各种方法中几乎无处不在，可能是由于相关研究人员的网络背景。这也可能是为什么有时会减少对流量和系统度量的关注，转而关注组件度量。可以肯定的是，流量和系统度量受组件度量的影响；然而，没有一种方法能够明确这种关系。考虑到这一点，并考虑到流量和系统指标对最终用户和网络运营商很有用，我们将仅限于以下小节中的内容。
Resolution | Routing | Cache
======================================================
Resolution | Request | FIB | Path | Size | Hit
time | rate | size | length | | ratio
==================================================================
CCN | x | | x | x | x | x
------------------------------------------------------------------
NetInf | x | x | | x | | x
------------------------------------------------------------------
PURSUIT | | | x | x | |
------------------------------------------------------------------
COMET | x | x | x | x | | x
------------------------------------------------------------------
CONVERGENCE | | x | x | | x |
==================================================================
Resolution | Routing | Cache
======================================================
Resolution | Request | FIB | Path | Size | Hit
time | rate | size | length | | ratio
==================================================================
CCN | x | | x | x | x | x
------------------------------------------------------------------
NetInf | x | x | | x | | x
------------------------------------------------------------------
PURSUIT | | | x | x | |
------------------------------------------------------------------
COMET | x | x | x | x | | x
------------------------------------------------------------------
CONVERGENCE | | x | x | | x |
==================================================================
Table 5: Component Metrics in Existing ICN Approaches
表5：现有ICN方法中的组件度量
Before proceeding, we should note that we would like our metrics to be applicable to host-centric networks as well. Standard metrics already exist for IP networks, and it would certainly be beneficial to take them into account. It is encouraging that many of the metrics used by existing ICN approaches can also be used on IP networks and that all of the approaches have tried on occasion to draw the parallels.
在继续之前，我们应该注意，我们希望我们的指标也适用于以主机为中心的网络。IP网络的标准度量已经存在，考虑它们肯定是有益的。令人鼓舞的是，现有ICN方法所使用的许多指标也可用于IP网络，而且所有这些方法有时都试图与之进行比较。
The IETF has been working for more than a decade on devising metrics and methods for measuring the performance of IP networks. The work has been carried out largely within the IP Performance Metrics (IPPM) working group, guided by a relevant framework [RFC2330]. IPPM metrics include delay, delay variation, loss, reordering, and duplication. While the IPPM work is certainly based on packet-switched IP networks, it is conceivable that it can be modified and extended to cover ICN networks as well. However, more study is necessary to turn this claim into a certainty. Many experts have toiled for a long time on devising and refining the IPPM metrics and methods, so it would be an advantage to use them for measuring ICN performance. In addition, said metrics and methods work already for host-centric networks, so comparison with information-centric networks would entail only the ICN extension of the IPPM framework. Finally, an important benefit of measuring the transport performance of a network at its output, using Quality of Service (QoS) metrics such as IPPM, is that it can be done mostly without any dependence to applications.
IETF十多年来一直致力于设计衡量IP网络性能的指标和方法。在相关框架[RFC2330]的指导下，该工作主要在IP性能指标（IPPM）工作组内进行。IPPM指标包括延迟、延迟变化、丢失、重新排序和复制。虽然IPPM的工作当然是基于分组交换IP网络，但可以想象，它也可以修改和扩展，以覆盖ICN网络。然而，要使这一主张成为事实，还需要进行更多的研究。许多专家在设计和完善IPPM指标和方法上花费了很长时间，因此使用它们来衡量ICN性能将是一种优势。此外，上述指标和方法已经适用于以主机为中心的网络，因此与以信息为中心的网络进行比较只需要IPPM框架的ICN扩展。最后，使用服务质量（QoS）指标（如IPPM）在网络输出端测量网络传输性能的一个重要好处是，它可以在不依赖于应用程序的情况下完成。
Another option for measuring transport performance would be to use QoS metrics, not at the output of the network like with IPPM, but at the input to the application. For a live video-streaming application the relevant metrics would be startup latency, playout lag, and playout continuity. The benefit of this approach is that it abstracts away all details of the underlying transport network, so it can be readily applied to compare between networks of different concepts (host-centric, information-centric, or other). As implied earlier, the drawback of the approach is its dependence on the application, so it is likely that different types of applications will require different metrics. It might be possible to identify standard metrics for each type of application, but the situation is not as clear as with IPPM metrics, and further investigation is necessary.
测量传输性能的另一个选项是使用QoS指标，而不是像IPPM那样在网络的输出端，而是在应用程序的输入端。对于实时视频流应用程序，相关指标将是启动延迟、播放延迟和播放连续性。这种方法的好处是，它将底层传输网络的所有细节抽象出来，因此可以很容易地应用于比较不同概念（以主机为中心、以信息为中心或其他）的网络。正如前面所暗示的，这种方法的缺点是依赖于应用程序，因此不同类型的应用程序可能需要不同的度量。可以为每种类型的应用程序确定标准度量，但情况不如IPPM度量那么清楚，需要进一步调查。
At a higher level of abstraction, we could measure the network's transport performance at the application output. This entails measuring the quality of the transported and reconstructed information as perceived by the user during consumption. In such an instance we would use Quality of Experience (QoE) metrics, which are by definition dependent on the application. For example, the standardized methods for obtaining a Mean Opinion Score (MOS) for VoIP (e.g., ITU-T Recommendation P.800) is quite different from those for IPTV (e.g., Perceptual Evaluation of Video Quality (PEVQ)). These methods are notoriously hard to implement, as they involve real users in a controlled environment. Such constraints can be relaxed or dropped by using methods that model human perception under certain environments, but these methods are typically intrusive. The most important drawback of measuring network performance at the output of the application is that only one part of each measurement is related to network performance. The rest is related to application performance, e.g., video coding, or even device capabilities, both of which are irrelevant to our purposes here and are generally hard to separate. We therefore see the use of QoE metrics in measuring ICN performance as a poor choice at this stage.
在更高的抽象级别上，我们可以在应用程序输出时测量网络的传输性能。这需要测量用户在消费过程中感知的传输和重构信息的质量。在这种情况下，我们将使用体验质量（QoE）指标，根据定义，这些指标取决于应用程序。例如，用于获得VoIP（例如，ITU-T建议P.800）的平均意见分数（MOS）的标准化方法与用于IPTV（例如，视频质量的感知评估（PEVQ））的方法非常不同。众所周知，这些方法很难实现，因为它们涉及到受控环境中的真实用户。这种限制可以通过使用在特定环境下模拟人类感知的方法来放松或消除，但这些方法通常是侵入性的。在应用程序的输出端测量网络性能最重要的缺点是，每次测量只有一部分与网络性能相关。其余部分与应用程序性能有关，例如视频编码，甚至设备功能，两者都与我们的目的无关，通常很难区分。因此，在现阶段，我们认为使用QoE指标来衡量ICN性能是一个糟糕的选择。
Overall system metrics that need to be considered include reliability, scalability, energy efficiency, and delay/disconnection tolerance. In deployments where ICN is addressing specific scenarios, relevant system metrics could be derived from current experience. For example, in Internet of Things (IoT) scenarios, which are discussed in [RFC7476], it is reasonable to consider the current generation of sensor nodes, sources of information, and even measurement gateways (e.g., for smart metering at homes) or smartphones. In this case, ICN operation ought to be evaluated with respect not only to overall scalability and network efficiency, but
需要考虑的总体系统指标包括可靠性、可扩展性、能效和延迟/断开容差。在ICN正在解决特定场景的部署中，可以根据当前经验得出相关的系统指标。例如，在[FRC776]中讨论的物联网（IOT）场景中，考虑当前一代的传感器节点、信息源、甚至测量网关（例如，用于家庭智能计量）或智能手机是合理的。在这种情况下，ICN操作不仅应该从总体可扩展性和网络效率方面进行评估，而且还应该从
also the impact on the nodes themselves. Karnouskos et al. [SensReqs] provide a comprehensive set of sensor and IoT-related requirements, for example, which include aspects such as resource utilization, service life-cycle management, and device management.
还包括对节点本身的影响。Karnouskos等人[SensReqs]提供了一套全面的传感器和物联网相关需求，例如，包括资源利用、服务生命周期管理和设备管理等方面。
Additionally, various specific metrics are also critical in constrained environments, such as processing requirements, signaling overhead, and memory allocation for caching procedures, in addition to power consumption and battery lifetime. For gateways (which typically act as a point of service to a large number of nodes and have to satisfy the information requests from remote entities), we need to consider scalability-related metrics, such as frequency and processing of successfully satisfied information requests.
此外，在受限环境中，除了功耗和电池寿命之外，各种特定指标也非常重要，例如处理需求、信令开销和缓存过程的内存分配。对于网关（通常充当服务点到大量节点，并且必须满足来自远程实体的信息请求），我们需要考虑可伸缩性相关度量，例如成功满足的信息请求的频率和处理。
Finally, given the in-network caching functionality of ICNs, efficiency and performance metrics of in-network caching have to be defined. Such metrics will need to guide researchers and operators regarding the performance of in-network caching algorithms. A first step on this direction has been made in [Psaras11]. The paper proposes a formula that approximates the proportion of time that a piece of content stays in a network cache. The model takes as input the rate of requests for a given piece of content (the Content of Interest (CoI)) and the rate of requests for all other contents that go through the given network element (router) and move the CoI down in the (LRU) cache. The formula takes also into account the size of the cache of this router.
最后，鉴于ICN的网络内缓存功能，必须定义网络内缓存的效率和性能指标。这些指标需要指导研究人员和运营商了解网络缓存算法的性能。在[Psaras11]中已经朝着这个方向迈出了第一步。本文提出了一个公式，用于近似计算内容在网络缓存中停留的时间比例。该模型将给定内容（感兴趣的内容（CoI））的请求速率和通过给定网络元素（路由器）并在（LRU）缓存中向下移动CoI的所有其他内容的请求速率作为输入。该公式还考虑了该路由器缓存的大小。
The output of the model essentially reflects the probability that the CoI will be found in a given cache. An initial study [Psaras11] is applied to the CCN / Named Data Networking (NDN) framework, where contents get cached at every node they traverse. The formula according to which the probability or proportion is calculated is given by:
该模型的输出本质上反映了在给定缓存中找到CoI的概率。一项初步研究[Psaras11]应用于CCN/命名数据网络（NDN）框架，其中内容缓存在它们所经过的每个节点上。概率或比例的计算公式如下：
pi = [mu / (mu + lambda)]^N
pi = [mu / (mu + lambda)]^N
where lambda is the request rate for the CoI, mu is the request rate for contents that move the CoI down the cache, and N is the size of the cache (in slots).
其中lambda是CoI的请求速率，mu是将CoI向下移动到缓存中的内容的请求速率，N是缓存的大小（在插槽中）。
The formula can be used to assess the caching performance of the system and can also potentially be used to identify the gain of the system due to caching. This can then be used to compare against gains by other factors, e.g., addition of extra bandwidth in the network.
该公式可用于评估系统的缓存性能，也可用于确定系统因缓存而获得的收益。然后，可以使用该值与其他因素（例如，网络中额外带宽的增加）的增益进行比较。
As we have seen above, every ICN network is built from a set of resources, which include link capacities, and different types of memory structures and repositories used for storing named data objects and chunks temporarily (i.e., caching) or persistently, as well as name resolution and other lookup services. A range of engineering trade-offs arise from the complexity and processing requirements of forwarding decisions, management needs (e.g., manual configuration, explicit garbage collection), and routing needs (e.g., amount of state, manual configuration of routing tables, support for mobility).
如上所述，每个ICN网络都是由一组资源构建的，这些资源包括链路容量、用于临时（即缓存）或持久存储命名数据对象和数据块的不同类型的内存结构和存储库，以及名称解析和其他查找服务。转发决策的复杂性和处理需求、管理需求（例如，手动配置、显式垃圾收集）和路由需求（例如，状态量、路由表的手动配置、对移动性的支持）会产生一系列工程权衡。
In order to be able to compare different ICN approaches, it would be beneficial to be able to define equivalence in terms of different resources that today are considered incomparable. For example, would provisioning an additional 5 Mbit/s link capacity lead to better performance than adding 100 GB of in-network storage? Within this context, one would consider resource equivalence (and the associated trade-offs) -- for example, for cache hit ratios per GB of cache, forwarding decision times, CPU cycles per forwarding decision, and so on.
为了能够比较不同的ICN方法，最好能够根据今天被认为不可比的不同资源定义等效性。例如，提供额外的5 Mbit/s链路容量会比添加100 GB的网络存储带来更好的性能吗？在此上下文中，人们将考虑资源等价性（以及相关的权衡），例如，对于每GB缓存的缓存命中率、转发决策时间、每次转发决定的CPU周期等等。
The introduction of an information-centric networking architecture and the corresponding communication paradigm results in changes to many aspects of network security. These will affect all scenarios described in [RFC7476]. Additional evaluation will be required to ensure relevant security requirements are appropriately met by the implementation of the chosen architecture in the various scenarios.
以信息为中心的网络体系结构和相应的通信模式的引入导致了网络安全许多方面的变化。这些将影响[RFC7476]中描述的所有场景。需要进行额外的评估，以确保在各种场景中所选架构的实施适当满足相关安全要求。
The ICN security aspects described in this document reflect the ICN security challenges outlined in [RFC7927].
本文档中描述的ICN安全方面反映了[RFC7927]中概述的ICN安全挑战。
The ICN architectures currently proposed have concentrated on authentication of delivered content to ensure its integrity. Even though the approaches are primarily applicable to freely accessible content that does not require access authorization, they will generally support delivery of encrypted content.
目前提出的ICN体系结构集中于对交付内容的身份验证，以确保其完整性。尽管这些方法主要适用于不需要访问授权的自由访问内容，但它们通常支持加密内容的交付。
The introduction of widespread caching mechanisms may also provide additional attack surfaces. The caching architecture to be used also needs to be evaluated to ensure that it meets the requirements of the usage scenarios.
引入广泛的缓存机制也可能提供额外的攻击面。还需要评估要使用的缓存体系结构，以确保它满足使用场景的要求。
In practice, the work on security in the various ICN research projects has been heavily concentrated on authentication of content. Work on authorization, access control, and privacy and security threats due to the expanded role of in-network caches has been quite limited. For example, a roadmap for improving the security model in NetInf can be found in [Renault09]. As secure communications on the Internet are becoming the norm, major gaps in ICN security aspects are bound to undermine the adoption of ICN. A comprehensive overview of ICN security is also provided in [Tourani16].
实际上，各种ICN研究项目中的安全性工作主要集中在内容认证上。由于在网络缓存中的角色扩大，在授权、访问控制以及隐私和安全威胁方面的工作非常有限。例如，可以在[Renault09]中找到改进NetInf安全模型的路线图。随着互联网上的安全通信正在成为常态，ICN安全方面的重大漏洞势必会破坏ICN的采用。[Tourani16]中还提供了ICN安全性的全面概述。
In the following subsections, we briefly consider the issues and provide pointers to the work that has been done on the security aspects of the architectures proposed.
在下面的小节中，我们简要地考虑这些问题，并为已经提出的体系结构的安全方面提供了指向工作的指针。
For fully secure content distribution, content access requires that the receiver be able to reliably assess:
对于完全安全的内容分发，内容访问要求接收方能够可靠地评估：
validity: Is it a complete, uncorrupted copy of what was originally published?
有效性：它是一个完整的，未被腐蚀的副本，什么是最初发表的？
provenance: Can the receiver identify the publisher? If so, can it and the source of any cached version of the document be adequately trusted?
出处：接收者能否识别出版者？如果是这样，它和文档的任何缓存版本的源是否可以充分信任？
relevance: Is the content an answer to the question that the receiver asked?
相关性：内容是否回答了接收者提出的问题？
All ICN architectures considered in this document primarily target the validity requirement using strong cryptographic means to tie the content request name to the content. Provenance and relevance are directly targeted to varying extents: There is a tussle or trade-off between simplicity and efficiency of access and level of assurance of all these traits. For example, maintaining provenance information can become extremely costly, particularly when considering (historic) relationships between multiple objects. Architectural decisions have therefore been made in each case as to whether the assessment is carried out by the information-centric network or left to the application.
本文档中考虑的所有ICN体系结构主要针对有效性要求，使用强加密手段将内容请求名称与内容绑定。出处和相关性在不同程度上是直接针对的：在获取的简单性和效率以及所有这些特征的保证水平之间存在着争斗或权衡。例如，维护出处信息可能会变得非常昂贵，特别是在考虑多个对象之间的（历史）关系时。因此，在每种情况下都做出了体系结构决策，即评估是由以信息为中心的网络执行还是由应用程序执行。
An additional consideration for authentication is whether a name should be irrevocably and immutably tied to a static piece of preexisting content or whether the name can be used to refer to dynamically or subsequently generated content. Schemes that only target immutable content can be less resource-hungry as they can use digest functions rather than public key cryptography for generating and checking signatures. However, this can increase the load on
身份验证的另一个考虑因素是，名称是否应不可撤销地、不变地绑定到先前存在的静态内容，或者该名称是否可用于引用动态或后续生成的内容。只针对不可变内容的方案可以减少资源消耗，因为它们可以使用摘要函数而不是公钥密码来生成和检查签名。但是，这可能会增加负载
applications because they are required to manage many names, rather than use a single name for an item of evolving content that changes over time (e.g., a piece of data containing an age reference).
应用程序，因为它们需要管理多个名称，而不是对随时间变化的内容项（例如，包含年龄参考的数据段）使用单个名称。
Data-Oriented Network Architecture (DONA) [DONA] and CCN [Jacobson09] [Smetters09] integrate most of the data needed to verify provenance into all content retrievals but need to be able to retrieve additional information (typically a security certificate) in order to complete the provenance authentication. Whether the application has any control of this extra retrieval will depend on the implementation. CCN is explicitly designed to handle dynamic content allowing names to be pre-allocated and attached to subsequently generated content. DONA offers variants for dynamic and immutable content.
面向数据的网络体系结构（DONA）[DONA]和CCN[Jacobson09][Smeters09]将验证来源所需的大部分数据集成到所有内容检索中，但需要能够检索附加信息（通常是安全证书），以完成来源身份验证。应用程序是否可以控制这个额外的检索将取决于实现。CCN明确设计用于处理动态内容，允许预先分配名称并将其附加到随后生成的内容。DONA为动态和不变的内容提供了变体。
Publish-Subscribe Internet Technology (PURSUIT) [Tagger12] appears to allow implementers to choose the authentication mechanism so that it can, in theory, emulate the authentication strategy of any of the other architectures. It is not clear whether different choices would lead to lack of interoperability.
发布-订阅互联网技术（PURSUIT）[Tagger12]似乎允许实现者选择身份验证机制，以便在理论上可以模拟任何其他体系结构的身份验证策略。目前尚不清楚不同的选择是否会导致缺乏互操作性。
NetInf uses the Named Information (ni) URI scheme [RFC6920] to identify content. This allows NetInf to assure validity without any additional information but gives no assurance on provenance or relevance. A "search" request allows an application to identify relevant content, and applications may choose to structure content to allow provenance assurance, but this will typically require additional network access. NetInf validity authentication is consequently efficient in a network environment with intermittent connectivity as it does not force additional network accesses and allows the application to decide on provenance validation if required. For dynamic content, NetInf can use, e.g., signed manifests. For more details on NetInf security, see [Dannewitz10].
NetInf使用命名信息（ni）URI方案[RFC6920]来标识内容。这使得NetInf可以在不提供任何额外信息的情况下确保有效性，但无法保证出处或相关性。“搜索”请求允许应用程序识别相关内容，并且应用程序可以选择构建内容以确保出处，但这通常需要额外的网络访问。因此，NetInf有效性身份验证在具有间歇性连接的网络环境中是有效的，因为它不会强制额外的网络访问，并允许应用程序在需要时决定来源验证。对于动态内容，NetInf可以使用，例如，签名清单。有关NetInf安全性的更多详细信息，请参阅[Dannewitz10]。
A potentially major concern for all ICN architectures considered here is that they do not provide any inbuilt support for an authorization framework or for logging. Once content has been published and cached in servers, routers, or endpoints not controlled by the publisher, the publisher has no way to enforce access control, determine which users have accessed the content, or revoke its publication. In fact, in some cases (where requests do not necessarily contain host/user identifier information), it is difficult for the publishers themselves to perform access control.
这里考虑的所有ICN体系结构的一个潜在主要问题是，它们不提供对授权框架或日志记录的任何内置支持。一旦内容发布并缓存在不受发布者控制的服务器、路由器或端点中，发布者将无法强制执行访问控制、确定哪些用户访问了内容或撤消其发布。事实上，在某些情况下（请求不一定包含主机/用户标识符信息），发布者本身很难执行访问控制。
Access could be limited by encrypting the content, but the necessity of distributing keys out-of-band appears to negate the advantages of in-network caching. This also creates significant challenges when attempting to manage and restrict key access. An authorization delegation scheme has been proposed [Fotiou12]. This scheme allows semi-trusted entities (such as caches or CDN nodes) to delegate access control decisions to third-party access control providers that are trusted by the content publisher. The former entities have no access to subscriber-related information and should respect the decisions of the access control providers.
通过对内容进行加密可以限制访问，但在带外分发密钥的必要性似乎否定了网络缓存的优势。在尝试管理和限制密钥访问时，这也会带来重大挑战。提出了一种授权委托方案[Fotiou12]。此方案允许半可信实体（如缓存或CDN节点）将访问控制决策委托给内容发布者信任的第三方访问控制提供商。前实体无权访问与订户相关的信息，应尊重访问控制提供商的决定。
A recent proposal for an extra layer in the protocol stack [LIRA] gives control of the name resolution infrastructure to the publisher. This enables access logging as well some degree of active cache management, e.g., purging of stale content.
最近提出的在协议栈[LIRA]中增加一层的建议将名称解析基础设施的控制权交给发布者。这可以实现访问日志记录以及某种程度的主动缓存管理，例如清除过时内容。
One possible technique that could allow for providing access control to heterogeneous groups and still allow for a single encrypted object representation that remains cacheable is Attribute-Based Encryption (ABE). A first proposal for this is presented in [Ion13]. To support heterogeneous groups and avoid having a single authority that has a master key multi-authority, ABE can be used [Lewko11].
一种可能的技术是基于属性的加密（ABE），它允许对异构组提供访问控制，并且仍然允许保持可缓存的单个加密对象表示。[13]中提出了这方面的第一个建议。为了支持异构组并避免拥有一个拥有主密钥多权限的单一权限，可以使用ABE[Lewko11]。
Evaluating the impact of the absence of these features will be essential for any scenario where an ICN architecture might be deployed. It may have a seriously negative impact on the applicability of ICN in commercial environments unless a solution can be found.
对于可能部署ICN体系结构的任何场景，评估缺少这些功能的影响都是至关重要的。除非能找到解决方案，否则可能会对ICN在商业环境中的适用性产生严重的负面影响。
Another area where the architectures have not been significantly analyzed is privacy. Caching implies a trade-off between network efficiency and privacy. The activity of users is significantly more exposed to the scrutiny of cache owners with whom they may not have any relationship. However, it should be noted that it is only the first-hop router/cache that can see who requests what, as requests are aggregated and only the previous-hop router is visible when a request is forwarded.
另一个没有对体系结构进行显著分析的领域是隐私。缓存意味着网络效率和隐私之间的权衡。用户的活动明显更容易受到缓存所有者的审查，他们可能与缓存所有者没有任何关系。然而，应该注意的是，只有第一跳路由器/缓存可以看到谁请求了什么，因为请求被聚合，并且当请求被转发时，只有前一跳路由器可见。
Although in many ICN architectures the source of a request is not explicitly identified, an attacker may be able to obtain considerable information if he or she can monitor transactions on the cache and obtain details of the objects accessed, the topological direction of requests, and information about the timing of transactions. The persistence of data in the cache can make life easier for an attacker by giving a longer timescale for analysis.
尽管在许多ICN体系结构中，请求的来源没有明确标识，但如果攻击者能够监视缓存上的事务，并获取所访问对象的详细信息、请求的拓扑方向以及有关事务时间的信息，则他或她可能能够获得大量信息。缓存中数据的持久性为攻击者提供了更长的分析时间，从而使攻击者的生活更加轻松。
The impact of CCN on privacy has been investigated in [Lauinger10], and the analysis is applicable to all ICN architectures because it is mostly focused on the common caching aspect. The privacy risks of Named Data Networking are also highlighted in [Lauinger12]. Further work on privacy in ICNs can be found in [Chaabane13]. Finally, Fotiou et al. define an ICN privacy evaluation framework in [Fotiou14].
[Lauinger10]研究了CCN对隐私的影响，该分析适用于所有ICN架构，因为它主要关注公共缓存方面。[Lauinger12]中还强调了命名数据网络的隐私风险。有关ICN中隐私的进一步工作，请参见[Chaabane13]。最后，Fotiou等人在[Fotiou14]中定义了ICN隐私评估框架。
The architectural differences of the various ICN models versus TCP/IP have consequences for network security. There is limited consideration of the threat models and potential mitigation in the various documents describing the architectures. [Lauinger10] and [Chaabane13] also consider the changed threat model. Some of the key aspects are:
不同ICN模型与TCP/IP的架构差异对网络安全有影响。在描述体系结构的各种文档中，对威胁模型和潜在缓解措施的考虑有限。[LaungEr10]和[CHAABANE13]还考虑了改变的威胁模型。一些关键方面包括：
o Caching implies a trade-off between network efficiency and user privacy as discussed in Section 3.3.
o 缓存意味着网络效率和用户隐私之间的权衡，如第3.3节所述。
o More-powerful routers upgraded to handle persistent caching increase the network's attack surface. This is particularly the case in systems that may need to perform cryptographic checks on content that is being cached. For example, not doing this could lead routers to disseminate invalid content.
o 升级更强大的路由器以处理持久缓存会增加网络的攻击面。在可能需要对缓存的内容执行加密检查的系统中尤其如此。例如，不这样做可能会导致路由器传播无效内容。
o ICNs makes it difficult to identify the origin of a request (as mentioned in Section 3.3), slowing down the process of blocking requests and requiring alternative mechanisms to differentiate legitimate requests from inappropriate ones as access control lists (ACLs) will probably be of little value for ICN requests.
o ICN使识别请求来源变得困难（如第3.3节所述），减慢了阻止请求的过程，并需要替代机制来区分合法请求和不适当请求，因为访问控制列表（ACL）对ICN请求可能没有什么价值。
o Denial-of-service (DoS) attacks may require more effort on ICN than on TCP/IP-based host-centric networks, but they are still feasible. One reason for this is that it is difficult for the attacker to force repeated requests for the same content onto a single node; ICNs naturally spread content so that after the initial few requests, subsequent requests will generally be satisfied by alternative sources, blunting the impact of a DoS attack. That said, there are many ways around this, e.g., generating random suffix identifiers that always result in cache misses.
o 拒绝服务（DoS）攻击可能需要在ICN上比在基于TCP/IP的以主机为中心的网络上付出更多的努力，但它们仍然是可行的。其中一个原因是攻击者很难在单个节点上强制重复请求相同的内容；ICN自然会传播内容，因此在最初的几次请求之后，后续请求通常会由其他来源满足，从而减弱DoS攻击的影响。也就是说，有很多方法可以解决这个问题，例如，生成总是导致缓存未命中的随机后缀标识符。
o Per-request state in routers can be abused for DoS attacks.
o 路由器中的每请求状态可能被滥用以进行DoS攻击。
o Caches can be misused in the following ways:
o 缓存可能以以下方式被误用：
+ Attackers can use caches as storage to make their own content available.
+ 攻击者可以使用缓存作为存储，使自己的内容可用。
+ The efficiency of caches can be decreased by attackers with the goal of DoS attacks.
+ 攻击者可以通过DoS攻击降低缓存的效率。
+ Content can be extracted by any attacker connected to the cache, putting users' privacy at risk.
+ 任何连接到缓存的攻击者都可以提取内容，从而危及用户的隐私。
Appropriate mitigation of these threats will need to be considered in each scenario.
在每种情况下都需要考虑适当缓解这些威胁。
Since ICN is an emerging area, the community is in the process of developing effective evaluation environments, including releasing open-source implementations, simulators, emulators, and testbeds. To date, none of the available evaluation tools can be seen as the one and only community reference evaluation tool. Furthermore, no single environment supports all well-known ICN approaches, as we describe below, hindering the direct comparison of the results obtained for different ICN approaches. The subsections that follow review the currently publicly available ICN implementations, simulators, and experimental facilities.
由于ICN是一个新兴领域，社区正在开发有效的评估环境，包括发布开源实现、模拟器、模拟器和测试平台。迄今为止，没有一种可用的评估工具可以被视为唯一的社区参考评估工具。此外，正如我们在下文所述，没有一个单一的环境支持所有众所周知的ICN方法，这妨碍了对不同ICN方法所得结果的直接比较。接下来的小节回顾了当前公开的ICN实现、模拟器和实验设施。
An updated list of the available evaluation tools will be maintained
at the ICNRG Wiki page: <https://trac.tools.ietf.org/group/irtf/trac/
wiki/IcnEvaluationAndTestbeds>
An updated list of the available evaluation tools will be maintained
at the ICNRG Wiki page: <https://trac.tools.ietf.org/group/irtf/trac/
wiki/IcnEvaluationAndTestbeds>
The Named Data Networking (NDN) project has open-sourced a software reference implementation of the architecture and protocol called NDN (http://named-data.net). NDN is available for deployment on various operating systems and includes C and Java libraries that can be used to build applications.
命名数据网络（NDN）项目已经公开了一个称为NDN的体系结构和协议的软件参考实现(http://named-data.net). NDN可用于部署在各种操作系统上，包括可用于构建应用程序的C和Java库。
CCN-lite (http://www.ccn-lite.net) is a lightweight implementation of the CCN protocol that supports most of the key features of CCNx and is interoperable with CCNx. CCN-lite implements the core CCN logic in about 1000 lines of code, so it is ideal for classroom work and course projects as well as for quickly experimenting with CCN extensions. For example, Baccelli et al. use CCN-lite on top of the RIOT operating system to conduct experiments over an IoT testbed [Baccelli14].
CCN-lite(http://www.ccn-lite.net)是CCN协议的轻量级实现，支持CCNx的大部分关键功能，并可与CCNx互操作。CCN lite在大约1000行代码中实现了核心CCN逻辑，因此它非常适合于课堂工作和课程项目，也适合于快速试验CCN扩展。例如，Baccelli等人在RIOT操作系统上使用CCN lite在物联网试验台上进行试验[Baccelli 14]。
PARC is offering CCN source code under various licensing schemes, please see <http://www.ccnx.org> for details.
PARC根据各种许可计划提供CCN源代码，请参见<http://www.ccnx.org>详情请参阅。
The PURSUIT project (http://www.fp7-pursuit.eu) has open-sourced its Blackhawk publish-subscribe (Pub/Sub) implementation for Linux and Android; more details are available at <https://github.com/fp7-pursuit/blackadder>. Blackadder uses the Click modular router for ease of development. The code distribution features a set of tools, test applications, and scripts. The POINT project (http://www.point-h2020.eu) is currently maintaining Blackadder.
追击计划(http://www.fp7-pursuit.eu)已将其针对Linux和Android的Blackhawk publish-subscribe（发布/订阅）实现开源；详情请浏览<https://github.com/fp7-pursuit/blackadder>. Blackadder使用Click模块化路由器以便于开发。代码发行版以一组工具、测试应用程序和脚本为特色。POINT项目(http://www.point-h2020.eu)目前正在维护Blackadder。
The 4WARD and SAIL projects have open-sourced software that implements different aspects of NetInf, e.g., the NetInf URI format and HTTP and UDP convergence layer, using different programming languages. The Java implementation provides a local caching proxy and client. Further, an OpenNetInf prototype is available as well as a hybrid host-centric and information-centric network architecture called the Global Information Network (GIN), a browser plug-in and video-streaming software. See <http://www.netinf.org/open-source> for more details.
4WARD和SAIL项目拥有开源软件，使用不同的编程语言实现NetInf的不同方面，例如NetInf URI格式以及HTTP和UDP聚合层。Java实现提供了本地缓存代理和客户端。此外，还提供了OpenNetInf原型以及称为全球信息网络（GIN）的以主机为中心和以信息为中心的混合网络体系结构，这是一种浏览器插件和视频流软件。看<http://www.netinf.org/open-source>更多细节。
Simulators and emulators should be able to capture faithfully all features and operations of the respective ICN architecture(s) and any limitations should be openly documented. It is essential that these tools and environments come with adequate logging facilities so that one can use them for in-depth analysis as well as debugging. Additional requirements include the ability to support medium- to large-scale experiments, the ability to quickly and correctly set various configurations and parameters, as well as to support the playback of traffic traces captured on a real testbed or network. Obviously, this does not even begin to touch upon the need for strong validation of any evaluated implementations.
模拟器和仿真器应能够忠实地捕获各个ICN体系结构的所有功能和操作，并且应公开记录任何限制。这些工具和环境必须配备足够的日志记录设施，以便能够使用它们进行深入分析和调试。其他要求包括支持中大规模实验的能力、快速正确设置各种配置和参数的能力，以及支持回放在真实试验台或网络上捕获的流量跟踪。显然，这甚至还没有涉及到对任何经过评估的实现进行强有力的验证的需要。
The Named Data Networking (NDN) project (http://named-data.net) has developed ndnSIM [ndnSIM] [ndnSIM2]; this is a module that can be plugged into the ns-3 simulator (https://www.nsnam.org) and supports the core features of NDN. One can use ndnSIM to experiment with various NDN applications and services as well as components developed for NDN such as routing protocols and caching and forwarding strategies, among others. The code for ns-3 and ndnSIM is openly available to the community and can be used as the basis for implementing ICN protocols or applications. For more details, see <http://ndnsim.net/2.0/>.
命名数据网络（NDN）项目(http://named-data.net)开发了ndnSIM[ndnSIM][ndnSIM2]；这是一个可插入ns-3模拟器的模块(https://www.nsnam.org)并支持NDN的核心功能。可以使用ndnSIM来试验各种NDN应用程序和服务以及为NDN开发的组件，例如路由协议、缓存和转发策略等。ns-3和ndnSIM的代码可供社区公开使用，并可作为实施ICN协议或应用程序的基础。有关详细信息，请参阅<http://ndnsim.net/2.0/>.
ccnSim [ccnSim] is a CCN-specific simulator that was specially designed to handle forwarding of a large number of CCN-chunks (http://www.infres.enst.fr/~drossi/index.php?n=Software.ccnSim). ccnSim is written in C++ for the OMNeT++ simulation framework (https://omnetpp.org). Other CCN-specific simulators include the CCN Packet-Level Simulator [CCNPL] and CCN-Joker [Cianci12]. CCN-Joker emulates in user space all basic aspects of a CCN node (e.g., handling of Interest and Data packets, cache sizing, replacement policies), including both flow and congestion control. The code is open source and is suitable for both emulation-based analyses and real experiments. Finally, Cabral et al. [MiniCCNx] use container-based emulation and resource isolation techniques to develop a prototyping and emulation tool.
ccnSim[ccnSim]是一个特定于CCN的模拟器，专门设计用于处理大量CCN块的转发(http://www.infres.enst.fr/~drossi/index.php？n=Software.ccnSim）。CCNSIM是用C++编写的OMNET++仿真框架（https://omnetpp.org). 其他特定于CCN的模拟器包括CCN数据包级模拟器[CCNPL]和CCN小丑[Cianci12]。CCN Joker在用户空间模拟CCN节点的所有基本方面（例如，兴趣和数据包的处理、缓存大小、替换策略），包括流量和拥塞控制。该代码是开源的，适用于基于仿真的分析和实际实验。最后，Cabral等人[MiniCCNx]使用基于容器的仿真和资源隔离技术来开发原型和仿真工具。
The Icarus simulator [ICARUS] focuses on caching in ICN and is agnostic with respect to any particular ICN implementation. The simulator is implemented in Python, uses the Fast Network Simulator Setup tool [Saino13], and is available at <http://icarus-sim.github.io>. Icarus has several caching strategies implemented, including among others ProbCache [Psaras12], node-centrality-based caching [Chai12], and hash-route-based caching [HASHROUT].
Icarus模拟器[Icarus]专注于ICN中的缓存，对于任何特定的ICN实现都是不可知的。模拟器是用Python实现的，使用快速网络模拟器设置工具[Saino13]，可在<http://icarus-sim.github.io>. Icarus实施了几种缓存策略，包括ProbCache[Psaras12]、基于节点中心性的缓存[Chai12]和基于哈希路由的缓存[HASHROUT]。
ProbCache [Psaras12] is taking a resource management view on caching decisions and approximates the available cache capacity along the path from source to destination. Based on this approximation and in order to reduce caching redundancy across the path, it caches content probabilistically. According to [Chai12], the node with the highest "betweenness centrality" along the path from source to destination is responsible for caching incoming content. Finally, [HASHROUT] calculates the hash function of a content's name and assigns contents to caches of a domain according to that. The hash space is split according to the number of caches of the network. Then, upon subsequent requests, and based again on the hash of the name included in the request, edge routers redirect requests to the cache assigned with the corresponding hash space. [HASHROUT] is an off-path caching strategy; in contrast to [Psaras12] and [Chai12], it requires minimum coordination and redirection overhead. In its latest update, Icarus also includes implementation of the "Satisfied Interest Table" (SIT) [Sourlas15]. The SIT points in the direction where content has been sent recently. Among other benefits, this enables information resilience in case of network fragmentation (i.e., content can still
ProbCache[Psaras12]从资源管理的角度考虑缓存决策，并大致估计从源到目标的路径上的可用缓存容量。基于此近似值，为了减少路径上的缓存冗余，它以概率方式缓存内容。根据[Chai12]，在从源到目标的路径上具有最高“介数中心性”的节点负责缓存传入内容。最后，[HASHROUT]计算内容名称的哈希函数，并根据该函数将内容分配给域的缓存。哈希空间根据网络缓存的数量进行分割。然后，根据后续请求，并且再次基于请求中包括的名称的散列，边缘路由器将请求重定向到分配有相应散列空间的缓存。[HASHROUT]是一种非路径缓存策略；与[Psaras12]和[Chai12]相比，它需要最小的协调和重定向开销。在其最新更新中，Icarus还包括“满意的利息表”（SIT）[Sourlas15]的实现。SIT指向最近发送内容的方向。除其他好处外，这还可以在网络碎片（即，内容仍然可以恢复）的情况下实现信息恢复能力
be found in neighbor caches or in users' devices) and inherently supports user-assisted caching (i.e., P2P-like content distribution).
可以在邻居缓存或用户设备中找到），并固有地支持用户辅助缓存（即，类似P2P的内容分发）。
Tortelli et al. [ICNSIMS] provide a comparison of ndnSIM, ccnSim, and Icarus.
Tortelli等人[ICNSIMS]对ndnSIM、ccnSim和Icarus进行了比较。
An important consideration in the evaluation of any kind of future Internet mechanism lies in the characteristics of that evaluation itself. Central to the assessment of the features provided by a novel mechanism is the consideration of how it improves over already existing technologies, and by "how much". With the disruptive nature of clean-slate approaches generating new and different technological requirements, it is complex to provide meaningful results for a network-layer framework, in comparison with what is deployed in the current Internet. Thus, despite the availability of ICN implementations and simulators, the need for large-scale environments supporting experimental evaluation of novel research is of prime importance to the advancement of ICN deployment.
在评估任何类型的未来互联网机制时，一个重要的考虑因素在于评估本身的特点。评估新机制提供的功能的核心是考虑它如何比现有技术有所改进，以及改进的程度。由于“一板一眼”方法的破坏性特点产生了新的和不同的技术需求，与当前互联网中部署的方法相比，为网络层框架提供有意义的结果是复杂的。因此，尽管ICN实现和模拟器可用，但对支持新研究实验评估的大规模环境的需求对于ICN部署的推进至关重要。
Different experimental facilities have different characteristics and capabilities, e.g., having low cost of use, reproducible configuration, easy-to-use tools, and available background traffic, and being sharable.
不同的实验设施具有不同的特性和能力，例如，具有低使用成本、可重复配置、易于使用的工具和可用的背景流量，并且可以共享。
An example of an experimental facility that supports CCN is the Open Network Lab [ONL] that currently comprises 18 extensible gigabit routers and over a 100 computers representing clients and is freely available to the public for running CCN experiments. Nodes in ONL are preloaded with CCNx software. ONL provides a graphical user interface for easy configuration and testbed setup as per the experiment requirements, and also serves as a control mechanism, allowing access to various control variables and traffic counters.
支持CCN的实验设施的一个例子是开放网络实验室[ONL]，该实验室目前包括18个可扩展千兆路由器和100多台代表客户端的计算机，公众可免费使用该实验室进行CCN实验。ONL中的节点使用CCNx软件预加载。ONL提供了一个图形用户界面，便于根据实验要求进行配置和试验台设置，还可以作为一种控制机制，允许访问各种控制变量和流量计数器。
Further, it is also possible to run and evaluate CCN over popular testbeds [PLANETLAB] [EMULAB] [DETERLAB] [OFELIA] by directly running, for example, the CCNx open-source code [Salsano13] [Carofiglio13] [Awiphan13] [Bernardini14]. Also, the Network Experimentation Programming Interface (NEPI) [NEPI] is a tool developed for controlling and managing large-scale network experiments. NEPI can be used to control and manage large-scale CCNx experiments, e.g., on PlanetLab [Quereilhac14].
此外，还可以通过直接运行CCNx开源代码[Salsano13][Carofiglio13][Awiphan13][Bernardini14]，在流行的测试床[PLANETLAB][EMULAB][DETERLAB][OFELIA]上运行和评估CCN。此外，网络实验编程接口（NEPI）[NEPI]是为控制和管理大规模网络实验而开发的工具。NEPI可用于控制和管理大规模CCNx实验，例如在PlanetLab上[Quereilhac14]。
The POINT project is maintaining a testbed with 40 machines across Europe, North America (Massachusetts Institute of Technology (MIT)), and Japan (National Institute of Information and Communications Technology (NICT)) interconnected in a topology containing one Topology Manager and one rendezvous node that handle all publish/subscribe and topology formation requests [Parisis13]. All machines run Blackadder (see Section 4.1). New nodes can join, and experiments can be run on request.
POINT项目在欧洲、北美（麻省理工学院（MIT））和日本（国家信息和通信技术研究所（NICT））维护一个包含40台机器的试验台在包含一个拓扑管理器和一个集合节点的拓扑中互连，集合节点处理所有发布/订阅和拓扑形成请求[Parisis13]。所有机器都运行黑加法器（见第4.1节）。新节点可以加入，并且可以根据请求运行实验。
NICT has also developed a testbed used for ICN experiments [Asaeda14] comprising multiple servers located in Asia and other locations. Each testbed server (or virtual machine) utilizes a Linux kernel-based container (LXC) for node virtualization. This testbed enables users to run applications and protocols for ICN in two experimentation modes using two different container designs:
NICT还开发了一个用于ICN实验的试验台[Asaeda14]，包括位于亚洲和其他地区的多台服务器。每个测试台服务器（或虚拟机）都使用基于Linux内核的容器（LXC）进行节点虚拟化。此测试平台使用户能够使用两种不同的容器设计，在两种实验模式下运行ICN的应用程序和协议：
1. application-level experimentation using a "common container" and
1. 使用“通用容器”和
2. network-level experimentation using a "user container."
2. 使用“用户容器”进行网络级实验
A common container is shared by all testbed users, and a user container is assigned to one testbed user. A common container has a global IP address to connect with other containers or external networks, whereas each user container uses a private IP address and a user space providing a closed networking environment. A user can login to his/her user containers using SSH with his/her certificate, or access them from PCs connected to the Internet using SSH tunneling.
一个公共容器由所有测试床用户共享，一个用户容器分配给一个测试床用户。公共容器有一个全局IP地址来连接其他容器或外部网络，而每个用户容器使用一个私有IP地址和一个用户空间来提供一个封闭的网络环境。用户可以使用SSH和证书登录到他/她的用户容器，或者使用SSH隧道从连接到Internet的PC访问这些容器。
This testbed also implements an "on-filesystem cache" to allocate caching data on a UNIX filesystem. The on-filesystem cache system accommodates two kinds of caches: "individual cache" and "shared cache." Individual cache is accessible for one dedicated router for the individual user, while shared cache is accessible for a set of routers in the same group to avoid duplicated caching in the neighborhood for cooperative caching.
该测试台还实现了一个“文件系统缓存”，用于在UNIX文件系统上分配缓存数据。文件系统上的缓存系统可容纳两种缓存：“单个缓存”和“共享缓存”。单个缓存可由单个用户的一个专用路由器访问，而共享缓存可由同一组中的一组路由器访问，以避免邻居中的重复缓存，从而实现协作缓存。
This document does not impact the security of the Internet, but Section 3 outlines security and privacy concerns that might affect a deployment of a future ICN approach.
本文件不影响互联网安全，但第3节概述了可能影响未来ICN方法部署的安全和隐私问题。
[4WARD6.1] Ohlman, B., et al., "First NetInf Architecture Description", 4WARD Project Deliverable D-6.1, April 2009.
[4WARD6.1]Ohlman，B.等人，“第一个NetInf架构描述”，4WARD项目交付成果D-6.1，2009年4月。
[4WARD6.3] Ahlgren, B., et al., "NetInf Evaluation", 4WARD Project Deliverable D-6.3, June 2010.
[4WARD6.3]Ahlgren，B.等人，“网络信息技术评估”，4WARD项目交付成果D-6.3，2010年6月。
[Arlitt97] Arlitt, M. and C. Williamson, "Internet web servers: workload characterization and performance implications", IEEE/ACM Transactions on Networking, vol. 5, pp. 631-645, DOI 10.1109/90.649565, 1997.
[Arlitt97]Arlitt，M.和C.Williamson，“互联网web服务器：工作负载特征和性能影响”，IEEE/ACM网络交易，第5卷，第631-645页，DOI 10.1109/90.6495651997。
[Asaeda14] Asaeda, H., Li, R., and N. Choi, "Container-Based Unified Testbed for Information-Centric Networking", IEEE Network, vol. 28, no. 6, pp. 60-66, DOI 10.1109/MNET.2014.6963806, 2014.
[Asaeda14]Asaeda，H.，Li，R.，和N.Choi，“基于容器的信息中心网络统一测试平台”，IEEE网络，第28卷，第6期，第60-66页，DOI 10.1109/MNET.2014.6963806，2014。
[Awiphan13] Awiphan, S., et al., "Video streaming over content centric networking: Experimental studies on PlanetLab", Proc. Computing, Communications and IT Applications Conference (ComComAp), IEEE, DOI 10.1109/ComComAp.2013.6533602, 2013.
[Awiphan13]Awiphan，S.等人，“以内容为中心的网络上的视频流：PlanetLab的实验研究”，Proc。计算、通信和IT应用会议（COMAP），IEEE，DOI 10.1109/COMAP.2013.6533602，2013年。
[Baccelli14] Baccelli, E., et al., "Information Centric Networking in the IoT: Experiments with NDN in the Wild", Proceedings of the 1st international conference on Information-centric networking (ICN '14), ACM, DOI 10.1145/2660129.2660144, 2014.
[Baccelli 14]Baccelli，E.等人，“物联网中的信息中心网络：野外NDN实验”，第一届信息中心网络国际会议记录（ICN'14），ACM，DOI 10.1145/2660129.2660144，2014年。
[Barabasi99] Barabasi, A. and R. Albert, "Emergence of Scaling in Random Networks", Science, vol. 286, no. 5439, pp. 509-512, DOI 10.1126/science.286.5439.509, 1999.
[Barabasi99]Barabasi，A.和R.Albert，“随机网络中尺度的出现”，《科学》，第286卷，第5439号，第509-512页，DOI 10.1126/Science.286.5439.5092999。
[Barford98] Barford, P. and M. Crovella, "Generating representative web workloads for network and server performance evaluation", in ACM SIGMETRICS '98 / PERFORMANCE '98, pp. 151-160, DOI 10.1145/277851.277897, 1998.
[Barford98]Barford，P.和M.Crovella，“为网络和服务器性能评估生成具有代表性的web工作负载”，载于ACM SIGMETRICS'98/performance'98，第151-160页，DOI 10.1145/277851.2778971998年。
[Barford99] Barford, P., Bestavros, A., Bradley, A., and M. Crovella, "Changes in web client access patterns: Characteristics and caching implications", World Wide Web, vol. 2, pp. 15-28, DOI 10.1023/A:1019236319752, 1999.
[Barford99]Barford，P.，Bestavros，A.，Bradley，A.，和M.Crovella，“web客户端访问模式的变化：特征和缓存含义”，万维网，第2卷，第15-28页，DOI 10.1023/A:10192363197521999。
[Bellissimo04] Bellissimo, A., Levine, B., and P. Shenoy, "Exploring the Use of BitTorrent as the Basis for a Large Trace Repository", University of Massachusetts Amherst, Tech. Rep. 04-41, 2004.
[BELISSIMO04] BelISimo，A，Levin，B.和P. Shenoy，“探索BitTorrent作为大型跟踪库的基础”，麻州大学AHESTT，Tea.R.P.04-41，2004。
[Bernardini14] Bernardini, C., et al., "Socially-aware caching strategy for content centric networking", Proc. IFIP Networking Conference, DOI 10.1109/IFIPNetworking.2014.6857093, 2014.
[Bernardini 14]Bernardini，C.等人，“以内容为中心的网络社交感知缓存策略”，Proc。IFIP网络会议，DOI 10.1109/IFIPNetworking.2014.6857093，2014。
[Blefari-Melazzi12] Blefari Melazzi, N., et al., "Scalability Measurements in an Information-Centric Network", Springer Lecture Notes in Computer Science (LNCS), vol. 7586, DOI 10.1007/978-3-642-41296-7_6, 2012.
[Blefari-Melazzi12]Blefari Melazzi，N.等人，“以信息为中心的网络中的可伸缩性测量”，Springer计算机科学课堂讲稿（LNCS），第7586卷，DOI 10.1007/978-3-642-41296-7_6，2012年。
[Breslau99] Breslau, L., Cao, P., Fan, L., Phillips, G., and S. Shenker, "Web caching and zipf-like distributions: evidence and implications", Proc. of INFOCOM '99, New York (NY), USA, DOI 10.1109/INFCOM.1999.749260, March 1999.
[Breslau99]Breslau，L.，Cao，P.，Fan，L.，Phillips，G.，和S.Shenker，“网络缓存和类似zipf的发行：证据和影响”，Proc。1999年3月，美国纽约州，DOI 10.1109/INFCOM.1999.749260Infocom'99。
[Busari02] Busari, M. and C. Williamson, "ProWGen: a synthetic workload generation tool for simulation evaluation of web proxy caches", Computer Networks, vol. 38, no. 6, pp. 779-794, DOI 10.1016/S1389-1286(01)00285-7, 2002.
[Busari02]Busari，M.和C.Williamson，“ProWGen：用于模拟评估web代理缓存的合成工作负载生成工具”，计算机网络，第38卷，第6期，第779-794页，DOI 10.1016/S1389-1286（01）00285-72002。
[Carofiglio11] Carofiglio, G., Gallo, M., Muscariello, L., and D. Perino, "Modeling Data Transfer in Content-Centric Networking", Proceedings of the 23rd International Teletraffic Congress (ITC '11), San Francisco, USA, September 2011.
[ CAROFIGIO11] CARFIGILO，G，Gallo，M，Muscariello，L，和D. Perino，“建模数据传输在以内容为中心的网络”，第二十三届国际远程交通大会（ITC’11），旧金山，美国，2011年9月。
[Carofiglio13] Carofiglio, G., et al., "Optimal multipath congestion control and request forwarding in Information-Centric Networks", Proc. 2013 21st IEEE International Conference on Network Protocols (ICNP), DOI 10.1109/ICNP.2013.6733576, 2013.
[Carofiglio 13]Carofiglio，G.等人，“信息中心网络中的最佳多路径拥塞控制和请求转发”，Proc。2013年第21届IEEE网络协议国际会议（ICNP），DOI 10.1109/ICNP.2013.6733576，2013年。
[CCNPL] Institut de Recherche Technologique (IRT) SystemX, "CCNPL-SIM", <http://systemx.enst.fr/ccnpl-sim>.
[CCNPL]技术研究所（IRT）SystemX，“CCNPL-SIM”<http://systemx.enst.fr/ccnpl-sim>.
[ccnSim] Rossini, G. and D. Rossi, "Large scale simulation of CCN networks", Proc. AlgoTel 2012, La Grande Motte, France, May 2012.
[ccnSim]Rossini，G.和D.Rossi，“CCN网络的大规模模拟”，Proc。AlgoTel 2012，拉格朗德莫特，法国，2012年5月。
[Cha07] Cha, M., Kwak, H., Rodriguez, P., Ahn, Y.-Y., and S. Moon, "I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system", Proceedings of the 7th ACM SIGCOMM conference on Internet measurement (IMC '07), San Diego (CA), USA, DOI 10.1145/1298306.1298309, October 2007.
[Cha07]Cha，M.，Kwak，H.，Rodriguez，P.，Ahn，Y.-Y.，和S.Moon，“我管，你管，每个人管：分析世界上最大的用户生成内容视频系统”，第七届ACM SIGCOMM互联网测量会议记录（IMC'07），美国圣地亚哥，DOI 10.1145/1298306.1298309，2007年10月。
[Chaabane13] Chaabane, A., De Cristofaro, E., Kaafar, M., and E. Uzun, "Privacy in Content-Oriented Networking: Threats and Countermeasures", ACM SIGCOMM Computer Communication Review, Vol. 43, Issue 3, DOI 10.1145/2500098.2500102, July 2013.
[Chaabane13]Chaabane，A.，De Cristofaro，E.，Kaafar，M.，和E.Uzun，“面向内容的网络中的隐私：威胁和对策”，ACM SIGCOMM计算机通信评论，第43卷，第3期，DOI 10.1145/2500098.25001022，2013年7月。
[Cheng08] Cheng, X., Dale, C., and J. Liu, "Statistics and social network of YouTube videos", 16th International Workshop on Quality of Service (IWQoS 2008), IEEE, pp. 229-238, DOI 10.1109/IWQOS.2008.32, 2008.
[Cheng08]Cheng，X.，Dale，C.，和J.Liu，“YouTube视频的统计和社交网络”，第16届服务质量国际研讨会（IWQoS 2008），IEEE，第229-238页，DOI 10.1109/IWQoS.2008.32，2008。
[Cheng13] Cheng, X., Liu, J., and C. Dale, "Understanding the Characteristics of Internet Short Video Sharing: YouTube as a Case Study", IEEE Transactions on Multimedia, vol. 15, issue 5, DOI 10.1109/TMM.2013.2265531, 2013.
[Cheng13]Cheng，X.，Liu，J.，和C.Dale，“理解互联网短视频共享的特征：YouTube作为案例研究”，IEEE多媒体交易，第15卷，第5期，DOI 10.1109/TMM.2013.22655312013。
[Chai12] Chai, W., He, D., Psaras, I., and G. Pavlou, "Cache 'Less for More' in Information-centric Networks", Proceedings of the 11th international IFIP TC 6 conference on Networking (IFIP '12), DOI 10.1007/978-3-642-30045-5_3, 2012.
[Chai12]Chai，W.，He，D.，Psaras，I.，和G.Pavlou，“在以信息为中心的网络中以“少换多”，第11届国际IFIP TC 6网络会议记录（IFIP'12），DOI 10.1007/978-3-642-30045-5!3，2012年。
[Cianci12] Cianci, I. et al. "CCN - Java Opensource Kit EmulatoR for Wireless Ad Hoc Networks", Proc. of the 7th International Conference on Future Internet Technologies (CFI '12), Seoul, Korea, DOI 10.1145/2377310.2377313, September 2012.
[Cianci12]Cianci，I.等人，《无线自组织网络的CCN-Java开源工具包模拟器》，Proc。第七届未来互联网技术国际会议（CFI'12），韩国首尔，DOI 10.1145/2377310.2377313，2012年9月。
[CMT-D5.2] Beben, A., et al., "Scalability of COMET System", COMET Project Deliverable D5.2, February 2013.
[CMT-D5.2]Beben，A.等人，“COMET系统的可扩展性”，COMET项目可交付成果D5.2，2013年2月。
[CMT-D6.2] Georgiades, M., et al., "Prototype Experimentation and Demonstration", COMET Project Deliverable D6.2, February 2013.
[CMT-D6.2]Georgiades，M.等人，“原型实验和演示”，彗星项目交付成果D6.2，2013年2月。
[Dannewitz10] Dannewitz, C., Golic, J., Ohlman, B., B. Ahlgren, "Secure Naming for A Network of Information", IEEE Conference on Computer Communications Workshops (INFOCOM), San Diego, CA, DOI 10.1109/INFCOMW.2010.5466661, March 2010.
[Dannewitz10]Dannewitz，C.，Golic，J.，Ohlman，B.，B.Ahlgren，“信息网络的安全命名”，IEEE计算机通信研讨会（INFOCOM），加利福尼亚州圣地亚哥，DOI 10.1109/INFCOMW.2010.5466112010年3月。
[DETERLAB] Benzel, T., "The Science of Cyber-Security Experimentation: The DETER Project", Proceedings of the 27th Annual Computer Security Applications Conference (ACSAC '11), DOI 10.1145/2076732.2076752, December 2011.
[DETERLAB]Benzel，T.，“网络安全实验科学：Detere项目”，第27届计算机安全应用年会论文集（ACSAC'11），DOI 10.1145/2076732.2076752，2011年12月。
[Dimitropoulos09] Dimitropoulos, X., et al., "Graph annotations in modeling complex network topologies", ACM Transactions on Modeling and Computer Simulation (TOMACS), vol. 19, no. 4, DOI 10.1145/1596519.1596522, November 2009.
[Dimitropoulos09]Dimitropoulos，X.等人，“复杂网络拓扑建模中的图形注释”，ACM建模与计算机仿真交易（TOMACS），第19卷，第4期，DOI 10.1145/1596519.1596522，2009年11月。
[DONA] Koponen, T., et al., "A Data-Oriented (and Beyond) Network Architecture", Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '07), ACM, DOI 10.1145/1282380.1282402, 2007.
[DONA]Koponen，T.，等人，“面向数据（及更高层次）的网络架构”，2007年计算机通信应用、技术、架构和协议会议记录（SIGCOMM'07），ACM，DOI 10.1145/1282380.12824022007。
[EMULAB] Eide, E., et al., "An Experimentation Workbench for Replayable Networking Research", Proceedings of the 4th USENIX conference on Networked systems design & implementation (NSDI '07), 2007.
[EMULAB]Eide，E.等人，“可重复使用网络研究的实验工作台”，第四届USENIX网络系统设计与实现会议记录（NSDI'07），2007年。
[Fotiou12] Fotiou, N., et al., "Access control enforcement delegation for information-centric networking architectures", Proceedings of the second edition of the ICN workshop on Information-centric networking (ICN '12), ACM, DOI 10.1145/2342488.2342507, 2012.
[Fotiou12]Fotiou，N.，等人，“信息中心网络体系结构的访问控制执行授权”，ICN信息中心网络研讨会（ICN'12）第二版会议记录，ACM，DOI 10.1145/2342488.23425072012年。
[Fotiou14] Fotiou, N., et al., "A framework for privacy analysis of ICN architectures", Proc. Second Annual Privacy Forum (APF), Springer, DOI 10.1007/978-3-319-06749-0_8, 2014.
[Fotiou14]Fotiou，N.等人，“ICN架构隐私分析框架”，Proc。第二届年度隐私论坛（APF），美国内政部斯普林格10.1007/978-3-319-06749-02014年。
[Fri12] Fricker, C., Robert, P., Roberts, J. and N. Sbihi, "Impact of traffic mix on caching performance in a content-centric network", 2012 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Orlando, USA, DOI 10.1109/INFCOMW.2012.6193511, March 2012.
[Fri12]Fricker，C.，Robert，P.，Roberts，J.和N.Sbihi，“以内容为中心的网络中流量混合对缓存性能的影响”，2012年IEEE计算机通信研讨会（INFOCOM WksHP），美国奥兰多，DOI 10.1109/INFCOMW.2012.6193511，2012年3月。
[Goog08] Google, "Official Google Blog: We knew the web was big...", July 2008, <http://googleblog.blogspot.it/ 2008/07/we-knew-web-was-big.html>.
[Goog08]谷歌，“谷歌官方博客：我们知道网络很大……”，2008年7月<http://googleblog.blogspot.it/ 2008/07/我们知道web很大。html>。
[Guo07] Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., and X. Zhang, "A performance study of BitTorrent-like peer-to-peer systems", IEEE Journal on Selected Areas in Communication, vol. 25, no. 1, pp. 155-169, DOI 10.1109/JSAC.2007.070116, 2007.
[Guo07]郭，L.，陈，S.，肖，Z.，谭，E.，丁，X.，和X.张，“类似BitTorrent的点对点系统的性能研究”，IEEE通信选择领域杂志，第25卷，第1期，第155-169页，DOI 10.1109/JSAC.2007.0701162007。
[HASHROUT] Saino, L., Psaras, I., and G. Pavlou, "Hash-routing Schemes for Information-Centric Networking", Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking (ICN '13), DOI 10.1145/2491224.2491232, 2013.
[HASHROUT]Saino，L.，Psaras，I.，和G.Pavlou，“信息中心网络的哈希路由方案”，第三届ACM SIGCOMM信息中心网络研讨会论文集（ICN'13），DOI 10.1145/2491224.2491232，2013年。
[Hefeeda08] Hefeeda, M. and O. Saleh, "Traffic Modeling and Proportional Partial Caching for Peer-to-Peer Systems", IEEE/ACM Transactions on Networking, vol. 16, no. 6, pp. 1447-1460, DOI 10.1109/TNET.2008.918081, 2008.
[Hefeeda08]Hefeeda，M.和O.Saleh，“对等系统的流量建模和比例部分缓存”，IEEE/ACM网络事务，第16卷，第6期，1447-1460页，DOI 10.1109/TNET.2008.9180812008。
[ICARUS] Saino, L., Psaras, I., and G. Pavlou, "Icarus: a Caching Simulator for Information Centric Networking (ICN)", Proceedings of the 7th International ICST Conference on Simulation Tools and Techniques (SimuTools '14), DOI 10.4108/icst.simutools.2014.254630, 2014.
[ICARUS]Saino，L.，Psaras，I.，和G.Pavlou，“ICARUS：信息中心网络（ICN）的缓存模拟器”，第七届国际ICST模拟工具和技术会议论文集（SimuTools'14），DOI 10.4108/ICST.SimuTools.2014.2546302014。
[Detti12] Detti, A., et al., "Supporting the Web with an Information Centric Network that Routes by Name", Elsevier Computer Networks, vol. 56, no. 17, DOI 10.1016/j.comnet.2012.08.006, November 2012.
[Detti12]Detti，A.等人，“通过以名称为路由的以信息为中心的网络支持网络”，爱思唯尔计算机网络，第56卷，第17期，DOI 10.1016/j.comnet.2012.08.006，2012年11月。
[ICNSIMS] Tortelli, M., et al., "CCN Simulators: Analysis and Cross-Comparison", Proceedings of the 1st international conference on Information-centric networking (ICN '14), ACM, DOI 10.1145/2660129.2660133, 2014.
[ICNSIMS]Tortelli，M.等人，“CCN模拟器：分析和交叉比较”，第一届信息中心网络国际会议记录（ICN'14），ACM，DOI 10.1145/2660129.26601332014。
[IMB2014] Imbrenda, C., Muscariello, L., and D. Rossi, "Analyzing Cacheable Traffic in ISP Access Networks for Micro CDN Applications via Content-Centric Networking", Proceedings of the 1st international conference on Information-centric networking (ICN '14), DOI 10.1145/2660129.2660146, 2014.
[IMB2014]Imbrenda，C.，Muscariello，L.，和D.Rossi，“通过以内容为中心的网络为微型CDN应用分析ISP接入网络中的可缓存流量”，第一届以信息为中心的网络国际会议记录（ICN'14），DOI 10.1145/2660129.2660146，2014年。
[Ion13] Ion, M., Zhang, J., and E. Schooler, "Toward content-centric privacy in ICN: attribute-based encryption and routing", Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM (SIGCOMM '13), ACM, DOI 10.1145/2486001.2491717, 2013.
[Ion13]Ion，M.，Zhang，J.，和E.Schooler，“ICN中以内容为中心的隐私：基于属性的加密和路由”，ACM SIGCOMM 2013年SIGCOMM会议记录（SIGCOMM'13），ACM，DOI 10.1145/248601.2491717，2013年。
[Jacobson09] Jacobson, V., et al., "Networking Named Content", Proceedings of the 5th international conference on Emerging networking experiments and technologies (CoNEXT '09), DOI 10.1145/1658939.1658941, 2009.
[Jacobson09]Jacobson，V.等人，“网络命名内容”，第五届新兴网络实验和技术国际会议记录（CoNEXT'09），DOI 10.1145/1658939.16589411909。
[Katsaros12] Katsaros, K., Xylomenos, G., and G. Polyzos, "GlobeTraff: a traffic workload generator for the performance evaluation of future Internet architectures", 2012 5th International Conference on New Technologies, Mobility and Security (NTMS), DOI 10.1109/NTMS.2012.6208742, 2012.
[Katsaros12]Katsaros，K.，Xylomenos，G.，和G.Polyzos，“GlobeTraff：用于未来互联网架构性能评估的流量工作量生成器”，2012年第五届新技术、移动性和安全（NTMS）国际会议，DOI 10.1109/NTMS.2012.6208742，2012年。
[Katsaros15] Katsaros, K., et al., "On the Inter-domain Scalability of Route-by-Name Information-Centric Network Architectures", Proc. IFIP Networking Conference, DOI 10.1109/IFIPNetworking.2015.7145308, 2015.
[Katsaros15]Katsaros，K.，等人，“按名称路由信息中心网络架构的域间可扩展性”，Proc。IFIP网络会议，DOI 10.1109/IFIPNetworking.2015.7145308，2015。
[Kaune09] Kaune, S. et al., "Modelling the Internet Delay Space Based on Geographical Locations", 17th Euromicro International Conference on Parallel, Distributed and Network-based Processing, Weimar, Germany, DOI 10.1109/PDP.2009.44, 2009.
[Kaune09]Kaune，S.等人，“基于地理位置的互联网延迟空间建模”，第17届欧洲微并行、分布式和基于网络的处理国际会议，德国魏玛，DOI 10.1109/PDP.2009.442009。
[Labovitz10] Labovitz, C., Iekel-Johnson, S., McPherson, D., Oberheide, J., and F. Jahanian, "Internet inter-domain traffic", In Proceedings of the ACM SIGCOMM 2010 conference (SIGCOMM DOI 10.1145/1851182.1851194, 2010.
[Labovitz10]Labovitz，C.，Iekel Johnson，S.，McPherson，D.，Oberheide，J.，和F.Jahanian，“互联网域间流量”，载于ACM SIGCOMM 2010年会议记录（SIGCOMM DOI 10.1145/1851182.18511942010）。
[Lauinger10] Lauinger, T., "Security and Scalability of Content-Centric Networking", Masters Thesis, Technische Universitaet Darmstadt and Eurecom, September 2010.
[Lauinger10]Lauinger，T.，“以内容为中心的网络的安全性和可扩展性”，硕士论文，达姆施塔特技术大学和Eurecom，2010年9月。
[Lauinger12] Lauinger, Y., et al, "Privacy Risks in Named Data Networking: What is the Cost of Performance?", ACM SIGCOMM Computer Communication Review, Vol. 42, Issue 5, DOI 10.1145/2378956.2378966, 2012.
[Lauinger12]Lauinger，Y.等人，“命名数据网络中的隐私风险：性能成本是多少？”，ACM SIGCOMM计算机通信评论，第42卷，第5期，DOI 10.1145/2378956.23789662012。
[Led12] Lederer, S., Muller, C., and C. Timmerer, "Dynamic adaptive streaming over HTTP dataset", Proceedings of the ACM Multimedia Systems Conference (MMSys '12), pp. 89-94, DOI 10.1145/2155555.2155570, 2012.
[Led12]Lederer，S.，Muller，C.，和C.Timmer，“HTTP数据集上的动态自适应流”，ACM多媒体系统会议记录（MMSys'12），第89-94页，DOI 10.1145/2155555.21555702012年。
[Lewko11] Lewko, A. and B. Waters, "Decentralizing attribute-based encryption", Proc. of EUROCRYPT 2011, Lecture Notes in Computer Science (LNCS), vol. 6632, pp. 568-588, DOI 10.1007/978-3-642-20465-4_31, 2011.
[Lewko11]Lewko，A.和B.Waters，“分散基于属性的加密”，Proc。《计算机科学（LNCS）课堂讲稿》，第6632卷，第568-588页，DOI 10.1007/978-3-642-20465-431，2011年。
[LIRA] Psaras, I., Katsaros, K., Saino, L., and G. Pavlou, "Lira: A location independent routing layer based on source-provided ephemeral names", Electronic and Electrical Eng. Dept., UCL, London, UK, Tech. Rep. 2014, <http://www.ee.ucl.ac.uk/comit-project/publications.html>.
[LIRA]Psaras，I.，Katsaros，K.，Saino，L.，和G.Pavlou，“LIRA：基于源提供的临时名称的位置独立路由层”，电子电气工程部，伦敦大学学院，英国，技术代表2014<http://www.ee.ucl.ac.uk/comit-project/publications.html>.
[Mahanti00] Mahanti, A., Williamson, C., and D. Eager., "Traffic analysis of a web proxy caching hierarchy", IEEE Network, Vol. 14, No. 3, pp. 16-23, DOI 10.1109/65.844496, May/June 2000.
[Mahanti 00]Mahanti，A.，Williamson，C.，和D.Eager.，“网络代理缓存层次结构的流量分析”，IEEE网络，第14卷，第3期，第16-23页，DOI 10.1109/65.844496，2000年5月/6月。
[Maier09] Maier, G., Feldmann, A., Paxson, V., and M. Allman, "On dominant characteristics of residential broadband internet traffic", In Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference (IMC '09), New York, NY, USA, 90-102. DOI 10.1145/1644893.1644904, 2009.
[Maier09]Maier，G.，Feldmann，A.，Paxson，V.，和M.Allman，“住宅宽带互联网流量的主要特征”，摘自第九届ACM SIGCOMM互联网测量会议记录（IMC'09），美国纽约，90-102。内政部10.1145/1644893.16449042009。
[Marciniak08] Marciniak, P., Liogkas, N., Legout, A., and E. Kohler, "Small is not always beautiful", In Proc. of IPTPS, International Workshop of Peer-to-Peer Systems, Tampa Bay, Florida (FL), USA, February 2008.
[Marciniak08]Marciniak，P.，Liogkas，N.，Legout，A.，和E.Kohler，“小并不总是美丽的”，在Proc。IPTPS，点对点系统国际研讨会，佛罗里达州坦帕湾（佛罗里达州），美国，2008年2月。
[MiniCCNx] Cabral, C., et al., "High fidelity content-centric experiments with Mini-CCNx", 2014 IEEE Symposium on Computers and Communications (ISCC), DOI 10.1109/ISCC.2014.6912537, 2014.
[MiniCCNx]卡布拉尔，C.等，“MiniCCNx的高保真以内容为中心的实验”，2014年IEEE计算机与通信研讨会（ISCC），DOI 10.1109/ISCC.2014.6912537，2014年。
[Montage] Hussain, A. and J. Chen, "Montage Topology Manager: Tools for Constructing and Sharing Representative Internet Topologies", DETER Technical Report, ISI-TR-684, August 2012.
[蒙太奇]Hussain，A.和J.Chen，“蒙太奇拓扑管理器：构建和共享代表性互联网拓扑的工具”，DERE技术报告，ISI-TR-6842012年8月。
[Muscariello11] Muscariello, L., Carofiglio, G., and M. Gallo, "Bandwidth and storage sharing performance in information centric networking", Proceedings of the ACM SIGCOMM workshop on Information-centric networking (ICN '11), DOI 10.1145/2018584.2018593, 2011.
[Muscariello 11]Muscariello，L.，Carofiglio，G.，和M.Gallo，“信息中心网络中的带宽和存储共享性能”，ACM SIGCOMM信息中心网络研讨会论文集（ICN'11），DOI 10.1145/2018584.20185932011。
[ndnSIM] Afanasyev, A., et al., "ndnSIM: NDN simulator for NS-3", NDN Technical Report NDN-0005, Revision 2, October 2012.
[ndnSIM]Afanasyev，A.等人，“ndnSIM:NS-3的NDN模拟器”，NDN技术报告NDN-0005，第2版，2012年10月。
[ndnSIM2] Mastorakis, S., et al., "ndnSIM 2.0: A new version of the NDN simulator for NS-3", NDN Technical Report NDN-0028, Revision 1, January 2015.
[ndnSIM2]Mastorakis，S.等人，“ndnSIM 2.0：用于NS-3的NDN模拟器的新版本”，NDN技术报告NDN-0028，第1版，2015年1月。
[NEPI] Quereilhac, A., et al., "NEPI: An integration framework for Network Experimentation", 2011 19th International Conference on Software, Telecommunications and Computer Networks (SoftCOM), IEEE, 2011.
[NEPI]Quereilhac，A.等人，“NEPI：网络实验的集成框架”，2011年第19届软件、电信和计算机网络国际会议（SoftCOM），IEEE，2011年。
[OFELIA] Sune, M., et al., "Design and implementation of the OFELIA FP7 facility: The European OpenFlow testbed", Computer Networks, vol. 61, pp. 132-150, DOI 10.1016/j.bjp.2013.10.015, March 2014.
[OFELIA]Sune，M.等人，“OFELIA FP7设施的设计和实施：欧洲OpenFlow试验台”，计算机网络，第61卷，第132-150页，DOI 10.1016/j.bjp.2013.10.015，2014年3月。
[ONL] DeHart, J., et al., "The open network laboratory: a resource for networking research and education", ACM SIGCOMM Computer Communication Review (CCR), vol. 35, no. 5, pp. 75-78, DOI 10.1145/1096536.1096547, 2005.
[ONL]DeHart，J.等人，“开放网络实验室：网络研究和教育资源”，ACM SIGCOMM计算机通信评论（CCR），第35卷，第5期，第75-78页，DOI 10.1145/1096536.1096547，2005年。
[Parisis13] Parisis, G., Trossen, D., and H. Asaeda, "A Node Design and a Framework for Development and Experimentation for an Information-Centric Network", IEICE Transactions on Communications, vol. E96-B, no. 7, pp. 1650-1660, July 2013.
[Parisis13]Parisis，G.，Trossen，D.，和H.Asaeda，“以信息为中心的网络开发和实验的节点设计和框架”，IEICE通信交易，第E96-B卷，第7期，第1650-1660页，2013年7月。
[Perino11] Perino, D. and M. Varvello, "A Reality Check for Content Centric Networking", Proceedings of the ACM SIGCOMM workshop on Information-centric networking (ICN '11), DOI 10.1145/2018584.2018596, 2011.
[Perino11]Perino，D.和M.Varvello，“以内容为中心的网络的现实检查”，ACM SIGCOMM信息中心网络研讨会论文集（ICN'11），DOI 10.1145/2018584.20185962011。
[PLANETLAB] Chun, B., et al., "Planetlab: an overlay testbed for broad-coverage services", ACM SIGCOMM Computer Communication Review (CCR), vol. 33, no. 3, pp. 3-12, DOI 10.1145/956993.956995, 2003.
[PLANETLAB]Chun，B.，等人，“PLANETLAB：广泛覆盖服务的覆盖测试平台”，ACM SIGCOMM计算机通信评论（CCR），第33卷，第3期，第3-12页，DOI 10.1145/956993.9569952003。
[PRST4.5] Riihijarvi, J., et al., "Final Architecture Validation and Performance Evaluation Report", PURSUIT Project Deliverable D4.5, January 2013.
[PRST4.5]Riihijarvi，J.等，“最终架构验证和性能评估报告”，追求项目交付成果D4.5，2013年1月。
[Psaras11] Psaras, I., Clegg, R., Landa, R., Chai, W., Pavlou, G., "Modelling and Evaluation of CCN-Caching Trees", Proceedings of the 10th international IFIP TC 6 conference on Networking, Valencia, Spain, May 2011.
[Psaras11]Psaras，I.，Clegg，R.，Landa，R.，Chai，W.，Pavlou，G.，“CCN缓存树的建模和评估”，第十届国际IFIP TC 6网络会议记录，西班牙巴伦西亚，2011年5月。
[Psaras12] Psaras, I., Chai, W., and G. Pavlou, "Probabilistic In-Network Caching for Information-Centric Networks", Proceedings of the second edition of the ICN workshop on Information-centric networking (ICN '12), DOI 10.1145/2342488.2342501, 2012.
[Psaras12]Psaras，I.，Chai，W.和G.Pavlou，“以信息为中心的网络的网络缓存中的概率”，ICN信息为中心的网络研讨会（ICN'12）第二版会议记录，DOI 10.1145/2342488.2342501201。
[Quereilhac14] Quereilhac, A., et al., "Demonstrating a unified ICN development and evaluation framework", Proceedings of the 1st international conference on Information-centric networking (ICN '14), ACM, DOI 10.1145/2660129.2660132, 2014.
[Quereilhac14]Quereilhac，A.等人，“展示统一的ICN开发和评估框架”，第一届信息中心网络国际会议记录（ICN'14），ACM，DOI 10.1145/2660129.26601322014。
[Renault09] Renault, E., Ahmad, A., and M. Abid, "Toward a Security Model for the Future Network of Information", Proceedings of the 4th International Conference on Ubiquitous Information Technologies & Applications (ICUT '09), IEEE, DOI 10.1109/ICUT.2009.5405676, 2009.
[Renault09]雷诺，E.，艾哈迈德，A.，和M.阿比德，“走向未来信息网络的安全模型”，第四届普适信息技术与应用国际会议论文集（ICUT'09），IEEE，DOI 10.1109/ICUT.2009.54056762009。
[RFC2330] Paxson, V., Almes, G., Mahdavi, J., and M. Mathis, "Framework for IP Performance Metrics", RFC 2330, DOI 10.17487/RFC2330, May 1998, <http://www.rfc-editor.org/info/rfc2330>.
[RFC2330]Paxson，V.，Almes，G.，Mahdavi，J.，和M.Mathis，“IP性能度量框架”，RFC 2330，DOI 10.17487/RFC2330，1998年5月<http://www.rfc-editor.org/info/rfc2330>.
[RFC5743] Falk, A., "Definition of an Internet Research Task Force (IRTF) Document Stream", RFC 5743, DOI 10.17487/RFC5743, December 2009, <http://www.rfc-editor.org/info/rfc5743>.
[RFC5743]Falk，A.“互联网研究工作队（IRTF）文件流的定义”，RFC 5743，DOI 10.17487/RFC5743，2009年12月<http://www.rfc-editor.org/info/rfc5743>.
[RFC6920] Farrell, S., Kutscher, D., Dannewitz, C., Ohlman, B., Keranen, A., and P. Hallam-Baker, "Naming Things with Hashes", RFC 6920, DOI 10.17487/RFC6920, April 2013, <http://www.rfc-editor.org/info/rfc6920>.
[RFC6920]Farrell，S.，Kutscher，D.，Dannewitz，C.，Ohlman，B.，Keranen，A.，和P.Hallam Baker，“用哈希命名事物”，RFC 6920，DOI 10.17487/RFC692012013年4月<http://www.rfc-editor.org/info/rfc6920>.
[RFC7476] Pentikousis, K., Ed., Ohlman, B., Corujo, D., Boggia, G., Tyson, G., Davies, E., Molinaro, A., and S. Eum, "Information-Centric Networking: Baseline Scenarios", RFC 7476, DOI 10.17487/RFC7476, March 2015, <http://www.rfc-editor.org/info/rfc7476>.
[RFC7476]Pentikousis，K.，Ed.，Ohlman，B.，Corujo，D.，Boggia，G.，Tyson，G.，Davies，E.，Molinaro，A.，和S.Eum，“以信息为中心的网络：基线场景”，RFC 7476，DOI 10.17487/RFC7476，2015年3月<http://www.rfc-editor.org/info/rfc7476>.
[RFC7927] Kutscher, D., Ed., Eum, S., Pentikousis, K., Psaras, I., Corujo, D., Saucez, D., Schmidt, T., and M. Waehlisch, "Information-Centric Networking (ICN) Research Challenges", RFC 7927, DOI 10.17487/RFC7927, July 2016, <http://www.rfc-editor.org/info/rfc7927>.
[RFC7927]Kutscher，D.，Ed.，Eum，S.，Pentikousis，K.，Psaras，I.，Corujo，D.，Saucez，D.，Schmidt，T.，和M.Waehlisch，“信息中心网络（ICN）研究挑战”，RFC 7927，DOI 10.17487/RFC7927，2016年7月<http://www.rfc-editor.org/info/rfc7927>.
[RFC7933] Westphal, C., Ed., Lederer, S., Posch, D., Timmerer, C., Azgin, A., Liu, W., Mueller, C., Detti, A., Corujo, D., Wang, J., Montpetit, M., and N. Murray, "Adaptive Video Streaming over Information-Centric Networking (ICN)", RFC 7933, DOI 10.17487/RFC7933, August 2016, <http://www.rfc-editor.org/info/rfc7933>.
[RFC7933]威斯特伐尔，C.，Ed.，莱德尔，S.，波什，D.，蒂默尔，C.，阿兹金，A.，刘，W.，穆勒，C.，德蒂，A.，科鲁乔，D.，王，J.，蒙佩蒂特，M.，和N.穆雷，“信息中心网络上的自适应视频流”（ICN）”，RFC 7933，DOI 10.17487/RFC7933，2016年8月<http://www.rfc-editor.org/info/rfc7933>.
[SAIL-B2] SAIL, "NetInf Content Delivery and Operations", SAIL Project Deliverable D-B.2, May 2012.
[SAIL-B2]SAIL，“NetInf内容交付和运营”，SAIL项目交付成果D-B.2，2012年5月。
[SAIL-B3] Kutscher, D., Ed., et al., "Final NetInf Architecture", SAIL Project Deliverable D-B.3, January 2013, <http://www.sail-project.eu/deliverables/>.
[SAIL-B3]Kutscher，D.，Ed.，et al.，“最终NetInf架构”，SAIL项目交付成果D-B.3，2013年1月<http://www.sail-project.eu/deliverables/>.
[Saino13] Saino, L., Cocora, C., and G. Pavlou, "A Toolchain for Simplifying Network Simulation Setup", Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques (SimuTools '13), 2013.
[Saino13]Saino，L.，Cocora，C.，和G.Pavlou，“简化网络模拟设置的工具链”，第六届国际ICST模拟工具和技术会议记录（SimuTools'13），2013年。
[Saleh06] Saleh, O., and M. Hefeeda, "Modeling and caching of peer-to-peer traffic", Proceedings of the 2006 IEEE International Conference on Network Protocols (ICNP), DOI 10.1109/ICNP.2006.320218, 2006.
[Saleh06]Saleh，O.和M.Hefeeda，“对等流量的建模和缓存”，2006年IEEE网络协议国际会议记录（ICNP），DOI 10.1109/ICNP.2006.320218，2006年。
[Salsano12] Salsano, S., et al., "Transport-Layer Issues in Information Centric Networks", Proceedings of the second edition of the ICN workshop on Information-centric networking (ICN '12), ACM, DOI 10.1145/2342488.2342493, 2012.
[Salsano 12]Salsano，S.等人，“信息中心网络中的传输层问题”，ICN信息中心网络研讨会（ICN'12）第二版会议记录，ACM，DOI 10.1145/2342488.2342493，2012年。
[Salsano13] Salsano, S., et al., "Information Centric Networking over SDN and OpenFlow: Architectural Aspects and Experiments on the OFELIA Testbed", Computer Networks, vol. 57, no. 16, pp. 3207-3221, DOI 10.1016/j.comnet.2013.07.031, November 2013.
[Salsano 13]Salsano，S.等人，“SDN和OpenFlow上的以信息为中心的网络：OFELIA试验台上的架构方面和实验”，计算机网络，第57卷，第16期，3207-3221页，DOI 10.1016/j.comnet.2013.07.0311913年11月。
[SensReqs] Karnouskos, S., et al., "Requirement considerations for ubiquitous integration of cooperating objects", 2011 4th IFIP International Conference on New Technologies, Mobility and Security (NTMS), DOI 10.1109/NTMS.2011.5720605, 2011.
[SensReqs]Karnouskos，S.等人，“合作对象普遍集成的需求考虑”，2011年第四届IFIP国际新技术、移动性和安全会议（NTMS），DOI 10.1109/NTMS.2011.57206052011。
[Smetters09] Smetters, D., and V. Jacobson, "Securing network content", Technical Report TR-2009-01, PARC, 2009.
[Smetters09]Smetters，D.和V.Jacobson，“保护网络内容”，技术报告TR-2009-01，PARC，2009年。
[Sourlas15] Sourlas, V., Tassiulas, L., Psaras, I., and G. Pavlou, "Information Resilience through User-Assisted Caching in Disruptive Content-Centric Networks", 14th IFIP Networking Conference, Toulouse, France, DOI 10.1109/IFIPNetworking.2015.7145301, May 2015.
[Sourlas15]Sourlas，V.，Tassiulas，L.，Psaras，I.，和G.Pavlou，“破坏性内容中心网络中通过用户辅助缓存实现的信息弹性”，第14届IFIP网络会议，法国图卢兹，DOI 10.1109/IFIPNetworking.2015.7145301，2015年5月。
[Tagger12] Tagger, B., et al., "Update on the Architecture and Report on Security Analysis", Deliverable 2.4, PURSUIT EU FP7 project, April 2012.
[Tagger12]Tagger，B.，等人，“架构更新和安全分析报告”，可交付成果2.4，欧盟FP7项目，2012年4月。
[Tourani16] Tourani, R., Mick, T., Misra, S., and G. Panwar, "Security, Privacy, and Access Control in Information-Centric Networking: A Survey", arXiv:1603.03409, March 2016.
[Tourani16]Tourani，R.，Mick，T.，Misra，S.，和G.Panwar，“信息中心网络中的安全、隐私和访问控制：调查”，arXiv:1603.03409，2016年3月。
[VoCCN] Jacobson, V., et al., "VoCCN: Voice-over Content-Centric Networks", Proceedings of the 2009 workshop on Re-architecting the internet (ReArch '09), DOI 10.1145/1658978.1658980, 2009.
[VoCCN]Jacobson，V.等人，“VoCCN：以内容为中心的网络语音”，2009年互联网重新架构研讨会论文集（研究报告'09），DOI 10.1145/1658978.1658980，2009年。
[Watts98] Watts, D. J. and S. H. Strogatz, "Collective dynamics of 'small-world' networks", Nature, vol. 393, no. 6684, pp. 440-442, DOI 10.1038/30918, April 1998.
[Watts98]Watts，D.J.和S.H.Strogatz，“小世界网络的集体动力学”，《自然》，第393卷，第6684号，第440-442页，DOI 10.1038/30918，1998年4月。
[Yu06] Yu, H., Zheng, D., Zhao, B., and W. Zheng, "Understanding user behavior in large-scale video-on-demand systems", ACM SIGOPS Operating Systems Review - Proceedings of the 2006 EuroSys conference, Vol. 40, Issue 4, pp. 333-344, DOI 10.1145/1218063.1217968, April 2006.
[Yu06]Yu，H.，Zheng，D.，Zhao，B.，和W.Zheng，“理解大规模视频点播系统中的用户行为”，ACM SIGOPS操作系统评论-2006年EuroSys会议记录，第40卷，第4期，333-344页，DOI 10.1145/1218063.1217968，2006年4月。
[Zhang10a] Zhang, C., Dhungel, P., Wu, D., and K. Ross, "Unraveling the BitTorrent Ecosystem", IEEE Transactions on Parallel and Distributed Systems, vol. 22, issue 7, pp. 1164-1177, DOI 10.1109/TPDS.2010.123, 2010.
[Zhang10a]Zhang，C.，Dhungel，P.，Wu，D.，和K.Ross，“破解BitTorrent生态系统”，IEEE并行和分布式系统交易，第22卷，第7期，第1164-1177页，DOI 10.1109/TPDS.2010.123，2010年。
[Zhang10b] Zhang, L., et al., "Named Data Networking (NDN) Project", NDN Technical Report NDN-0001, October 2010, <http://named-data.net/publications/techreports/>.
[Zhang10b]Zhang，L.等人，“命名数据网络（NDN）项目”，NDN技术报告NDN-0001，2010年10月<http://named-data.net/publications/techreports/>.
[Zhou11] Zhou, J., Li, Y., Adhikari, K., and Z.-L. Zhang, "Counting YouTube videos via random prefix sampling", Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference (IMC '11), Berlin, Germany, DOI 10.1145/2068816.2068851, November 2011.
[Zhou11]Zhou，J.，Li，Y.，Adhikari，K.，和Z.-L.Zhang，“通过随机前缀抽样计算YouTube视频”，2011年ACM SIGCOMM互联网测量会议记录（IMC'11），德国柏林，DOI 10.1145/2068816.2068851，2011年11月。
Acknowledgments
致谢
Konstantinos Katsaros contributed the updated text of Section 2.2 along with an extensive set of references.
Konstantinos Katsaros提供了第2.2节的更新文本以及大量参考资料。
Priya Mahadevan, Daniel Corujo, and Gareth Tyson contributed to a draft version of this document.
Priya Mahadevan、Daniel Corujo和Gareth Tyson参与了本文件的草稿。
This document has benefited from reviews, pointers to the growing ICN literature, suggestions, comments, and proposed text provided by the following members of the IRTF Information-Centric Networking Research Group (ICNRG), listed in alphabetical order: Marica Amadeo, Hitoshi Asaeda, E. Baccelli, Claudia Campolo, Christian Esteve Rothenberg, Suyong Eum, Nikos Fotiou, Dorothy Gellert, Luigi Alfredo Grieco, Myeong-Wuk Jang, Ren Jing, Will Liu, Antonella Molinaro, Luca Muscariello, Ioannis Psaras, Dario Rossi, Stefano Salsano, Damien Saucez, Dirk Trossen, Jianping Wang, Yuanzhe Xuan, and Xinwen Zhang.
本文件得益于IRTF信息中心网络研究小组（ICNRG）以下成员提供的评论、指向不断增长的ICN文献的指针、建议、评论和建议文本，这些成员按字母顺序排列：Marica Amadeo、Hitoshi Asaeda、E.Baccelli、Claudia Campolo、Christian Esteve Rothenberg、，苏雍·欧姆、尼科斯·福蒂欧、多萝西·盖勒特、路易吉·阿尔弗雷多·格里科、张明武、任静、刘威尔、安东内拉·莫利纳罗、卢卡·马斯卡里埃罗、伊奥尼斯·诗篇、达里奥·罗西、斯蒂法诺·萨尔萨诺、达米恩·索切斯、德克·特罗森、王建平、袁哲轩和张新文。
The IRSG review was provided by Aaron Falk.
IRSG审查由Aaron Falk提供。
Authors' Addresses
作者地址
Kostas Pentikousis (editor) Travelping Koernerstr. 7-10 10785 Berlin Germany
Kostas Pentikousis（编辑）Travelping Koernerstr。7-10 10785德国柏林
Email: k.pentikousis@travelping.com
Email: k.pentikousis@travelping.com
Borje Ohlman Ericsson Research S-16480 Stockholm Sweden
Borje Ohlman Ericsson Research S-16480瑞典斯德哥尔摩
Email: Borje.Ohlman@ericsson.com
Email: Borje.Ohlman@ericsson.com
Elwyn Davies Trinity College Dublin/Folly Consulting Ltd Dublin, 2 Ireland
都柏林艾尔温·戴维斯三一学院/富利咨询有限公司都柏林，2爱尔兰
Email: davieseb@scss.tcd.ie
Email: davieseb@scss.tcd.ie
Spiros Spirou Intracom Telecom 19.7 km Markopoulou Avenue 19002 Peania, Athens Greece
Spiros Spirou Inracom Telecom 19.7公里Markopoulou大道19002号希腊雅典Peania
Email: spis@intracom-telecom.com
Email: spis@intracom-telecom.com
Gennaro Boggia Dept. of Electrical and Information Engineering Politecnico di Bari Via Orabona 4 70125 Bari Italy
Gennaro Boggia电气和信息工程部，意大利巴里理工大学，经Orabona 4 70125巴里
Email: g.boggia@poliba.it
Email: g.boggia@poliba.it