diff options
| author |   Paul Vinciguerra <pvinci@vinciconsulting.com> | 2019-10-27 17:28:10 -0400 |
|---|---|---|
| committer |   Dave Barach <openvpp@barachs.net> | 2019-10-28 13:51:13 +0000 |
| commit | 7fa3dd2881be537ec6144850064ad1419dc12f3e (patch) | |
| tree | 7fa013d6e23f16f73b0ca97628c1374a009b49bd /docs/gettingstarted/developers/fib20/dataplane.rst | |
| parent | 3b5e222f8a4d0ccd4ec4eace2551491f13de85d9 (diff) | |
docs: cleanup typos on readthrough
Type: style
Change-Id: I3b15035ea6c13cd1ca3cdc9dfa9b10a6e1be9880
Signed-off-by: Paul Vinciguerra <pvinci@vinciconsulting.com>
Diffstat (limited to 'docs/gettingstarted/developers/fib20/dataplane.rst')
| -rw-r--r-- | docs/gettingstarted/developers/fib20/dataplane.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/docs/gettingstarted/developers/fib20/dataplane.rst b/docs/gettingstarted/developers/fib20/dataplane.rst index 2a728c5a89a..a9e2bf27d69 100644 --- a/docs/gettingstarted/developers/fib20/dataplane.rst +++ b/docs/gettingstarted/developers/fib20/dataplane.rst @@ -68,7 +68,7 @@ stacking occurs, the necessary VLIB graph arcs are automatically constructed from the respected DPO type's registered graph nodes. The diagrams above show that for any given route the full data-plane graph is -known before anypacket arrives. If that graph is composed of n objects, then the +known before any packet arrives. If that graph is composed of n objects, then the packet will visit n nodes and thus incur a forwarding cost of approximately n times the graph node cost. This could be reduced if the graph were *collapsed* into a single DPO and associated node. However, collapsing a graph removes the |