CPS Core Performance
Test Environment
TODO: Laptop specs
Test data used complies with Open ROADM YANG model.
Storing data nodes
| Device nodes | 1 | 100 | 200 | 300 | 400 | 500 | 600 | 700 | 800 | 900 | 1000 |
Time (seconds) | 0.295 | 2.36 | 4.36 | 7.15 | 9.76 | 11.50 | 14.77 | 18.43 | 19.79 | 22.16 | 26.54 |
Observations
- Storing data nodes has linear time complexity (expected).
- There are edge cases with worse complexity.
- Performance can be improved by enabling write batching (CPS-1795)
Updating data nodes and descendants
| Device nodes | 1 | 100 | 200 | 300 | 400 | 500 | 600 | 700 | 800 | 900 | 1000 |
Time (seconds) | 0.215 | 12.79 | 28.38 | 44.23 | 51.55 | 69.46 | 85.67 | 95.02 | 109.16 | 117.00 | 131.15 |
Observations
- Updating data nodes has linear time complexity (expected).
- Updating is approximately 5.5 times slower than storing data nodes.
Batch updating data leaves
| Device nodes | 1 | 100 | 200 | 300 | 400 | 500 | 600 | 700 | 800 | 900 | 1000 |
Time (seconds) | .201 | .266 | .276 | .280 | .317 | .379 | .385 | .465 | .485 | .520 | .561 |
Observations
- Updating data leaves has linear time complexity.
Reading data using getDataNodes API
Cps Path Queries
Deleting data nodes
NCMP Performance
CM-handle registration
TODO Comparison of Kohn, London, Montreal (current) up to 40,000 CM handles
CM-handle deregistration
TODO Comparison of Kohn, London, Montreal (current) up to 40,000 CM handles