Network Working Group V. Manral
Request for Comments: 4061 SiNett Corp.
Category: Informational R. White
Cisco Systems
A. Shaikh
AT&T Labs (Research)
April 2005
Network Working Group V. Manral
Request for Comments: 4061 SiNett Corp.
Category: Informational R. White
Cisco Systems
A. Shaikh
AT&T Labs (Research)
April 2005
Benchmarking Basic OSPF Single Router Control Plane Convergence
基准测试基本OSPF单路由器控制平面收敛
Status of This Memo
关于下段备忘
This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited.
本备忘录为互联网社区提供信息。它没有规定任何类型的互联网标准。本备忘录的分发不受限制。
Copyright Notice
版权公告
Copyright (C) The Internet Society (2005).
版权所有（C）互联网协会（2005年）。
Abstract
摘要
This document provides suggestions for measuring OSPF single router control plane convergence. Its initial emphasis is on the control plane of a single OSPF router. We do not address forwarding plane performance.
本文件提供了测量OSPF单路由器控制平面收敛性的建议。它最初的重点是单个OSPF路由器的控制平面。我们不讨论转发平面性能。
NOTE: In this document, the word "convergence" relates to single router control plane convergence only.
注：在本文件中，“收敛”一词仅涉及单路由器控制平面收敛。
Table of Contents
目录
1. Introduction....................................................2
2. Specification of Requirements...................................2
3. Overview and Scope..............................................3
4. Reference Topologies............................................4
5. Basic Performance Tests.........................................5
5.1. Time Required to Process an LSA...........................5
5.2. Flooding Time.............................................6
5.3. Shortest Path First Computation Time......................6
6. Basic Intra-area OSPF Tests.....................................8
6.1. Forming Adjacencies on Point-to-Point Links
(Initialization)..........................................9
6.2. Forming Adjacencies on Point-to-Point Links...............9
6.3. Forming Adjacencies with Information Already in the
Database.................................................10
6.4. Designated Router Election Time on a Broadcast Network...11
1. Introduction....................................................2
2. Specification of Requirements...................................2
3. Overview and Scope..............................................3
4. Reference Topologies............................................4
5. Basic Performance Tests.........................................5
5.1. Time Required to Process an LSA...........................5
5.2. Flooding Time.............................................6
5.3. Shortest Path First Computation Time......................6
6. Basic Intra-area OSPF Tests.....................................8
6.1. Forming Adjacencies on Point-to-Point Links
(Initialization)..........................................9
6.2. Forming Adjacencies on Point-to-Point Links...............9
6.3. Forming Adjacencies with Information Already in the
Database.................................................10
6.4. Designated Router Election Time on a Broadcast Network...11
6.5. Initial Convergence Time on a Broadcast Network,
Test 1...................................................11
6.6. Initial Convergence Time on a Broadcast Network,
Test 2...................................................12
6.7. Link Down with Layer Two Detection.......................12
6.8. Link Down with Layer Three Detection.....................13
7. Security Considerations........................................13
8. Acknowledgements...............................................13
9. Normative References...........................................14
10. Informative References.........................................14
Authors' Addresses.................................................15
Full Copyright Statement...........................................16
6.5. Initial Convergence Time on a Broadcast Network,
Test 1...................................................11
6.6. Initial Convergence Time on a Broadcast Network,
Test 2...................................................12
6.7. Link Down with Layer Two Detection.......................12
6.8. Link Down with Layer Three Detection.....................13
7. Security Considerations........................................13
8. Acknowledgements...............................................13
9. Normative References...........................................14
10. Informative References.........................................14
Authors' Addresses.................................................15
Full Copyright Statement...........................................16
There is a growing interest in routing protocol convergence testing, with many people looking at various tests to determine how long it takes for a network to converge after various conditions occur. The major problem with this sort of testing is that the framework of the tests has a major impact on the results; for instance, determining when a network is converged, what parts of the router's operation are considered within the testing, and other such things will have a major impact on the apparent performance that routing protocols provide.
人们对路由协议收敛测试越来越感兴趣，许多人通过各种测试来确定在各种情况发生后网络收敛所需的时间。这类测试的主要问题是测试框架对结果有重大影响；例如，确定网络何时聚合、测试中考虑了路由器操作的哪些部分，以及其他此类事项将对路由协议提供的明显性能产生重大影响。
This document attempts to provide a framework for Open Shortest Path First [OSPF] performance testing, and to provide some tests for measuring some aspects of OSPF performance. The motivation of the document is to provide a set of tests that can provide the user comparable data from various vendors with which to evaluate the OSPF protocol performance on the devices.
本文试图为开放式最短路径优先（OSPF）性能测试提供一个框架，并提供一些测试来衡量OSPF性能的某些方面。本文件的目的是提供一组测试，可以向用户提供来自不同供应商的可比数据，用于评估设备上的OSPF协议性能。
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in [RFC2119]. RFC 2119 key words in this document are used to ensure methodological control, which is very important in the specification of benchmarks. This document does not specify a network-related protocol.
本文件中的关键词“必须”、“不得”、“必需”、“应”、“不应”、“应”、“不应”、“建议”、“可”和“可选”应按照[RFC2119]中所述进行解释。本文件中的RFC 2119关键词用于确保方法控制，这在基准规范中非常重要。本文档未指定与网络相关的协议。
Although this document describes a specific set of tests aimed at characterizing the single router control plane convergence performance of OSPF processes in routers or other boxes that incorporate OSPF functionality, a key objective is to propose methodologies that produce directly comparable convergence-related measurements.
尽管本文件描述了一组特定的测试，旨在描述路由器或包含OSPF功能的其他盒子中OSPF过程的单路由器控制平面收敛性能，但关键目标是提出产生直接可比收敛相关测量的方法。
The following considerations are outside the scope of this document:
以下注意事项不在本文件范围内：
o The interactions of convergence and forwarding; testing is restricted to events occurring within the control plane. Forwarding performance is the primary focus in [INTERCONNECT], and it is expected to be dealt with in work that ensues from [FIB-TERM].
o 融合与转发的互动；测试仅限于控制平面内发生的事件。转发性能是[INTERCONNECT]的主要关注点，预计将在[FIB-TERM]后续的工作中处理。
o Inter-area route generation, AS-external route generation, and simultaneous traffic on the control and data paths within the DUT. Although the tests outlined in this document measure SPF time, flooding times, and other aspects of OSPF convergence performance, this document does not provide tests for measuring external or summary route generation, route translation, or other OSPF inter-area and external routing performance. These areas are expected to be dealt with in a later document.
o 区域间路由生成，作为外部路由生成，以及DUT内控制和数据路径上的同步通信量。尽管本文件中概述的测试测量SPF时间、泛洪时间和OSPF收敛性能的其他方面，但本文件不提供测量外部或摘要路由生成、路由转换或其他OSPF区域间和外部路由性能的测试。这些领域将在以后的文件中讨论。
The tests should be run more than once, since a single test run cannot be relied on to produce statistically sound results. The number of test runs and any variations between the tests should be recorded in the test results (see [TERM] for more information on what items should be recorded in the test results).
测试应不止一次运行，因为单次测试运行不能产生统计上可靠的结果。测试运行次数和测试之间的任何变化应记录在测试结果中（有关测试结果中应记录哪些项目的更多信息，请参见[术语]）。
Several reference topologies that are used throughout the tests are described in the remaining sections of this document. All of the topologies have been collectively placed in one section to avoid repetition.
本文件其余部分介绍了在整个测试过程中使用的几种参考拓扑。所有拓扑都集中放置在一个部分中，以避免重复。
o Reference Topology 1 (Emulated Topology)
o 参考拓扑1（仿真拓扑）
( )
DUT----Generator----( emulated topology )
( )
( )
DUT----Generator----( emulated topology )
( )
A simple back-to-back configuration. It's assumed that the link between the generator and the DUT is a point-to-point link, while the connections within the generator represent some emulated topology.
简单的背靠背配置。假设发电机和DUT之间的链路是点对点链路，而发电机内的连接表示一些仿真拓扑。
o Reference Topology 2 (Generator and Collector)
o 参考拓扑2（发电机和收集器）
( )
Collector-----DUT-----Generator--( emulated topology )
\ / ( )
\------------/
( )
Collector-----DUT-----Generator--( emulated topology )
\ / ( )
\------------/
All routers are connected through point-to-point links. The cost of all links is assumed to be the same unless otherwise noted.
所有路由器都通过点对点链路连接。除非另有说明，否则假设所有链接的成本相同。
o Reference Topology 3 (Broadcast Network)
o 参考拓扑3（广播网络）
DUT R1 R2
| | |
-+------+------+-----.....
DUT R1 R2
| | |
-+------+------+-----.....
Any number of routers could be included on the common broadcast network.
公共广播网络上可以包括任意数量的路由器。
o Reference Topology 4 (Parallel Links)
o 参考拓扑4（平行链路）
/--(link 1)-----\ ( )
DUT Generator--( emulated topology )
\--(link 2)-----/ ( )
/--(link 1)-----\ ( )
DUT Generator--( emulated topology )
\--(link 2)-----/ ( )
In all cases the tests and topologies are designed to allow performance measurements to be taken all on a single device, whether this is the DUT or some other device in the network. This eliminates the need for synchronized clocks within the test networks.
在所有情况下，测试和拓扑设计都允许在单个设备（无论是DUT还是网络中的其他设备）上进行性能测量。这样就不需要在测试网络中同步时钟。
These tests will measure aspects of the OSPF implementation as a process on the device under test, including
这些测试将测量OSPF实现的各个方面，作为测试设备上的一个过程，包括
o time required to process an LSA,
o 处理LSA所需的时间，
o flooding time, and
o 泛洪时间，以及
o Shortest Path First computation.
o 最短路径优先计算。
o Using reference topology 1 (Emulated Topology), begin with all links up and a full adjacency established between the DUT and the generator.
o 使用参考拓扑1（仿真拓扑），从所有连接开始，并在DUT和发电机之间建立完全邻接。
Note: The generator does not have direct knowledge of the state of the adjacency on the DUT. The fact that the adjacency may be in Full state on the generator does not mean that the DUT is ready. It may still (and is likely to) be requesting LSAs from the generator. This process, involving processing of requested LSAs, will affect the results of the test. The generator should either wait until it sees the DUT's router-LSA listing the adjacency with the generator or introduce a configurable delay before starting the test.
注：发电机不直接了解DUT上的邻接状态。发电机上的邻接可能处于满状态并不意味着DUT已准备就绪。它可能仍然（并且很可能）从生成器请求LSA。此过程涉及处理请求的LSA，将影响测试结果。在开始测试之前，发生器应等待直到看到DUT的路由器LSA列出与发生器的相邻位置，或引入可配置的延迟。
o Send an LSA that is already in the DUT (a duplicate LSA), note the time difference between when the LSA is sent and when the ack is received. This measures the time taken to propagate the LSA and the ack, as well as the processing time of the duplicate LSA. This is dupLSAprocTime.
o 发送已在DUT中的LSA（重复LSA），注意发送LSA和接收ack之间的时间差。这测量了传播LSA和ack所花费的时间，以及重复LSA的处理时间。这是Duplsaprotime。
o Send a new LSA from the generator to the DUT, followed immediately by a duplicate LSA (LSA that already resides in the database of DUT, but not the same as the one just sent).
o 从发生器向DUT发送一个新的LSA，然后立即发送一个重复的LSA（已驻留在DUT数据库中的LSA，但与刚刚发送的LSA不同）。
o The DUT will acknowledge this second LSA immediately; note the time of this acknowledgement. This is newLSAprocTime.
o DUT将立即确认第二个LSA；记下此确认的时间。这是新的时间。
The amount of time required for an OSPF implementation to process the new LSA can be computed by subtracting dupLSAprocTime from newLSAprocTime.
OSPF实现处理新LSA所需的时间量可以通过从newLSAprocTime中减去dupLSAprocTime来计算。
Note: The duplicate LSA cannot be the same as the one just sent because of the MinLSInterval restriction [OSPF]. This test is taken from [BLACKBOX].
注意：由于MinLSInterval限制[OSPF]，重复的LSA不能与刚发送的LSA相同。此测试取自[黑盒]。
Note: This time may or may not include the time required to perform flooding-related operations, depending on when the implementation sends the ack: before it floods the LSA further, or after it does, or anywhere in between. In other words, this measurement may not mean the same thing in all implementations.
注意：此时间可能包括也可能不包括执行泛洪相关操作所需的时间，具体取决于实现何时发送ack：在进一步泛洪LSA之前、之后或两者之间的任何时间。换句话说，在所有实现中，这种度量可能并不意味着相同的事情。
o Using reference topology 2 (Generator and Collector), enable OSPF on all links and allow the devices to build full adjacencies. Configure the collector so that it will block all flooding toward the DUT (but so that it continues receiving advertisements from the DUT).
o 使用参考拓扑2（生成器和收集器），在所有链路上启用OSPF，并允许设备构建完全邻接。配置采集器，使其阻止所有向DUT的泛洪（但继续从DUT接收播发）。
o Inject a new set of LSAs from the generator toward the collector and the DUT.
o 从发生器向收集器和DUT注入一组新的LSA。
o On the collector, note the time the flooding is complete across the link to the generator. Also note the time the flooding is complete across the link from the DUT.
o 在收集器上，记录通过链接到生成器的泛洪完成的时间。还应注意从DUT通过链路完成泛洪的时间。
The time from when the last LSA is received on the collector from the generator to when the last LSA is received on the collector from the DUT should be measured during this test. This time is important in link state protocols, since the loop-free nature of the network is reliant on the speed at which revised topology information is flooded.
在本试验期间，应测量从收集器从发电机接收到最后一个LSA到收集器从DUT接收到最后一个LSA的时间。这一时间在链路状态协议中很重要，因为网络的无环特性取决于修改后的拓扑信息被淹没的速度。
Depending on the number of LSAs flooded, the sizes of the LSAs, the number of LSUs, and the rate of flooding, these numbers could vary by some amount. The settings and variances of these numbers should be reported with the test results.
根据被淹没LSA的数量、LSA的大小、LSU的数量和淹没率，这些数字可能会有所不同。这些数字的设置和差异应与测试结果一起报告。
o Use reference topology 1 (Emulated Topology), beginning with the DUT and the generator fully adjacent.
o 使用参考拓扑1（模拟拓扑），从DUT和发电机完全相邻开始。
o The default SPF timer on the DUT should be set to 0 so that any new LSA that arrives immediately results in the SPF calculation [BLACKBOX].
o DUT上的默认SPF定时器应设置为0，以便立即到达的任何新LSA都会导致SPF计算[BLACKBOX]。
o The generator should inject a set of LSAs toward the DUT; the DUT should be allowed to converge and install all best paths in the local routing table, etc.
o 发电机应向DUT注入一组LSA；应允许DUT聚合并在本地路由表中安装所有最佳路径等。
o Send an LSA that is already in the DUT (a duplicate LSA), note the time difference between when the LSA is sent and when the ack is received. This measures the time taken to propagate the LSA and the ack, as well as the processing time of the duplicate LSA. This is dupLSAprocTime.
o 发送已在DUT中的LSA（重复LSA），注意发送LSA和接收ack之间的时间差。这测量了传播LSA和ack所花费的时间，以及重复LSA的处理时间。这是Duplsaprotime。
o Change the link cost between the generator and the emulated network it is advertising, and transmit the new LSA to the DUT.
o 改变发生器和它正在宣传的模拟网络之间的链路成本，并将新的LSA传输到DUT。
o Immediately inject another LSA that is a duplicate of some other LSA the generator has previously injected (preferably a stub network someplace within the emulated network).
o 立即注入另一个LSA，该LSA是生成器先前注入的某些其他LSA的副本（最好是模拟网络中某个位置的存根网络）。
Note: The generator should make sure that outbound LSA packing is not performed for the duplicate LSAs and that they are always sent in a separate Link-state Update packet. Otherwise, if the LSA carrying the topology change and the duplicate LSA are in the same packet, the SPF starts after the duplicate LSA is acked.
注意：生成器应确保不会对重复的LSA执行出站LSA打包，并且它们始终在单独的链路状态更新数据包中发送。否则，如果承载拓扑更改的LSA和重复LSA在同一数据包中，则SPF在重复LSA确认后启动。
o Measure the time between transmitting the second (duplicate) LSA and the acknowledgement for that LSA; this is the totalSPFtime. The total time required to run SPF can be computed by subtracting dupLSAprocTime from totalSPFtime.
o 测量发送第二（重复）LSA和该LSA的确认之间的时间；这是总时间。运行SPF所需的总时间可以通过从TotalSpftTime中减去dupLSAprocTime来计算。
The accuracy of this test is crucially dependent on the amount of time between the transmissions of the first and second LSAs. If too much time elapsed, the test is meaningless because the SPF run will complete before the second (duplicate) LSA is received. If the time elapsed is less, then both LSAs will be handled before the SPF run is scheduled and started, and thus the measurement would only be for the handling of the duplicate LSA.
该测试的准确性在很大程度上取决于第一和第二LSA传输之间的时间量。如果经过的时间太长，则测试没有意义，因为SPF运行将在收到第二个（重复的）LSA之前完成。如果经过的时间较短，则在计划和启动SPF运行之前将处理两个LSA，因此测量仅用于处理重复LSA。
This test is also specified in [BLACKBOX].
该测试也在[黑盒]中规定。
Note: This test may not be accurate on systems that implement OSPF as a multithreaded process, where the flooding takes place in a separate process (or on a different processor) than shortest path first computations.
注意：在将OSPF实现为多线程进程的系统上，此测试可能不准确，其中泛洪发生在与最短路径优先计算不同的单独进程（或不同处理器）中。
It is also possible to measure the SPF time using white box tests (using output supplied by the OSPF software implementer), such as the following:
也可以使用白盒测试（使用OSPF软件实施者提供的输出）测量SPF时间，例如：
o Using reference topology 1 (Emulated Topology), establish a full adjacency between the generator and the DUT.
o 使用参考拓扑1（仿真拓扑），在发电机和DUT之间建立完全邻接。
o Inject a set of LSAs from the generator toward the DUT. Allow the DUT to stabilize and install all best paths in the routing table, etc.
o 从发电机向DUT注入一组LSA。允许DUT稳定并安装路由表中的所有最佳路径等。
o Change the link cost between the DUT and the generator (or the link between the generator and the emulated network it is advertising), such that a full SPF is required to run, although only one piece of information is changed.
o 更改DUT和发电机之间的链路成本（或发电机和它正在宣传的模拟网络之间的链路），以便需要运行完整的SPF，尽管只更改了一条信息。
o Measure the amount of time required for the DUT to compute a new shortest path tree as a result of the topology changes injected by the generator. These measurements should be taken using available show and debug information on the DUT.
o 测量由于发电机注入的拓扑变化，DUT计算新的最短路径树所需的时间量。应使用DUT上可用的显示和调试信息进行这些测量。
Several caveats MUST be mentioned when a white box method of measuring SPF time is used. For instance, such white box tests are only applicable when testing various versions or variations within a single implementation of the OSPF protocol. Further, the same set of commands MUST be used in each iteration of such a test to ensure consistent results.
当使用白盒法测量SPF时间时，必须提到几个注意事项。例如，这种白盒测试仅适用于在OSPF协议的单个实现中测试各种版本或变体时。此外，在此类测试的每次迭代中必须使用相同的命令集，以确保结果一致。
There is an interesting relationship between the SPF times reported by white box (internal) testing and black box (external) testing; each of these two types of tests may be used as a "sanity check" on the other by comparing results.
白盒（内部）测试和黑盒（外部）测试报告的SPF时间之间存在有趣的关系；通过比较结果，这两种测试中的每一种都可以用作另一种测试的“健全性检查”。
See [CONSIDERATIONS] for further discussion.
有关进一步的讨论，请参见[注意事项]。
These tests measure the performance of an OSPF implementation for basic intra-area tasks, including:
这些测试用于测量OSPF实现的基本区域内任务的性能，包括：
o Forming Adjacencies on Point-to-Point Link (Initialization)
o 在点到点链接上形成邻接（初始化）
o Forming Adjacencies on Point-to-Point Links
o 在点到点链接上形成邻接
o Link Up with Information Already in the Database
o 与数据库中已有的信息链接
o Initial convergence Time on a Designated Router Electing (Broadcast) Network
o 指定路由器选择（广播）网络上的初始收敛时间
o Link Down with Layer 2 Detection
o 与第2层检测连接
o Link Down with Layer 3 Detection
o 与第3层检测连接
o Designated Router Election Time on A Broadcast Network
o 广播网络上指定的路由器选择时间
This test measures the time required to form an OSPF adjacency from the time a layer two (data link) connection is formed between two devices running OSPF.
该测试测量从运行OSPF的两个设备之间形成第二层（数据链路）连接开始，形成OSPF邻接所需的时间。
o Use reference topology 1 (Emulated Topology), beginning with the link between the generator and DUT disabled on the DUT. OSPF should be configured and operating on both devices.
o 使用参考拓扑1（仿真拓扑），从发电机和DUT之间的链路开始，DUT上禁用。OSPF应在两个设备上配置和运行。
o Inject a set of LSAs from the generator toward the DUT.
o 从发电机向DUT注入一组LSA。
o Bring the link up at the DUT, noting the time when the link carrier is established on the generator.
o 在DUT处启动链路，记录在发电机上建立链路载体的时间。
o Note the time when the acknowledgement for the last LSA transmitted from the DUT is received on the generator.
o 注意发电机接收到来自DUT的最后一次LSA确认的时间。
The time between the carrier establishment and the acknowledgement for the last LSA transmitted by the generator should be taken as the total amount of time required for the OSPF process on the DUT to react to a link up event with the set of LSAs injected, including the time required for the operating system to notify the OSPF process about the link up, etc. The acknowledgement for the last LSA transmitted is used instead of the last acknowledgement received in order to prevent timing skews due to retransmitted acknowledgements or LSAs.
载波建立和发电机发送的最后一个LSA确认之间的时间应视为DUT上OSPF过程对注入LSA组的连接事件作出反应所需的总时间，包括操作系统通知OSPF进程连接等所需的时间。使用发送的最后一个LSA的确认，而不是接收的最后一个确认，以防止由于重传确认或LSA而导致的时间偏差。
This test measures the time required to form an adjacency from the time the first communication occurs between two devices running OSPF.
该测试测量从运行OSPF的两个设备之间第一次通信开始形成邻接所需的时间。
o Using reference topology 1 (Emulated Topology), configure the DUT and the generator so that traffic can be passed along the link between them.
o 使用参考拓扑1（模拟拓扑），配置DUT和生成器，以便流量可以沿着它们之间的链路传递。
o Configure the generator so that OSPF is running on the point-to-point link toward the DUT, and inject a set of LSAs.
o 配置发生器，使OSPF在指向DUT的点对点链路上运行，并注入一组LSA。
o Configure the DUT so that OSPF is initialized, but not running on the point-to-point link between the DUT and the generator.
o 配置DUT，使OSPF初始化，但不在DUT和发电机之间的点对点链路上运行。
o Enable OSPF on the interface between the DUT and the generator on the DUT.
o 在DUT和DUT上的发电机之间的接口上启用OSPF。
o Note the time of the first hello received from the DUT on the generator.
o 记下发电机上从DUT接收到的第一次hello的时间。
o Note the time of the acknowledgement from the DUT for the last LSA transmitted on the generator.
o 记录DUT对发电机上传输的最后一个LSA的确认时间。
The time between the first hello received and the acknowledgement for the last LSA transmitted by the generator should be taken as the total amount of time required for the OSPF process on the DUT to build a FULL neighbor adjacency with the set of LSAs injected. The acknowledgement for the last LSA transmitted is used instead of the last acknowledgement received in order to prevent timing skews due to retransmitted acknowledgements or LSAs.
从接收到的第一个hello到生成器发送的最后一个LSA的确认之间的时间应被视为在DUT上OSPF进程与注入的LSA集建立完全邻接所需的总时间。使用最后发送的LSA的确认代替最后接收的确认，以防止由于重新发送的确认或LSA而导致的定时偏差。
o Using reference topology 2 (Generator and Collector), configure all three devices to run OSPF.
o 使用参考拓扑2（生成器和收集器），将所有三个设备配置为运行OSPF。
o Configure the DUT so that the link between the DUT and the generator is disabled.
o 配置DUT，以禁用DUT和发电机之间的链路。
o Inject a set of LSAs into the network from the generator; the DUT should receive these LSAs through normal flooding from the collector.
o 从发电机向网络中注入一组LSA；DUT应通过收集器的正常泛洪接收这些LSA。
o Enable the link between the DUT and the generator.
o 启用DUT和发电机之间的链路。
o Note the time of the first hello received from the DUT on the generator.
o 记下发电机上从DUT接收到的第一次hello的时间。
o Note the time of the last DBD (Database Description) received on the generator.
o 记下生成器上接收到的最后一个DBD（数据库描述）的时间。
o Note the time of the acknowledgement from the DUT for the last LSA transmitted on the generator.
o 记录DUT对发电机上传输的最后一个LSA的确认时间。
The time between the hello received by the generator from the DUT and the acknowledgement for the last LSA transmitted by the generator should be taken as the total amount of time required for the OSPF process on the DUT to build a FULL neighbor adjacency with the set of LSAs injected. In this test, the DUT is already aware of the entire network topology, so the time required should only include the processing of DBDs exchanged when in EXCHANGE state, the time to build a new router LSA containing the new connection information, and the time required to flood and acknowledge this new router LSA.
生成器从DUT接收到hello和生成器发送的最后一个LSA确认之间的时间应视为DUT上OSPF进程与注入的LSA集建立完全邻接所需的总时间。在该测试中，DUT已经知道整个网络拓扑，因此所需的时间应仅包括在交换状态下交换的DBD的处理、构建包含新连接信息的新路由器LSA的时间以及泛洪和确认该新路由器LSA所需的时间。
The acknowledgement for the last LSA transmitted is used instead of the last acknowledgement received in order to prevent timing skews due to retransmitted acknowledgements or LSAs.
使用最后发送的LSA的确认代替最后接收的确认，以防止由于重新发送的确认或LSA而导致的定时偏差。
o Using reference topology 3 (Broadcast Network), configure R1 to be the designated router on the link, and the DUT to be the backup designated router.
o 使用参考拓扑3（广播网络），将R1配置为链路上的指定路由器，将DUT配置为备份指定路由器。
o Enable OSPF on the common broadcast link on all the routers in the test bed.
o 在测试台上所有路由器的公共广播链路上启用OSPF。
o Disable the broadcast link on R1.
o 禁用R1上的广播链接。
o Note the time of the last hello received from R1 on R2.
o 记下R2上最后一次从R1收到hello的时间。
o Note the time of the first network LSA generated by the DUT as received on R2.
o 记下在R2上接收到的DUT生成的第一个网络LSA的时间。
The time between the last hello received on R2 and the first network LSA generated by the DUT should be taken as the amount of time required for the DUT to complete a designated router election computation. Note that this test includes the dead interval timer at the DUT, so this time may be factored out, or the hello and dead intervals may be reduced to lessen these timers' impact on the overall test times. All changed timers, the number of routers connected to the link, and other variable factors should be noted in the test results.
R2上接收到的最后一个hello与DUT生成的第一个网络LSA之间的时间应视为DUT完成指定路由器选择计算所需的时间量。注意，该测试包括DUT上的死区时间间隔计时器，因此该时间可以被计算出来，或者可以减少hello和死区时间间隔，以减少这些计时器对整体测试时间的影响。测试结果中应注明所有更改的定时器、连接到链路的路由器数量以及其他可变因素。
Note: If R1 sends a "goodbye hello", typically a hello with its neighbor list empty, in the process of shutting down its interface, using the time when this hello is received instead of the time when the last one was would provide a more accurate measurement.
注意：如果R1在关闭其接口的过程中发送“再见你好”，通常是邻居列表为空的你好，则使用收到此你好的时间而不是上次收到的时间将提供更准确的测量。
o Using reference topology 3 (Broadcast Network), begin with the DUT connected to the network with OSPF enabled. OSPF should be enabled on R1, but the broadcast link should be disabled.
o 使用参考拓扑3（广播网络），从连接到启用OSPF的网络的DUT开始。应在R1上启用OSPF，但应禁用广播链路。
o Enable the broadcast link between R1 and the DUT. Note the time of the first hello received by R1.
o 启用R1和DUT之间的广播链路。记下R1收到第一个hello的时间。
o Note the time when the first network LSA is flooded by the DUT at R1.
o 记录第一个网络LSA在R1处被DUT淹没的时间。
o The difference between the first hello and the first network LSA is the time required by the DUT to converge on this new topology.
o 第一个hello和第一个网络LSA之间的差异是DUT在这个新拓扑上收敛所需的时间。
This test assumes that the DUT will be the designated router on the broadcast link. A similar test could be designed to test the convergence time when the DUT is not the designated router.
该测试假设DUT将是广播链路上的指定路由器。当DUT不是指定路由器时，可以设计类似的测试来测试收敛时间。
This test maybe performed with a varying number of devices attached to the broadcast network, and with varying sets of LSAs being advertised to the DUT from the routers attached to the broadcast network. Variations in the LSA sets and other factors should be noted in the test results.
该测试可以使用连接到广播网络的不同数量的设备来执行，并且使用从连接到广播网络的路由器向DUT播发的不同LSA集来执行。试验结果中应注意LSA组和其他因素的变化。
The time required to elect a designated router, as measured in Section 6.4, above, may be subtracted from the results of this test to provide just the convergence time across a broadcast network.
选择指定路由器所需的时间（如上文第6.4节所测）可从该测试结果中减去，以提供整个广播网络的收敛时间。
Note that although all the other tests in this document include route calculation time in the convergence time, as described in [TERM], this test may not include route calculation time in the resulting measured convergence time, because initial route calculation may occur after the first network LSA is flooded.
注意，尽管本文件中的所有其他测试包括收敛时间中的路由计算时间，如[TERM]中所述，但该测试可能不包括结果测量收敛时间中的路由计算时间，因为初始路由计算可能发生在第一个网络LSA被淹没后。
o Using reference topology 3 (Broadcast Network), begin with the DUT connected to the network with OSPF enabled. OSPF should be enabled on R1, but the broadcast link should be disabled.
o 使用参考拓扑3（广播网络），从连接到启用OSPF的网络的DUT开始。应在R1上启用OSPF，但应禁用广播链路。
o Enable the broadcast link between R1 and the DUT. Note the time of the first hello transmitted by the DUT with a designated router listed.
o 启用R1和DUT之间的广播链路。记下DUT通过列出的指定路由器发送的第一个hello的时间。
o Note the time when the first network LSA is flooded by the DUT at R1.
o 记录第一个网络LSA在R1处被DUT淹没的时间。
o The time difference between the first hello with a designated router lists and the first network LSA is the period required by the DUT to converge on this new topology.
o 具有指定路由器列表的第一个hello与第一个网络LSA之间的时间差是DUT在该新拓扑上收敛所需的时间。
o Using reference topology 4 (Parallel Links), begin with OSPF in the Full state between the generator and the DUT. Both links should be point-to-point links with the ability to notify the operating system immediately upon link failure.
o 使用参考拓扑4（并行链路），从发电机和DUT之间处于满状态的OSPF开始。两个链路都应该是点对点链路，能够在链路出现故障时立即通知操作系统。
o Disable link 1; this should be done in such a way that the keepalive timers at the data link layer will have no impact on the DUT recognizing the link failure (the operating system in the DUT
o 禁用链路1；这样做的方式应确保数据链路层的keepalive定时器不会影响DUT识别链路故障（DUT中的操作系统
should recognize this link failure immediately). Disconnecting the cable on the generator end would be one possibility; shutting the link down would be another.
应立即识别此链接故障）。断开发电机端的电缆是一种可能性；关闭链接将是另一种情况。
o Note the time of the link failure on the generator.
o 记录发电机上链路故障的时间。
o At the generator, note the time of the receipt of the new router LSA from the DUT notifying the generator of the link 2 failure.
o 在发生器处，记录从DUT接收到新路由器LSA的时间，通知发生器链路2故障。
The difference in the time between the initial link failure and the receipt of the LSA on the generator across link 2 should be taken as the time required for an OSPF implementation to recognize and process a link failure, including the time required to generate and flood an LSA describing the link down event to an adjacent neighbor.
初始链路故障和通过链路2在生成器上接收LSA之间的时间差应被视为OSPF实现识别和处理链路故障所需的时间，包括生成和向相邻邻居发送描述链路中断事件的LSA所需的时间。
o Using reference topology 4 (Parallel Links), begin with OSPF in the Full state between the generator and the DUT.
o 使用参考拓扑4（并行链路），从发电机和DUT之间处于满状态的OSPF开始。
o Disable OSPF processing on link 1 from the generator. This should be done in such a way that it does not affect link status; the DUT MUST note the failure of the adjacency through the dead interval.
o 从生成器禁用链路1上的OSPF处理。这应以不影响链路状态的方式进行；DUT必须注意通过死区间隔的相邻故障。
o At the generator, note the time of the receipt of the new router LSA from the DUT notifying the generator of the link 2 failure.
o 在发生器处，记录从DUT接收到新路由器LSA的时间，通知发生器链路2故障。
The difference in the time between the initial link failure and the receipt of the LSA on the generator across link 2 should be taken as the time required for an OSPF implementation to recognize and process an adjacency failure.
初始链路故障与通过链路2在发电机上接收LSA之间的时间差应视为OSPF实现识别和处理邻接故障所需的时间。
This document does not modify the underlying security considerations in [OSPF].
本文档不修改[OSPF]中的基本安全注意事项。
Thanks to Howard Berkowitz (hcb@clark.net) for his encouragement and support. Thanks also to Alex Zinin (zinin@psg.net), Gurpreet Singh (Gurpreet.Singh@SpirentCom.com), and Yasuhiro Ohara (yasu@sfc.wide.ad.jp) for their comments.
多亏了霍华德·伯克维茨(hcb@clark.net)感谢他的鼓励和支持。也要感谢亚历克斯·齐宁(zinin@psg.net)，Gurpreet Singh（Gurpreet。Singh@SpirentCom.com)和大原康弘(yasu@sfc.wide.ad.jp)感谢他们的评论。
[OSPF] Moy, J., "OSPF Version 2", STD 54, RFC 2328, April 1998.
[OSPF]Moy，J.，“OSPF版本2”，STD 54，RFC 23281998年4月。
[TERM] Manral, V., White, R., and A. Shaikh, "OSPF Benchmarking Terminology and Concepts", RFC 4062, April 2005.
[术语]Manral，V.，White，R.，和A.Shaikh，“OSPF基准术语和概念”，RFC 4062，2005年4月。
[CONSIDERATIONS] Manral, V., White, R., and A. Shaikh, "Considerations When Using Basic OSPF Convergence Benchmarks", RFC 4063, April 2005.
[注意事项]Manral，V.，White，R.，和A.Shaikh，“使用基本OSPF收敛基准时的注意事项”，RFC 4063，2005年4月。
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, March 1997.
[RFC2119]Bradner，S.，“RFC中用于表示需求水平的关键词”，BCP 14，RFC 2119，1997年3月。
[INTERCONNECT] Bradner, S. and J. McQuaid, "Benchmarking Methodology for Network Interconnect Devices", RFC 2544, March 1999.
[互连]Bradner，S.和J.McQuaid，“网络互连设备的基准测试方法”，RFC 2544，1999年3月。
[FIB-TERM] Trotter, G., "Terminology for Forwarding Information Base (FIB) based Router Performance", RFC 3222, December 2001.
[FIB-TERM]Trotter，G.“基于转发信息库（FIB）的路由器性能术语”，RFC3222，2001年12月。
[BLACKBOX] Shaikh, A. and Greenberg, A., "Experience in Black-box OSPF measurement", Proc. ACM SIGCOMM Internet Measurement Workshop (IMW), November 2001
[BLACKBOX]Shaikh，A.和Greenberg，A.，“黑箱OSPF测量的经验”，Proc。ACM SIGCOMM互联网测量研讨会（IMW），2001年11月
Authors' Addresses
作者地址
Vishwas Manral SiNett Corp, Ground Floor, Embassy Icon Annexe, 2/1, Infantry Road, Bangalore, India
印度班加罗尔步兵路2/1号大使馆图标附件一楼Vishwas Manral SiNett公司
EMail: vishwas@sinett.com
EMail: vishwas@sinett.com
Russ White Cisco Systems, Inc. 7025 Kit Creek Rd. Research Triangle Park, NC 27709
Russ White Cisco Systems，Inc.地址：北卡罗来纳州三角研究公园Kit Creek路7025号，邮编：27709
EMail: riw@cisco.com
EMail: riw@cisco.com
Aman Shaikh AT&T Labs (Research) 180 Park Av, PO Box 971 Florham Park, NJ 07932
Aman Shaikh AT&T实验室（研究）180 Park Av，邮政信箱971 Florham Park，NJ 07932
EMail: ashaikh@research.att.com
EMail: ashaikh@research.att.com
Full Copyright Statement
完整版权声明
Copyright (C) The Internet Society (2005).
版权所有（C）互联网协会（2005年）。
This document is subject to the rights, licenses and restrictions contained in BCP 78, and except as set forth therein, the authors retain all their rights.
本文件受BCP 78中包含的权利、许可和限制的约束，除其中规定外，作者保留其所有权利。
This document and the information contained herein are provided on an "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY AND THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
本文件及其包含的信息是按“原样”提供的，贡献者、他/她所代表或赞助的组织（如有）、互联网协会和互联网工程任务组不承担任何明示或暗示的担保，包括但不限于任何保证，即使用本文中的信息不会侵犯任何权利，或对适销性或特定用途适用性的任何默示保证。
Intellectual Property
知识产权
The IETF takes no position regarding the validity or scope of any Intellectual Property Rights or other rights that might be claimed to pertain to the implementation or use of the technology described in this document or the extent to which any license under such rights might or might not be available; nor does it represent that it has made any independent effort to identify any such rights. Information on the procedures with respect to rights in RFC documents can be found in BCP 78 and BCP 79.
IETF对可能声称与本文件所述技术的实施或使用有关的任何知识产权或其他权利的有效性或范围，或此类权利下的任何许可可能或可能不可用的程度，不采取任何立场；它也不表示它已作出任何独立努力来确定任何此类权利。有关RFC文件中权利的程序信息，请参见BCP 78和BCP 79。
Copies of IPR disclosures made to the IETF Secretariat and any assurances of licenses to be made available, or the result of an attempt made to obtain a general license or permission for the use of such proprietary rights by implementers or users of this specification can be obtained from the IETF on-line IPR repository at http://www.ietf.org/ipr.
向IETF秘书处披露的知识产权副本和任何许可证保证，或本规范实施者或用户试图获得使用此类专有权利的一般许可证或许可的结果，可从IETF在线知识产权存储库获取，网址为http://www.ietf.org/ipr.
The IETF invites any interested party to bring to its attention any copyrights, patents or patent applications, or other proprietary rights that may cover technology that may be required to implement this standard. Please address the information to the IETF at ietf-ipr@ietf.org.
IETF邀请任何相关方提请其注意任何版权、专利或专利申请，或其他可能涵盖实施本标准所需技术的专有权利。请将信息发送至IETF的IETF-ipr@ietf.org.
Acknowledgement
确认
Funding for the RFC Editor function is currently provided by the Internet Society.
RFC编辑功能的资金目前由互联网协会提供。