Internet-Draft | draft-cerveny-bmwg-ipv6-nd-00 | September 2013 |
Cerveny | Expires 14 March 2014 | [Page] |
This document is a benchmarking instantiation of RFC 6583: "Operational Neighbor Discovery Problems". It describes a general testing procedure and measurements that can be performed to evaluate how the problems described in RFC 6583 may impact the functionality or performance of intermediate nodes.¶
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 RFC 2119 [RFC2119].¶
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at http://datatracker.ietf.org/drafts/current/.¶
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶
This Internet-Draft will expire on 14 March 2014.¶
Copyright (c) 2013 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. 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.¶
This document is a benchmarking instantiation of RFC 6583: "Operational Neighbor Discovery Problems" [RFC6583]. It describes a general testing procedure and measurements that can be performed to evaluate how the problems described in RFC 6583 may impact the functionality or performance of intermediate nodes.¶
The test network design is fairly simple. The network needs to minimally have two subnets: one from which the scanner(s) source their scanning activity and the other which is the target network of the address scans.¶
It is assumed that the latency for all network segments is neglible.¶
At least one node should reside on the target network to confirm some of the performance characteristics.¶
Basic format of test network. Note that optional "non-participating network" is a third network not related to the scanner or target network.¶
+---------------+ +-----------+ +--------------+ | | Scanner | | Target | | | Scanning |-------------| DUT |--------------|Target Network| | interface | Network | | Network | interface | | | | | | | +---------------+ +-----------+ +--------------+ | | +-----------------+ | | |Non-participating| | network | | | +-----------------+¶
Throughout measurements, two testing interfaces are defined:¶
tester#1-new: Sets up new addresses¶
tester#2-renew: Discovers addresses previously discovered¶
This test evaluates how many hosts can be on a network and still have connectivity between all endpoints.¶
Perform "scan" with addresses in ascending order.¶
tester#1-new sets up new addresses¶
tester#2-renew is pinging existing addresses, where granularity is somewhere between a millisecond and a second.¶
tester#1-new and tester#2-renew should get responses to every packet¶
Given that there are as many hosts as determined in "maximum number of hosts" test, determine how long it takes for the neighbor cache get into a reasonable state.¶
reduce timer on tester#1-new¶
tester#1-new should not always get responses tester#2-renew should get responses to every packet¶
How do we behave when we're being scanned. Priority should be given to hosts that have been seen before.¶
Slow down tester#2-renew until one gets into refreshing every 6 seconds. If an address is in the "stale" state, it should get priority over new request.¶
increase timer on tester#2-renew.¶
tester#2-renew should always get responses¶
tester#1-new should not always get responses.¶
These are measurements which while possible, aren't being made because of the itemized reasons below:¶
This measurement relies on the DUT to provide utilization information, which is subjective.¶
This benchmarking test is not intended to test DUT behavior in the presence of malformed packets, such as packets which do not confirm to designs consistent with IETF standards.¶
At the beginning of each test, the neighbor cache of the DUT should be initialized¶
This document makes no request of IANA.¶
Note to RFC Editor: this section may be removed on publication as an RFC.¶
Benchmarking activities as described in this memo are limited to technology characterization using controlled stimuli in a laboratory environment, with dedicated address space and the constraints specified in the sections above.¶
The benchmarking network topology will be an independent test setup and MUST NOT be connected to devices that may forward the test traffic into a production network, or misroute traffic to the test management network.¶
Further, benchmarking is performed on a "black-box" basis, relying solely on measurements observable external to the DUT/SUT. Special capabilities SHOULD NOT exist in the DUT/SUT specifically for benchmarking purposes.¶
Any implications for network security arising from the DUT/SUT SHOULD be identical in the lab and in production networks.¶