Internet Engineering Task Force (IETF) M. Mathis
Request for Comments: 8337 Google, Inc
Category: Experimental A. Morton
ISSN: 2070-1721 AT&T Labs
March 2018
Internet Engineering Task Force (IETF) M. Mathis
Request for Comments: 8337 Google, Inc
Category: Experimental A. Morton
ISSN: 2070-1721 AT&T Labs
March 2018
Model-Based Metrics for Bulk Transport Capacity
基于模型的散装运输能力度量
Abstract
摘要
This document introduces a new class of Model-Based Metrics designed to assess if a complete Internet path can be expected to meet a predefined Target Transport Performance by applying a suite of IP diagnostic tests to successive subpaths. The subpath-at-a-time tests can be robustly applied to critical infrastructure, such as network interconnections or even individual devices, to accurately detect if any part of the infrastructure will prevent paths traversing it from meeting the Target Transport Performance.
本文档介绍了一类新的基于模型的指标，旨在通过对连续子路径应用一套IP诊断测试，评估完整的Internet路径是否能够满足预定义的目标传输性能。每次子路径测试可以稳健地应用于关键基础设施，例如网络互连或甚至单个设备，以准确检测基础设施的任何部分是否会阻止通过它的路径达到目标传输性能。
Model-Based Metrics rely on mathematical models to specify a Targeted IP Diagnostic Suite, a set of IP diagnostic tests designed to assess whether common transport protocols can be expected to meet a predetermined Target Transport Performance over an Internet path.
基于模型的度量依赖于数学模型来指定目标IP诊断套件，这是一组IP诊断测试，旨在评估公共传输协议是否能够在Internet路径上达到预定的目标传输性能。
For Bulk Transport Capacity, the IP diagnostics are built using test streams and statistical criteria for evaluating the packet transfer that mimic TCP over the complete path. The temporal structure of the test stream (e.g., bursts) mimics TCP or other transport protocols carrying bulk data over a long path. However, they are constructed to be independent of the details of the subpath under test, end systems, or applications. Likewise, the success criteria evaluates the packet transfer statistics of the subpath against criteria determined by protocol performance models applied to the Target Transport Performance of the complete path. The success criteria also does not depend on the details of the subpath, end systems, or applications.
对于批量传输容量，IP诊断是使用测试流和统计标准构建的，用于评估在完整路径上模拟TCP的数据包传输。测试流的时间结构（例如，突发）模仿TCP或其他传输协议，在长路径上传输大量数据。然而，它们被构造成独立于被测子路径、终端系统或应用程序的细节。同样，成功标准根据应用于完整路径的目标传输性能的协议性能模型确定的标准来评估子路径的分组传输统计信息。成功标准也不取决于子路径、终端系统或应用程序的详细信息。
Status of This Memo
关于下段备忘
This document is not an Internet Standards Track specification; it is published for examination, experimental implementation, and evaluation.
本文件不是互联网标准跟踪规范；它是为检查、实验实施和评估而发布的。
This document defines an Experimental Protocol for the Internet community. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Not all documents approved by the IESG are candidates for any level of Internet Standard; see Section 2 of RFC 7841.
本文档为互联网社区定义了一个实验协议。本文件是互联网工程任务组（IETF）的产品。它代表了IETF社区的共识。它已经接受了公众审查，并已被互联网工程指导小组（IESG）批准出版。并非IESG批准的所有文件都适用于任何级别的互联网标准；见RFC 7841第2节。
Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at https://www.rfc-editor.org/info/rfc8337.
有关本文件当前状态、任何勘误表以及如何提供反馈的信息，请访问https://www.rfc-editor.org/info/rfc8337.
Copyright Notice
版权公告
Copyright (c) 2018 IETF Trust and the persons identified as the document authors. All rights reserved.
版权所有（c）2018 IETF信托基金和确定为文件作者的人员。版权所有。
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://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. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License.
本文件受BCP 78和IETF信托有关IETF文件的法律规定的约束(https://trustee.ietf.org/license-info)自本文件出版之日起生效。请仔细阅读这些文件，因为它们描述了您对本文件的权利和限制。从本文件中提取的代码组件必须包括信托法律条款第4.e节中所述的简化BSD许可证文本，并提供简化BSD许可证中所述的无担保。
Table of Contents
目录
1. Introduction ....................................................4
2. Overview ........................................................5
3. Terminology .....................................................8
3.1. General Terminology ........................................8
3.2. Terminology about Paths ...................................10
3.3. Properties ................................................11
3.4. Basic Parameters ..........................................12
3.5. Ancillary Parameters ......................................13
3.6. Temporal Patterns for Test Streams ........................14
3.7. Tests .....................................................15
4. Background .....................................................16
4.1. TCP Properties ............................................18
4.2. Diagnostic Approach .......................................20
4.3. New Requirements Relative to RFC 2330 .....................21
5. Common Models and Parameters ...................................22
5.1. Target End-to-End Parameters ..............................22
5.2. Common Model Calculations .................................22
5.3. Parameter Derating ........................................23
5.4. Test Preconditions ........................................24
6. Generating Test Streams ........................................24
6.1. Mimicking Slowstart .......................................25
6.2. Constant Window Pseudo CBR ................................27
6.3. Scanned Window Pseudo CBR .................................28
6.4. Concurrent or Channelized Testing .........................28
7. Interpreting the Results .......................................29
7.1. Test Outcomes .............................................29
7.2. Statistical Criteria for Estimating run_length ............31
7.3. Reordering Tolerance ......................................33
8. IP Diagnostic Tests ............................................34
8.1. Basic Data Rate and Packet Transfer Tests .................34
8.1.1. Delivery Statistics at Paced Full Data Rate ........35
8.1.2. Delivery Statistics at Full Data Windowed Rate .....35
8.1.3. Background Packet Transfer Statistics Tests ........35
8.2. Standing Queue Tests ......................................36
8.2.1. Congestion Avoidance ...............................37
8.2.2. Bufferbloat ........................................37
8.2.3. Non-excessive Loss .................................38
8.2.4. Duplex Self-Interference ...........................38
8.3. Slowstart Tests ...........................................39
8.3.1. Full Window Slowstart Test .........................39
8.3.2. Slowstart AQM Test .................................39
8.4. Sender Rate Burst Tests ...................................40
8.5. Combined and Implicit Tests ...............................41
8.5.1. Sustained Full-Rate Bursts Test ....................41
8.5.2. Passive Measurements ...............................42
1. Introduction ....................................................4
2. Overview ........................................................5
3. Terminology .....................................................8
3.1. General Terminology ........................................8
3.2. Terminology about Paths ...................................10
3.3. Properties ................................................11
3.4. Basic Parameters ..........................................12
3.5. Ancillary Parameters ......................................13
3.6. Temporal Patterns for Test Streams ........................14
3.7. Tests .....................................................15
4. Background .....................................................16
4.1. TCP Properties ............................................18
4.2. Diagnostic Approach .......................................20
4.3. New Requirements Relative to RFC 2330 .....................21
5. Common Models and Parameters ...................................22
5.1. Target End-to-End Parameters ..............................22
5.2. Common Model Calculations .................................22
5.3. Parameter Derating ........................................23
5.4. Test Preconditions ........................................24
6. Generating Test Streams ........................................24
6.1. Mimicking Slowstart .......................................25
6.2. Constant Window Pseudo CBR ................................27
6.3. Scanned Window Pseudo CBR .................................28
6.4. Concurrent or Channelized Testing .........................28
7. Interpreting the Results .......................................29
7.1. Test Outcomes .............................................29
7.2. Statistical Criteria for Estimating run_length ............31
7.3. Reordering Tolerance ......................................33
8. IP Diagnostic Tests ............................................34
8.1. Basic Data Rate and Packet Transfer Tests .................34
8.1.1. Delivery Statistics at Paced Full Data Rate ........35
8.1.2. Delivery Statistics at Full Data Windowed Rate .....35
8.1.3. Background Packet Transfer Statistics Tests ........35
8.2. Standing Queue Tests ......................................36
8.2.1. Congestion Avoidance ...............................37
8.2.2. Bufferbloat ........................................37
8.2.3. Non-excessive Loss .................................38
8.2.4. Duplex Self-Interference ...........................38
8.3. Slowstart Tests ...........................................39
8.3.1. Full Window Slowstart Test .........................39
8.3.2. Slowstart AQM Test .................................39
8.4. Sender Rate Burst Tests ...................................40
8.5. Combined and Implicit Tests ...............................41
8.5.1. Sustained Full-Rate Bursts Test ....................41
8.5.2. Passive Measurements ...............................42
9. Example ........................................................43
9.1. Observations about Applicability ..........................44
10. Validation ....................................................45
11. Security Considerations .......................................46
12. IANA Considerations ...........................................47
13. Informative References ........................................47
Appendix A. Model Derivations ....................................52
A.1. Queueless Reno ............................................52
Appendix B. The Effects of ACK Scheduling ........................53
Acknowledgments ...................................................55
Authors' Addresses ................................................55
9. Example ........................................................43
9.1. Observations about Applicability ..........................44
10. Validation ....................................................45
11. Security Considerations .......................................46
12. IANA Considerations ...........................................47
13. Informative References ........................................47
Appendix A. Model Derivations ....................................52
A.1. Queueless Reno ............................................52
Appendix B. The Effects of ACK Scheduling ........................53
Acknowledgments ...................................................55
Authors' Addresses ................................................55
Model-Based Metrics (MBM) rely on peer-reviewed mathematical models to specify a Targeted IP Diagnostic Suite (TIDS), a set of IP diagnostic tests designed to assess whether common transport protocols can be expected to meet a predetermined Target Transport Performance over an Internet path. This document describes the modeling framework to derive the test parameters for assessing an Internet path's ability to support a predetermined Bulk Transport Capacity.
基于模型的度量（MBM）依靠同行评审的数学模型来指定目标IP诊断套件（TIDS），这是一组IP诊断测试，旨在评估公共传输协议是否能够在Internet路径上满足预定的目标传输性能。本文档描述了建模框架，用于推导测试参数，以评估互联网路径支持预定批量传输容量的能力。
Each test in TIDS measures some aspect of IP packet transfer needed to meet the Target Transport Performance. For Bulk Transport Capacity, the TIDS includes IP diagnostic tests to verify that there is sufficient IP capacity (data rate), sufficient queue space at bottlenecks to absorb and deliver typical transport bursts, low enough background packet loss ratio to not interfere with congestion control, and other properties described below. Unlike typical IP Performance Metrics (IPPM) that yield measures of network properties, Model-Based Metrics nominally yield pass/fail evaluations of the ability of standard transport protocols to meet the specific performance objective over some network path.
TIDS中的每个测试都测量满足目标传输性能所需的IP数据包传输的某些方面。对于批量传输容量，TID包括IP诊断测试，以验证是否有足够的IP容量（数据速率）、瓶颈处是否有足够的队列空间来吸收和交付典型的传输突发、是否有足够低的背景数据包丢失率以不干扰拥塞控制，以及下面描述的其他属性。与产生网络属性度量的典型IP性能度量（IPPM）不同，基于模型的度量名义上产生通过/失败评估标准传输协议在某些网络路径上满足特定性能目标的能力。
In most cases, the IP diagnostic tests can be implemented by combining existing IPPM metrics with additional controls for generating test streams having a specified temporal structure (bursts or standing queues caused by constant bit rate streams, etc.) and statistical criteria for evaluating packet transfer. The temporal structure of the test streams mimics transport protocol behavior over the complete path; the statistical criteria models the transport protocol's response to less-than-ideal IP packet transfer. In control theory terms, the tests are "open loop". Note that running a test requires the coordinated activity of sending and receiving measurement points.
在大多数情况下，IP诊断测试可以通过将现有IPPM度量与用于生成具有指定时间结构（由恒定比特率流引起的突发或静止队列等）的测试流的附加控制和用于评估分组传输的统计标准相结合来实现。测试流的时间结构模拟完整路径上的传输协议行为；统计标准对传输协议对不理想IP数据包传输的响应进行建模。在控制理论方面，测试是“开环”的。请注意，运行测试需要发送和接收测量点的协调活动。
This document addresses Bulk Transport Capacity. It describes an alternative to the approach presented in "A Framework for Defining Empirical Bulk Transfer Capacity Metrics" [RFC3148]. Other Model-Based Metrics may cover other applications and transports, such as Voice over IP (VoIP) over UDP, RTP, and new transport protocols.
本文件涉及散装运输能力。它描述了“定义经验批量传输容量指标的框架”[RFC3148]中所述方法的替代方法。其他基于模型的指标可能涵盖其他应用程序和传输，如UDP上的IP语音（VoIP）、RTP和新的传输协议。
This document assumes a traditional Reno TCP-style, self-clocked, window-controlled transport protocol that uses packet loss and Explicit Congestion Notification (ECN) Congestion Experienced (CE) marks for congestion feedback. There are currently some experimental protocols and congestion control algorithms that are rate based or otherwise fall outside of these assumptions. In the future, these new protocols and algorithms may call for revised models.
本文档采用传统的Reno TCP风格、自时钟、窗口控制传输协议，该协议使用丢包和显式拥塞通知（ECN）拥塞体验（CE）标记进行拥塞反馈。目前有一些实验协议和拥塞控制算法是基于速率的，或者不符合这些假设。未来，这些新的协议和算法可能需要修改模型。
The MBM approach, i.e., mapping Target Transport Performance to a Targeted IP Diagnostic Suite (TIDS) of IP tests, solves some intrinsic problems with using TCP or other throughput-maximizing protocols for measurement. In particular, all throughput-maximizing protocols (especially TCP congestion control) cause some level of congestion in order to detect when they have reached the available capacity limitation of the network. This self-inflicted congestion obscures the network properties of interest and introduces non-linear dynamic equilibrium behaviors that make any resulting measurements useless as metrics because they have no predictive value for conditions or paths different from that of the measurement itself. In order to prevent these effects, it is necessary to avoid the effects of TCP congestion control in the measurement method. These issues are discussed at length in Section 4. Readers who are unfamiliar with basic properties of TCP and TCP-like congestion control may find it easier to start at Section 4 or 4.1.
MBM方法，即将目标传输性能映射到IP测试的目标IP诊断套件（TIDS），解决了使用TCP或其他吞吐量最大化协议进行测量的一些固有问题。特别是，所有吞吐量最大化协议（尤其是TCP拥塞控制）都会导致一定程度的拥塞，以便检测它们何时达到网络的可用容量限制。这种自我造成的拥塞掩盖了感兴趣的网络属性，并引入了非线性动态平衡行为，使得任何产生的测量都无法作为度量，因为它们对不同于测量本身的条件或路径没有预测价值。为了防止这些影响，有必要在测量方法中避免TCP拥塞控制的影响。第4节详细讨论了这些问题。不熟悉TCP和TCP（如拥塞控制）的基本属性的读者可能会发现从第4节或第4.1节开始更容易。
A Targeted IP Diagnostic Suite does not have such difficulties. IP diagnostics can be constructed such that they make strong statistical statements about path properties that are independent of measurement details, such as vantage and choice of measurement points.
目标IP诊断套件没有这种困难。IP诊断可以构造成这样，即它们可以对路径属性进行强有力的统计陈述，这些属性独立于测量细节，例如优势和测量点的选择。
This document describes a modeling framework for deriving a Targeted IP Diagnostic Suite from a predetermined Target Transport Performance. It is not a complete specification and relies on other standards documents to define important details such as packet type-P selection, sampling techniques, vantage selection, etc. Fully Specified Targeted IP Diagnostic Suites (FSTIDSs) define all of these details. A Targeted IP Diagnostic Suite (TIDS) refers to the subset of such a specification that is in scope for this document. This terminology is further defined in Section 3.
本文档描述了一个建模框架，用于从预定的目标传输性能派生目标IP诊断套件。它不是一个完整的规范，依赖于其他标准文件来定义重要细节，如包类型P选择、采样技术、优势选择等。完全指定的目标IP诊断套件（FSTIDS）定义了所有这些细节。目标IP诊断套件（TIDS）是指本文档范围内的此类规范的子集。第3节对该术语作了进一步定义。
Section 4 describes some key aspects of TCP behavior and what they imply about the requirements for IP packet transfer. Most of the IP diagnostic tests needed to confirm that the path meets these properties can be built on existing IPPM metrics, with the addition of statistical criteria for evaluating packet transfer and, in a few cases, new mechanisms to implement the required temporal structure. (One group of tests, the standing queue tests described in Section 8.2, don't correspond to existing IPPM metrics, but suitable new IPPM metrics can be patterned after the existing definitions.)
第4节描述了TCP行为的一些关键方面，以及它们对IP数据包传输的要求意味着什么。确认路径满足这些属性所需的大多数IP诊断测试可以建立在现有IPPM度量的基础上，添加用于评估数据包传输的统计标准，以及在少数情况下，实现所需时间结构的新机制。（第8.2节中描述的一组测试，即站立队列测试，与现有IPPM度量不对应，但可以在现有定义之后构建合适的新IPPM度量。）
Figure 1 shows the MBM modeling and measurement framework. The Target Transport Performance at the top of the figure is determined by the needs of the user or application, which are outside the scope of this document. For Bulk Transport Capacity, the main performance parameter of interest is the Target Data Rate. However, since TCP's ability to compensate for less-than-ideal network conditions is fundamentally affected by the Round-Trip Time (RTT) and the Maximum Transmission Unit (MTU) of the complete path, these parameters must also be specified in advance based on knowledge about the intended application setting. They may reflect a specific application over a real path through the Internet or an idealized application and hypothetical path representing a typical user community. Section 5 describes the common parameters and models derived from the Target Transport Performance.
图1显示了MBM建模和度量框架。图顶部的目标传输性能由用户或应用程序的需求决定，不在本文档范围内。对于散装运输能力，主要性能参数是目标数据速率。然而，由于TCP补偿不理想网络条件的能力从根本上受完整路径的往返时间（RTT）和最大传输单位（MTU）的影响，因此还必须根据预期应用设置的知识提前指定这些参数。它们可以通过互联网的真实路径或代表典型用户社区的理想化应用程序和假设路径反映特定应用程序。第5节描述了从目标传输性能导出的通用参数和模型。
Target Transport Performance
(Target Data Rate, Target RTT, and Target MTU)
|
________V_________
| mathematical |
| models |
| |
------------------
Traffic parameters | | Statistical criteria
| |
_______V____________V____Targeted IP____
| | * * * | Diagnostic Suite |
_____|_______V____________V________________ |
__|____________V____________V______________ | |
| IP diagnostic tests | | |
| | | | | |
| _____________V__ __V____________ | | |
| | traffic | | Delivery | | | |
| | pattern | | Evaluation | | | |
| | generation | | | | | |
| -------v-------- ------^-------- | | |
| | v test stream via ^ | | |--
| | -->======================>-- | | |
| | subpath under test | |-
----V----------------------------------V--- |
| | | | | |
V V V V V V
fail/inconclusive pass/fail/inconclusive
(traffic generation status) (test result)
Target Transport Performance
(Target Data Rate, Target RTT, and Target MTU)
|
________V_________
| mathematical |
| models |
| |
------------------
Traffic parameters | | Statistical criteria
| |
_______V____________V____Targeted IP____
| | * * * | Diagnostic Suite |
_____|_______V____________V________________ |
__|____________V____________V______________ | |
| IP diagnostic tests | | |
| | | | | |
| _____________V__ __V____________ | | |
| | traffic | | Delivery | | | |
| | pattern | | Evaluation | | | |
| | generation | | | | | |
| -------v-------- ------^-------- | | |
| | v test stream via ^ | | |--
| | -->======================>-- | | |
| | subpath under test | |-
----V----------------------------------V--- |
| | | | | |
V V V V V V
fail/inconclusive pass/fail/inconclusive
(traffic generation status) (test result)
Figure 1: Overall Modeling Framework
图1：总体建模框架
Mathematical TCP models are used to determine traffic parameters and subsequently to design traffic patterns that mimic TCP (which has burst characteristics at multiple time scales) or other transport protocols delivering bulk data and operating at the Target Data Rate, MTU, and RTT over a full range of conditions. Using the techniques described in Section 6, the traffic patterns are generated based on the three Target parameters of the complete path (Target Data Rate, Target RTT, and Target MTU), independent of the properties of individual subpaths. As much as possible, the test streams are generated deterministically (precomputed) to minimize the extent to which test methodology, measurement points, measurement vantage, or path partitioning affect the details of the measurement traffic.
数学TCP模型用于确定流量参数，并随后设计模拟TCP（在多个时间尺度上具有突发特性）或其他传输协议的流量模式，这些传输协议提供大量数据，并在各种条件下以目标数据速率、MTU和RTT运行。使用第6节中描述的技术，基于完整路径的三个目标参数（目标数据速率、目标RTT和目标MTU）生成业务模式，与各个子路径的属性无关。尽可能确定地（预计算）生成测试流，以最小化测试方法、测量点、测量优势或路径划分对测量流量细节的影响程度。
Section 7 describes packet transfer statistics and methods to test against the statistical criteria provided by the mathematical models. Since the statistical criteria typically apply to the complete path
第7节描述了数据包传输统计数据以及根据数学模型提供的统计标准进行测试的方法。因为统计标准通常适用于完整路径
(a composition of subpaths) [RFC6049], in situ testing requires that the end-to-end statistical criteria be apportioned as separate criteria for each subpath. Subpaths that are expected to be bottlenecks would then be permitted to contribute a larger fraction of the end-to-end packet loss budget. In compensation, subpaths that are not expected to exhibit bottlenecks must be constrained to contribute less packet loss. Thus, the statistical criteria for each subpath in each test of a TIDS is an apportioned share of the end-to-end statistical criteria for the complete path that was determined by the mathematical model.
（子路径的组成）[RFC6049]，现场测试要求端到端统计标准作为每个子路径的单独标准进行分配。预计将成为瓶颈的子路径将被允许贡献端到端数据包丢失预算的较大部分。在补偿中，不希望出现瓶颈的子路径必须受到约束，以减少数据包丢失。因此，TID每次测试中每个子路径的统计标准是由数学模型确定的完整路径的端到端统计标准的分摊份额。
Section 8 describes the suite of individual tests needed to verify all of the required IP delivery properties. A subpath passes if and only if all of the individual IP diagnostic tests pass. Any subpath that fails any test indicates that some users are likely to fail to attain their Target Transport Performance under some conditions. In addition to passing or failing, a test can be deemed inconclusive for a number of reasons, including the following: the precomputed traffic pattern was not accurately generated, the measurement results were not statistically significant, the test failed to meet some required test preconditions, etc. If all tests pass but some are inconclusive, then the entire suite is deemed to be inconclusive.
第8节描述了验证所有所需IP交付属性所需的一系列单独测试。当且仅当所有单个IP诊断测试均通过时，子路径才会通过。任何测试失败的子路径都表明，在某些情况下，某些用户可能无法达到其目标传输性能。除通过或失败外，测试还可能被视为不确定，原因有很多，包括：未准确生成预计算的交通模式，测量结果不具有统计意义，测试未能满足某些要求的测试先决条件，等等。如果所有测试通过，但有些测试不确定，那么整个组曲就被认为是不确定的了。
In Section 9, we present an example TIDS that might be representative of High Definition (HD) video and illustrate how Model-Based Metrics can be used to address difficult measurement situations, such as confirming that inter-carrier exchanges have sufficient performance and capacity to deliver HD video between ISPs.
在第9节中，我们提供了一个可能代表高清（HD）视频的TID示例，并说明了如何使用基于模型的度量来解决困难的测量情况，例如确认载波间交换具有足够的性能和容量，以在ISP之间传输高清视频。
Since there is some uncertainty in the modeling process, Section 10 describes a validation procedure to diagnose and minimize false positive and false negative results.
由于建模过程中存在一些不确定性，第10节描述了诊断和最小化假阳性和假阴性结果的验证程序。
Terms containing underscores (rather than spaces) appear in equations and typically have algorithmic definitions.
包含下划线（而非空格）的术语出现在方程式中，通常具有算法定义。
Target: A general term for any parameter specified by or derived from the user's application or transport performance requirements.
目标：由用户的应用或传输性能要求指定或派生的任何参数的通用术语。
Target Transport Performance: Application or transport performance target values for the complete path. For Bulk Transport Capacity defined in this document, the Target Transport Performance includes the Target Data Rate, Target RTT, and Target MTU as described below.
目标传输性能：完整路径的应用程序或传输性能目标值。对于本文件中定义的散装运输能力，目标运输性能包括如下所述的目标数据速率、目标RTT和目标MTU。
Target Data Rate: The specified application data rate required for an application's proper operation. Conventional Bulk Transport Capacity (BTC) metrics are focused on the Target Data Rate; however, these metrics have little or no predictive value because they do not consider the effects of the other two parameters of the Target Transport Performance -- the RTT and MTU of the complete paths.
目标数据速率：应用程序正常运行所需的指定应用程序数据速率。传统的散装运输能力（BTC）指标侧重于目标数据速率；然而，这些度量几乎没有或没有预测值，因为它们不考虑目标传输性能的其他两个参数的影响——完整路径的RTT和MTU。
Target RTT (Round-Trip Time): The specified baseline (minimum) RTT of the longest complete path over which the user expects to be able to meet the target performance. TCP and other transport protocol's ability to compensate for path problems is generally proportional to the number of round trips per second. The Target RTT determines both key parameters of the traffic patterns (e.g., burst sizes) and the thresholds on acceptable IP packet transfer statistics. The Target RTT must be specified considering appropriate packets sizes: MTU-sized packets on the forward path and ACK-sized packets (typically, header_overhead) on the return path. Note that Target RTT is specified and not measured; MBM measurements derived for a given target_RTT will be applicable to any path with a smaller RTT.
目标RTT（往返时间）：用户期望能够达到目标性能的最长完整路径的指定基线（最小）RTT。TCP和其他传输协议补偿路径问题的能力通常与每秒的往返次数成正比。目标RTT确定业务模式的关键参数（例如，突发大小）和可接受IP分组传输统计的阈值。必须考虑适当的数据包大小来指定目标RTT：转发路径上的MTU大小的数据包和返回路径上的ACK大小的数据包（通常，报头开销）。请注意，目标RTT是指定的，而不是测量的；为给定目标RTT导出的MBM测量将适用于RTT较小的任何路径。
Target MTU (Maximum Transmission Unit): The specified maximum MTU supported by the complete path over which the application expects to meet the target performance. In this document, we assume a 1500-byte MTU unless otherwise specified. If a subpath has a smaller MTU, then it becomes the Target MTU for the complete path, and all model calculations and subpath tests must use the same smaller MTU.
目标MTU（最大传输单位）：应用程序期望达到目标性能的完整路径所支持的指定最大MTU。在本文档中，除非另有规定，否则我们假设MTU为1500字节。如果子路径具有较小的MTU，则它将成为完整路径的目标MTU，并且所有模型计算和子路径测试必须使用相同的较小MTU。
Targeted IP Diagnostic Suite (TIDS): A set of IP diagnostic tests designed to determine if an otherwise ideal complete path containing the subpath under test can sustain flows at a specific target_data_rate using packets with a size of target_MTU when the RTT of the complete path is target_RTT.
目标IP诊断套件（TIDS）：一组IP诊断测试，旨在确定当完整路径的RTT为目标RTT时，包含被测子路径的理想完整路径是否可以使用大小为目标MTU的数据包以特定目标数据速率维持流。
Fully Specified Targeted IP Diagnostic Suite (FSTIDS): A TIDS together with additional specifications such as measurement packet type ("type-p" [RFC2330]) that are out of scope for this document and need to be drawn from other standards documents.
完全指定的目标IP诊断套件（FSTID）：TID以及其他规范，如测量数据包类型（“p型”[RFC2330]），不在本文件范围内，需要从其他标准文件中提取。
Bulk Transport Capacity (BTC): Bulk Transport Capacity metrics evaluate an Internet path's ability to carry bulk data, such as large files, streaming (non-real-time) video, and, under some conditions, web images and other content. Prior efforts to define BTC metrics have been based on [RFC3148], which predates our understanding of TCP and the requirements described in Section 4. In general, "Bulk Transport" indicates that performance is
批量传输容量（BTC）：批量传输容量指标评估Internet路径承载批量数据的能力，例如大文件、流式（非实时）视频，以及在某些情况下承载web图像和其他内容的能力。先前定义BTC指标的工作是基于[RFC3148]，它早于我们对TCP和第4节所述要求的理解。通常，“批量运输”表示性能不稳定
determined by the interplay between the network, cross traffic, and congestion control in the transport protocol. It excludes situations where performance is dominated by the RTT alone (e.g., transactions) or bottlenecks elsewhere, such as in the application itself.
由网络、交叉流量和传输协议中的拥塞控制之间的相互作用决定。它排除了性能仅由RTT控制的情况（例如，事务）或其他地方（如应用程序本身）的瓶颈。
IP diagnostic tests: Measurements or diagnostics to determine if packet transfer statistics meet some precomputed target.
IP诊断测试：用于确定数据包传输统计数据是否满足某些预计算目标的测量或诊断。
traffic patterns: The temporal patterns or burstiness of traffic generated by applications over transport protocols such as TCP. There are several mechanisms that cause bursts at various timescales as described in Section 4.1. Our goal here is to mimic the range of common patterns (burst sizes, rates, etc.), without tying our applicability to specific applications, implementations, or technologies, which are sure to become stale.
流量模式：应用程序通过传输协议（如TCP）生成的流量的时间模式或突发性。如第4.1节所述，有几种机制会在不同的时间尺度上导致突发事件。我们的目标是模拟常见模式的范围（突发大小、速率等），而不将我们的适用性绑定到特定的应用程序、实现或技术，这些应用程序、实现或技术肯定会过时。
Explicit Congestion Notification (ECN): See [RFC3168].
显式拥塞通知（ECN）：请参阅[RFC3168]。
packet transfer statistics: Raw, detailed, or summary statistics about packet transfer properties of the IP layer including packet losses, ECN Congestion Experienced (CE) marks, reordering, or any other properties that may be germane to transport performance.
数据包传输统计信息：有关IP层数据包传输属性的原始、详细或摘要统计信息，包括数据包丢失、ECN拥塞（CE）标记、重新排序或与传输性能密切相关的任何其他属性。
packet loss ratio: As defined in [RFC7680].
数据包丢失率：如[RFC7680]中所定义。
apportioned: To divide and allocate, for example, budgeting packet loss across multiple subpaths such that the losses will accumulate to less than a specified end-to-end loss ratio. Apportioning metrics is essentially the inverse of the process described in [RFC5835].
分摊：例如，在多个子路径上对数据包丢失进行分摊和分配，以使丢失累积到小于指定的端到端丢失率。分配指标本质上与[RFC5835]中描述的过程相反。
open loop: A control theory term used to describe a class of techniques where systems that naturally exhibit circular dependencies can be analyzed by suppressing some of the dependencies, such that the resulting dependency graph is acyclic.
开环：一个控制理论术语，用于描述一类技术，其中自然表现出循环依赖的系统可以通过抑制某些依赖进行分析，从而得到的依赖图是非循环的。
See [RFC2330] and [RFC7398] for existing terms and definitions.
现有术语和定义见[RFC2330]和[RFC7398]。
data sender: Host sending data and receiving ACKs.
数据发送方：发送数据和接收确认的主机。
data receiver: Host receiving data and sending ACKs.
数据接收器：接收数据并发送确认的主机。
complete path: The end-to-end path from the data sender to the data receiver.
完整路径：从数据发送方到数据接收方的端到端路径。
subpath: A portion of the complete path. Note that there is no requirement that subpaths be non-overlapping. A subpath can be as small as a single device, link, or interface.
子路径：完整路径的一部分。请注意，不要求子路径不重叠。子路径可以与单个设备、链路或接口一样小。
measurement point: Measurement points as described in [RFC7398].
测量点：如[RFC7398]所述的测量点。
test path: A path between two measurement points that includes a subpath of the complete path under test. If the measurement points are off path, the test path may include "test leads" between the measurement points and the subpath.
测试路径：两个测量点之间的路径，包括被测完整路径的子路径。如果测量点偏离路径，测试路径可能包括测量点和子路径之间的“测试引线”。
dominant bottleneck: The bottleneck that generally determines most packet transfer statistics for the entire path. It typically determines a flow's self-clock timing, packet loss, and ECN CE marking rate, with other potential bottlenecks having less effect on the packet transfer statistics. See Section 4.1 on TCP properties.
主要瓶颈：通常决定整个路径的大多数数据包传输统计信息的瓶颈。它通常确定流的自时钟定时、分组丢失和ECN-CE标记率，而其他潜在瓶颈对分组传输统计数据的影响较小。请参见第4.1节“TCP属性”。
front path: The subpath from the data sender to the dominant bottleneck.
前端路径：从数据发送方到主要瓶颈的子路径。
back path: The subpath from the dominant bottleneck to the receiver.
反向路径：从主要瓶颈到接收器的子路径。
return path: The path taken by the ACKs from the data receiver to the data sender.
返回路径：ACK从数据接收方到数据发送方的路径。
cross traffic: Other, potentially interfering, traffic competing for network resources (such as bandwidth and/or queue capacity).
交叉流量：竞争网络资源（如带宽和/或队列容量）的其他潜在干扰流量。
The following properties are determined by the complete path and application. These are described in more detail in Section 5.1.
以下属性由完整路径和应用程序确定。第5.1节对其进行了更详细的描述。
Application Data Rate: General term for the data rate as seen by the application above the transport layer in bytes per second. This is the payload data rate and explicitly excludes transport-level and lower-level headers (TCP/IP or other protocols), retransmissions, and other overhead that is not part of the total quantity of data delivered to the application.
应用程序数据速率：传输层之上的应用程序所看到的数据速率的通用术语，以字节/秒为单位。这是有效负载数据速率，明确排除传输级别和较低级别的报头（TCP/IP或其他协议）、重传和其他开销，这些开销不属于传递给应用程序的数据总量的一部分。
IP rate: The actual number of IP-layer bytes delivered through a subpath, per unit time, including TCP and IP headers, retransmits, and other TCP/IP overhead. This is the same as IP-type-P Link Usage in [RFC5136].
IP速率：每单位时间通过子路径传递的IP层字节的实际数量，包括TCP和IP头、重传和其他TCP/IP开销。这与[RFC5136]中的IP-type-P链路使用相同。
IP capacity: The maximum number of IP-layer bytes that can be transmitted through a subpath, per unit time, including TCP and IP headers, retransmits, and other TCP/IP overhead. This is the same as IP-type-P Link Capacity in [RFC5136].
IP容量：每单位时间可通过子路径传输的最大IP层字节数，包括TCP和IP头、重传和其他TCP/IP开销。这与[RFC5136]中的IP-type-P链路容量相同。
bottleneck IP capacity: The IP capacity of the dominant bottleneck in the forward path. All throughput-maximizing protocols estimate this capacity by observing the IP rate delivered through the bottleneck. Most protocols derive their self-clocks from the timing of this data. See Section 4.1 and Appendix B for more details.
瓶颈IP容量：转发路径中主要瓶颈的IP容量。所有吞吐量最大化协议都通过观察通过瓶颈交付的IP速率来估计此容量。大多数协议从这些数据的定时中获得它们的自时钟。详见第4.1节和附录B。
implied bottleneck IP capacity: The bottleneck IP capacity implied by the ACKs returning from the receiver. It is determined by looking at how much application data the ACK stream at the sender reports as delivered to the data receiver per unit time at various timescales. If the return path is thinning, batching, or otherwise altering the ACK timing, the implied bottleneck IP capacity over short timescales might be substantially larger than the bottleneck IP capacity averaged over a full RTT. Since TCP derives its clock from the data delivered through the bottleneck, the front path must have sufficient buffering to absorb any data bursts at the dimensions (size and IP rate) implied by the ACK stream, which are potentially doubled during slowstart. If the return path is not altering the ACK stream, then the implied bottleneck IP capacity will be the same as the bottleneck IP capacity. See Section 4.1 and Appendix B for more details.
隐含瓶颈IP容量：接收方返回的ACK隐含的瓶颈IP容量。它是通过查看发送方的ACK流在不同时间尺度上每单位时间向数据接收方报告的应用程序数据量来确定的。如果返回路径正在细化、批处理或以其他方式改变ACK定时，则短时间尺度上的隐含瓶颈IP容量可能大大大于整个RTT上的平均瓶颈IP容量。由于TCP的时钟来自通过瓶颈传输的数据，因此前端路径必须具有足够的缓冲，以吸收ACK流所暗示的维度（大小和IP速率）的任何数据突发，这些维度在slowstart期间可能加倍。如果返回路径没有改变ACK流，那么隐含的瓶颈IP容量将与瓶颈IP容量相同。详见第4.1节和附录B。
sender interface rate: The IP rate that corresponds to the IP capacity of the data sender's interface. Due to sender efficiency algorithms, including technologies such as TCP segmentation offload (TSO), nearly all modern servers deliver data in bursts at full interface link rate. Today, 1 or 10 Gb/s are typical.
发送方接口速率：与数据发送方接口的IP容量相对应的IP速率。由于发送方效率算法，包括TCP分段卸载（TSO）等技术，几乎所有现代服务器都以全接口链路速率突发发送数据。今天，通常是1或10 Gb/s。
header_overhead: The IP and TCP header sizes, which are the portion of each MTU not available for carrying application payload. Without loss of generality, this is assumed to be the size for returning acknowledgments (ACKs). For TCP, the Maximum Segment Size (MSS) is the Target MTU minus the header_overhead.
header_开销：IP和TCP报头大小，是每个MTU中不可用于承载应用程序负载的部分。在不丧失一般性的情况下，假设这是返回确认（ACKs）的大小。对于TCP，最大段大小（MSS）是目标MTU减去报头开销。
Basic parameters common to models and subpath tests are defined here. Formulas for target_window_size and target_run_length appear in Section 5.2. Note that these are mixed between application transport performance (excludes headers) and IP performance (includes TCP headers and retransmissions as part of the IP payload).
这里定义了模型和子路径测试通用的基本参数。目标窗口大小和目标运行长度的公式见第5.2节。请注意，这些性能在应用程序传输性能（不包括标头）和IP性能（包括TCP标头和作为IP有效负载一部分的重传）之间混合。
Network power: The observed data rate divided by the observed RTT. Network power indicates how effectively a transport protocol is filling a network.
网络功率：观测数据速率除以观测RTT。网络功率表示传输协议填充网络的效率。
Window [size]: The total quantity of data carried by packets in-flight plus the data represented by ACKs circulating in the network is referred to as the window. See Section 4.1. Sometimes used with other qualifiers (congestion window (cwnd) or receiver window) to indicate which mechanism is controlling the window.
窗口[大小]：飞行中的数据包携带的数据总量加上网络中循环的ACK表示的数据称为窗口。见第4.1节。有时与其他限定符（拥塞窗口（cwnd）或接收器窗口）一起使用，以指示控制窗口的机制。
pipe size: A general term for the number of packets needed in flight (the window size) to exactly fill a network path or subpath. It corresponds to the window size, which maximizes network power. It is often used with additional qualifiers to specify which path, under what conditions, etc.
管道大小：用于准确填充网络路径或子路径所需的数据包数量（窗口大小）的通用术语。它对应于窗口大小，从而最大化网络功率。它通常与其他限定符一起使用，以指定路径、条件等。
target_window_size: The average number of packets in flight (the window size) needed to meet the Target Data Rate for the specified Target RTT and Target MTU. It implies the scale of the bursts that the network might experience.
target_window_size：满足指定目标RTT和目标MTU的目标数据速率所需的正在传输的平均数据包数（窗口大小）。这意味着网络可能经历的突发事件的规模。
run length: A general term for the observed, measured, or specified number of packets that are (expected to be) delivered between losses or ECN CE marks. Nominally, it is one over the sum of the loss and ECN CE marking probabilities, if they are independently and identically distributed.
运行长度：在丢失或ECN CE标记之间传输的（预期）观察、测量或指定数量的数据包的通用术语。名义上，如果损失和ECN CE标记概率是独立且相同分布的，则为损失和ECN CE标记概率之和的1。
target_run_length: The target_run_length is an estimate of the minimum number of non-congestion marked packets needed between losses or ECN CE marks necessary to attain the target_data_rate over a path with the specified target_RTT and target_MTU, as computed by a mathematical model of TCP congestion control. A reference calculation is shown in Section 5.2 and alternatives in Appendix A.
target_run_length：target_run_length是对丢失或ECN CE标记之间所需的非拥塞标记数据包的最小数量的估计，该数据包是在具有指定target_RTT和target_MTU的路径上实现目标数据速率所必需的，由TCP拥塞控制的数学模型计算得出。参考计算见第5.2节，备选方案见附录A。
reference target_run_length: target_run_length computed precisely by the method in Section 5.2. This is likely to be slightly more conservative than required by modern TCP implementations.
参考目标运行长度：根据第5.2节中的方法精确计算的目标运行长度。这可能比现代TCP实现要求的保守一些。
The following ancillary parameters are used for some tests:
以下辅助参数用于某些测试：
derating: Under some conditions, the standard models are too conservative. The modeling framework permits some latitude in relaxing or "derating" some test parameters, as described in Section 5.3, in exchange for a more stringent TIDS validation
降额：在某些情况下，标准型号过于保守。如第5.3节所述，建模框架允许放宽或“减额”某些试验参数，以换取更严格的TIDS验证
procedures, described in Section 10. Models can be derated by including a multiplicative derating factor to make tests less stringent.
第10节所述的程序。模型可以通过包含乘法降额因子来降低，以降低测试的严格性。
subpath_IP_capacity: The IP capacity of a specific subpath.
子路径IP容量：特定子路径的IP容量。
test path: A subpath of a complete path under test.
测试路径：被测试的完整路径的子路径。
test_path_RTT: The RTT observed between two measurement points using packet sizes that are consistent with the transport protocol. This is generally MTU-sized packets of the forward path and packets with a size of header_overhead on the return path.
测试路径：使用与传输协议一致的数据包大小在两个测量点之间观察到的RTT。这通常是前向路径的MTU大小的数据包和返回路径上具有头部开销大小的数据包。
test_path_pipe: The pipe size of a test path. Nominally, it is the test_path_RTT times the test path IP_capacity.
测试路径管道：测试路径的管道尺寸。名义上，它是测试路径RTT乘以测试路径IP容量。
test_window: The smallest window sufficient to meet or exceed the target_rate when operating with a pure self-clock over a test path. The test_window is typically calculated as follows (but see the discussion in Appendix B about the effects of channel scheduling on RTT):
测试_窗口：在测试路径上使用纯自时钟运行时，足以达到或超过目标_速率的最小窗口。test_窗口通常按以下方式计算（但参见附录B中关于信道调度对RTT影响的讨论）：
ceiling(target_data_rate * test_path_RTT / (target_MTU -
header_overhead))
ceiling(target_data_rate * test_path_RTT / (target_MTU -
header_overhead))
On some test paths, the test_window may need to be adjusted slightly to compensate for the RTT being inflated by the devices that schedule packets.
在一些测试路径上，可能需要稍微调整测试窗口，以补偿调度数据包的设备所膨胀的RTT。
The terminology below is used to define temporal patterns for test streams. These patterns are designed to mimic TCP behavior, as described in Section 4.1.
下面的术语用于定义测试流的时间模式。这些模式旨在模拟TCP行为，如第4.1节所述。
packet headway: Time interval between packets, specified from the start of one to the start of the next. For example, if packets are sent with a 1 ms headway, there will be exactly 1000 packets per second.
数据包间隔：数据包之间的时间间隔，从一个数据包的开始到下一个数据包的开始。例如，如果以1ms的间隔发送数据包，则每秒正好有1000个数据包。
burst headway: Time interval between bursts, specified from the start of the first packet of one burst to the start of the first packet of the next burst. For example, if 4 packet bursts are sent with a 1 ms burst headway, there will be exactly 4000 packets per second.
突发间隔：突发之间的时间间隔，从一个突发的第一个数据包开始到下一个突发的第一个数据包开始。例如，如果以1ms的突发间隔发送4个数据包突发，则每秒将正好有4000个数据包。
paced single packets: Individual packets sent at the specified rate or packet headway.
有节奏的单个数据包：以指定速率或数据包间隔发送的单个数据包。
paced bursts: Bursts on a timer. Specify any 3 of the following: average data rate, packet size, burst size (number of packets), and burst headway (burst start to start). By default, the bursts are assumed to occur at full sender interface rate, such that the packet headway within each burst is the minimum supported by the sender's interface. Under some conditions, it is useful to explicitly specify the packet headway within each burst.
有节奏的爆发：计时器上的爆发。指定以下任意3项：平均数据速率、数据包大小、突发大小（数据包数）和突发间隔（突发开始到开始）。默认情况下，假定突发以完全发送方接口速率发生，使得每个突发内的分组间隔是发送方接口支持的最小间隔。在某些情况下，明确指定每个突发内的数据包间隔是有用的。
slowstart rate: Paced bursts of four packets each at an average data rate equal to twice the implied bottleneck IP capacity (but not more than the sender interface rate). This mimics TCP slowstart. This is a two-level burst pattern described in more detail in Section 6.1. If the implied bottleneck IP capacity is more than half of the sender interface rate, the slowstart rate becomes the sender interface rate.
slowstart速率：四个数据包的有节奏的突发，每个数据包的平均数据速率等于隐含瓶颈IP容量的两倍（但不超过发送方接口速率）。这模仿了TCP slowstart。这是第6.1节中更详细描述的两级突发模式。如果隐含的瓶颈IP容量超过发送方接口速率的一半，则slowstart速率将成为发送方接口速率。
slowstart burst: A specified number of packets in a two-level burst pattern that resembles slowstart. This mimics one round of TCP slowstart.
slowstart突发：两级突发模式中指定数量的数据包，类似于slowstart。这模拟了一轮TCP慢启动。
repeated slowstart bursts: Slowstart bursts repeated once per target_RTT. For TCP, each burst would be twice as large as the prior burst, and the sequence would end at the first ECN CE mark or lost packet. For measurement, all slowstart bursts would be the same size (nominally, target_window_size but other sizes might be specified), and the ECN CE marks and lost packets are counted.
重复慢启动脉冲：每个目标重复一次慢启动脉冲。对于TCP，每个突发将是前一个突发的两倍大，并且序列将在第一个ECN CE标记或丢失的数据包处结束。对于测量，所有slowstart突发都将是相同的大小（名义上，目标窗口大小，但可能指定其他大小），并且计算ECN CE标记和丢失的数据包。
The tests described in this document can be grouped according to their applicability.
本文件中描述的试验可根据其适用性进行分组。
Capacity tests: Capacity tests determine if a network subpath has sufficient capacity to deliver the Target Transport Performance. As long as the test stream is within the proper envelope for the Target Transport Performance, the average packet losses or ECN CE marks must be below the statistical criteria computed by the model. As such, capacity tests reflect parameters that can transition from passing to failing as a consequence of cross traffic, additional presented load, or the actions of other network users. By definition, capacity tests also consume significant network resources (data capacity and/or queue buffer space), and the test schedules must be balanced by their cost.
容量测试：容量测试确定网络子路径是否有足够的容量来交付目标传输性能。只要测试流在目标传输性能的适当包络内，平均分组丢失或ECN CE标记必须低于模型计算的统计标准。因此，容量测试反映了由于交叉流量、额外呈现的负载或其他网络用户的操作而可能从通过过渡到失败的参数。根据定义，容量测试也会消耗大量的网络资源（数据容量和/或队列缓冲区空间），测试计划必须根据其成本进行平衡。
Monitoring tests: Monitoring tests are designed to capture the most important aspects of a capacity test without presenting excessive ongoing load themselves. As such, they may miss some details of
监控测试：监控测试旨在捕获容量测试的最重要方面，而不会呈现过多的持续负载。因此，他们可能会错过一些细节
the network's performance but can serve as a useful reduced-cost proxy for a capacity test, for example, to support continuous production network monitoring.
网络的性能，但可以作为容量测试的一个有用的降低成本的代理，例如，支持连续生产网络监控。
Engineering tests: Engineering tests evaluate how network algorithms (such as Active Queue Management (AQM) and channel allocation) interact with TCP-style self-clocked protocols and adaptive congestion control based on packet loss and ECN CE marks. These tests are likely to have complicated interactions with cross traffic and, under some conditions, can be inversely sensitive to load. For example, a test to verify that an AQM algorithm causes ECN CE marks or packet drops early enough to limit queue occupancy may experience a false pass result in the presence of cross traffic. It is important that engineering tests be performed under a wide range of conditions, including both in situ and bench testing, and over a wide variety of load conditions. Ongoing monitoring is less likely to be useful for engineering tests, although sparse in situ testing might be appropriate.
工程测试：工程测试评估网络算法（如主动队列管理（AQM）和信道分配）如何与TCP风格的自时钟协议以及基于数据包丢失和ECN CE标记的自适应拥塞控制交互。这些测试可能与交叉流量有复杂的交互作用，在某些情况下，可能对负载负敏感。例如，验证AQM算法导致ECN CE标记或数据包丢失足够早以限制队列占用的测试可能会在存在交叉流量的情况下遇到错误通过结果。重要的是，工程试验应在各种条件下进行，包括现场和台架试验，以及在各种荷载条件下进行。持续监测不太可能对工程测试有用，尽管稀疏的现场测试可能是合适的。
When "Framework for IP Performance Metrics" [RFC2330] was published in 1998, sound Bulk Transport Capacity (BTC) measurement was known to be well beyond our capabilities. Even when "A Framework for Defining Empirical Bulk Transfer Capacity Metrics" [RFC3148] was published, we knew that we didn't really understand the problem. Now, in hindsight, we understand why assessing BTC is such a difficult problem:
当“IP性能度量框架”[RFC2330]于1998年发布时，我们已经知道声音批量传输容量（BTC）测量远远超出了我们的能力。即使当“定义经验批量传输容量指标的框架”[RFC3148]发表时，我们也知道我们并没有真正理解这个问题。现在，事后来看，我们明白了为什么评估BTC是一个如此困难的问题：
o TCP is a control system with circular dependencies -- everything affects performance, including components that are explicitly not part of the test (for example, the host processing power is not in-scope of path performance tests).
o TCP是一个具有循环依赖关系的控制系统——任何东西都会影响性能，包括显式不属于测试的组件（例如，主机处理能力不在路径性能测试的范围内）。
o Congestion control is a dynamic equilibrium process, similar to processes observed in chemistry and other fields. The network and transport protocols find an operating point that balances opposing forces: the transport protocol pushing harder (raising the data rate and/or window) while the network pushes back (raising packet loss ratio, RTT, and/or ECN CE marks). By design, TCP congestion control keeps raising the data rate until the network gives some indication that its capacity has been exceeded by dropping packets or adding ECN CE marks. If a TCP sender accurately fills a path to its IP capacity (e.g., the bottleneck is 100% utilized), then packet losses and ECN CE marks are mostly determined by the TCP sender and how aggressively it seeks additional capacity; they are not determined by the network itself, because the network must send exactly the signals that TCP needs to set its rate.
o 拥塞控制是一个动态平衡过程，类似于化学和其他领域中观察到的过程。网络和传输协议找到了一个平衡对立力量的工作点：传输协议在网络推回（提高丢包率、RTT和/或ECN CE标记）的同时更努力地推动（提高数据速率和/或窗口）。根据设计，TCP拥塞控制会不断提高数据速率，直到网络通过丢弃数据包或添加ECN CE标记指示其容量已超过。如果TCP发送方准确地填充到其IP容量的路径（例如，瓶颈利用率为100%），则数据包丢失和ECN CE标记主要取决于TCP发送方及其寻求额外容量的积极程度；它们不是由网络本身决定的，因为网络必须准确地发送TCP设置其速率所需的信号。
o TCP's ability to compensate for network impairments (such as loss, delay, and delay variation, outside of those caused by TCP itself) is directly proportional to the number of send-ACK round-trip exchanges per second (i.e., inversely proportional to the RTT). As a consequence, an impaired subpath may pass a short RTT local test even though it fails when the subpath is extended by an effectively perfect network to some larger RTT.
o TCP补偿网络损伤的能力（如丢失、延迟和延迟变化，不包括TCP本身造成的损伤）与每秒发送-确认往返交换的数量成正比（即与RTT成反比）。因此，受损的子路径可能通过短RTT本地测试，即使在子路径被有效完善的网络扩展到某个更大的RTT时失败。
o TCP has an extreme form of the Observer Effect (colloquially known as the "Heisenberg Effect"). Measurement and cross traffic interact in unknown and ill-defined ways. The situation is actually worse than the traditional physics problem where you can at least estimate bounds on the relative momentum of the measurement and measured particles. In general, for network measurement, you cannot determine even the order of magnitude of the effect. It is possible to construct measurement scenarios where the measurement traffic starves real user traffic, yielding an overly inflated measurement. The inverse is also possible: the user traffic can fill the network, such that the measurement traffic detects only minimal available capacity. In general, you cannot determine which scenario might be in effect, so you cannot gauge the relative magnitude of the uncertainty introduced by interactions with other network traffic.
o TCP有一种极端形式的观察者效应（俗称“海森堡效应”）。测量和交叉流量以未知和不明确的方式相互作用。这种情况实际上比传统的物理问题更糟糕，在传统的物理问题中，你至少可以估计测量和被测量粒子的相对动量的界限。通常，对于网络测量，您甚至无法确定效果的数量级。可以构建测量场景，其中测量流量会耗尽实际用户流量，从而产生过度膨胀的测量。反过来也是可能的：用户流量可以填满网络，这样测量流量只能检测到最小的可用容量。通常，您无法确定哪种场景可能有效，因此无法衡量与其他网络流量交互所引入的不确定性的相对大小。
o As a consequence of the properties listed above, it is difficult, if not impossible, for two independent implementations (hardware or software) of TCP congestion control to produce equivalent performance results [RFC6576] under the same network conditions.
o 由于上述特性，TCP拥塞控制的两个独立实现（硬件或软件）在相同的网络条件下很难（如果不是不可能的话）产生同等的性能结果[RFC6576]。
These properties are a consequence of the dynamic equilibrium behavior intrinsic to how all throughput-maximizing protocols interact with the Internet. These protocols rely on control systems based on estimated network metrics to regulate the quantity of data to send into the network. The packet-sending characteristics in turn alter the network properties estimated by the control system metrics, such that there are circular dependencies between every transmission characteristic and every estimated metric. Since some of these dependencies are nonlinear, the entire system is nonlinear, and any change anywhere causes a difficult-to-predict response in network metrics. As a consequence, Bulk Transport Capacity metrics have not fulfilled the analytic framework envisioned in [RFC2330].
这些特性是所有吞吐量最大化协议如何与Internet交互所固有的动态平衡行为的结果。这些协议依赖于基于估计网络度量的控制系统来调节发送到网络中的数据量。分组发送特性反过来改变由控制系统度量估计的网络特性，使得每个传输特性和每个估计度量之间存在循环依赖性。由于其中一些相关性是非线性的，所以整个系统是非线性的，任何地方的任何变化都会导致难以预测的网络指标响应。因此，散装运输能力指标未达到[RFC2330]中设想的分析框架。
Model-Based Metrics overcome these problems by making the measurement system open loop: the packet transfer statistics (akin to the network estimators) do not affect the traffic or traffic patterns (bursts), which are computed on the basis of the Target Transport Performance. A path or subpath meeting the Target Transfer Performance
基于模型的度量通过使测量系统开环来克服这些问题：分组传输统计（类似于网络估计器）不会影响基于目标传输性能计算的流量或流量模式（突发）。满足目标传输性能的路径或子路径
requirements would exhibit packet transfer statistics and estimated metrics that would not cause the control system to slow the traffic below the Target Data Rate.
需求将展示数据包传输统计数据和估计指标，这些数据包传输统计数据和估计指标不会导致控制系统将流量降低到目标数据速率以下。
TCP and other self-clocked protocols (e.g., the Stream Control Transmission Protocol (SCTP)) carry the vast majority of all Internet data. Their dominant bulk data transport behavior is to have an approximately fixed quantity of data and acknowledgments (ACKs) circulating in the network. The data receiver reports arriving data by returning ACKs to the data sender, and the data sender typically responds by sending approximately the same quantity of data back into the network. The total quantity of data plus the data represented by ACKs circulating in the network is referred to as the "window". The mandatory congestion control algorithms incrementally adjust the window by sending slightly more or less data in response to each ACK. The fundamentally important property of this system is that it is self-clocked: the data transmissions are a reflection of the ACKs that were delivered by the network, and the ACKs are a reflection of the data arriving from the network.
TCP和其他自时钟协议（例如，流控制传输协议（SCTP））承载了绝大多数互联网数据。它们主要的批量数据传输行为是在网络中循环大约固定数量的数据和确认（ack）。数据接收方通过向数据发送方返回ack来报告到达的数据，数据发送方通常通过向网络发送大约相同数量的数据来响应。数据总量加上网络中循环的ack表示的数据称为“窗口”。强制拥塞控制算法通过发送稍多或稍少的数据来响应每个ACK，从而递增地调整窗口。该系统的基本重要特性是它是自时钟的：数据传输是网络发送的ack的反映，ack是来自网络的数据的反映。
A number of protocol features cause bursts of data, even in idealized networks that can be modeled as simple queuing systems.
许多协议特性导致数据突发，即使在可以建模为简单排队系统的理想网络中也是如此。
During slowstart, the IP rate is doubled on each RTT by sending twice as much data as was delivered to the receiver during the prior RTT. Each returning ACK causes the sender to transmit twice the data the ACK reported arriving at the receiver. For slowstart to be able to fill the pipe, the network must be able to tolerate slowstart bursts up to the full pipe size inflated by the anticipated window reduction on the first loss or ECN CE mark. For example, with classic Reno congestion control, an optimal slowstart has to end with a burst that is twice the bottleneck rate for one RTT in duration. This burst causes a queue that is equal to the pipe size (i.e., the window is twice the pipe size), so when the window is halved in response to the first packet loss, the new window will be the pipe size.
在slowstart期间，通过发送两倍于先前RTT期间发送到接收器的数据，每个RTT上的IP速率加倍。每个返回的ACK都会导致发送方发送两倍于ACK报告到达接收方的数据。为了使slowstart能够填充管道，管网必须能够承受slowstart爆裂，直至第一次损失或ECN CE标记上预期的窗口减少所膨胀的全部管道尺寸。例如，使用经典的雷诺拥塞控制，最佳慢启动必须以一次突发结束，该突发的持续时间是一次RTT瓶颈速率的两倍。此突发导致队列等于管道大小（即，窗口是管道大小的两倍），因此当响应第一个数据包丢失而将窗口减半时，新窗口将是管道大小。
Note that if the bottleneck IP rate is less than half of the capacity of the front path (which is almost always the case), the slowstart bursts will not by themselves cause significant queues anywhere else along the front path; they primarily exercise the queue at the dominant bottleneck.
请注意，如果瓶颈IP速率小于前端路径容量的一半（几乎总是这样），则slowstart突发本身不会在前端路径的任何其他位置造成显著的队列；他们主要在主要瓶颈处排队。
Several common efficiency algorithms also cause bursts. The self-clock is typically applied to groups of packets: the receiver's delayed ACK algorithm generally sends only one ACK per two data segments. Furthermore, modern senders use TCP segmentation offload
几种常见的高效算法也会导致突发事件。自时钟通常应用于分组：接收机的延迟ACK算法通常每两个数据段只发送一个ACK。此外，现代发送方使用TCP分段卸载
(TSO) to reduce CPU overhead. The sender's software stack builds super-sized TCP segments that the TSO hardware splits into MTU-sized segments on the wire. The net effect of TSO, delayed ACK, and other efficiency algorithms is to send bursts of segments at full sender interface rate.
（TSO）以减少CPU开销。发送方的软件堆栈构建超大TCP段，TSO硬件在线路上将其拆分为MTU大小的段。TSO、延迟ACK和其他高效算法的净效果是以全发送方接口速率发送突发段。
Note that these efficiency algorithms are almost always in effect, including during slowstart, such that slowstart typically has a two-level burst structure. Section 6.1 describes slowstart in more detail.
请注意，这些效率算法几乎总是有效的，包括在slowstart期间，因此slowstart通常具有两级突发结构。第6.1节更详细地描述了slowstart。
Additional sources of bursts include TCP's initial window [RFC6928], application pauses, channel allocation mechanisms, and network devices that schedule ACKs. Appendix B describes these last two items. If the application pauses (e.g., stops reading or writing data) for some fraction of an RTT, many TCP implementations catch up to their earlier window size by sending a burst of data at the full sender interface rate. To fill a network with a realistic application, the network has to be able to tolerate sender interface rate bursts large enough to restore the prior window following application pauses.
突发的其他来源包括TCP的初始窗口[RFC6928]、应用程序暂停、通道分配机制和调度ACK的网络设备。附录B描述了最后两项。如果应用程序暂停（例如，停止读取或写入数据）RTT的某一部分，许多TCP实现通过以完全发送方接口速率发送突发数据来赶上其早期的窗口大小。要用真实的应用程序填充网络，网络必须能够容忍足够大的发送方接口速率突发，以便在应用程序暂停后恢复先前的窗口。
Although the sender interface rate bursts are typically smaller than the last burst of a slowstart, they are at a higher IP rate so they potentially exercise queues at arbitrary points along the front path from the data sender up to and including the queue at the dominant bottleneck. It is known that these bursts can hurt network performance, especially in conjunction with other queue pressure; however, we are not aware of any models for estimating the impact or prescribing limits on the size or frequency of sender rate bursts.
虽然发送方接口速率突发通常比slowstart的最后一个突发小，但它们的IP速率更高，因此它们可能在从数据发送方到主要瓶颈的前端路径（包括该队列）的任意点上执行队列。众所周知，这些突发会影响网络性能，尤其是与其他队列压力相结合时；然而，我们不知道有任何模型用于估计发送速率突发的大小或频率的影响或规定限制。
In conclusion, to verify that a path can meet a Target Transport Performance, it is necessary to independently confirm that the path can tolerate bursts at the scales that can be caused by the above mechanisms. Three cases are believed to be sufficient:
总之，为了验证路径能够满足目标传输性能，有必要独立确认路径能够承受上述机制可能导致的规模的突发。三个案例被认为是足够的：
o Two-level slowstart bursts sufficient to get connections started properly.
o 两级slowstart突发足以正确启动连接。
o Ubiquitous sender interface rate bursts caused by efficiency algorithms. We assume four packet bursts to be the most common case, since it matches the effects of delayed ACK during slowstart. These bursts should be assumed not to significantly affect packet transfer statistics.
o 效率算法引起的无处不在的发送方接口速率突发。我们假设四个数据包突发是最常见的情况，因为它与slowstart期间延迟ACK的影响相匹配。应假定这些突发不会显著影响数据包传输统计。
o Infrequent sender interface rate bursts that are the maximum of the full target_window_size and the initial window size (10 segments in [RFC6928]). The target_run_length may be derated for these large fast bursts.
o 不频繁的发送方接口速率突发，最大为完整目标窗口大小和初始窗口大小（RFC6928中的10段）。对于这些大的快速爆发，目标运行长度可能会降低。
If a subpath can meet the required packet loss ratio for bursts at all of these scales, then it has sufficient buffering at all potential bottlenecks to tolerate any of the bursts that are likely introduced by TCP or other transport protocols.
如果子路径能够满足所有这些规模的突发所需的丢包率，那么它在所有潜在瓶颈处都有足够的缓冲，以容忍TCP或其他传输协议可能引入的任何突发。
A complete path is expected to be able to attain a specified Bulk Transport Capacity if the path's RTT is equal to or smaller than the Target RTT, the path's MTU is equal to or larger than the Target MTU, and all of the following conditions are met:
如果路径的RTT等于或小于目标RTT，路径的MTU等于或大于目标MTU，并且满足以下所有条件，则完整路径预计能够达到指定的批量传输容量：
1. The IP capacity is above the Target Data Rate by a sufficient margin to cover all TCP/IP overheads. This can be confirmed by the tests described in Section 8.1 or any number of IP capacity tests adapted to implement MBM.
1. IP容量比目标数据速率高出足够的裕度，足以覆盖所有TCP/IP开销。这可以通过第8.1节中所述的测试或适用于实施MBM的任何数量的IP容量测试来确认。
2. The observed packet transfer statistics are better than required by a suitable TCP performance model (e.g., fewer packet losses or ECN CE marks). See Section 8.1 or any number of low- or fixed-rate packet loss tests outside of MBM.
2. 观察到的数据包传输统计数据优于合适的TCP性能模型所要求的数据包传输统计数据（例如，更少的数据包丢失或ECN CE标记）。参见第8.1节或MBM以外的任何数量的低或固定速率丢包测试。
3. There is sufficient buffering at the dominant bottleneck to absorb a slowstart burst large enough to get the flow out of slowstart at a suitable window size. See Section 8.3.
3. 在主要瓶颈处有足够的缓冲来吸收足够大的slowstart突发，以便在合适的窗口大小下从slowstart流出流量。见第8.3节。
4. There is sufficient buffering in the front path to absorb and smooth sender interface rate bursts at all scales that are likely to be generated by the application, any channel arbitration in the ACK path, or any other mechanisms. See Section 8.4.
4. 前端路径中有足够的缓冲，以吸收和平滑应用程序、ACK路径中的任何信道仲裁或任何其他机制可能产生的所有规模的发送方接口速率突发。见第8.4节。
5. When there is a slowly rising standing queue at the bottleneck, then the onset of packet loss has to be at an appropriate point (in time or in queue depth) and has to be progressive, for example, by use of Active Queue Management [RFC7567]. See Section 8.2.
5. 当瓶颈处存在缓慢上升的站立队列时，则数据包丢失必须在适当的时间点（时间或队列深度）开始，并且必须是渐进的，例如，通过使用主动队列管理[RFC7567]。见第8.2节。
6. When there is a standing queue at a bottleneck for a shared media subpath (e.g., a half-duplex link), there must be a suitable bound on the interaction between ACKs and data, for example, due to the channel arbitration mechanism. See Section 8.2.4.
6. 当共享媒体子路径（例如，半双工链路）的瓶颈处有一个固定队列时，例如，由于信道仲裁机制，ACK和数据之间的交互必须有一个合适的界限。见第8.2.4节。
Note that conditions 1 through 4 require capacity tests for validation and thus may need to be monitored on an ongoing basis. Conditions 5 and 6 require engineering tests, which are best performed in controlled environments (e.g., bench tests). They won't generally fail due to load but may fail in the field (e.g., due to configuration errors, etc.) and thus should be spot checked.
请注意，条件1至4要求进行验证能力测试，因此可能需要持续监控。条件5和6要求工程试验，最好在受控环境中进行（例如，台架试验）。它们通常不会因负载而失败，但可能会在现场失败（例如，由于配置错误等），因此应进行抽查。
A tool that can perform many of the tests is available from [MBMSource].
可以执行许多测试的工具可从[MBMSource]获得。
Model-Based Metrics are designed to fulfill some additional requirements that were not recognized at the time RFC 2330 [RFC2330] was published. These missing requirements may have significantly contributed to policy difficulties in the IP measurement space. Some additional requirements are:
基于模型的指标旨在满足RFC 2330[RFC2330]发布时未被认可的一些额外需求。这些缺失的要求可能在很大程度上导致了IP测量领域的政策困难。一些额外要求是：
o IP metrics must be actionable by the ISP -- they have to be interpreted in terms of behaviors or properties at the IP or lower layers that an ISP can test, repair, and verify.
o IP指标必须是可由ISP执行的——它们必须根据ISP可以测试、修复和验证的IP或更低层的行为或属性进行解释。
o Metrics should be spatially composable, such that measures of concatenated paths should be predictable from subpaths.
o 度量应该是空间上可组合的，这样连接路径的度量应该可以从子路径预测。
o Metrics must be vantage point invariant over a significant range of measurement point choices, including off-path measurement points. The only requirements for Measurement Point (MP) selection should be that the RTT between the MPs is below some reasonable bound and that the effects of the "test leads" connecting MPs to the subpath under test can be calibrated out of the measurements. The latter might be accomplished if the test leads are effectively ideal or their properties can be deducted from the measurements between the MPs. While many tests require that the test leads have at least as much IP capacity as the subpath under test, some do not, for example, the Background Packet Transfer Statistics Tests described in Section 8.1.3.
o 度量必须在测量点选择的重要范围内保持有利点不变，包括非路径测量点。选择测量点（MP）的唯一要求是，MPs之间的RTT低于某个合理界限，并且连接MPs与被测子路径的“测试引线”的影响可以在测量之外进行校准。如果测试引线非常理想，或者可以从MPs之间的测量值中扣除其特性，则可以实现后者。虽然许多测试要求测试引线的IP容量至少与被测子路径的IP容量相同，但有些测试不要求，例如，第8.1.3节中描述的后台数据包传输统计测试。
o Metric measurements should be repeatable by multiple parties with no specialized access to MPs or diagnostic infrastructure. It should be possible for different parties to make the same measurement and observe the same results. In particular, it is important that both a consumer (or the consumer's delegate) and ISP be able to perform the same measurement and get the same result. Note that vantage independence is key to meeting this requirement.
o 计量测量应可由多方重复，且无需专门访问MPs或诊断基础设施。不同的缔约方应能够进行相同的测量并观察相同的结果。尤其重要的是，消费者（或消费者代表）和ISP能够执行相同的测量并获得相同的结果。请注意，vantage独立性是满足此要求的关键。
The target end-to-end parameters are the Target Data Rate, Target RTT, and Target MTU as defined in Section 3. These parameters are determined by the needs of the application or the ultimate end user and the complete Internet path over which the application is expected to operate. The target parameters are in units that make sense to layers above the TCP layer: payload bytes delivered to the application. They exclude overheads associated with TCP and IP headers, retransmits and other protocols (e.g., DNS). Note that IP-based network services include TCP headers and retransmissions as part of delivered payload; this difference (header_overhead) is recognized in calculations below.
目标端到端参数是第3节中定义的目标数据速率、目标RTT和目标MTU。这些参数由应用程序或最终用户的需求以及应用程序预期运行的完整Internet路径决定。目标参数的单位对TCP层之上的层有意义：交付给应用程序的有效负载字节。它们不包括与TCP和IP头、重传和其他协议（如DNS）相关的开销。注意，基于IP的网络服务包括TCP报头和作为交付有效负载的一部分的重传；这一差异（表头费用）在下面的计算中得到确认。
Other end-to-end parameters defined in Section 3 include the effective bottleneck data rate, the sender interface data rate, and the TCP and IP header sizes.
第3节中定义的其他端到端参数包括有效瓶颈数据速率、发送方接口数据速率以及TCP和IP头大小。
The target_data_rate must be smaller than all subpath IP capacities by enough headroom to carry the transport protocol overhead, explicitly including retransmissions and an allowance for fluctuations in TCP's actual data rate. Specifying a target_data_rate with insufficient headroom is likely to result in brittle measurements that have little predictive value.
目标_数据_速率必须比所有子路径IP容量小足够的净空，以承载传输协议开销，明确包括重传和允许TCP实际数据速率的波动。在净空不足的情况下指定目标数据率可能会导致脆弱的测量结果，几乎没有预测价值。
Note that the target parameters can be specified for a hypothetical path (for example, to construct TIDS designed for bench testing in the absence of a real application) or for a live in situ test of production infrastructure.
请注意，可以为假设路径指定目标参数（例如，在没有实际应用的情况下构建用于台架测试的TID）或为生产基础设施的现场测试指定目标参数。
The number of concurrent connections is explicitly not a parameter in this model. If a subpath requires multiple connections in order to meet the specified performance, that must be stated explicitly, and the procedure described in Section 6.4 applies.
并发连接的数量在此模型中不是一个参数。如果子路径需要多个连接以满足规定的性能，则必须明确说明，并且第6.4节中描述的程序适用。
The Target Transport Performance is used to derive the target_window_size and the reference target_run_length.
目标传输性能用于导出目标窗口大小和参考目标运行长度。
The target_window_size is the average window size in packets needed to meet the target_rate, for the specified target_RTT and target_MTU. To calculate target_window_size:
target_window_size是指定的target_RTT和target_MTU满足target_速率所需的数据包的平均窗口大小。要计算目标窗口大小，请执行以下操作：
target_window_size = ceiling(target_rate * target_RTT / (target_MTU -
header_overhead))
target_window_size = ceiling(target_rate * target_RTT / (target_MTU -
header_overhead))
The target_run_length is an estimate of the minimum required number of unmarked packets that must be delivered between losses or ECN CE marks, as computed by a mathematical model of TCP congestion control. The derivation here is parallel to the derivation in [MSMO97] and, by design, is quite conservative.
目标_run_length是由TCP拥塞控制的数学模型计算的必须在丢失或ECN CE标记之间传递的未标记数据包的最小所需数量的估计值。这里的推导与[MSMO97]中的推导是平行的，并且设计上相当保守。
The reference target_run_length is derived as follows. Assume the subpath_IP_capacity is infinitesimally larger than the target_data_rate plus the required header_overhead. Then, target_window_size also predicts the onset of queuing. A larger window will cause a standing queue at the bottleneck.
参考目标运行长度推导如下。假设子路径IP容量无限大，大于目标数据速率加上所需的头开销。然后，目标窗口大小也可以预测排队的开始。较大的窗口将导致瓶颈处出现站立队列。
Assume the transport protocol is using standard Reno-style Additive Increase Multiplicative Decrease (AIMD) congestion control [RFC5681] (but not Appropriate Byte Counting [RFC3465]) and the receiver is using standard delayed ACKs. Reno increases the window by one packet every pipe size worth of ACKs. With delayed ACKs, this takes two RTTs per increase. To exactly fill the pipe, the spacing of losses must be no closer than when the peak of the AIMD sawtooth reached exactly twice the target_window_size. Otherwise, the multiplicative window reduction triggered by the loss would cause the network to be underfilled. Per [MSMO97] the number of packets between losses must be the area under the AIMD sawtooth. They must be no more frequent than every 1 in ((3/2)*target_window_size)*(2*target_window_size) packets, which simplifies to:
假设传输协议使用标准雷诺式加增乘减（AIMD）拥塞控制[RFC5681]（但不是适当的字节计数[RFC3465]），并且接收器使用标准延迟ACK。雷诺每增加一个管道大小的ACK，就增加一个包的窗口。对于延迟ACK，每次增加需要两个RTT。为准确填充管道，损失间距不得小于AIMD锯齿峰值正好达到目标窗口大小两倍时的距离。否则，由丢失触发的乘法窗口缩小将导致网络填充不足。根据[MSMO97]，丢失之间的数据包数必须是AIMD锯齿下的区域。它们的频率不得超过每1英寸（（3/2）*目标窗口大小）*（2*目标窗口大小）数据包的频率，这简化为：
target_run_length = 3*(target_window_size^2)
target_run_length = 3*(target_window_size^2)
Note that this calculation is very conservative and is based on a number of assumptions that may not apply. Appendix A discusses these assumptions and provides some alternative models. If a different model is used, an FSTIDS must document the actual method for computing target_run_length and the ratio between alternate target_run_length and the reference target_run_length calculated above, along with a discussion of the rationale for the underlying assumptions.
请注意，此计算非常保守，并且基于一些可能不适用的假设。附录A讨论了这些假设，并提供了一些替代模型。如果使用不同的模型，则FSTID必须记录计算目标运行长度的实际方法、备用目标运行长度与上述计算的参考目标运行长度之间的比率，以及对基本假设的基本原理的讨论。
Most of the individual parameters for the tests in Section 8 are derived from target_window_size and target_run_length.
第8节中测试的大多数单独参数都来自目标窗口大小和目标运行长度。
Since some aspects of the models are very conservative, the MBM framework permits some latitude in derating test parameters. Rather than trying to formalize more complicated models, we permit some test parameters to be relaxed as long as they meet some additional procedural constraints:
由于模型的某些方面非常保守，MBM框架允许对试验参数进行降额。我们不尝试将更复杂的模型形式化，而是允许放宽一些测试参数，只要它们满足一些额外的程序约束：
o The FSTIDS must document and justify the actual method used to compute the derated metric parameters.
o FSTID必须记录并证明用于计算减额公制参数的实际方法。
o The validation procedures described in Section 10 must be used to demonstrate the feasibility of meeting the Target Transport Performance with infrastructure that just barely passes the derated tests.
o 第10节中所述的验证程序必须用于证明仅通过减额测试的基础设施满足目标运输性能的可行性。
o The validation process for an FSTIDS itself must be documented in such a way that other researchers can duplicate the validation experiments.
o FSTID本身的验证过程必须以其他研究人员可以复制验证实验的方式记录。
Except as noted, all tests below assume no derating. Tests for which there is not currently a well-established model for the required parameters explicitly include derating as a way to indicate flexibility in the parameters.
除非另有说明，否则以下所有试验均假定无降额。对于目前尚未建立完善的所需参数模型的试验，明确包括降额，以表明参数的灵活性。
Many tests have preconditions that are required to assure their validity. Examples include the presence or non-presence of cross traffic on specific subpaths; negotiating ECN; and a test stream preamble of appropriate length to achieve stable access to network resources in the presence of reactive network elements (as defined in Section 1.1 of [RFC7312]). If preconditions are not properly satisfied for some reason, the tests should be considered to be inconclusive. In general, it is useful to preserve diagnostic information as to why the preconditions were not met and any test data that was collected even if it is not useful for the intended test. Such diagnostic information and partial test data may be useful for improving the test or test procedures themselves.
许多测试都有确保其有效性所需的先决条件。示例包括特定子路径上是否存在交叉交通；谈判电子计算机网络；以及具有适当长度的测试流前导，以在存在反应性网络元件（如[RFC7312]第1.1节所定义）的情况下实现对网络资源的稳定访问。如果由于某种原因未适当满足先决条件，则应将试验视为非决定性试验。一般来说，保留诊断信息是有用的，这些信息包括为什么不满足先决条件以及收集的任何测试数据，即使这些数据对预期测试没有用处。此类诊断信息和部分测试数据可能有助于改进测试或测试程序本身。
It is important to preserve the record that a test was scheduled; otherwise, precondition enforcement mechanisms can introduce sampling bias. For example, canceling tests due to cross traffic on subscriber access links might introduce sampling bias in tests of the rest of the network by reducing the number of tests during peak network load.
保存测试计划的记录很重要；否则，前提条件执行机制可能会引入抽样偏差。例如，由于用户接入链路上的交叉流量而取消测试可能会通过减少峰值网络负载期间的测试次数在网络其余部分的测试中引入采样偏差。
Test preconditions and failure actions must be specified in an FSTIDS.
必须在FSTIDS中指定测试先决条件和故障操作。
Many important properties of Model-Based Metrics, such as vantage independence, are a consequence of using test streams that have temporal structures that mimic TCP or other transport protocols running over a complete path. As described in Section 4.1, self-
基于模型的度量的许多重要属性，如优势独立性，是使用具有模仿TCP或其他传输协议在完整路径上运行的时间结构的测试流的结果。如第4.1节“自我保护”所述-
clocked protocols naturally have burst structures related to the RTT and pipe size of the complete path. These bursts naturally get larger (contain more packets) as either the Target RTT or Target Data Rate get larger or the Target MTU gets smaller. An implication of these relationships is that test streams generated by running self-clocked protocols over short subpaths may not adequately exercise the queuing at any bottleneck to determine if the subpath can support the full Target Transport Performance over the complete path.
时钟协议自然具有与RTT和完整路径的管道大小相关的突发结构。随着目标RTT或目标数据速率变大或目标MTU变小，这些突发自然会变大（包含更多数据包）。这些关系的一个含义是，通过在短子路径上运行自时钟协议生成的测试流可能无法在任何瓶颈处充分执行排队，以确定子路径是否能够在完整路径上支持完整的目标传输性能。
Failing to authentically mimic TCP's temporal structure is part of the reason why simple performance tools such as iPerf, netperf, nc, etc., have the reputation for yielding false pass results over short test paths, even when a subpath has a flaw.
无法真实模拟TCP的时间结构是简单性能工具（如iPerf、netperf、nc等）在短测试路径上产生错误通过结果的部分原因，即使子路径存在缺陷。
The definitions in Section 3 are sufficient for most test streams. We describe the slowstart and standing queue test streams in more detail.
第3节中的定义适用于大多数测试流。我们将更详细地描述slowstart和standing queue测试流。
In conventional measurement practice, stochastic processes are used to eliminate many unintended correlations and sample biases. However, MBM tests are designed to explicitly mimic temporal correlations caused by network or protocol elements themselves. Some portions of these systems, such as traffic arrival (e.g., test scheduling), are naturally stochastic. Other behaviors, such as back-to-back packet transmissions, are dominated by implementation-specific deterministic effects. Although these behaviors always contain non-deterministic elements and might be modeled stochastically, these details typically do not contribute significantly to the overall system behavior. Furthermore, it is known that real protocols are subject to failures caused by network property estimators suffering from bias due to correlation in their own traffic. For example, TCP's RTT estimator used to determine the Retransmit Timeout (RTO), can be fooled by periodic cross traffic or start-stop applications. For these reasons, many details of the test streams are specified deterministically.
在传统的测量实践中，随机过程被用来消除许多非预期的相关性和样本偏差。然而，MBM测试被设计成显式地模拟由网络或协议元素本身引起的时间相关性。这些系统的某些部分，例如交通到达（例如，测试调度），自然是随机的。其他行为，如背对背的数据包传输，由特定于实现的确定性影响控制。尽管这些行为总是包含不确定的元素，并且可以随机建模，但这些细节通常不会对整个系统行为产生重大影响。此外，众所周知，实际协议会因网络属性估计器自身流量中的相关性而遭受偏差而导致失败。例如，TCP用于确定重传超时（RTO）的RTT估计器可能被周期性交叉流量或启停应用程序所愚弄。由于这些原因，确定地指定了测试流的许多细节。
It may prove useful to introduce fine-grained noise sources into the models used for generating test streams in an update of Model-Based Metrics, but the complexity is not warranted at the time this document was written.
在基于模型的度量更新中，将细粒度噪声源引入用于生成测试流的模型可能会很有用，但在编写本文档时，并不保证其复杂性。
TCP slowstart has a two-level burst structure as shown in Figure 2. The fine time structure is caused by efficiency algorithms that deliberately batch work (CPU, channel allocation, etc.) to better amortize certain network and host overheads. ACKs passing through the return path typically cause the sender to transmit small bursts
TCP slowstart具有两级突发结构，如图2所示。精细的时间结构是由效率算法造成的，这些算法故意批量工作（CPU、通道分配等），以便更好地分摊某些网络和主机开销。通过返回路径的ack通常会导致发送方发送小突发
of data at the full sender interface rate. For example, TCP Segmentation Offload (TSO) and Delayed Acknowledgment both contribute to this effect. During slowstart, these bursts are at the same headway as the returning ACKs but are typically twice as large (e.g., have twice as much data) as the ACK reported was delivered to the receiver. Due to variations in delayed ACK and algorithms such as Appropriate Byte Counting [RFC3465], different pairs of senders and receivers produce slightly different burst patterns. Without loss of generality, we assume each ACK causes four packet sender interface rate bursts at an average headway equal to the ACK headway; this corresponds to sending at an average rate equal to twice the effective bottleneck IP rate. Each slowstart burst consists of a series of four packet sender interface rate bursts such that the total number of packets is the current window size (as of the last packet in the burst).
以完全发送方接口速率传输数据。例如，TCP分段卸载（TSO）和延迟确认都会导致这种效果。在慢启动期间，这些突发与返回的ACK处于相同的间隔，但通常是发送给接收器的ACK报告的两倍大（例如，数据量是两倍）。由于延迟ACK和算法（如适当的字节计数[RFC3465]）的变化，不同的发送方和接收方对产生略有不同的突发模式。在不丧失一般性的情况下，我们假设每个ACK以等于ACK间隔的平均间隔引起四个包发送方接口速率突发；这相当于以等于有效瓶颈IP速率两倍的平均速率发送。每个slowstart突发由一系列四个数据包发送方接口速率突发组成，因此数据包总数为当前窗口大小（从突发中的最后一个数据包开始）。
The coarse time structure is due to each RTT being a reflection of the prior RTT. For real transport protocols, each slowstart burst is twice as large (twice the window) as the previous burst but is spread out in time by the network bottleneck, such that each successive RTT exhibits the same effective bottleneck IP rate. The slowstart phase ends on the first lost packet or ECN mark, which is intended to happen after successive slowstart bursts merge in time: the next burst starts before the bottleneck queue is fully drained and the prior burst is complete.
粗略的时间结构是由于每个RTT都是先前RTT的反映。对于真正的传输协议，每个slowstart突发都是前一个突发的两倍大（窗口的两倍），但会被网络瓶颈在时间上分散开来，因此每个连续的RTT显示相同的有效瓶颈IP速率。slowstart阶段在第一个丢失的数据包或ECN标记处结束，这是在连续的slowstart突发及时合并之后发生的：下一个突发在瓶颈队列完全耗尽和前一个突发完成之前开始。
For the diagnostic tests described below, we preserve the fine time structure but manipulate the coarse structure of the slowstart bursts (burst size and headway) to measure the ability of the dominant bottleneck to absorb and smooth slowstart bursts.
对于下面描述的诊断测试，我们保留了精细的时间结构，但操纵了slowstart突发的粗略结构（突发大小和间隔），以测量主要瓶颈吸收和平滑slowstart突发的能力。
Note that a stream of repeated slowstart bursts has three different average rates, depending on the averaging time interval. At the finest timescale (a few packet times at the sender interface), the peak of the average IP rate is the same as the sender interface rate; at a medium timescale (a few ACK times at the dominant bottleneck), the peak of the average IP rate is twice the implied bottleneck IP capacity; and at timescales longer than the target_RTT and when the burst size is equal to the target_window_size, the average rate is equal to the target_data_rate. This pattern corresponds to repeating the last RTT of TCP slowstart when delayed ACK and sender-side byte counting are present but without the limits specified in Appropriate Byte Counting [RFC3465].
请注意，重复的slowstart突发流具有三种不同的平均速率，具体取决于平均时间间隔。在最精细的时间尺度上（发送方接口处的几次分组），平均IP速率的峰值与发送方接口速率相同；在中等时间尺度上（主要瓶颈处的几次确认），平均IP速率的峰值是隐含瓶颈IP容量的两倍；在比目标时间长的时间尺度上，当突发大小等于目标时间窗大小时，平均速率等于目标数据速率。此模式对应于当存在延迟ACK和发送方端字节计数但没有相应字节计数[RFC3465]中规定的限制时，重复TCP slowstart的最后一次RTT。
time ==> ( - equals one packet)
time ==> ( - equals one packet)
Fine time structure of the packet stream:
分组流的精细时间结构：
---- ---- ---- ---- ----
---- ---- ---- ---- ----
|<>| sender interface rate bursts (typically 3 or 4 packets)
|<===>| burst headway (from the ACK headway)
|<>| sender interface rate bursts (typically 3 or 4 packets)
|<===>| burst headway (from the ACK headway)
\____repeating sender______/
rate bursts
\____repeating sender______/
rate bursts
Coarse (RTT-level) time structure of the packet stream:
分组流的粗略（RTT级）时间结构：
---- ---- ---- ---- ---- ---- ---- ...
---- ---- ---- ---- ---- ---- ---- ...
|<========================>| slowstart burst size (from the window)
|<==============================================>| slowstart headway
(from the RTT)
\__________________________/ \_________ ...
one slowstart burst Repeated slowstart bursts
|<========================>| slowstart burst size (from the window)
|<==============================================>| slowstart headway
(from the RTT)
\__________________________/ \_________ ...
one slowstart burst Repeated slowstart bursts
Figure 2: Multiple Levels of Slowstart Bursts
图2：多级Slowstart爆发
Pseudo constant bit rate (CBR) is implemented by running a standard self-clocked protocol such as TCP with a fixed window size. If that window size is test_window, the data rate will be slightly above the target_rate.
伪恒定比特率（CBR）是通过运行标准的自时钟协议（如具有固定窗口大小的TCP）来实现的。如果该窗口大小为test_window，则数据速率将略高于目标_速率。
Since the test_window is constrained to be an integer number of packets, for small RTTs or low data rates, there may not be sufficiently precise control over the data rate. Rounding the test_window up (as defined above) is likely to result in data rates that are higher than the target rate, but reducing the window by one packet may result in data rates that are too small. Also, cross traffic potentially raises the RTT, implicitly reducing the rate. Cross traffic that raises the RTT nearly always makes the test more strenuous (i.e., more demanding for the network path).
由于test_窗口被限制为整数个分组，对于小rtt或低数据速率，可能无法对数据速率进行足够精确的控制。向上舍入test_窗口（如上所述）可能会导致数据速率高于目标速率，但将窗口减少一个数据包可能会导致数据速率太小。此外，交叉流量可能会提高RTT，从而降低速率。提高RTT的交叉流量几乎总是使测试更加繁重（即，对网络路径的要求更高）。
Note that Constant Window Pseudo CBR (and Scanned Window Pseudo CBR in the next section) both rely on a self-clock that is at least partially derived from the properties of the subnet under test. This introduces the possibility that the subnet under test exhibits behaviors such as extreme RTT fluctuations that prevent these algorithms from accurately controlling data rates.
请注意，常量窗口伪CBR（以及下一节中的扫描窗口伪CBR）都依赖于自时钟，该自时钟至少部分来自于被测子网的属性。这就引入了这样一种可能性，即被测子网可能表现出诸如极端RTT波动等行为，从而阻止这些算法精确控制数据速率。
An FSTIDS specifying a Constant Window Pseudo CBR test must explicitly indicate under what conditions errors in the data rate cause tests to be inconclusive. Conventional paced measurement traffic may be more appropriate for these environments.
指定恒定窗口伪CBR测试的FSTID必须明确指出在什么情况下数据速率中的错误会导致测试不确定。传统的步调测量流量可能更适合这些环境。
Scanned Window Pseudo CBR is similar to the Constant Window Pseudo CBR described above, except the window is scanned across a range of sizes designed to include two key events: the onset of queuing and the onset of packet loss or ECN CE marks. The window is scanned by incrementing it by one packet every 2*target_window_size delivered packets. This mimics the additive increase phase of standard Reno TCP congestion avoidance when delayed ACKs are in effect. Normally, the window increases are separated by intervals slightly longer than twice the target_RTT.
扫描窗口伪CBR与上述恒定窗口伪CBR类似，不同之处在于，在设计为包括两个关键事件的范围内扫描窗口：队列开始和数据包丢失或ECN CE标记开始。通过每2个*目标\u窗口\u大小交付的数据包将窗口增加一个数据包来扫描窗口。这模拟了延迟确认生效时标准Reno TCP拥塞避免的加性增加阶段。通常情况下，窗口增加的间隔比目标时间的两倍稍长。
There are two ways to implement this test: 1) applying a window clamp to standard congestion control in a standard protocol such as TCP and 2) stiffening a non-standard transport protocol. When standard congestion control is in effect, any losses or ECN CE marks cause the transport to revert to a window smaller than the clamp, such that the scanning clamp loses control of the window size. The NPAD (Network Path and Application Diagnostics) pathdiag tool is an example of this class of algorithms [Pathdiag].
有两种方法可以实现此测试：1）在标准协议（如TCP）中对标准拥塞控制应用窗口钳；2）加强非标准传输协议。当标准拥塞控制生效时，任何丢失或ECN CE标记都会导致传输恢复到小于夹钳的窗口，从而使扫描夹钳失去对窗口大小的控制。NPAD（网络路径和应用程序诊断）pathdiag工具就是此类算法[pathdiag]的一个示例。
Alternatively, a non-standard congestion control algorithm can respond to losses by transmitting extra data, such that it maintains the specified window size independent of losses or ECN CE marks. Such a stiffened transport explicitly violates mandatory Internet congestion control [RFC5681] and is not suitable for in situ testing. It is only appropriate for engineering testing under laboratory conditions. The Windowed Ping tool implements such a test [WPING]. This tool has been updated (see [mpingSource]).
或者，非标准拥塞控制算法可以通过传输额外数据来响应丢失，从而保持指定的窗口大小与丢失或ECN-CE标记无关。这种加固传输明显违反了强制性互联网拥塞控制[RFC5681]，不适合现场测试。它仅适用于实验室条件下的工程测试。窗口Ping工具实现了这样的测试[WPING]。此工具已更新（请参见[mpingSource]）。
The test procedures in Section 8.2 describe how to the partition the scans into regions and how to interpret the results.
第8.2节中的测试程序描述了如何将扫描划分为多个区域以及如何解释结果。
The procedures described in this document are only directly applicable to single-stream measurement, e.g., one TCP connection or measurement stream. In an ideal world, we would disallow all performance claims based on multiple concurrent streams, but this is not practical due to at least two issues. First, many very high-rate link technologies are channelized and at last partially pin the flow-to-channel mapping to minimize packet reordering within flows.
本文件中描述的程序仅直接适用于单流测量，例如，一个TCP连接或测量流。在理想情况下，我们将不允许基于多个并发流的所有性能声明，但由于至少两个问题，这是不实际的。首先，许多高速链路技术被信道化，最后部分固定流到信道的映射，以最小化流中的数据包重新排序。
Second, TCP itself has scaling limits. Although the former problem might be overcome through different design decisions, the latter problem is more deeply rooted.
第二，TCP本身有扩展限制。虽然前一个问题可以通过不同的设计决策来克服，但后一个问题更为根深蒂固。
All congestion control algorithms that are philosophically aligned with [RFC5681] (e.g., claim some level of TCP compatibility, friendliness, or fairness) have scaling limits; that is, as a long fat network (LFN) with a fixed RTT and MTU gets faster, these congestion control algorithms get less accurate and, as a consequence, have difficulty filling the network [CCscaling]. These properties are a consequence of the original Reno AIMD congestion control design and the requirement in [RFC5681] that all transport protocols have similar responses to congestion.
所有在理论上与[RFC5681]一致的拥塞控制算法（例如，要求某种程度的TCP兼容性、友好性或公平性）都有扩展限制；也就是说，当具有固定RTT和MTU的长fat网络（LFN）变得更快时，这些拥塞控制算法变得不那么准确，因此难以填充网络[CCscaling]。这些特性是原始雷诺AIMD拥塞控制设计和[RFC5681]中要求所有传输协议对拥塞具有相似响应的结果。
There are a number of reasons to want to specify performance in terms of multiple concurrent flows; however, this approach is not recommended for data rates below several megabits per second, which can be attained with run lengths under 10000 packets on many paths. Since the required run length is proportional to the square of the data rate, at higher rates, the run lengths can be unreasonably large, and multiple flows might be the only feasible approach.
有很多原因需要指定多个并发流的性能；但是，对于每秒数兆比特以下的数据速率，不建议采用这种方法，因为在许多路径上，当运行长度低于10000个数据包时，可以达到这种速率。由于所需的运行长度与数据速率的平方成正比，在较高的速率下，运行长度可能会非常大，并且多个流可能是唯一可行的方法。
If multiple flows are deemed necessary to meet aggregate performance targets, then this must be stated both in the design of the TIDS and in any claims about network performance. The IP diagnostic tests must be performed concurrently with the specified number of connections. For the tests that use bursty test streams, the bursts should be synchronized across streams unless there is a priori knowledge that the applications have some explicit mechanism to stagger their own bursts. In the absence of an explicit mechanism to stagger bursts, many network and application artifacts will sometimes implicitly synchronize bursts. A test that does not control burst synchronization may be prone to false pass results for some applications.
如果认为需要多个流来满足总体性能目标，则必须在TID设计和任何有关网络性能的声明中说明这一点。IP诊断测试必须与指定的连接数同时执行。对于使用突发测试流的测试，应该跨流同步突发，除非事先知道应用程序有某种明确的机制来交错它们自己的突发。在缺乏交错突发的显式机制的情况下，许多网络和应用程序工件有时会隐式同步突发。对于某些应用程序，不控制突发同步的测试可能容易出现错误的通过结果。
To perform an exhaustive test of a complete network path, each test of the TIDS is applied to each subpath of the complete path. If any subpath fails any test, then a standard transport protocol running over the complete path can also be expected to fail to attain the Target Transport Performance under some conditions.
为了执行完整网络路径的穷举测试，TID的每个测试都应用于完整路径的每个子路径。如果任何子路径未通过任何测试，则在某些情况下，在完整路径上运行的标准传输协议也可能无法达到目标传输性能。
In addition to passing or failing, a test can be deemed to be inconclusive for a number of reasons. Proper instrumentation and treatment of inconclusive outcomes is critical to the accuracy and
除通过或不通过外，由于多种原因，测试也可能被视为不确定。对不确定结果进行适当的检测和处理对准确性和有效性至关重要
robustness of Model-Based Metrics. Tests can be inconclusive if the precomputed traffic pattern or data rates were not accurately generated; the measurement results were not statistically significant; the required preconditions for the test were not met; or other causes. See Section 5.4.
基于模型的度量的鲁棒性。如果未准确生成预计算的流量模式或数据速率，则测试可能不确定；测量结果无统计学意义；未满足试验所需的先决条件；或其他原因。见第5.4节。
For example, consider a test that implements Constant Window Pseudo CBR (Section 6.2) by adding rate controls and detailed IP packet transfer instrumentation to TCP (e.g., using the extended performance statistics for TCP as described in [RFC4898]). TCP includes built-in control systems that might interfere with the sending data rate. If such a test meets the required packet transfer statistics (e.g., run length) while failing to attain the specified data rate, it must be treated as an inconclusive result, because we cannot a priori determine if the reduced data rate was caused by a TCP problem or a network problem or if the reduced data rate had a material effect on the observed packet transfer statistics.
例如，考虑通过向TCP添加速率控制和详细IP分组传输测试（例如，使用在[RCFC98]中描述的TCP的扩展性能统计）来实现常数窗口伪CBR（第6.2节）的测试。TCP包含可能干扰发送数据速率的内置控制系统。如果此类测试满足所需的数据包传输统计数据（例如，运行长度），但未能达到指定的数据速率，则必须将其视为非决定性结果，因为我们无法先验地确定降低的数据速率是由TCP问题还是网络问题引起的，或者降低的数据速率是否对观察到的数据包传输统计数据有重大影响。
Note that for capacity tests, if the observed packet transfer statistics meet the statistical criteria for failing (based on acceptance of hypothesis H1 in Section 7.2), the test can be considered to have failed because it doesn't really matter that the test didn't attain the required data rate.
请注意，对于容量测试，如果观察到的数据包传输统计数据满足失败的统计标准（基于第7.2节中假设H1的接受），则可以认为测试失败，因为测试没有达到所需的数据速率并不重要。
The important new properties of MBM, such as vantage independence, are a direct consequence of opening the control loops in the protocols, such that the test stream does not depend on network conditions or IP packets received. Any mechanism that introduces feedback between the path's measurements and the test stream generation is at risk of introducing nonlinearities that spoil these properties. Any exceptional event that indicates that such feedback has happened should cause the test to be considered inconclusive.
MBM的重要新特性，如优势独立性，是打开协议中控制回路的直接结果，因此测试流不依赖于网络条件或接收的IP数据包。任何在路径测量和测试流生成之间引入反馈的机制都有引入非线性的风险，从而破坏这些属性。任何表明已发生此类反馈的异常事件应导致测试被视为不确定。
Inconclusive tests may be caused by situations in which a test outcome is ambiguous because of network limitations or an unknown limitation on the IP diagnostic test itself, which may have been caused by some uncontrolled feedback from the network.
非结论性测试可能是由于网络限制或IP诊断测试本身的未知限制导致测试结果不明确，这可能是由于来自网络的一些不受控制的反馈造成的。
Note that procedures that attempt to search the target parameter space to find the limits on a parameter such as target_data_rate are at risk of breaking the location-independent properties of Model-Based Metrics if any part of the boundary between passing, inconclusive, or failing results is sensitive to RTT (which is normally the case). For example, the maximum data rate for a marginal link (e.g., exhibiting excess errors) is likely to be sensitive to the test_path_RTT. The maximum observed data rate over the test path has very little value for predicting the maximum rate over a different path.
请注意，如果通过、非结论性或失败结果之间的任何部分边界对RTT敏感（通常情况下），则尝试搜索目标参数空间以查找参数限制（如目标数据率）的过程有可能破坏基于模型的度量的位置无关属性。例如，边缘链路的最大数据速率（例如，表现出过多的错误）可能对测试路径RTT敏感。测试路径上的最大观测数据速率对于预测不同路径上的最大速率几乎没有价值。
One of the goals for evolving TIDS designs will be to keep sharpening the distinctions between inconclusive, passing, and failing tests. The criteria for inconclusive, passing, and failing tests must be explicitly stated for every test in the TIDS or FSTIDS.
改进TIDS设计的目标之一是不断强化非决定性测试、通过测试和失败测试之间的区别。对于TID或FSTID中的每项测试，必须明确说明非决定性、通过和失败测试的标准。
One of the goals for evolving the testing process, procedures, tools, and measurement point selection should be to minimize the number of inconclusive tests.
发展测试过程、程序、工具和测量点选择的目标之一应该是最小化非决定性测试的数量。
It may be useful to keep raw packet transfer statistics and ancillary metrics [RFC3148] for deeper study of the behavior of the network path and to measure the tools themselves. Raw packet transfer statistics can help to drive tool evolution. Under some conditions, it might be possible to re-evaluate the raw data for satisfying alternate Target Transport Performance. However, it is important to guard against sampling bias and other implicit feedback that can cause false results and exhibit measurement point vantage sensitivity. Simply applying different delivery criteria based on a different Target Transport Performance is insufficient if the test traffic patterns (bursts, etc.) do not match the alternate Target Transport Performance.
保存原始数据包传输统计数据和辅助度量[RFC3148]可能有助于深入研究网络路径的行为，并测量工具本身。原始数据包传输统计数据有助于推动工具的发展。在某些条件下，可能需要重新评估原始数据，以满足备用目标传输性能。然而，重要的是要防止取样偏差和其他可能导致错误结果和显示测量点优势灵敏度的隐式反馈。如果测试流量模式（突发等）与备用目标传输性能不匹配，则仅基于不同的目标传输性能应用不同的传输标准是不够的。
When evaluating the observed run_length, we need to determine appropriate packet stream sizes and acceptable error levels for efficient measurement. In practice, can we compare the empirically estimated packet loss and ECN CE marking ratios with the targets as the sample size grows? How large a sample is needed to say that the measurements of packet transfer indicate a particular run length is present?
在评估观察到的运行长度时，我们需要确定适当的数据包流大小和可接受的错误级别，以便进行有效的测量。在实践中，随着样本量的增加，我们能否将经验估计的数据包丢失率和ECN CE标记率与目标进行比较？需要多大的样本才能说明数据包传输的测量结果表明存在特定的运行长度？
The generalized measurement can be described as recursive testing: send packets (individually or in patterns) and observe the packet transfer performance (packet loss ratio, other metric, or any marking we define).
广义测量可以描述为递归测试：发送数据包（单独或以模式）并观察数据包传输性能（数据包丢失率、其他度量或我们定义的任何标记）。
As each packet is sent and measured, we have an ongoing estimate of the performance in terms of the ratio of packet loss or ECN CE marks to total packets (i.e., an empirical probability). We continue to send until conditions support a conclusion or a maximum sending limit has been reached.
在发送和测量每个数据包时，我们根据数据包丢失或ECN CE标记与总数据包的比率（即经验概率）对性能进行持续估计。我们将继续发送，直到支持结论的条件或达到最大发送限制为止。
We have a target_mark_probability, one mark per target_run_length, where a "mark" is defined as a lost packet, a packet with ECN CE mark, or other signal. This constitutes the null hypothesis:
我们有一个目标标记概率，每个目标运行长度一个标记，其中“标记”定义为丢失的数据包、带有ECN CE标记的数据包或其他信号。这构成了无效假设：
H0: no more than one mark in target_run_length =
3*(target_window_size)^2 packets
H0: no more than one mark in target_run_length =
3*(target_window_size)^2 packets
We can stop sending packets if ongoing measurements support accepting H0 with the specified Type I error = alpha (= 0.05, for example).
如果正在进行的测量支持接受带有指定I型错误=alpha（=0.05，例如）的H0，则可以停止发送数据包。
We also have an alternative hypothesis to evaluate: is performance significantly lower than the target_mark_probability? Based on analysis of typical values and practical limits on measurement duration, we choose four times the H0 probability:
我们还有另一个假设需要评估：绩效是否显著低于目标得分概率？基于对典型值和测量持续时间的实际限制的分析，我们选择四倍H0概率：
H1: one or more marks in (target_run_length/4) packets
H1：（目标运行长度/4）数据包中的一个或多个标记
and we can stop sending packets if measurements support rejecting H0 with the specified Type II error = beta (= 0.05, for example), thus preferring the alternate hypothesis H1.
如果测量支持以指定的II型错误=beta（=0.05，例如）拒绝H0，那么我们可以停止发送数据包，从而更倾向于备选假设H1。
H0 and H1 constitute the success and failure outcomes described elsewhere in this document; while the ongoing measurements do not support either hypothesis, the current status of measurements is inconclusive.
H0和H1构成本文件其他部分描述的成功和失败结果；虽然正在进行的测量不支持这两种假设，但测量的当前状态是不确定的。
The problem above is formulated to match the Sequential Probability Ratio Test (SPRT) [Wald45] [Montgomery90]. Note that as originally framed, the events under consideration were all manufacturing defects. In networking, ECN CE marks and lost packets are not defects but signals, indicating that the transport protocol should slow down.
上面的问题是为了匹配顺序概率比检验（SPRT）[Wald45][Montgomery90]。请注意，如最初所述，所考虑的事件均为制造缺陷。在网络中，ECN CE标记和丢失的数据包不是缺陷，而是信号，表明传输协议应该减速。
The Sequential Probability Ratio Test also starts with a pair of hypotheses specified as above:
顺序概率比测试也从如上所述的一对假设开始：
H0: p0 = one defect in target_run_length
H0:p0=目标运行长度中的一个缺陷
H1: p1 = one defect in target_run_length/4
H1: p1 = one defect in target_run_length/4
As packets are sent and measurements collected, the tester evaluates the cumulative defect count against two boundaries representing H0 Acceptance or Rejection (and acceptance of H1):
在发送数据包和收集测量数据时，测试人员根据表示H0接受或拒绝（以及H1接受）的两个边界评估累积缺陷计数：
Acceptance line: Xa = -h1 + s*n
Acceptance line: Xa = -h1 + s*n
Rejection line: Xr = h2 + s*n
Rejection line: Xr = h2 + s*n
where n increases linearly for each packet sent and
其中n对于发送的每个数据包线性增加，并且
h1 = { log((1-alpha)/beta) }/k
h1 = { log((1-alpha)/beta) }/k
h2 = { log((1-beta)/alpha) }/k
h2 = { log((1-beta)/alpha) }/k
k = log{ (p1(1-p0)) / (p0(1-p1)) }
k = log{ (p1(1-p0)) / (p0(1-p1)) }
s = [ log{ (1-p0)/(1-p1) } ]/k
s = [ log{ (1-p0)/(1-p1) } ]/k
for p0 and p1 as defined in the null and alternative hypotheses statements above, and alpha and beta as the Type I and Type II errors.
对于上述零假设和替代假设陈述中定义的p0和p1，α和β为I型和II型误差。
The SPRT specifies simple stopping rules:
SPRT指定了简单的停止规则：
o Xa < defect_count(n) < Xr: continue testing
o Xa<defect\u count（n）<Xr：继续测试
o defect_count(n) <= Xa: Accept H0
o 缺陷计数（n）<=Xa：接受H0
o defect_count(n) >= Xr: Accept H1
o 缺陷计数（n）>=Xr:Accept H1
The calculations above are implemented in the R-tool for Statistical Analysis [Rtool], in the add-on package for Cross-Validation via Sequential Testing (CVST) [CVST].
上述计算在R-tool for Statistic Analysis[Rtool]中实现，在附加包中通过顺序测试（CVST）[CVST]进行交叉验证。
Using the equations above, we can calculate the minimum number of packets (n) needed to accept H0 when x defects are observed. For example, when x = 0:
利用上述方程，我们可以计算出当观察到x缺陷时接受H0所需的最小数据包数（n）。例如，当x=0时：
Xa = 0 = -h1 + s*n
Xa = 0 = -h1 + s*n
and n = h1 / s
n=h1/s
Note that the derivations in [Wald45] and [Montgomery90] differ. Montgomery's simplified derivation of SPRT may assume a Bernoulli processes, where the packet loss probabilities are independent and identically distributed, making the SPRT more accessible. Wald's seminal paper showed that this assumption is not necessary. It helps to remember that the goal of SPRT is not to estimate the value of the packet loss rate but only whether or not the packet loss ratio is likely (1) low enough (when we accept the H0 null hypothesis), yielding success or (2) too high (when we accept the H1 alternate hypothesis), yielding failure.
请注意，[Wald45]和[Montgomery90]中的推导不同。蒙哥马利对SPRT的简化推导可以假设一个伯努利过程，其中丢包概率是独立且相同分布的，使得SPRT更容易访问。瓦尔德的开创性论文表明，这种假设是没有必要的。这有助于记住，SPRT的目标不是估计丢包率的值，而是仅评估丢包率是否可能（1）足够低（当我们接受H0零假设时），是否产生成功（2）过高（当我们接受H1替代假设时），是否产生失败。
All tests must be instrumented for packet-level reordering [RFC4737]. However, there is no consensus for how much reordering should be acceptable. Over the last two decades, the general trend has been to
必须对所有测试进行数据包级重新排序[RFC4737]。然而，对于多少重新排序是可以接受的，还没有达成共识。在过去二十年中，总的趋势是
make protocols and applications more tolerant to reordering (for example, see [RFC5827]), in response to the gradual increase in reordering in the network. This increase has been due to the deployment of technologies such as multithreaded routing lookups and Equal-Cost Multipath (ECMP) routing. These techniques increase parallelism in the network and are critical to enabling overall Internet growth to exceed Moore's Law.
使协议和应用程序更能容忍重新排序（例如，参见[RFC5827]），以响应网络中重新排序的逐渐增加。这一增长归因于多线程路由查找和等成本多路径（ECMP）路由等技术的部署。这些技术提高了网络的并行性，对于使互联网的总体增长超过摩尔定律至关重要。
With transport retransmission strategies, there are fundamental trade-offs among reordering tolerance, how quickly losses can be repaired, and overhead from spurious retransmissions. In advance of new retransmission strategies, we propose the following strawman: transport protocols should be able to adapt to reordering as long as the reordering extent is not more than the maximum of one quarter window or 1 ms, whichever is larger. (These values come from experience prototyping Early Retransmit [RFC5827] and related algorithms. They agree with the values being proposed for "RACK: a time-based fast loss detection algorithm" [RACK].) Within this limit on reorder extent, there should be no bound on reordering density.
对于传输重新传输策略，在重新排序容差、修复损失的速度以及虚假重新传输的开销之间存在着基本的权衡。在新的重传策略之前，我们提出了以下斯特劳曼：传输协议应该能够适应重传，只要重传范围不超过1/4窗口或1ms（以较大者为准）的最大值。（这些值来自经验原型设计早期重传[RFC5827]和相关算法。它们与“机架：一种基于时间的快速丢失检测算法”[RACK]的建议值一致。）在重新排序范围的限制范围内，应该没有重新排序密度的限制。
By implication, recording that is less than these bounds should not be treated as a network impairment. However, [RFC4737] still applies: reordering should be instrumented, and the maximum reordering that can be properly characterized by the test (because of the bound on history buffers) should be recorded with the measurement results.
言下之意，小于这些界限的记录不应被视为网络损伤。但是，[RFC4737]仍然适用：应检测重新排序，并且可以通过测试正确表征的最大重新排序（由于历史缓冲区的限制）应与测量结果一起记录。
Reordering tolerance and diagnostic limitations, such as the size of the history buffer used to diagnose packets that are way out of order, must be specified in an FSTIDS.
必须在FSTIDS中指定重新排序容差和诊断限制，例如用于诊断顺序错误的数据包的历史缓冲区的大小。
The IP diagnostic tests below are organized according to the technique used to generate the test stream as described in Section 6. All of the results are evaluated in accordance with Section 7, possibly with additional test-specific criteria.
下面的IP诊断测试是根据第6节中描述的用于生成测试流的技术组织的。根据第7节的要求对所有结果进行评估，可能还有额外的试验特定标准。
We also introduce some combined tests that are more efficient when networks are expected to pass but conflate diagnostic signatures when they fail.
我们还介绍了一些组合测试，这些测试在网络预期通过时更有效，但在网络失败时会合并诊断特征。
We propose several versions of the basic data rate and packet transfer statistics test that differ in how the data rate is controlled. The data can be paced on a timer or window controlled (and self-clocked). The first two tests implicitly confirm that
我们提出了几个版本的基本数据速率和数据包传输统计测试，它们在数据速率的控制方式上有所不同。数据可以在定时器或窗口控制（和自时钟）上进行调整。前两个测试隐含地证实了这一点
sub_path has sufficient raw capacity to carry the target_data_rate. They are recommended for relatively infrequent testing, such as an installation or periodic auditing process. The third test, Background Packet Transfer Statistics, is a low-rate test designed for ongoing monitoring for changes in subpath quality.
子路径有足够的原始容量来承载目标数据速率。建议将它们用于相对不频繁的测试，例如安装或定期审核过程。第三个测试，后台数据包传输统计，是一个低速率测试，用于持续监控子路径质量的变化。
This test confirms that the observed run length is at least the target_run_length while relying on timer to send data at the target_rate using the procedure described in Section 6.1 with a burst size of 1 (single packets) or 2 (packet pairs).
该测试确认观察到的运行长度至少为目标运行长度，同时使用第6.1节中描述的程序，使用突发大小为1（单个数据包）或2（数据包对）的定时器以目标运行速率发送数据。
The test is considered to be inconclusive if the packet transmission cannot be accurately controlled for any reason.
如果由于任何原因无法准确控制数据包传输，则该测试被认为是不确定的。
RFC 6673 [RFC6673] is appropriate for measuring packet transfer statistics at full data rate.
RFC 6673[RFC6673]适用于以全数据速率测量数据包传输统计信息。
This test confirms that the observed run length is at least the target_run_length while sending at an average rate approximately equal to the target_data_rate, by controlling (or clamping) the window size of a conventional transport protocol to test_window.
该测试通过控制（或钳制）传统传输协议的窗口大小来测试窗口，以大约等于目标数据速率的平均速率发送时，确认观察到的运行长度至少为目标运行长度。
Since losses and ECN CE marks cause transport protocols to reduce their data rates, this test is expected to be less precise about controlling its data rate. It should not be considered inconclusive as long as at least some of the round trips reached the full target_data_rate without incurring losses or ECN CE marks. To pass this test, the network must deliver target_window_size packets in target_RTT time without any losses or ECN CE marks at least once per two target_window_size round trips, in addition to meeting the run length statistical test.
由于丢失和ECN CE标记会导致传输协议降低其数据速率，因此预计该测试在控制其数据速率方面的精确度较低。只要至少部分往返行程达到了完整的目标数据率，且未造成损失或ECN CE分数，则不应视为不确定。为了通过此测试，除了满足运行长度统计测试外，网络必须在目标RTT时间内交付目标窗口大小的数据包，且每两次目标窗口大小往返至少一次，且无任何损失或ECN CE标记。
The Background Packet Transfer Statistics Test is a low-rate version of the target rate test above, designed for ongoing lightweight monitoring for changes in the observed subpath run length without disrupting users. It should be used in conjunction with one of the above full-rate tests because it does not confirm that the subpath can support raw data rate.
后台数据包传输统计测试是上述目标速率测试的低速版本，旨在对观察到的子路径运行长度的变化进行持续的轻量级监视，而不会中断用户。它应该与上面的一个全速率测试结合使用，因为它不能确认子路径是否支持原始数据速率。
RFC 6673 [RFC6673] is appropriate for measuring background packet transfer statistics.
RFC 6673[RFC6673]适用于测量后台数据包传输统计信息。
These engineering tests confirm that the bottleneck is well behaved across the onset of packet loss, which typically follows after the onset of queuing. Well behaved generally means lossless for transient queues, but once the queue has been sustained for a sufficient period of time (or reaches a sufficient queue depth), there should be a small number of losses or ECN CE marks to signal to the transport protocol that it should reduce its window or data rate. Losses that are too early can prevent the transport from averaging at the target_data_rate. Losses that are too late indicate that the queue might not have an appropriate AQM [RFC7567] and, as a consequence, be subject to bufferbloat [wikiBloat]. Queues without AQM have the potential to inflict excess delays on all flows sharing the bottleneck. Excess losses (more than half of the window) at the onset of loss make loss recovery problematic for the transport protocol. Non-linear, erratic, or excessive RTT increases suggest poor interactions between the channel acquisition algorithms and the transport self-clock. All of the tests in this section use the same basic scanning algorithm, described here, but score the link or subpath on the basis of how well it avoids each of these problems.
这些工程测试证实，瓶颈在分组丢失开始时表现良好，而分组丢失通常发生在排队开始后。对于瞬态队列而言，良好行为通常意味着无损，但一旦队列持续足够长的时间（或达到足够的队列深度），则应存在少量的丢失或ECN CE标记，以向传输协议发出信号，表明其应减少其窗口或数据速率。过早的丢失可能会阻止传输以目标数据速率进行平均。太晚的丢失表示队列可能没有适当的AQM[RFC7567]，因此可能会受到bufferbloat[wikiBloat]的影响。没有AQM的队列有可能对共享瓶颈的所有流造成过度延迟。丢失开始时的过度丢失（超过窗口的一半）会使传输协议的丢失恢复出现问题。非线性、不稳定或过大的RTT增加表明信道捕获算法和传输自时钟之间的交互作用较差。本节中的所有测试都使用相同的基本扫描算法（如本文所述），但根据避免这些问题的程度对链接或子路径进行评分。
Some network technologies rely on virtual queues or other techniques to meter traffic without adding any queuing delay, in which case the data rate will vary with the window size all the way up to the onset of load-induced packet loss or ECN CE marks. For these technologies, the discussion of queuing in Section 6.3 does not apply, but it is still necessary to confirm that the onset of losses or ECN CE marks be at an appropriate point and progressive. If the network bottleneck does not introduce significant queuing delay, modify the procedure described in Section 6.3 to start the scan at a window equal to or slightly smaller than the test_window.
一些网络技术依赖于虚拟队列或其他技术来计量流量，而不增加任何排队延迟，在这种情况下，数据速率将随窗口大小而变化，一直到负载引起的数据包丢失或ECN CE标记开始。对于这些技术，第6.3节中关于排队的讨论不适用，但仍有必要确认损失或ECN CE标记的起始点在适当的点上，并且是渐进的。如果网络瓶颈没有引入明显的排队延迟，请修改第6.3节中描述的程序，以在等于或略小于测试窗口的窗口开始扫描。
Use the procedure in Section 6.3 to sweep the window across the onset of queuing and the onset of loss. The tests below all assume that the scan emulates standard additive increase and delayed ACK by incrementing the window by one packet for every 2*target_window_size packets delivered. A scan can typically be divided into three regions: below the onset of queuing, a standing queue, and at or beyond the onset of loss.
使用第6.3节中的程序，在排队开始和损失开始时扫过窗口。下面的测试都假设扫描模拟标准的加性增加和延迟ACK，即每发送2*个目标窗口大小的数据包，将窗口增加一个数据包。扫描通常可分为三个区域：排队开始下方、站立队列和丢失开始时或之后。
Below the onset of queuing, the RTT is typically fairly constant, and the data rate varies in proportion to the window size. Once the data rate reaches the subpath IP rate, the data rate becomes fairly constant, and the RTT increases in proportion to the increase in window size. The precise transition across the start of queuing can be identified by the maximum network power, defined to be the ratio
在排队开始之前，RTT通常相当恒定，数据速率随窗口大小成比例变化。一旦数据速率达到子路径IP速率，数据速率将变得相当恒定，RTT将随着窗口大小的增加而成比例增加。通过最大网络功率（定义为比率），可以确定排队开始时的精确过渡
data rate over the RTT. The network power can be computed at each window size, and the window with the maximum is taken as the start of the queuing region.
RTT上的数据速率。可以在每个窗口大小下计算网络功率，并将具有最大值的窗口作为排队区域的起点。
If there is random background loss (e.g., bit errors), precise determination of the onset of queue-induced packet loss may require multiple scans. At window sizes large enough to cause loss in queues, all transport protocols are expected to experience periodic losses determined by the interaction between the congestion control and AQM algorithms. For standard congestion control algorithms, the periodic losses are likely to be relatively widely spaced, and the details are typically dominated by the behavior of the transport protocol itself. For the case of stiffened transport protocols (with non-standard, aggressive congestion control algorithms), the details of periodic losses will be dominated by how the window increase function responds to loss.
如果存在随机背景丢失（例如，位错误），则可能需要多次扫描才能精确确定队列引起的数据包丢失的开始。当窗口大小足以导致队列丢失时，所有传输协议都会经历由拥塞控制和AQM算法之间的交互确定的周期性丢失。对于标准的拥塞控制算法，周期性的丢失很可能是相对较宽的间隔，并且细节通常由传输协议本身的行为决定。对于强化传输协议（使用非标准、积极的拥塞控制算法），周期性丢失的细节将取决于窗口增加函数如何响应丢失。
A subpath passes the congestion avoidance standing queue test if more than target_run_length packets are delivered between the onset of queuing (as determined by the window with the maximum network power as described above) and the first loss or ECN CE mark. If this test is implemented using a standard congestion control algorithm with a clamp, it can be performed in situ in the production internet as a capacity test. For an example of such a test, see [Pathdiag].
如果在排队开始（由具有如上所述的最大网络功率的窗口确定）和第一个丢失或ECN CE标记之间传递了超过目标运行长度的数据包，则子路径通过拥塞避免常设队列测试。如果此测试是使用标准的拥塞控制算法和钳制来实现的，则可以在生产互联网上原位执行，作为容量测试。有关此类测试的示例，请参见[Pathdiag]。
For technologies that do not have conventional queues, use the test_window in place of the onset of queuing. That is, a subpath passes the congestion avoidance standing queue test if more than target_run_length packets are delivered between the start of the scan at test_window and the first loss or ECN CE mark.
对于没有常规队列的技术，使用test_窗口代替队列开始。也就是说，如果在“测试时扫描”窗口的开始和第一个丢失或ECN CE标记之间传递了超过目标运行长度的数据包，则子路径通过拥塞避免站立队列测试。
This test confirms that there is some mechanism to limit buffer occupancy (e.g., that prevents bufferbloat). Note that this is not strictly a requirement for single-stream bulk transport capacity; however, if there is no mechanism to limit buffer queue occupancy, then a single stream with sufficient data to deliver is likely to cause the problems described in [RFC7567] and [wikiBloat]. This may cause only minor symptoms for the dominant flow but has the potential to make the subpath unusable for other flows and applications.
此测试确认存在一些限制缓冲区占用的机制（例如，防止缓冲区膨胀）。请注意，这并不是单流散装运输能力的严格要求；但是，如果没有限制缓冲区队列占用的机制，那么具有足够数据的单个流可能会导致[RFC7567]和[wikiBloat]中描述的问题。这可能只会导致主流出现轻微症状，但有可能使子路径无法用于其他流和应用程序。
The test will pass if the onset of loss occurs before a standing queue has introduced delay greater than twice the target_RTT or another well-defined and specified limit. Note that there is not yet a model for how much standing queue is acceptable. The factor of two
如果丢失发生在站立队列引入的延迟大于目标RTT的两倍或另一个定义明确且指定的限制之前，则测试将通过。请注意，目前还没有一个模型来说明站立队列的数量是可以接受的。二的因素
chosen here reflects a rule of thumb. In conjunction with the previous test, this test implies that the first loss should occur at a queuing delay that is between one and two times the target_RTT.
这里的选择反映了经验法则。结合前面的测试，该测试意味着第一次丢失应该发生在一个队列延迟上，该队列延迟在目标时间的1到2倍之间。
Specified RTT limits that are larger than twice the target_RTT must be fully justified in the FSTIDS.
大于目标RTT两倍的指定RTT限制必须在FSTID中完全合理。
This test confirms that the onset of loss is not excessive. The test will pass if losses are equal to or less than the increase in the cross traffic plus the test stream window increase since the previous RTT. This could be restated as non-decreasing total throughput of the subpath at the onset of loss. (Note that when there is a transient drop in subpath throughput and there is not already a standing queue, a subpath that passes other queue tests in this document will have sufficient queue space to hold one full RTT worth of data).
这项测试证实了损失的开始并不过度。如果损失等于或小于交叉流量的增加加上自上次RTT以来的测试流窗口增加，则测试将通过。这可以重新表述为在开始丢失时子路径的总吞吐量不减少。（请注意，当子路径吞吐量暂时下降且不存在固定队列时，通过本文档中其他队列测试的子路径将有足够的队列空间来容纳一个完整的RTT数据）。
Note that token bucket policers will not pass this test, which is as intended. TCP often stumbles badly if more than a small fraction of the packets are dropped in one RTT. Many TCP implementations will require a timeout and slowstart to recover their self-clock. Even if they can recover from the massive losses, the sudden change in available capacity at the bottleneck wastes serving and front-path capacity until TCP can adapt to the new rate [Policing].
请注意，令牌桶策略将无法通过此测试，这是预期的。如果在一个RTT中丢弃的数据包超过一小部分，TCP通常会出现严重的错误。许多TCP实现都需要超时和慢启动来恢复自身时钟。即使他们能够从巨大的损失中恢复过来，瓶颈处可用容量的突然变化也会浪费服务和前端路径容量，直到TCP能够适应新的速率[监管]。
This engineering test confirms a bound on the interactions between the forward data path and the ACK return path when they share a half-duplex link.
当前向数据路径和ACK返回路径共享半双工链路时，此工程测试确认前向数据路径和ACK返回路径之间的交互存在界限。
Some historical half-duplex technologies had the property that each direction held the channel until it completely drained its queue. When a self-clocked transport protocol, such as TCP, has data and ACKs passing in opposite directions through such a link, the behavior often reverts to stop-and-wait. Each additional packet added to the window raises the observed RTT by two packet times, once as the additional packet passes through the data path and once for the additional delay incurred by the ACK waiting on the return path.
一些历史上的半双工技术具有这样的特性：每个方向都保持通道，直到完全耗尽其队列。当自时钟传输协议（如TCP）的数据和ACK通过这样的链路以相反的方向传递时，行为通常会恢复为停止和等待。添加到窗口的每个附加数据包都会将观察到的RTT提高两倍，一次是在附加数据包通过数据路径时，一次是在ACK等待返回路径时产生的附加延迟时。
The Duplex Self-Interference Test fails if the RTT rises by more than a fixed bound above the expected queuing time computed from the excess window divided by the subpath IP capacity. This bound must be smaller than target_RTT/2 to avoid reverting to stop-and-wait behavior (e.g., data packets and ACKs both have to be released at least twice per RTT).
如果RTT上升超过预期排队时间的固定范围，则双工自干扰测试将失败，该预期排队时间是由剩余窗口除以子路径IP容量计算得出的。该界限必须小于target_RTT/2，以避免恢复到停止和等待行为（例如，每个RTT必须至少释放两次数据包和ack）。
These tests mimic slowstart: data is sent at twice the effective bottleneck rate to exercise the queue at the dominant bottleneck.
这些测试模拟slowstart：数据以有效瓶颈速率的两倍发送，以在主要瓶颈处执行队列。
This capacity test confirms that slowstart is not likely to exit prematurely. To perform this test, send slowstart bursts that are target_window_size total packets and accumulate packet transfer statistics as described in Section 7.2 to score the outcome. The test will pass if it is statistically significant that the observed number of good packets delivered between losses or ECN CE marks is larger than the target_run_length. The test will fail if it is statistically significant that the observed interval between losses or ECN CE marks is smaller than the target_run_length.
该容量测试确认slowstart不太可能过早退出。为了执行该测试，发送slowstart突发，该突发为目标大小的总数据包，并按照第7.2节所述累积数据包传输统计信息，以对结果进行评分。如果在丢失或ECN CE标记之间发送的良好数据包的观察数量大于目标运行长度，则测试将通过。如果观察到的损失或ECN CE标记之间的间隔小于目标运行长度，则测试将失败。
The test is deemed inconclusive if the elapsed time to send the data burst is not less than half of the time to receive the ACKs. (That is, it is acceptable to send data too fast, but sending it slower than twice the actual bottleneck rate as indicated by the ACKs is deemed inconclusive). The headway for the slowstart bursts should be the target_RTT.
如果发送数据突发所用的时间不少于接收ACK所用时间的一半，则测试被视为不确定。（也就是说，发送数据速度过快是可以接受的，但发送速度低于ACKs指示的实际瓶颈速率的两倍则被视为不确定）。慢启动脉冲的间隔应为目标时间。
Note that these are the same parameters that are used for the Sustained Full-Rate Bursts Test, except the burst rate is at slowstart rate rather than sender interface rate.
请注意，这些参数与持续全速率突发测试所用的参数相同，但突发速率为slowstart速率而非发送方接口速率。
To perform this test, do a continuous slowstart (send data continuously at twice the implied IP bottleneck capacity) until the first loss; stop and allow the network to drain and repeat; gather statistics on how many packets were delivered before the loss, the pattern of losses, maximum observed RTT, and window size; and justify the results. There is not currently sufficient theory to justify requiring any particular result; however, design decisions that affect the outcome of this tests also affect how the network balances between long and short flows (the "mice vs. elephants" problem). The queue sojourn time for the first packet delivered after the first loss should be at least one half of the target_RTT.
要执行此测试，请执行连续slowstart（以隐含IP瓶颈容量的两倍连续发送数据），直到第一次丢失；停止并让网络排空并重复；收集丢失前发送的数据包数量、丢失模式、观察到的最大RTT和窗口大小的统计信息；并证明结果的合理性。目前没有足够的理论来证明需要任何特定的结果；然而，影响测试结果的设计决策也会影响网络在长流和短流之间的平衡（“老鼠对大象”问题）。第一次丢失后交付的第一个数据包的队列驻留时间应至少为目标RTT的一半。
This engineering test should be performed on a quiescent network or testbed, since cross traffic has the potential to change the results in ill-defined ways.
此工程测试应在静态网络或试验台上进行，因为交叉流量可能以定义不明确的方式改变结果。
These tests determine how well the network can deliver bursts sent at the sender's interface rate. Note that this test most heavily exercises the front path and is likely to include infrastructure that may be out of scope for an access ISP, even though the bursts might be caused by ACK compression, thinning, or channel arbitration in the access ISP. See Appendix B.
这些测试确定了网络能够以发送方的接口速率传输突发数据的能力。请注意，此测试最主要地使用前端路径，并且可能包括可能超出接入ISP范围的基础设施，即使突发可能是由接入ISP中的ACK压缩、细化或信道仲裁引起的。见附录B。
Also, there are a several details about sender interface rate bursts that are not fully defined here. These details, such as the assumed sender interface rate, should be explicitly stated in an FSTIDS.
此外，还有一些关于发送方接口速率突发的细节，这里没有完全定义。这些细节，如假定的发送方接口速率，应在FSTIDS中明确说明。
Current standards permit TCP to send full window bursts following an application pause. (Congestion Window Validation [RFC2861] and updates to support Rate-Limited Traffic [RFC7661] are not required). Since full window bursts are consistent with standard behavior, it is desirable that the network be able to deliver such bursts; otherwise, application pauses will cause unwarranted losses. Note that the AIMD sawtooth requires a peak window that is twice target_window_size, so the worst-case burst may be 2*target_window_size.
当前标准允许TCP在应用程序暂停后发送完整的窗口突发。（不需要拥塞窗口验证[RFC2861]和支持速率限制流量[RFC7661]的更新）。由于全窗口突发与标准行为一致，因此期望网络能够传送此类突发；否则，应用程序暂停将导致不必要的损失。请注意，AIMD锯齿需要两倍于目标窗口大小的峰值窗口，因此最坏情况下的突发可能是2*目标窗口大小。
It is also understood in the application and serving community that interface rate bursts have a cost to the network that has to be balanced against other costs in the servers themselves. For example, TCP Segmentation Offload (TSO) reduces server CPU in exchange for larger network bursts, which increase the stress on network buffer memory. Some newer TCP implementations can pace traffic at scale [TSO_pacing] [TSO_fq_pacing]. It remains to be determined if and how quickly these changes will be deployed.
应用程序和服务社区还了解，接口速率突发对网络有成本，必须与服务器本身的其他成本相平衡。例如，TCP分段卸载（TSO）减少了服务器CPU，以换取更大的网络突发，这增加了网络缓冲内存的压力。一些较新的TCP实现可以按比例调整流量[TSO_Packing][TSO_fq_Packing]。这些更改是否部署以及部署的速度还有待确定。
There is not yet theory to unify these costs or to provide a framework for trying to optimize global efficiency. We do not yet have a model for how many server rate bursts should be tolerated by the network. Some bursts must be tolerated by the network, but it is probably unreasonable to expect the network to be able to efficiently deliver all data as a series of bursts.
目前还没有理论来统一这些成本或提供一个试图优化全球效率的框架。我们还没有一个模型来说明网络应该容忍多少服务器速率突发。网络必须容忍某些突发事件，但期望网络能够以一系列突发事件的形式高效地传递所有数据可能是不合理的。
For this reason, this is the only test for which we encourage derating. A TIDS could include a table containing pairs of derating parameters: burst sizes and how much each burst size is permitted to reduce the run length, relative to the target_run_length.
因此，这是我们鼓励降额的唯一测试。TIDS可以包括一个包含减额参数对的表格：突发大小以及相对于目标运行长度，允许每个突发大小减少多少运行长度。
Combined tests efficiently confirm multiple network properties in a single test, possibly as a side effect of normal content delivery. They require less measurement traffic than other testing strategies at the cost of conflating diagnostic signatures when they fail. These are by far the most efficient for monitoring networks that are nominally expected to pass all tests.
组合测试可以在单个测试中有效地确认多个网络属性，这可能是正常内容交付的副作用。与其他测试策略相比，它们需要更少的测量流量，但在失败时会混淆诊断特征。到目前为止，对于名义上期望通过所有测试的监控网络来说，这些是最有效的。
The Sustained Full-Rate Bursts Test implements a combined worst-case version of all of the capacity tests above. To perform this test, send target_window_size bursts of packets at server interface rate with target_RTT burst headway (burst start to next burst start), and verify that the observed packet transfer statistics meets the target_run_length.
持续全速率突发测试实现上述所有容量测试的组合最坏情况版本。要执行此测试，请以服务器接口速率以目标RTT突发间隔（突发开始到下一个突发开始）发送目标\u窗口大小的突发数据包，并验证观察到的数据包传输统计数据是否符合目标\u运行长度。
Key observations:
主要意见：
o The subpath under test is expected to go idle for some fraction of the time, determined by the difference between the time to drain the queue at the subpath_IP_capacity and the target_RTT. If the queue does not drain completely, it may be an indication that the subpath has insufficient IP capacity or that there is some other problem with the test (e.g., it is inconclusive).
o 被测试的子路径预计会空闲一段时间，这是由子路径IP容量和目标RTT处的队列排空时间之差决定的。如果队列没有完全排空，则可能表示子路径的IP容量不足，或者测试存在其他问题（例如，测试结果不确定）。
o The burst sensitivity can be derated by sending smaller bursts more frequently (e.g., by sending target_window_size*derate packet bursts every target_RTT*derate, where "derate" is less than one).
o 可以通过更频繁地发送较小的突发来降低突发敏感性（例如，通过发送目标\u窗口\u大小*减额分组突发，每个目标\u RTT*减额，其中“减额”小于1）。
o When not derated, this test is the most strenuous capacity test.
o 未降额时，该试验是最费力的容量试验。
o A subpath that passes this test is likely to be able to sustain higher rates (close to subpath_IP_capacity) for paths with RTTs significantly smaller than the target_RTT.
o 对于RTT明显小于目标RTT的路径，通过此测试的子路径可能能够维持更高的速率（接近子路径IP容量）。
o This test can be implemented with instrumented TCP [RFC4898], using a specialized measurement application at one end (e.g., [MBMSource]) and a minimal service at the other end (e.g., [RFC863] and [RFC864]).
o 该测试可通过仪表化TCP[RFC4898]实现，在一端使用专用测量应用程序（例如，[MBMSource]），在另一端使用最小服务（例如，[RFC863]和[RFC864]）。
o This test is efficient to implement, since it does not require per-packet timers, and can make use of TSO in modern network interfaces.
o 该测试实现起来很有效，因为它不需要每包定时器，并且可以在现代网络接口中使用TSO。
o If a subpath is known to pass the standing queue engineering tests (particularly that it has a progressive onset of loss at an appropriate queue depth), then the Sustained Full-Rate Bursts Test is sufficient to assure that the subpath under test will not impair Bulk Transport Capacity at the target performance under all conditions. See Section 8.2 for a discussion of the standing queue tests.
o 如果已知子路径通过了固定队列工程测试（特别是在适当队列深度下，其逐渐开始丢失），则持续全速率突发测试足以确保被测子路径在所有条件下都不会损害目标性能下的批量传输能力。有关站立队列测试的讨论，请参见第8.2节。
Note that this test is clearly independent of the subpath RTT or other details of the measurement infrastructure, as long as the measurement infrastructure can accurately and reliably deliver the required bursts to the subpath under test.
请注意，只要测量基础设施能够准确可靠地将所需的突发传输到被测子路径，该测试显然独立于子路径RTT或测量基础设施的其他细节。
Any non-throughput-maximizing application, such as fixed-rate streaming media, can be used to implement passive or hybrid (defined in [RFC7799]) versions of Model-Based Metrics with some additional instrumentation and possibly a traffic shaper or other controls in the servers. The essential requirement is that the data transmission be constrained such that even with arbitrary application pauses and bursts, the data rate and burst sizes stay within the envelope defined by the individual tests described above.
任何非吞吐量最大化的应用程序，如固定速率流媒体，可用于实现被动或混合（在[RFC7799]中定义）版本的基于模型的指标，并在服务器中使用一些额外的仪器和可能的流量整形器或其他控件。基本要求是，数据传输应受到限制，以便即使在任意应用程序暂停和突发的情况下，数据速率和突发大小仍保持在上述单独测试定义的包络内。
If the application's serving data rate can be constrained to be less than or equal to the target_data_rate and the serving_RTT (the RTT between the sender and client) is less than the target_RTT, this constraint is most easily implemented by clamping the transport window size to serving_window_clamp (which is set to the test_window and computed for the actual serving path).
如果应用程序的服务数据速率可以约束为小于或等于目标数据速率，并且服务RTT（发送方和客户端之间的RTT）小于目标RTT，则通过将传输窗口大小钳制为服务窗口钳制最容易实现此约束（设置为test_窗口并针对实际服务路径进行计算）。
Under the above constraints, the serving_window_clamp will limit both the serving data rate and burst sizes to be no larger than the parameters specified by the procedures in Section 8.1.2, 8.4, or 8.5.1. Since the serving RTT is smaller than the target_RTT, the worst-case bursts that might be generated under these conditions will be smaller than called for by Section 8.4, and the sender rate burst sizes are implicitly derated by the serving_window_clamp divided by the target_window_size at the very least. (Depending on the application behavior, the data might be significantly smoother than specified by any of the burst tests.)
在上述约束条件下，服务窗口夹具将限制服务数据速率和突发大小，使其不大于第8.1.2、8.4或8.5.1节中程序规定的参数。由于服务RTT小于目标RTT，因此在这些条件下可能产生的最坏情况突发将小于第8.4节所要求的突发，并且发送方速率突发大小至少由服务RTT除以目标RTT得到隐含减额。（根据应用程序的行为，数据可能比任何突发测试所指定的平滑得多。）
In an alternative implementation, the data rate and bursts might be explicitly controlled by a programmable traffic shaper or by pacing at the sender. This would provide better control over transmissions but is more complicated to implement, although the required technology is available [TSO_pacing] [TSO_fq_pacing].
在另一种实现方式中，数据速率和突发可以由可编程的流量整形器或在发送方处的步调显式控制。这将提供更好的传输控制，但实施起来更复杂，尽管所需的技术可用[TSO_起搏][TSO_fq_起搏]。
Note that these techniques can be applied to any content delivery that can be operated at a constrained data rate to inhibit TCP equilibrium behavior.
请注意，这些技术可应用于任何内容交付，这些内容交付可在受限数据速率下运行，以抑制TCP平衡行为。
Furthermore, note that Dynamic Adaptive Streaming over HTTP (DASH) is generally in conflict with passive Model-Based Metrics measurement, because it is a rate-maximizing protocol. It can still meet the requirement here if the rate can be capped, for example, by knowing a priori the maximum rate needed to deliver a particular piece of content.
此外，请注意，HTTP上的动态自适应流（DASH）通常与基于被动模型的度量方法相冲突，因为它是一种速率最大化协议。如果速率可以被限制，例如，通过事先知道交付特定内容所需的最大速率，它仍然可以满足这里的要求。
In this section, we illustrate a TIDS designed to confirm that an access ISP can reliably deliver HD video from multiple content providers to all of its customers. With modern codecs, minimal HD video (720p) generally fits in 2.5 Mb/s. Due to the ISP's geographical size, network topology, and modem characteristics, the ISP determines that most content is within a 50 ms RTT of its users. (This example RTT is sufficient to cover the propagation delay to continental Europe or to either coast of the United States with low-delay modems; it is sufficient to cover somewhat smaller geographical regions if the modems require additional delay to implement advanced compression and error recovery.)
在本节中，我们将演示一个TIDS，该TIDS旨在确认接入ISP能够可靠地从多个内容提供商向其所有客户交付高清视频。使用现代编解码器，最小高清视频（720p）通常适合2.5 Mb/s。由于ISP的地理尺寸、网络拓扑和调制解调器特性，ISP确定大多数内容在其用户的50 ms RTT范围内。（该示例RTT足以覆盖到欧洲大陆或使用低延迟调制解调器的美国任一海岸的传播延迟；如果调制解调器需要额外延迟以实现高级压缩和错误恢复，则足以覆盖稍微较小的地理区域。）
+----------------------+-------+---------+
| End-to-End Parameter | value | units |
+----------------------+-------+---------+
| target_rate | 2.5 | Mb/s |
| target_RTT | 50 | ms |
| target_MTU | 1500 | bytes |
| header_overhead | 64 | bytes |
| | | |
| target_window_size | 11 | packets |
| target_run_length | 363 | packets |
+----------------------+-------+---------+
+----------------------+-------+---------+
| End-to-End Parameter | value | units |
+----------------------+-------+---------+
| target_rate | 2.5 | Mb/s |
| target_RTT | 50 | ms |
| target_MTU | 1500 | bytes |
| header_overhead | 64 | bytes |
| | | |
| target_window_size | 11 | packets |
| target_run_length | 363 | packets |
+----------------------+-------+---------+
Table 1: 2.5 Mb/s over a 50 ms Path
表1:50毫秒路径上的2.5 Mb/s
Table 1 shows the default TCP model with no derating and, as such, is quite conservative. The simplest TIDS would be to use the Sustained Full-Rate Bursts Test, described in Section 8.5.1. Such a test would send 11 packet bursts every 50 ms and confirm that there was no more than 1 packet loss per 33 bursts (363 total packets in 1.650 seconds).
表1显示了没有降额的默认TCP模型，因此是相当保守的。最简单的TID是使用第8.5.1节所述的持续全速爆破试验。这样的测试将每50毫秒发送11个数据包突发，并确认每33个数据包突发（1.650秒内总共363个数据包）不会有超过1个数据包丢失。
Since this number represents the entire end-to-end loss budget, independent subpath tests could be implemented by apportioning the packet loss ratio across subpaths. For example, 50% of the losses might be allocated to the access or last mile link to the user, 40% to the network interconnections with other ISPs, and 1% to each internal hop (assuming no more than 10 internal hops). Then, all of the subpaths can be tested independently, and the spatial composition of passing subpaths would be expected to be within the end-to-end loss budget.
由于该数字表示整个端到端丢失预算，因此可以通过在子路径之间分配数据包丢失率来实现独立的子路径测试。例如，50%的损失可能分配给用户的接入或最后一英里链路，40%分配给与其他ISP的网络互连，1%分配给每个内部跃点（假设不超过10个内部跃点）。然后，可以独立测试所有子路径，通过子路径的空间组成预计在端到端损失预算内。
Guidance on deploying and using MBM belong in a future document. However, the example above illustrates some of the issues that may need to be considered.
关于部署和使用MBM的指南将在未来的文档中提供。然而，上面的例子说明了可能需要考虑的一些问题。
Note that another ISP, with different geographical coverage, topology, or modem technology may need to assume a different target_RTT and, as a consequence, a different target_window_size and target_run_length, even for the same target_data rate. One of the implications of this is that infrastructure shared by multiple ISPs, such as Internet Exchange Points (IXPs) and other interconnects may need to be evaluated on the basis of the most stringent target_window_size and target_run_length of any participating ISP. One way to do this might be to choose target parameters for evaluating such shared infrastructure on the basis of a hypothetical reference path that does not necessarily match any actual paths.
请注意，具有不同地理覆盖、拓扑或调制解调器技术的另一ISP可能需要采用不同的目标RTT，因此，即使对于相同的目标数据速率，也需要采用不同的目标窗口大小和目标运行长度。这意味着，多个ISP共享的基础设施，如互联网交换点（IXP）和其他互连，可能需要根据任何参与ISP最严格的目标窗口大小和目标运行长度进行评估。实现这一点的一种方法是，根据不一定匹配任何实际路径的假设参考路径，选择用于评估此类共享基础设施的目标参数。
Testing interconnects has generally been problematic: conventional performance tests run between measurement points adjacent to either side of the interconnect are not generally useful. Unconstrained TCP tests, such as iPerf [iPerf], are usually overly aggressive due to the small RTT (often less than 1 ms). With a short RTT, these tools are likely to report inflated data rates because on a short RTT, these tools can tolerate very high packet loss ratios and can push other cross traffic off of the network. As a consequence, these measurements are useless for predicting actual user performance over longer paths and may themselves be quite disruptive. Model-Based Metrics solves this problem. The interconnect can be evaluated with the same TIDS as other subpaths. Continuing our example, if the interconnect is apportioned 40% of the losses, 11 packet bursts sent every 50 ms should have fewer than one loss per 82 bursts (902 packets).
测试互连通常是有问题的：在互连两侧相邻的测量点之间运行的常规性能测试通常不有用。由于RTT较小（通常小于1ms），诸如iPerf[iPerf]之类的无约束TCP测试通常过于激进。对于较短的RTT，这些工具可能会报告过高的数据速率，因为在较短的RTT上，这些工具可以容忍非常高的数据包丢失率，并且可以将其他交叉流量推离网络。因此，这些测量对于预测较长路径上的实际用户性能是无用的，并且本身可能具有相当大的破坏性。基于模型的度量解决了这个问题。可使用与其他子路径相同的TID评估互连。继续我们的示例，如果互连分配了40%的损失，那么每50毫秒发送的11个数据包突发每82个数据包（902个数据包）的损失应该少于一个。
Since some aspects of the models are likely to be too conservative, Section 5.2 permits alternate protocol models, and Section 5.3 permits test parameter derating. If either of these techniques is used, we require demonstrations that such a TIDS can robustly detect subpaths that will prevent authentic applications using state-of-the-art protocol implementations from meeting the specified Target Transport Performance. This correctness criteria is potentially difficult to prove, because it implicitly requires validating a TIDS against all possible paths and subpaths. The procedures described here are still experimental.
由于模型的某些方面可能过于保守，第5.2节允许使用备用协议模型，第5.3节允许使用试验参数降额。如果使用了这两种技术中的任何一种，我们需要证明这样的TID能够可靠地检测子路径，从而防止使用最新协议实现的真实应用程序达到指定的目标传输性能。这种正确性标准可能很难证明，因为它隐含地要求根据所有可能的路径和子路径验证TID。这里描述的程序仍然是实验性的。
We suggest two approaches, both of which should be applied. First, publish a fully open description of the TIDS, including what assumptions were used and how it was derived, such that the research community can evaluate the design decisions, test them, and comment on their applicability. Second, demonstrate that applications do meet the Target Transport Performance when running over a network testbed that has the tightest possible constraints that still allow the tests in the TIDS to pass.
我们建议采用两种方法，这两种方法都应适用。首先，发布TID的完全公开说明，包括使用了哪些假设以及如何得出这些假设，以便研究界能够评估设计决策，测试它们，并对其适用性进行评论。第二，证明应用程序在网络测试台上运行时确实满足目标传输性能，该测试台具有最严格的约束，仍然允许TID中的测试通过。
This procedure resembles an epsilon-delta proof in calculus. Construct a test network such that all of the individual tests of the TIDS pass by only small (infinitesimal) margins, and demonstrate that a variety of authentic applications running over real TCP implementations (or other protocols as appropriate) meets the Target Transport Performance over such a network. The workloads should include multiple types of streaming media and transaction-oriented short flows (e.g., synthetic web traffic).
这个过程类似于微积分中的ε-δ证明。构建一个测试网络，使TID的所有单独测试只通过很小（无限小）的裕度，并证明通过实际TCP实现（或其他协议，视情况而定）运行的各种真实应用程序满足此类网络上的目标传输性能。工作负载应包括多种类型的流媒体和面向事务的短流（例如，合成web流量）。
For example, for the HD streaming video TIDS described in Section 9, the IP capacity should be exactly the header_overhead above 2.5 Mb/s, the per packet random background loss ratio should be 1/363 (for a run length of 363 packets), the bottleneck queue should be 11 packets, and the front path should have just enough buffering to withstand 11 packet interface rate bursts. We want every one of the TIDS tests to fail if we slightly increase the relevant test parameter, so, for example, sending a 12-packet burst should cause excess (possibly deterministic) packet drops at the dominant queue at the bottleneck. This network has the tightest possible constraints that can be expected to pass the TIDS, yet it should be possible for a real application using a stock TCP implementation in the vendor's default configuration to attain 2.5 Mb/s over a 50 ms path.
例如，对于第9节中描述的高清流媒体视频TID，IP容量应该正好是2.5 Mb/s以上的头_开销，每个包的随机背景丢失率应该是1/363（对于363个包的运行长度），瓶颈队列应该是11个包，前端路径应该有足够的缓冲，以承受11个包接口速率突发。如果稍微增加相关的测试参数，我们希望每一个TID测试都失败，因此，例如，发送12个数据包突发应该会在瓶颈处的主要队列中导致过多（可能是确定性的）数据包丢失。该网络具有最严格的约束条件，可以预期通过TID，但对于在供应商的默认配置中使用库存TCP实现的实际应用程序来说，在50毫秒的路径上应该可以达到2.5 Mb/s。
The most difficult part of setting up such a testbed is arranging for it to have the tightest possible constraints that still allow it to pass the individual tests. Two approaches are suggested:
建立这样一个测试平台最困难的部分是安排它具有尽可能严格的约束，使它仍然能够通过单独的测试。建议采用两种方法：
o constraining (configuring) the network devices not to use all available resources (e.g., by limiting available buffer space or data rate)
o 限制（配置）网络设备不使用所有可用资源（例如，通过限制可用缓冲空间或数据速率）
o pre-loading subpaths with cross traffic
o 具有交叉交通的预加载子路径
Note that it is important that a single tightly constrained environment just barely passes all tests; otherwise, there is a chance that TCP can exploit extra latitude in some parameters (such as data rate) to partially compensate for constraints in other parameters (e.g., queue space). This effect is potentially bidirectional: extra latitude in the queue space tests has the potential to enable TCP to compensate for insufficient data-rate headroom.
请注意，一个严格约束的环境仅仅勉强通过所有测试是很重要的；否则，TCP可能会利用某些参数（如数据速率）中的额外纬度来部分补偿其他参数（如队列空间）中的约束。这种影响可能是双向的：队列空间测试中的额外纬度有可能使TCP能够补偿不足的数据速率净空。
To the extent that a TIDS is used to inform public dialog, it should be fully documented publicly, including the details of the tests, what assumptions were used, and how it was derived. All of the details of the validation experiment should also be published with sufficient detail for the experiments to be replicated by other researchers. All components should be either open source or fully described proprietary implementations that are available to the research community.
如果TID用于通知公共对话，则应公开完整记录，包括测试细节、使用了什么假设以及如何推导。验证实验的所有细节也应公布，并提供足够的细节，以便其他研究人员复制实验。所有组件都应该是开源的，或者是研究社区可以使用的完整描述的专有实现。
Measurement is often used to inform business and policy decisions and, as a consequence, is potentially subject to manipulation. Model-Based Metrics are expected to be a huge step forward because equivalent measurements can be performed from multiple vantage points, such that performance claims can be independently validated by multiple parties.
度量通常用于通知业务和政策决策，因此可能会受到操纵。基于模型的度量预计将是一个巨大的进步，因为可以从多个有利位置执行等效度量，这样性能声明就可以由多方独立验证。
Much of the acrimony in the Net Neutrality debate is due to the historical lack of any effective vantage-independent tools to characterize network performance. Traditional methods for measuring Bulk Transport Capacity are sensitive to RTT and as a consequence often yield very different results when run local to an ISP or interconnect and when run over a customer's complete path. Neither the ISP nor customer can repeat the other's measurements, leading to high levels of distrust and acrimony. Model-Based Metrics are expected to greatly improve this situation.
网络中立性辩论中的许多激烈争论是由于历史上缺乏任何有效的、与优势无关的工具来描述网络性能。测量散装运输能力的传统方法对RTT非常敏感，因此，当在ISP或互连的本地运行时，以及在客户的完整路径上运行时，通常会产生非常不同的结果。ISP和客户都不能重复对方的测量结果，从而导致高度的不信任和尖刻。基于模型的指标有望大大改善这种情况。
Note that in situ measurements sometimes require sending synthetic measurement traffic between arbitrary locations in the network and, as such, are potentially attractive platforms for launching DDoS
请注意，现场测量有时需要在网络中的任意位置之间发送合成测量流量，因此，它们可能是启动DDoS的有吸引力的平台
attacks. All active measurement tools and protocols must be designed to minimize the opportunities for these misuses. See the discussion in Section 7 of [RFC7594].
攻击。所有主动测量工具和协议的设计必须尽量减少这些误用的机会。参见[RFC7594]第7节中的讨论。
Some of the tests described in this document are not intended for frequent network monitoring since they have the potential to cause high network loads and might adversely affect other traffic.
本文档中描述的一些测试不用于频繁的网络监控，因为它们可能会导致高网络负载，并可能对其他流量产生不利影响。
This document only describes a framework for designing a Fully Specified Targeted IP Diagnostic Suite. Each FSTIDS must include its own security section.
本文档仅描述设计完全指定的目标IP诊断套件的框架。每个FSTID必须包括自己的安全部分。
This document has no IANA actions.
本文档没有IANA操作。
[RFC863] Postel, J., "Discard Protocol", STD 21, RFC 863, DOI 10.17487/RFC0863, May 1983, <https://www.rfc-editor.org/info/rfc863>.
[RFC863]Postel，J.，“丢弃协议”，STD 21，RFC 863，DOI 10.17487/RFC0863，1983年5月<https://www.rfc-editor.org/info/rfc863>.
[RFC864] Postel, J., "Character Generator Protocol", STD 22, RFC 864, DOI 10.17487/RFC0864, May 1983, <https://www.rfc-editor.org/info/rfc864>.
[RFC864]Postel，J.，“字符生成器协议”，STD 22，RFC 864，DOI 10.17487/RFC0864，1983年5月<https://www.rfc-editor.org/info/rfc864>.
[RFC2330] Paxson, V., Almes, G., Mahdavi, J., and M. Mathis, "Framework for IP Performance Metrics", RFC 2330, DOI 10.17487/RFC2330, May 1998, <https://www.rfc-editor.org/info/rfc2330>.
[RFC2330]Paxson，V.，Almes，G.，Mahdavi，J.，和M.Mathis，“IP性能度量框架”，RFC 2330，DOI 10.17487/RFC2330，1998年5月<https://www.rfc-editor.org/info/rfc2330>.
[RFC2861] Handley, M., Padhye, J., and S. Floyd, "TCP Congestion Window Validation", RFC 2861, DOI 10.17487/RFC2861, June 2000, <https://www.rfc-editor.org/info/rfc2861>.
[RFC2861]Handley，M.，Padhye，J.和S.Floyd，“TCP拥塞窗口验证”，RFC 2861，DOI 10.17487/RFC2861，2000年6月<https://www.rfc-editor.org/info/rfc2861>.
[RFC3148] Mathis, M. and M. Allman, "A Framework for Defining Empirical Bulk Transfer Capacity Metrics", RFC 3148, DOI 10.17487/RFC3148, July 2001, <https://www.rfc-editor.org/info/rfc3148>.
[RFC3148]Mathis，M.和M.Allman，“定义经验批量输送能力指标的框架”，RFC 3148，DOI 10.17487/RFC3148，2001年7月<https://www.rfc-editor.org/info/rfc3148>.
[RFC3168] Ramakrishnan, K., Floyd, S., and D. Black, "The Addition of Explicit Congestion Notification (ECN) to IP", RFC 3168, DOI 10.17487/RFC3168, September 2001, <https://www.rfc-editor.org/info/rfc3168>.
[RFC3168]Ramakrishnan，K.，Floyd，S.，和D.Black，“向IP添加显式拥塞通知（ECN）”，RFC 3168，DOI 10.17487/RFC3168，2001年9月<https://www.rfc-editor.org/info/rfc3168>.
[RFC3465] Allman, M., "TCP Congestion Control with Appropriate Byte Counting (ABC)", RFC 3465, DOI 10.17487/RFC3465, February 2003, <https://www.rfc-editor.org/info/rfc3465>.
[RFC3465]Allman，M.，“具有适当字节计数（ABC）的TCP拥塞控制”，RFC 3465，DOI 10.17487/RFC3465，2003年2月<https://www.rfc-editor.org/info/rfc3465>.
[RFC4737] Morton, A., Ciavattone, L., Ramachandran, G., Shalunov, S., and J. Perser, "Packet Reordering Metrics", RFC 4737, DOI 10.17487/RFC4737, November 2006, <https://www.rfc-editor.org/info/rfc4737>.
[RFC4737]Morton，A.，Ciavattone，L.，Ramachandran，G.，Shalunov，S.，和J.Perser，“数据包重新排序度量”，RFC 4737，DOI 10.17487/RFC4737，2006年11月<https://www.rfc-editor.org/info/rfc4737>.
[RFC4898] Mathis, M., Heffner, J., and R. Raghunarayan, "TCP Extended Statistics MIB", RFC 4898, DOI 10.17487/RFC4898, May 2007, <https://www.rfc-editor.org/info/rfc4898>.
[RFC4898]Mathis，M.，Heffner，J.和R.Raghunarayan，“TCP扩展统计MIB”，RFC 4898，DOI 10.17487/RFC4898，2007年5月<https://www.rfc-editor.org/info/rfc4898>.
[RFC5136] Chimento, P. and J. Ishac, "Defining Network Capacity", RFC 5136, DOI 10.17487/RFC5136, February 2008, <https://www.rfc-editor.org/info/rfc5136>.
[RFC5136]Chimento，P.和J.Ishac，“定义网络容量”，RFC 5136，DOI 10.17487/RFC5136，2008年2月<https://www.rfc-editor.org/info/rfc5136>.
[RFC5681] Allman, M., Paxson, V., and E. Blanton, "TCP Congestion Control", RFC 5681, DOI 10.17487/RFC5681, September 2009, <https://www.rfc-editor.org/info/rfc5681>.
[RFC5681]Allman，M.，Paxson，V.和E.Blanton，“TCP拥塞控制”，RFC 5681，DOI 10.17487/RFC56812009年9月<https://www.rfc-editor.org/info/rfc5681>.
[RFC5827] Allman, M., Avrachenkov, K., Ayesta, U., Blanton, J., and P. Hurtig, "Early Retransmit for TCP and Stream Control Transmission Protocol (SCTP)", RFC 5827, DOI 10.17487/RFC5827, May 2010, <https://www.rfc-editor.org/info/rfc5827>.
[RFC5827]Allman，M.，Avrachenkov，K.，Ayesta，U.，Blanton，J.，和P.Hurtig，“TCP和流控制传输协议（SCTP）的早期重传”，RFC 5827，DOI 10.17487/RFC5827，2010年5月<https://www.rfc-editor.org/info/rfc5827>.
[RFC5835] Morton, A., Ed. and S. Van den Berghe, Ed., "Framework for Metric Composition", RFC 5835, DOI 10.17487/RFC5835, April 2010, <https://www.rfc-editor.org/info/rfc5835>.
[RFC5835]Morton，A.，Ed.和S.Van den Berghe，Ed.，“公制组合框架”，RFC 5835，DOI 10.17487/RFC5835，2010年4月<https://www.rfc-editor.org/info/rfc5835>.
[RFC6049] Morton, A. and E. Stephan, "Spatial Composition of Metrics", RFC 6049, DOI 10.17487/RFC6049, January 2011, <https://www.rfc-editor.org/info/rfc6049>.
[RFC6049]Morton，A.和E.Stephan，“度量的空间构成”，RFC 6049，DOI 10.17487/RFC6049，2011年1月<https://www.rfc-editor.org/info/rfc6049>.
[RFC6576] Geib, R., Ed., Morton, A., Fardid, R., and A. Steinmitz, "IP Performance Metrics (IPPM) Standard Advancement Testing", BCP 176, RFC 6576, DOI 10.17487/RFC6576, March 2012, <https://www.rfc-editor.org/info/rfc6576>.
[RFC6576]Geib，R.，Ed.，Morton，A.，Fardid，R.，和A.Steinmitz，“IP性能度量（IPPM）标准推进测试”，BCP 176，RFC 6576，DOI 10.17487/RFC6576，2012年3月<https://www.rfc-editor.org/info/rfc6576>.
[RFC6673] Morton, A., "Round-Trip Packet Loss Metrics", RFC 6673, DOI 10.17487/RFC6673, August 2012, <https://www.rfc-editor.org/info/rfc6673>.
[RFC6673]Morton，A.，“往返数据包丢失度量”，RFC 6673，DOI 10.17487/RFC6673，2012年8月<https://www.rfc-editor.org/info/rfc6673>.
[RFC6928] Chu, J., Dukkipati, N., Cheng, Y., and M. Mathis, "Increasing TCP's Initial Window", RFC 6928, DOI 10.17487/RFC6928, April 2013, <https://www.rfc-editor.org/info/rfc6928>.
[RFC6928]Chu，J.，Dukkipati，N.，Cheng，Y.，和M.Mathis，“增加TCP的初始窗口”，RFC 6928，DOI 10.17487/RFC6928，2013年4月<https://www.rfc-editor.org/info/rfc6928>.
[RFC7312] Fabini, J. and A. Morton, "Advanced Stream and Sampling Framework for IP Performance Metrics (IPPM)", RFC 7312, DOI 10.17487/RFC7312, August 2014, <https://www.rfc-editor.org/info/rfc7312>.
[RFC7312]Fabini，J.和A.Morton，“IP性能度量的高级流和采样框架（IPPM）”，RFC 7312，DOI 10.17487/RFC7312，2014年8月<https://www.rfc-editor.org/info/rfc7312>.
[RFC7398] Bagnulo, M., Burbridge, T., Crawford, S., Eardley, P., and A. Morton, "A Reference Path and Measurement Points for Large-Scale Measurement of Broadband Performance", RFC 7398, DOI 10.17487/RFC7398, February 2015, <https://www.rfc-editor.org/info/rfc7398>.
[RFC7398]Bagnulo，M.，Burbridge，T.，Crawford，S.，Eardley，P.，和A.Morton，“宽带性能大规模测量的参考路径和测量点”，RFC 7398，DOI 10.17487/RFC7398，2015年2月<https://www.rfc-editor.org/info/rfc7398>.
[RFC7567] Baker, F., Ed. and G. Fairhurst, Ed., "IETF Recommendations Regarding Active Queue Management", BCP 197, RFC 7567, DOI 10.17487/RFC7567, July 2015, <https://www.rfc-editor.org/info/rfc7567>.
[RFC7567]Baker，F.，Ed.和G.Fairhurst，Ed.，“IETF关于主动队列管理的建议”，BCP 197，RFC 7567，DOI 10.17487/RFC7567，2015年7月<https://www.rfc-editor.org/info/rfc7567>.
[RFC7594] Eardley, P., Morton, A., Bagnulo, M., Burbridge, T., Aitken, P., and A. Akhter, "A Framework for Large-Scale Measurement of Broadband Performance (LMAP)", RFC 7594, DOI 10.17487/RFC7594, September 2015, <https://www.rfc-editor.org/info/rfc7594>.
[RFC7594]Eardley，P.，Morton，A.，Bagnulo，M.，Burbridge，T.，Aitken，P.，和A.Akhter，“宽带性能的大规模测量框架（LMAP）”，RFC 7594，DOI 10.17487/RFC7594，2015年9月<https://www.rfc-editor.org/info/rfc7594>.
[RFC7661] Fairhurst, G., Sathiaseelan, A., and R. Secchi, "Updating TCP to Support Rate-Limited Traffic", RFC 7661, DOI 10.17487/RFC7661, October 2015, <https://www.rfc-editor.org/info/rfc7661>.
[RFC7661]Fairhurst，G.，Sathiaseelan，A.，和R.Secchi，“更新TCP以支持速率受限的流量”，RFC 7661，DOI 10.17487/RFC7661，2015年10月<https://www.rfc-editor.org/info/rfc7661>.
[RFC7680] Almes, G., Kalidindi, S., Zekauskas, M., and A. Morton, Ed., "A One-Way Loss Metric for IP Performance Metrics (IPPM)", STD 82, RFC 7680, DOI 10.17487/RFC7680, January 2016, <https://www.rfc-editor.org/info/rfc7680>.
[RFC7680]Almes，G.，Kalidini，S.，Zekauskas，M.，和A.Morton，Ed.，“IP性能度量（IPPM）的单向损失度量”，STD 82，RFC 7680，DOI 10.17487/RFC7680，2016年1月<https://www.rfc-editor.org/info/rfc7680>.
[RFC7799] Morton, A., "Active and Passive Metrics and Methods (with Hybrid Types In-Between)", RFC 7799, DOI 10.17487/RFC7799, May 2016, <https://www.rfc-editor.org/info/rfc7799>.
[RFC7799]Morton，A.“主动和被动度量和方法（介于两者之间的混合类型）”，RFC 7799，DOI 10.17487/RFC7799，2016年5月<https://www.rfc-editor.org/info/rfc7799>.
[AFD] Pan, R., Breslau, L., Prabhakar, B., and S. Shenker, "Approximate fairness through differential dropping", ACM SIGCOMM Computer Communication Review, Volume 33, Issue 2, DOI 10.1145/956981.956985, April 2003.
[AFD]Pan，R.，Breslau，L.，Prabhakar，B.，和S.Shenker，“通过差分丢弃实现近似公平”，ACM SIGCOMM计算机通信评论，第33卷，第2期，DOI 10.1145/956981.9569852003年4月。
[CCscaling] Paganini, F., Doyle, J., and S. Low, "Scalable laws for stable network congestion control", Proceedings of IEEE Conference on Decision and Control,, DOI 10.1109/CDC.2001.980095, December 2001.
[CCscaling]Paganini，F.，Doyle，J.，和S.Low，“稳定网络拥塞控制的可扩展法律”，IEEE决策和控制会议记录，DOI 10.1109/CDC.2001.980095，2001年12月。
[CVST] Krueger, T. and M. Braun, "R package: Fast Cross-Validation via Sequential Testing", version 0.1, 11 2012.
[CVST]Krueger，T.和M.Braun，“R包：通过顺序测试进行快速交叉验证”，版本0.112012。
[iPerf] Wikipedia, "iPerf", November 2017, <https://en.wikipedia.org/w/ index.php?title=Iperf&oldid=810583885>.
[iPerf]维基百科，“iPerf”，2017年11月<https://en.wikipedia.org/w/ index.php？title=Iperf&oldid=810583885>。
[MBMSource] "mbm", July 2016, <https://github.com/m-lab/MBM>.
[mbm来源]“mbm”，2016年7月<https://github.com/m-lab/MBM>.
[Montgomery90] Montgomery, D., "Introduction to Statistical Quality Control", 2nd Edition, ISBN 0-471-51988-X, 1990.
[蒙哥马利90]蒙哥马利博士，“统计质量控制导论”，第二版，ISBN 0-471-51988-X，1990年。
[mpingSource] "mping", July 2016, <https://github.com/m-lab/mping>.
[mpingSource]“mping”，2016年7月<https://github.com/m-lab/mping>.
[MSMO97] Mathis, M., Semke, J., Mahdavi, J., and T. Ott, "The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm", Computer Communications Review, Volume 27, Issue 3, DOI 10.1145/263932.264023, July 1997.
[MSMO97]Mathis，M.，Semke，J.，Mahdavi，J.，和T.Ott，“TCP拥塞避免算法的宏观行为”，《计算机通信评论》，第27卷，第3期，DOI 10.1145/263932.264023，1997年7月。
[Pathdiag] Mathis, M., Heffner, J., O'Neil, P., and P. Siemsen, "Pathdiag: Automated TCP Diagnosis", Passive and Active Network Measurement, Lecture Notes in Computer Science, Volume 4979, DOI 10.1007/978-3-540-79232-1_16, 2008.
[Pathdiag]Mathis，M.，Heffner，J.，O'Neil，P.，和P.Siemsen，“Pathdiag：自动TCP诊断”，被动和主动网络测量，计算机科学课堂讲稿，第4979卷，DOI 10.1007/978-3-540-79232-1呰，2008年。
[Policing] Flach, T., Papageorge, P., Terzis, A., Pedrosa, L., Cheng, Y., Karim, T., Katz-Bassett, E., and R. Govindan, "An Internet-Wide Analysis of Traffic Policing", Proceedings of ACM SIGCOMM, DOI 10.1145/2934872.2934873, August 2016.
[警务]Flach，T.，Papageorge，P.，Terzis，A.，Pedrosa，L.，Cheng，Y.，Karim，T.，Katz Bassett，E.，和R.Govindan，“全互联网交通警务分析”，ACM SIGCOMM会议录，DOI 10.1145/2934872.2934873，2016年8月。
[RACK] Cheng, Y., Cardwell, N., Dukkipati, N., and P. Jha, "RACK: a time-based fast loss detection algorithm for TCP", Work in Progress, draft-ietf-tcpm-rack-03, March 2018.
[RACK]Cheng，Y.，Cardwell，N.，Dukkipati，N.，和P.Jha，“RACK:TCP基于时间的快速丢失检测算法”，正在进行的工作，草稿-ietf-tcpm-RACK-032018年3月。
[Rtool] R Development Core Team, "R: A language and environment for statistical computing", R Foundation for Statistical Computing, Vienna, Austria, ISBN 3-900051-07-0, 2011, <http://www.R-project.org/>.
R开发核心团队，R：统计计算语言和环境，R统计计算基础，维也纳，奥地利，ISBN 3-900051-07- 0，2011，<http://www.R-project.org/>.
[TSO_fq_pacing] Dumazet, E. and Y. Chen, "TSO, fair queuing, pacing: three's a charm", Proceedings of IETF 88, TCPM WG, November 2013, <https://www.ietf.org/proceedings/88/slides/ slides-88-tcpm-9.pdf>.
[TSO_fq_Packing]Dumazet，E.和Y.Chen，“TSO，公平排队，Packing:three's a charm”，IETF 88会议记录，TCPM工作组，2013年11月<https://www.ietf.org/proceedings/88/slides/ 幻灯片-88-tcpm-9.pdf>。
[TSO_pacing] Corbet, J., "TSO sizing and the FQ scheduler", August 2013, <https://lwn.net/Articles/564978/>.
[TSO_Packing]Corbet，J.，“TSO规模和FQ调度程序”，2013年8月<https://lwn.net/Articles/564978/>.
[Wald45] Wald, A., "Sequential Tests of Statistical Hypotheses", The Annals of Mathematical Statistics, Volume 16, Number 2, pp. 117-186, June 1945, <http://www.jstor.org/stable/2235829>.
[Wald45]Wald，A.，“统计假设的顺序检验”，《数理统计年鉴》，第16卷，第2期，第117-186页，1945年6月<http://www.jstor.org/stable/2235829>.
[wikiBloat] Wikipedia, "Bufferbloat", January 2018, <https://en.wikipedia.org/w/ index.php?title=Bufferbloat&oldid=819293377>.
[维基百科]维基百科，“Bufferbloat”，2018年1月<https://en.wikipedia.org/w/ index.php？title=Bufferbloat&oldid=819293377>。
[WPING] Mathis, M., "Windowed Ping: An IP Level Performance Diagnostic", Computer Networks and ISDN Systems, Volume 27, Issue 3, DOI 10.1016/0169-7552(94)90119-8, June 1994.
[WPING]Mathis，M.，“窗口Ping：IP级性能诊断”，计算机网络和ISDN系统，第27卷，第3期，DOI 10.1016/0169-7552（94）90119-81994年6月。
The reference target_run_length described in Section 5.2 is based on very conservative assumptions: that all excess data in flight (i.e., the window size) above the target_window_size contributes to a standing queue that raises the RTT and that classic Reno congestion control with delayed ACKs is in effect. In this section we provide two alternative calculations using different assumptions.
第5.2节中所述的参考目标运行长度基于非常保守的假设：超过目标运行时间的所有多余数据（即窗口大小）都会导致产生RTT的静止队列，并且具有延迟ACK的经典雷诺拥塞控制有效。在本节中，我们使用不同的假设提供了两种备选计算方法。
It may seem out of place to allow such latitude in a measurement method, but this section provides offsetting requirements.
在测量方法中允许这样的纬度似乎不合适，但本节提供了偏移要求。
The estimates provided by these models make the most sense if network performance is viewed logarithmically. In the operational Internet, data rates span more than eight orders of magnitude, RTT spans more than three orders of magnitude, and packet loss ratio spans at least eight orders of magnitude if not more. When viewed logarithmically (as in decibels), these correspond to 80 dB of dynamic range. On an 80 dB scale, a 3 dB error is less than 4% of the scale, even though it represents a factor of 2 in untransformed parameter.
如果以对数方式查看网络性能，则这些模型提供的估计最有意义。在可操作的互联网中，数据速率跨越八个数量级以上，RTT跨越三个数量级以上，数据包丢失率跨越至少八个数量级（如果不是更大的话）。当以对数方式观察时（如分贝），这些对应于80 dB的动态范围。在80 dB标度上，3 dB的误差小于标度的4%，即使它在未转换参数中表示一个因子2。
This document gives a lot of latitude for calculating target_run_length; however, people designing a TIDS should consider the effect of their choices on the ongoing tussle about the relevance of "TCP friendliness" as an appropriate model for Internet capacity allocation. Choosing a target_run_length that is substantially smaller than the reference target_run_length specified in Section 5.2 strengthens the argument that it may be appropriate to abandon "TCP friendliness" as the Internet fairness model. This gives developers incentive and permission to develop even more aggressive applications and protocols, for example, by increasing the number of connections that they open concurrently.
本文件为计算目标运行长度提供了很多自由度；然而，设计TIDS的人应该考虑他们的选择对正在进行的争夺“TCP友好性”的相关性作为适当的互联网容量分配模型的影响。选择一个比第5.2节中规定的参考目标运行长度小得多的目标运行长度加强了以下论点，即放弃“TCP友好性”作为互联网公平性模型可能是合适的。这使得开发人员有动力和权限开发更具攻击性的应用程序和协议，例如，通过增加并发打开的连接数。
In Section 5.2, models were derived based on the assumption that the subpath IP rate matches the target rate plus overhead, such that the excess window needed for the AIMD sawtooth causes a fluctuating queue at the bottleneck.
在第5.2节中，基于子路径IP速率与目标速率加上开销相匹配的假设导出了模型，因此AIMD锯齿所需的多余窗口会导致瓶颈处的队列波动。
An alternate situation would be a bottleneck where there is no significant queue and losses are caused by some mechanism that does not involve extra delay, for example, by the use of a virtual queue as done in Approximate Fair Dropping [AFD]. A flow controlled by such a bottleneck would have a constant RTT and a data rate that fluctuates in a sawtooth due to AIMD congestion control. Assume the
另一种情况是瓶颈，即没有明显的队列，并且损失是由一些不涉及额外延迟的机制造成的，例如，通过使用近似公平丢弃[AFD]中的虚拟队列。由这种瓶颈控制的流将具有恒定的RTT，并且由于AIMD拥塞控制，数据速率以锯齿形波动。假设
losses are being controlled to make the average data rate meet some goal that is equal to or greater than the target_rate. The necessary run length to meet the target_rate can be computed as follows:
正在控制损失，以使平均数据速率达到等于或大于目标速率的某个目标。满足目标_率所需的运行长度可计算如下：
For some value of Wmin, the window will sweep from Wmin packets to 2*Wmin packets in 2*Wmin RTT (due to delayed ACK). Unlike the queuing case where Wmin = target_window_size, we want the average of Wmin and 2*Wmin to be the target_window_size, so the average data rate is the target rate. Thus, we want Wmin = (2/3)*target_window_size.
对于某些Wmin值，窗口将从Wmin数据包扫描到2*Wmin RTT中的2*Wmin数据包（由于延迟确认）。与Wmin=目标窗口大小的排队情况不同，我们希望Wmin和2*Wmin的平均值为目标窗口大小，因此平均数据速率为目标速率。因此，我们需要Wmin=（2/3）*目标窗口大小。
Between losses, each sawtooth delivers (1/2)(Wmin+2*Wmin)(2Wmin) packets in 2*Wmin RTTs.
在丢失之间，每个锯齿以2*Wmin RTT的形式发送（1/2）（Wmin+2*Wmin）（2Wmin）数据包。
Substituting these together, we get:
将这些值一起替换，我们得到：
target_run_length = (4/3)(target_window_size^2)
target_run_length = (4/3)(target_window_size^2)
Note that this is 44% of the reference_run_length computed earlier. This makes sense because under the assumptions in Section 5.2, the AMID sawtooth caused a queue at the bottleneck, which raised the effective RTT by 50%.
请注意，这是前面计算的参考运行长度的44%。这是有意义的，因为在第5.2节中的假设下，中间锯齿线在瓶颈处造成排队，从而将有效RTT提高了50%。
For many network technologies, simple queuing models don't apply: the network schedules, thins, or otherwise alters the timing of ACKs and data, generally to raise the efficiency of the channel allocation algorithms when confronted with relatively widely spaced small ACKs. These efficiency strategies are ubiquitous for half-duplex, wireless, and broadcast media.
对于许多网络技术，简单的排队模型并不适用：网络调度、稀释或以其他方式改变ack和数据的定时，通常是为了在遇到相对较宽的间隔较小的ack时提高信道分配算法的效率。这些效率策略在半双工、无线和广播媒体中普遍存在。
Altering the ACK stream by holding or thinning ACKs typically has two consequences: it raises the implied bottleneck IP capacity, making the fine-grained slowstart bursts either faster or larger, and it raises the effective RTT by the average time that the ACKs and data are delayed. The first effect can be partially mitigated by re-clocking ACKs once they are beyond the bottleneck on the return path to the sender; however, this further raises the effective RTT.
通过保持或细化ACK来改变ACK流通常有两个后果：它提高了隐含的瓶颈IP容量，使细粒度的slowstart突发更快或更大，并且通过ACK和数据延迟的平均时间提高了有效RTT。第一个影响可以通过在ACK超出到发送方的返回路径上的瓶颈后对其重新计时来部分缓解；然而，这进一步提高了有效RTT。
The most extreme example of this sort of behavior would be a half-duplex channel that is not released as long as the endpoint currently holding the channel has more traffic (data or ACKs) to send. Such environments cause self-clocked protocols under full load to revert to extremely inefficient stop-and-wait behavior. The channel constrains the protocol to send an entire window of data as a single
这种行为最极端的例子是半双工信道，只要当前持有该信道的端点有更多的通信量（数据或ack）要发送，就不会释放该信道。这种环境会导致满负载下的自时钟协议恢复为极为低效的停止和等待行为。通道限制协议将整个数据窗口作为单个窗口发送
contiguous burst on the forward path, followed by the entire window of ACKs on the return path. (A channel with this behavior would fail the Duplex Self-Interference Test described in Section 8.2.4).
前向路径上的连续突发，然后是返回路径上的整个ACK窗口。（具有这种行为的信道将无法通过第8.2.4节所述的双工自干扰测试）。
If a particular return path contains a subpath or device that alters the timing of the ACK stream, then the entire front path from the sender up to the bottleneck must be tested at the burst parameters implied by the ACK scheduling algorithm. The most important parameter is the implied bottleneck IP capacity, which is the average rate at which the ACKs advance snd.una. Note that thinning the ACK stream (relying on the cumulative nature of seg.ack to permit discarding some ACKs) causes most TCP implementations to send interface rate bursts to offset the longer times between ACKs in order to maintain the average data rate.
如果特定返回路径包含改变ACK流定时的子路径或设备，则必须在ACK调度算法暗示的突发参数下测试从发送方到瓶颈的整个前端路径。最重要的参数是隐含的瓶颈IP容量，它是ACK前进snd.una的平均速率。请注意，细化ACK流（依赖于seg.ACK的累积性质以允许丢弃某些ACK）会导致大多数TCP实现发送接口速率突发，以抵消ACK之间的较长时间，从而保持平均数据速率。
Note that due to ubiquitous self-clocking in Internet protocols, ill-conceived channel allocation mechanisms are likely to increases the queuing stress on the front path because they cause larger full sender rate data bursts.
请注意，由于Internet协议中普遍存在自时钟，考虑不周的信道分配机制可能会增加前端路径上的排队压力，因为它们会导致更大的全发送方速率数据突发。
Holding data or ACKs for channel allocation or other reasons (such as forward error correction) always raises the effective RTT relative to the minimum delay for the path. Therefore, it may be necessary to replace target_RTT in the calculation in Section 5.2 by an effective_RTT, which includes the target_RTT plus a term to account for the extra delays introduced by these mechanisms.
由于信道分配或其他原因（如前向纠错）而保留数据或ACK总是会提高相对于路径最小延迟的有效RTT。因此，在第5.2节的计算中，可能有必要用有效的_RTT替换目标_RTT，其中包括目标_RTT加上一个用于解释这些机制引入的额外延迟的术语。
Acknowledgments
致谢
Ganga Maguluri suggested the statistical test for measuring loss probability in the target run length. Alex Gilgur and Merry Mou helped with the statistics.
Ganga Maguluri建议使用统计测试来测量目标游程中的损失概率。Alex Gilgur和Merry Mou帮助进行统计。
Meredith Whittaker improved the clarity of the communications.
Meredith Whittaker提高了沟通的清晰度。
Ruediger Geib provided feedback that greatly improved the document.
Ruediger Geib提供的反馈大大改进了文档。
This work was inspired by Measurement Lab: open tools running on an open platform, using open tools to collect open data. See <http://www.measurementlab.net/>.
这项工作的灵感来自测量实验室：在开放平台上运行的开放工具，使用开放工具收集开放数据。看<http://www.measurementlab.net/>.
Authors' Addresses
作者地址
Matt Mathis Google, Inc 1600 Amphitheatre Parkway Mountain View, CA 94043 United States of America
Matt Mathis Google，Inc.美国加利福尼亚州山景大道1600圆形剧场，邮编94043
Email: mattmathis@google.com
Email: mattmathis@google.com
Al Morton AT&T Labs 200 Laurel Avenue South Middletown, NJ 07748 United States of America
美国新泽西州劳雷尔大道南米德尔顿200号阿尔莫顿AT&T实验室，邮编：07748
Phone: +1 732 420 1571
Email: acmorton@att.com
Phone: +1 732 420 1571
Email: acmorton@att.com