Page History

...

commit e64d3758611e1215bf9bf8628435da2aa29a8cb1 69b36d5d11e81e28e56b46ba44e4b8cd701c5867 (HEAD, origin/master, origin/HEAD, master)
Author: Charles Chan lishuai [rascov@gmaillishuai12@huawei.com]
AuthorDate: Wed Oct 21 1316:0350:58 16 2015 -0700+0800
Commit: Gerrit Code Review [gerrit@onlabRay Milkey [ray@onlab.us]
CommitDate: Thu Oct 22 0018:4049:42 17 2015 +0000

[ONOS-3194] Prevent NullPointerException3188] Add the method: Returns the virtualPort associated with the

<iframe src="https://onos-jenkins.onlab.us/job/HAsanity/plot/Plot-HA/getPlot?index=0&width=500&height=300"noborder="0" width="500" height="300" scrolling="yes" seamless="seamless"></iframe>

...

• 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

• 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 - FAIL
Added counters are incorrect
• 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() - 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

...