Due to a ransomware attack, the wiki was reverted to a July 2022 version. . We apologize for the lack of a more recent valid backup.
...
commit a090a118ef445cd662ab3332283b11c8a7670623 d1a33b6b7788d46c4c4248b7a7ccecfb04b30030 (HEAD, origin/master, origin/HEAD, master)
Author: Madan Jampani Sho SHIMIZU [madansshimizu@us.jampani@gmailfujitsu.com]
AuthorDate: Mon Tue Jan 19 18 16:3840:17 29 2016 -0800
Commit: Gerrit Code Review [gerrit@onlab.usSho SHIMIZU [sshimizu@us.fujitsu.com]
CommitDate: Tue Jan 19 1918:3742:37 01 2016 +0000
Added DistributedPrimitive interface-0800
Rename instance field
| HTML |
|---|
<iframe src="https://onos-jenkins.onlab.us/job/HAsanity/plot/Plot-HA/getPlot?index=1&width=500&height=300"noborder="0" width="500" height="300" scrolling="yes" seamless="seamless"></iframe> |
...
- 8.1 Comparing ONOS topology to MN topology - PASS
- 8.2 Hosts view is consistent across all ONOS nodes - PASS
- 8.3 Hosts information is correct - PASS
- 8.4 Host attachment points to the network - PASS
- 8.5 Clusters view is consistent across all ONOS nodes - PASS
- 8.6 There is only one SCC - PASS
- 8.7 Device information is correct - PASS
- 8.8 Links are correct - PASS
- 8.9 Hosts are correct - PASS
- 8.10 Checking ONOS nodes - PASS
Case 3: Adding host Intents -
...
PASS
Discover hosts by using pingall then assign predetermined host-to-host intents. After installation, check that the intent is distributed to all nodes and the state is INSTALLED
- 3.1 Install reactive forwarding app - PASS
- 3.2 Check app ids - PASS
- 3.3 Discovering Hosts( Via pingall for now ) - PASS
- 3.4 Uninstall reactive forwarding app - PASS
- 3.5 Check app ids - PASS
- 3.6 Add host intents via cli - PASS
- 3.7 Intent Anti-Entropy dispersion - FAIL
PASS
Case 4: Verify connectivity by sendind traffic across Intents - PASS
...
- 16.1 Install Primitives app - PASS
Case 17: Check for basic functionality with distributed primitives -
...
PASS
Test the methods of the distributed primitives (counters and sets) throught the cli
- 17.1 Increment then get a default counter on each node - PASS
- 17.2 Get then Increment a default counter on each node - PASS
- 17.3 Counters we added have the correct values - PASS
- 17.4 Add -8 to then get a default counter on each node - PASS
- 17.5 Add 5 to then get a default counter on each node - PASS
- 17.6 Get then add 5 to a default counter on each node - PASS
- 17.7 Counters we added have the correct values - PASS
- 17.8 Increment and get an in-memory counter on each node - PASS
- 17.9 Get then Increment a in-memory counter on each node - PASS
- 17.10 Counters we added have the correct values - PASS
- 17.11 Add -8 to then get a in-memory counter on each node - PASS
- 17.12 Add 5 to then get a in-memory counter on each node - PASS
- 17.13 Get then add 5 to a in-memory counter on each node - PASS
- 17.14 Counters we added have the correct values - PASS
- 17.15 Check counters are consistant across nodes - PASS
- 17.16 Counters we added have the correct values - PASS
- 17.17 Distributed Set get - PASS
- 17.18 Distributed Set size - PASS
- 17.19 Distributed Set add() - PASS
- 17.20 Distributed Set addAll() - PASS
- 17.21 Distributed Set contains() - PASS
- 17.22 Distributed Set containsAll() - PASS
- 17.23 Distributed Set remove() - PASS
- 17.24 Distributed Set removeAll() - PASS
- 17.25 Distributed Set addAll() - PASS
- 17.26 Distributed Set clear() - FAIL
- PASS
- 17.27 Distributed Set addAll() - PASS
- 17.28 Distributed Set retain() - PASS
- 17.29 Partitioned Transactional maps put - PASS
- 17.30 Partitioned Transactional maps get - PASS
- 17.31 In-memory Transactional maps put - PASS
- 17.32 In-Memory Transactional maps get - PASS
...
- 15.1 Run for election on each node - PASS
- 15.2 Check that each node shows the same leader and candidates - PASS
- 15.3 Find current leader and withdraw - PASS
- 15.4 Check that a new node was elected leader - PASS
- 15.5 Check that that new leader was the candidate of old leader - PASS
- 15.6 Run for election on old leader( just so everyone is in the hat ) - PASS
- 15.7 Check that oldLeader is a candidate, and leader if only 1 node - PASS
Case 17: Check for basic functionality with distributed primitives - PASS
Test the methods of the distributed primitives (counters and sets) throught the cli
...