draft-ietf-bmwg-ospfconv-intraarea-03.txt   draft-ietf-bmwg-ospfconv-intraarea-04.txt 
Network Working Group Vishwas Manral Network Working Group Vishwas Manral
Internet Draft Netplane Systems Internet Draft Netplane Systems
Russ White Russ White
Cisco Systems Cisco Systems
Aman Shaikh Aman Shaikh
Expiration Date: June 2003 University of California Expiration Date: September 2003 University of California
File Name: draft-ietf-bmwg-ospfconv-intraarea-03.txt January 2003 File Name: draft-ietf-bmwg-ospfconv-intraarea-04.txt March 2003
Benchmarking Methodology for Basic OSPF Convergence Benchmarking Methodology for Basic OSPF Convergence
draft-ietf-bmwg-ospfconv-intraarea-03.txt draft-ietf-bmwg-ospfconv-intraarea-04.txt
1. Status of this Memo 1. Status of this Memo
This document is an Internet-Draft and is in full conformance with This document is an Internet-Draft and is in full conformance with
all provisions of Section 10 of RFC2026. all provisions of Section 10 of RFC2026.
Internet Drafts are working documents of the Internet Engineering Internet Drafts are working documents of the Internet Engineering
Task Force (IETF), its Areas, and its Working Groups. Note that other Task Force (IETF), its Areas, and its Working Groups. Note that other
groups may also distribute working documents as Internet Drafts. groups may also distribute working documents as Internet Drafts.
skipping to change at page 1, line 38 skipping to change at page 1, line 38
The list of current Internet-Drafts can be accessed at The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt http://www.ietf.org/ietf/1id-abstracts.txt
The list of Internet-Draft Shadow Directories can be accessed at The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html. http://www.ietf.org/shadow.html.
2. Abstract 2. Abstract
This draft establishes standards for measuring OSPF convergence This draft establishes standards for measuring OSPF convergence
performance on a single router (SR-Convergence [4]). Its initial performance on a single router (SR-Convergence [TERM]). Its initial
emphasis is on the control plane of single OSPF routers. We do not emphasis is on the control plane of single OSPF routers. We do not
address forwarding plane performance. address forwarding plane performance.
3. Conventions used in this document 3. Motivation
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 [1].
4. Motivation
There is a growing interest in routing protocol SR-Convergence There is a growing interest in routing protocol SR-Convergence
testing, with many people looking at various tests to determine how testing, with many people looking at various tests to determine how
long it takes for a network to converge after various conditions long it takes for a network to converge after various conditions
occur. The major problem with this sort of testing is that the occur. The major problem with this sort of testing is that the
framework of the tests has a major impact on the results; for framework of the tests has a major impact on the results; for
instance, determining when a network is converged, what parts of the instance, determining when a network is converged, what parts of the
router's operation are considered within the testing, and other such router's operation are considered within the testing, and other such
things will have a major impact on what apparent performance routing things will have a major impact on what apparent performance routing
protocols provide. protocols provide.
This document attempts to provide a framework within which Open This document attempts to provide a framework within which Open
Shortest Path First (OSPF) [2] performance testing can be placed, and Shortest Path First [OSPF] performance testing can be placed, and
provide some tests with which some aspects of OSPF performance can be provide some tests with which some aspects of OSPF performance can be
measured. The motivation of the draft is to provide a set of tests measured. The motivation of the draft is to provide a set of tests
that can provide the user comparable data from various vendors with that can provide the user comparable data from various vendors with
which to evaluate the OSPF protocol performance on the devices. which to evaluate the OSPF protocol performance on the devices.
5. Overview & Scope 4. Overview & Scope
While this document describes a specific set of tests aimed at While this document describes a specific set of tests aimed at
characterizing the SR-Convergence performance of OSPF processes in characterizing the SR-Convergence performance of OSPF processes in
routers or other boxes that incorporate OSPF functionality, a key routers or other boxes that incorporate OSPF functionality, a key
objective is to propose methodology that will standardize the objective is to propose methodology that will standardize the
conducting and reporting of convergence-related measurements. conducting and reporting of convergence-related measurements.
Things which are outside the scope of this document include: Things which are outside the scope of this document include:
o The interactions of SR-Convergence and forwarding; testing is o The interactions of SR-Convergence and forwarding; testing is
restricted to events occurring within the control plane. For- restricted to events occurring within the control plane. For-
warding performance is the primary focus in [3] and it is warding performance is the primary focus in [INTERCONNECT]
expected to be dealt with in work that ensues from [6]. and it is expected to be dealt with in work that ensues from
[FIB-TERM].
o Inter area routing, AS-external routing, and simultaneous o Inter area routing, AS-external routing, and simultaneous
traffic on the control and data paths within the DUT. traffic on the control and data paths within the DUT.
Other drafts in the future may cover some of the items noted as not Other drafts in the future may cover some of the items noted as not
covered in the scope of this draft. For a discussion of the covered in the scope of this draft. For a discussion of the terminol-
terminology used in this draft (in relation to the tests themselves), ogy used in this draft (in relation to the tests themselves), refer
refer to [4]. For a discussion of the applicability of this draft, to [TERM]. For a discussion of the applicability of this draft, refer
refer to [8]. to [APPLICABILITY].
6. Test Conditions While this draft assumes OSPFv2, which only carries routing informa-
tion for IPv4 destinations, nothing in this draft precludes it from
use with OSPFv3, which carries IPv6 destinations.
5. Test Conditions
In all tests, the following test conditions will be assumed: In all tests, the following test conditions will be assumed:
o The link speed should be high enough so that does not become o The link speed should be high enough so that does not become
a bottleneck. Link speeds of 10MBps or higher are recom- a bottleneck. Link speeds of 10MBps or higher are recom-
mended. The link speed between routers should be specified in mended. The link speed between routers should be specified in
the test report. the test report.
o For all point-to-point links, it is assumed that a link o For all point-to-point links, it is assumed that a link
failure results in an immediate notification to the operating failure results in an immediate notification to the operating
system, and thus to the OSPF process; this is explained system, and thus to the OSPF process; this is explained
thoroughly in [5]. thoroughly in [MILLISEC].
o No data traffic will be running between the routers during o No data traffic will be running between the routers during
these tests. these tests.
o Optional capabilities which can reduce performance, such as o Optional capabilities which can reduce performance, such as
authentication, should be noted in the test results if they authentication, should be noted in the test results if they
are enabled. are enabled.
o Optional changes in the default timer values, such as the o Optional changes in the default timer values, such as the
SPF, hello, router dead, and other intervals, should be noted SPF, hello, router dead, and other intervals, should be noted
in the test results. in the test results.
o All places where injecting a set of LSAs is referenced, the o All places where injecting a set of LSAs is referenced, the
set can include varying numbers of LSAs of varying types set can include varying numbers of LSAs of varying types
representing a varying number of reachable destinations. See representing a varying number of reachable destinations. See
[4] for further information about issues with LSA sets and [TERM] for further information about issues with LSA sets and
network topologies. network topologies.
Tests should be run more than once, since a single test run Tests should be run more than once, since a single test run
cannot be relied on to produce statistically sound results. cannot be relied on to produce statistically sound results.
The number of test runs and any variations between the tests The number of test runs and any variations between the tests
should be recorded in the test results (see [4] for more should be recorded in the test results (see [TERM] for more
information on what items should be recorded in the test information on what items should be recorded in the test
results). results).
7. Reference Topologies 6. Reference Topologies
Several reference topologies will be used throughout the tests Several reference topologies will be used throughout the tests
described in the remainder of this document. Rather than repeating described in the remainder of this document. Rather than repeating
these topologies, we've gathered them all in one section. these topologies, we've gathered them all in one section.
o Reference Topology 1 o Reference Topology 1 (Emulated Topology)
( ) ( )
DUT----Generator----( emulated topology ) DUT----Generator----( emulated topology )
( ) ( )
A simple back-to-back configuration. It's assumed that the A simple back-to-back configuration. It's assumed that the
link between the generator and the DUT is a point-to-point link between the generator and the DUT is a point-to-point
link, while the connections within the generator represent link, while the connections within the generator represent
some emulated topology. some emulated topology.
o Reference Topology 2 o Reference Topology 2 (Generator and Collector)
( ) ( )
Collector-----DUT-----Generator--( emulated topology ) Collector-----DUT-----Generator--( emulated topology )
\ / ( ) \ / ( )
\------------/ \------------/
All routers are connected through point-to-point links. The All routers are connected through point-to-point links. The
cost of all links is assumed to be the same unless otherwise cost of all links is assumed to be the same unless otherwise
noted. noted.
o Reference Topology 3 o Reference Topology 3 (Broadcast Network)
DUT R1 R2 DUT R1 R2
| | | | | |
-+------+------+-----..... -+------+------+-----.....
Any number of routers could be included on the common broad- Any number of routers could be included on the common broad-
cast network. cast network.
o Reference Topology 4 o Reference Topology 4 (Parallel Links)
/--(link 1)-----\ ( ) /--(link 1)-----\ ( )
DUT Generator--( emulated topology ) DUT Generator--( emulated topology )
\--(link 2)-----/ ( ) \--(link 2)-----/ ( )
In all cases the tests and topologies are designed to allow perfor- In all cases the tests and topologies are designed to allow perfor-
mance measurements to be taken all on a single device, whether the mance measurements to be taken all on a single device, whether the
DUT or some other device in the network. This eliminates the need for DUT or some other device in the network. This eliminates the need for
syncronized clocks within the test networks. syncronized clocks within the test networks.
8. Basic Process Performance Tests 7. Basic Process Performance Tests
These tests will measure aspects of the OSPF implementation as a pro- These tests will measure aspects of the OSPF implementation as a pro-
cess on the device under test, including: cess on the device under test, including:
o Time required to process an LSA o Time required to process an LSA
o Flooding time o Flooding time
o Shortest Path First computation o Shortest Path First computation
8.1. Time required to process an LSA 7.1. Time required to process an LSA
o Using reference topology 1, begin with all links up and a o Using reference topology 1 (Emulated Topology), begin with
full adjacency established between the DUT and the generator. all links up and a full adjacency established between the DUT
and the generator.
o Send an LSA that is already there in the DUT (a duplicate o Send an LSA that is already there in the DUT (a duplicate
LSA), note the time difference between when the LSA is sent LSA), note the time difference between when the LSA is sent
to when the ack is received. This measures the time to pro- to when the ack is received. This measures the time to pro-
pagate the LSA and the ack, as well as processing time of the pagate the LSA and the ack, as well as processing time of the
duplicate LSA. This is dupLSAprocTime. duplicate LSA. This is dupLSAprocTime.
o Send a new LSA from the generator to the DUT, followed o Send a new LSA from the generator to the DUT, followed
immediately by a duplicate LSA (LSA that already resides in immediately by a duplicate LSA (LSA that already resides in
the database of DUT, but not the same as the one just sent). the database of DUT, but not the same as the one just sent).
o The DUT will acknowledge this second LSA immediately; note o The DUT will acknowledge this second LSA immediately; note
the time of this acknowledgement. This is newLSAprocTime. the time of this acknowledgement. This is newLSAprocTime.
The amount of time required for an OSPF implementation to The amount of time required for an OSPF implementation to
process the new LSA can be computed by subtracting process the new LSA can be computed by subtracting
dupLSAprocTime from newLSAprocTime. dupLSAprocTime from newLSAprocTime.
Note: The duplicate LSA cannot be the same as the one just Note: The duplicate LSA cannot be the same as the one just
sent because of the MinLSInterval restriction.[RFC2328] This sent because of the MinLSInterval restriction.[RFC2328] This
test is taken from [7]. test is taken from [BLACKBOX].
8.2. Flooding Time 7.2. Flooding Time
o Using reference topology 2, enable OSPF on all links and o Using reference topology 2 (Generator and Colelctor),
allow the devices to build full adjacencies. Configure the enable OSPF on all links and allow the devices to build
collector so it will block all flooding towards the DUT, full adjacencies. Configure the collector so it will block
although it continues receiving advertisements from the all flooding towards the DUT, although it continues
DUT. receiving advertisements from the DUT.
o Inject a new set of LSAs from the generator towards the o Inject a new set of LSAs from the generator towards the
collector and the DUT. collector and the DUT.
o On the collector, note the time the flooding is complete o On the collector, note the time the flooding is complete
across the link to the generator. Also note the time the across the link to the generator. Also note the time the
flooding is complete across the link from the DUT. flooding is complete across the link from the DUT.
Two measurements can be taken from this test: Two measurements can be taken from this test:
skipping to change at page 6, line 32 skipping to change at page 6, line 33
Depending on the number of LSAs flooded, the sizes of the Depending on the number of LSAs flooded, the sizes of the
LSAs, and the rate of flooding, these numbers could vary by LSAs, and the rate of flooding, these numbers could vary by
some amount. The settings and variances of these numbers some amount. The settings and variances of these numbers
should be reported with the test results. should be reported with the test results.
This time is important in link state protocols, since the This time is important in link state protocols, since the
loop free nature of the network is reliant on the speed at loop free nature of the network is reliant on the speed at
which revised topology information is flooded. which revised topology information is flooded.
8.3. Shortest Path First Computation Time (Internal Test) 7.3. Shortest Path First Computation Time
o Using reference topology 1, establish a full adjacency
between the generator and the DUT.
o Inject a set of LSAs from the generator towards the DUT.
Allow the DUT to stabilize and install all best paths in
the routing table, etc.
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 Measure the amount of time required for the DUT to compute
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.
The test results should note what available commands were
used to determine the length of the shortest path first run,
and should note any performance implications of monitoring
the SPF calculations using information available from the DUT
itself.
8.4. Shortest Path First Computation Time (External Test)
o Use reference topology 1, beginning with the DUT and the o Use reference topology 1 (Emulated Toplogy), beginning
generator fully adjacent. with the DUT and the generator fully adjacent.
o The default SPF timer on the DUT should be set to 0, so o The default SPF timer on the DUT should be set to 0, so
that any new LSA that arrives, immediately results in the that any new LSA that arrives, immediately results in the
SPF calculation [7]. SPF calculation [BLACKBOX].
o The generator should inject a set of LSAs towards the DUT; o The generator should inject a set of LSAs towards the DUT;
the DUT should be allowed to converge and install all best the DUT should be allowed to converge and install all best
paths in the local routing table, etc.. paths in the local routing table, etc..
o Send an LSA that is already there in the DUT (a duplicate o Send an LSA that is already there in the DUT (a duplicate
LSA), note the time difference between when the LSA is LSA), note the time difference between when the LSA is
sent to when the ack is received. This measures the time sent to when the ack is received. This measures the time
to propagate the LSA and the ack, as well as processing to propagate the LSA and the ack, as well as processing
time of the duplicate LSA. This is dupLSAprocTime. time of the duplicate LSA. This is dupLSAprocTime.
skipping to change at page 8, line 11 skipping to change at page 7, line 32
The accuracy of this test is crucially dependant on the The accuracy of this test is crucially dependant on the
amount of time between the transmission of the first and amount of time between the transmission of the first and
second LSAs. If there is too much time between them, the test second LSAs. If there is too much time between them, the test
is meaningless because the SPF run will complete before the is meaningless because the SPF run will complete before the
second (duplicate) LSA is received. If there is too little second (duplicate) LSA is received. If there is too little
time between the LSAs being generated, then they will both be time between the LSAs being generated, then they will both be
handled before the SPF run is scheduled and started, and thus handled before the SPF run is scheduled and started, and thus
the measurement would only be for the handling of the dupli- the measurement would only be for the handling of the dupli-
cate LSA. cate LSA.
This test is also specified in [7]. This test is also specified in [BLACKBOX].
Note: This test may not be accurate on systems which imple- Note: This test may not be accurate on systems which
ment OSPF as a multithreaded process, where the flooding implement OSPF as a multithreaded process, where the
takes place in a separate process (or on a different proces- flooding takes place in a separate process (or on a dif-
sor) than shortest path first computations. ferent processor) than shortest path first computations.
9. Basic Intra-Area OSPF tests It is also possible to measure the SPF time using white box
tests (using output supplied by the OSPF software impelem-
tor). For instance:
o Using reference topology 1 (Emulated Topology), establish
a full adjacency between the generator and the DUT.
o Inject a set of LSAs from the generator towards the DUT.
Allow the DUT to stabilize and install all best paths in
the routing table, etc.
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 Measure the amount of time required for the DUT to compute
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.
Several caveats must be mentioned when using a white box
method of measuring SPF time; for instance, such white box
tests are only applicable when testing various versions or
variations within a single implementation of the OSPF proto-
col. Futher, the same set of commands must be used in each
iteration of such a test, to ensure consistent results.
There is some interesting relationship between the SPF times
reported by internal, white box, testing, and external, black
box testing; these two types of tests may be used as a "san-
ity check" on the other type of tests, by comparing the
results of the two tests.
See [APPLICABILITY] for further discussion.
8. Basic Intra-Area OSPF tests
These tests measure the performance of an OSPF implementation for These tests measure the performance of an OSPF implementation for
basic intra-area tasks, including: basic intra-area tasks, including:
o Forming Adjacencies on Point-to-Point Link Initialization o Forming Adjacencies on Point-to-Point Link (Initialization)
o Forming Adjacencies on Point-to-Point Links o Forming Adjacencies on Point-to-Point Links
o Link Up with Information Already in the Database o Link Up with Information Already in the Database
o Initial SR-Convergence Time on a DR electing (broadcast) network o Initial SR-Convergence Time on a Designated Router Electing
(Broadcast) Network
o Point-to-point Link Down with Layer 2 Detection o Link Down with Layer 2 Detection
o Broadcast Media Link Down with Layer 3 Detection o Link Down with Layer 3 Detection
o Designated Router Election Time on A Broadcast Network o Designated Router Election Time on A Broadcast Network
9.1. Forming Adjacencies on Point-to-Point Link Initialization 8.1. Forming Adjacencies on Point-to-Point Link (Initialization)
o Use reference topology 1, beginning with the link between This test measures the time required to form an OSPF adjacency from
the generator and DUT disabled on the DUT. OSPF should be the time a layer two (data link) connection is formed between two
configured and operating on both devices. devices running 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 Inject a set of LSAs from the generator towards the DUT. o Inject a set of LSAs from the generator towards the DUT.
o Bring the link up at the DUT, noting the time that the o Bring the link up at the DUT, noting the time that the
link carrier is established on the generator. link carrier is established on the generator.
o Note the time the acknowledgement for the last LSA o Note the time the acknowledgement for the last LSA
transmitted from the DUT is received on the generator. transmitted from the DUT is received on the generator.
The time between the carrier establishment and the ack- The time between the carrier establishment and the ack-
nowledgement for the last LSA transmitted by the generator nowledgement for the last LSA transmitted by the generator
should be taken as the total amount of time required for the 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 OSPF process on the DUT to react to a link up event with the
set of LSAs injected, including the time required for the set of LSAs injected, including the time required for the
operating system to notify the OSPF process about the link operating system to notify the OSPF process about the link
up, etc.. The acknowledgement for the last LSA transmitted is up, etc.. The acknowledgement for the last LSA transmitted is
used instead of the last acknowledgement received in order to used instead of the last acknowledgement received in order to
prevent timing skews due to retransmitted acknowledgements or prevent timing skews due to retransmitted acknowledgements or
LSAs. LSAs.
9.2. Forming Adjacencies on Point-to-Point Links 8.2. Forming Adjacencies on Point-to-Point Links
o Using reference topology 1, configure the DUT and the gen- This test measures the time required to form an adjacency from the
erator so traffic can be passed along the link between time the first communication occurs between two devices running OSPF.
them.
o Using reference topology 1 (Emulated Topology), configure
the DUT and the generator so traffic can be passed along
the link between them.
o Configure the generator so OSPF is running on the point- o Configure the generator so OSPF is running on the point-
to-point link towards the DUT, and inject a set of LSAs. to-point link towards the DUT, and inject a set of LSAs.
o Configure the DUT so OSPF is initialized, but not running o Configure the DUT so OSPF is initialized, but not running
on the point-to-point link between the DUT and the genera- on the point-to-point link between the DUT and the genera-
tor. tor.
o Enable OSPF on the interface between the DUT and the gen- o Enable OSPF on the interface between the DUT and the gen-
erator on the DUT. erator on the DUT.
skipping to change at page 10, line 5 skipping to change at page 10, line 23
The time between the first hello received and the ack- The time between the first hello received and the ack-
nowledgement for the last LSA transmitted by the generator nowledgement for the last LSA transmitted by the generator
should be taken as the total amount of time required for the should be taken as the total amount of time required for the
OSPF process on the DUT to build a FULL neighbor adjacency OSPF process on the DUT to build a FULL neighbor adjacency
with the set of LSAs injected. The acknowledgement for the with the set of LSAs injected. The acknowledgement for the
last LSA transmitted is used instead of the last acknowledge- last LSA transmitted is used instead of the last acknowledge-
ment received in order to prevent timing skews due to ment received in order to prevent timing skews due to
retransmitted acknowledgements or LSAs. retransmitted acknowledgements or LSAs.
9.3. Link Up with Information Already in the Database 8.3. Forming adjacencies with Information Already in the Database
o Using reference topology 2, configure all three devices to o Using reference topology 2 (Generator and Collector), con-
run OSPF. figure all three devices to run OSPF.
o Configure the DUT so the link between the DUT and the gen- o Configure the DUT so the link between the DUT and the gen-
erator is disabled . erator is disabled .
o Inject a set of LSAs into the network from the generator; o Inject a set of LSAs into the network from the generator;
the DUT should receive these LSAs through normal flooding the DUT should receive these LSAs through normal flooding
from the collector. from the collector.
o Enable the link between the DUT and the generator. o Enable the link between the DUT and the generator.
skipping to change at page 10, line 32 skipping to change at page 10, line 50
o Note the time of the acknowledgement from the DUT for the o Note the time of the acknowledgement from the DUT for the
last LSA transmitted on the generator. last LSA transmitted on the generator.
The time between the hello received from the DUT by the gen- The time between the hello received from the DUT by the gen-
erator and the acknowledgement for the last LSA transmitted erator and the acknowledgement for the last LSA transmitted
by the generator should be taken as the total amount of time by the generator should be taken as the total amount of time
required for the OSPF process on the DUT to build a FULL required for the OSPF process on the DUT to build a FULL
neighbor adjacency with the set of LSAs injected. In this neighbor adjacency with the set of LSAs injected. In this
test, the DUT is already aware of the entire network topol- test, the DUT is already aware of the entire network topol-
ogy, so the time required should only include the processing ogy, so the time required should only include the processing
of each LSA from the generator and transmitting an ack- of each LSA from the generator and transmitting an
nowledgement. The acknowledgement for the last LSA transmit- acknowledgement. The acknowledgement for the last LSA
ted is used instead of the last acknowledgement received in transmitted is used instead of the last acknowledgement
order to prevent timing skews due to retransmitted ack- received in order to prevent timing skews due to retransmit-
nowledgements or LSAs. ted acknowledgements or LSAs.
9.4. Initial SR-Convergence Time on a DR electing (broadcast) network 8.4. Designated Router Election Time on A Broadcast Network
o Using reference topology 3, begin with the DUT connected o Using reference topology 3 (Broadcast Network), configure
to the network with OSPF enabled. OSPF should be enabled R1 to be the designated router on the link, and the DUT to
on R1, but the broadcast link should be disabled. be the backup designated router.
o Enable OSPF on the common broadcast link on all the
routers in the test bed.
o Disble the broadcast link on R1.
o Note the time of the last hello received from R1 on R2.
o Note the time of the first network LSA generated by the
DUT as received on R2.
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 this test includes the dead
interval timer at the DUT, so this time can be factored out,
or the hello and dead intervals reduced to make these timers
impact the overall test times less. All changed timers, the
number of routers connected to the link, and other variable
factors should be noted in the test results.
8.5. Initial SR-Convergence Time on a Designated Router Electing (Broad-
cast) Network
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 Enable the broadcast link between R1 and the DUT. Note the o Enable the broadcast link between R1 and the DUT. Note the
time of the first hello received by R1. time of the first hello received by R1.
o Note the time the first network LSA is flooded by the DUT o Note the time the first network LSA is flooded by the DUT
at R1. at R1.
o The differential between the first hello and the first o The differential between the first hello and the first
network LSA is the time required by the DUT to converge on network LSA is the time required by the DUT to converge on
this new topology. this new topology.
skipping to change at page 11, line 20 skipping to change at page 12, line 20
on the broadcast link. A similar test could be designed to on the broadcast link. A similar test could be designed to
test the SR-Convergence time when the DUT is not the desig- test the SR-Convergence time when the DUT is not the desig-
nated router as well. nated router as well.
This test may be performed with varying numbers of devices This test may be performed with varying numbers of devices
attached to the broadcast network, and varying sets of LSAs attached to the broadcast network, and varying sets of LSAs
being advertised to the DUT from the routers attached to the being advertised to the DUT from the routers attached to the
broadcast network. Variations in the LSA sets and other fac- broadcast network. Variations in the LSA sets and other fac-
tors shoul dbe noted in the test results. tors shoul dbe noted in the test results.
9.5. Point-to-point Link Down with Layer 2 Detection The time required to elect a designated router, as measured
in Designated Router Election Time on A Broadcast Network,
above, may be subtracted from the results of this test to
provide just the convergence time across a broadcast network.
o Using reference topology 4, begin with OSPF in the full 8.6. Link Down with Layer 2 Detection
state between the generator and the DUT. Both links should
be point-to-point links with the ability to notify the o Using reference topology 4 (Parallel Links), begin with
operating system immediately upon link failure. 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 Disable link 1; this should be done in such a way that the o Disable link 1; this should be done in such a way that the
keepalive timers at the data link layer will have no keepalive timers at the data link layer will have no
impact on the DUT recognizing the link failure (the impact on the DUT recognizing the link failure (the
operating system in the DUT should recognize this link operating system in the DUT should recognize this link
failure immediately). Disconnecting the cable on the gen- failure immediately). Disconnecting the cable on the gen-
erator end would be one possibility, or shutting the link erator end would be one possibility, or shutting the link
down. down.
o Note the time of the link failure on the generator. o Note the time of the link failure on the generator.
o At the generator, note the time of the receipt of the new o At the generator, note the time of the receipt of the new
router LSA from the DUT notifying the generator of the router LSA from the DUT notifying the generator of the
link 2 failure. link 2 failure.
The difference in the time between the initial link failure The difference in the time between the initial link failure
and the receipt of the LSA on the generator across link 2 and the receipt of the LSA on the generator across link 2
should be taken as the time required for an OSPF implementa- should be taken as the time required for an OSPF implementa-
tion to recognize and process a link failure. tion to recognize and process a link failure.
9.6. Broadcast Media Link Down with Layer 3 Detection 8.7. Link Down with Layer 3 Detection
o Using reference topology 4, begin with OSPF in the full o Using reference topology 4 (Parallel Links), begin with
state between the generator and the DUT. OSPF in the full state between the generator and the DUT.
o Disable OSPF processing on link 1 from the generator. This o Disable OSPF processing on link 1 from the generator. This
should be done in such a way so it does not affect link should be done in such a way so it does not affect link
status; the DUT must note the failure of the adjacency status; the DUT must note the failure of the adjacency
through the dead interval. through the dead interval.
o At the generator, note the time of the receipt of the new o At the generator, note the time of the receipt of the new
router LSA from the DUT notifying the generator of the router LSA from the DUT notifying the generator of the
link 2 failure. link 2 failure.
The difference in the time between the initial link failure The difference in the time between the initial link failure
and the receipt of the LSA on the generator across link 2 and the receipt of the LSA on the generator across link 2
should be taken as the time required for an OSPF implementa- should be taken as the time required for an OSPF implementa-
tion to recognize and process an adjacency failure. tion to recognize and process an adjacency failure.
9.7. Designated Router Election Time on A Broadcast Network 9. Security Considerations
o Using reference topology 3, configure R1 to be the desig-
nated router on the link, and the DUT to be the backup
designated router.
o Enable OSPF on the common broadcast link on all the
routers in the test bed.
o Disble the broadcast link on R1.
o Note the time of the last hello received from R1 on R2.
o Note the time of the first network LSA generated by the
DUT as received on R2.
The time between the last hello received on R2 and the first This draft adds no new security considerations nor does it resolve
network LSA generated by the DUT should be taken as the any security considerations from the protocols tested.
amount of time required for the DUT to complete a designated
router election computation. Note this test includes the dead
interval timer at the DUT, so this time can be factored out,
or the hello and dead intervals reduced to make these timers
impact the overall test times less. All changed timers, the
number of routers connected to the link, and other variable
factors should be noted in the test results.
10. Acknowledgements 10. Acknowledgements
Thanks to Howard Berkowitz, (hcb@clark.net), for his encouragement Thanks to Howard Berkowitz, (hcb@clark.net), for his encouragement
and support. Thanks also to Gurpreet Singh and support. Thanks also to Gurpreet Singh
(Gurpreet.Singh@SpirentCom.COM) for his help as well. (Gurpreet.Singh@SpirentCom.COM) and Yasuhiro Ohara
(yasu@sfc.wide.ad.jp) for their comments as well.
11. References 11. Normative References
[1] Bradner, S., "Key words for use in RFCs to Indicate Requirement [OPSF]Moy, J., "OSPF Version 2", RFC 2328, April 1998.
Levels", RFC2119, March 1997.
[2] Moy, J., "OSPF Version 2", RFC 2328, April 1998. [TERM]Manral, V., "OSPF Convergence Testing Terminiology and Concepts",
draft-ietf-bmwg-ospfconv-term-03, March 2003
[3] Bradner, S., McQuaid, J., "Benchmarking Methodology for Network [APPLICABILITY]
Interconnect Devices", RFC2544, March 1999. Manral, V., "Benchmarking Applicability for Basic OSPF Conver-
gence", draft-ietf-bmwg-ospfconv-applicability-02, March 2003
[4] Manral, V., "OSPF Convergence Testing Terminiology and Concepts", 12. Informative References
draft-ietf-bmwg-ospfconv-term, January 2003
[5] Alaettinoglu C., et al., "Towards Milli-Second IGP Convergence" [INTERCONNECT]
Bradner, S., McQuaid, J., "Benchmarking Methodology for Network
Interconnect Devices", RFC2544, March 1999.
[MILLISEC]
Alaettinoglu C., et al., "Towards Milli-Second IGP Convergence"
draft-alaettinoglu-isis-convergence draft-alaettinoglu-isis-convergence
[6] Trotter, G., "Terminology for Forwarding Information Base (FIB) [FIB-TERM]
Trotter, G., "Terminology for Forwarding Information Base (FIB)
based Router Performance", RFC3222, October 2001. based Router Performance", RFC3222, October 2001.
[7] Shaikh, Aman, Greenberg, Albert, "Experience in Black-Box OSPF [BLACKBOX]
Shaikh, Aman, Greenberg, Albert, "Experience in Black-Box OSPF
measurement" measurement"
[8] Manral, V., "Benchmarking Applicability for Basic OSPF Conver- 13. Authors' Addresses
gence", draft-ietf-bmwg-ospfconv-applicability
12. Authors' Addresses
Vishwas Manral Vishwas Manral
Netplane Systems Netplane Systems
189 Prashasan Nagar 189 Prashasan Nagar
Road number 72 Road number 72
Jubilee Hills Jubilee Hills
Hyderabad, India Hyderabad, India
vmanral@netplane.com vmanral@netplane.com
 End of changes. 

This html diff was produced by rfcdiff 1.23, available from http://www.levkowetz.com/ietf/tools/rfcdiff/