Git-Mirrors/haveno
1
0
Fork 0
mirror of https://github.com/haveno-dex/haveno.git synced 2025-08-02 11:46:11 -04:00
Code Issues Projects Releases Packages Wiki Activity

Draft and describe loop for mailbox send test

Browse source
This commit is contained in:
Ivan Vilata-i-Balaguer 2016-05-10 12:05:10 +02:00
parent f74d88cb33
commit ab4491d956
1 changed files with 16 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

18
network/src/test/java/io/bitsquare/p2p/network/NetworkStressTest.java
View file

@ -53,8 +53,8 @@ public class NetworkStressTest {
/** Default number of peers in the test. */ /** Default number of peers in the test. */
private static final int NPEERS_DEFAULT = 4; private static final int NPEERS_DEFAULT = 4;
/** Minimum number of peers for the test to work. */ /** Minimum number of peers for the test to work (2 for direct messages, 3 for mailbox messages). */
private static final int NPEERS_MIN = 2; private static final int NPEERS_MIN = 3;
/** Default number of direct messages to be sent by each peer. */ /** Default number of direct messages to be sent by each peer. */
private static final int DIRECT_COUNT_DEFAULT = 100; private static final int DIRECT_COUNT_DEFAULT = 100;
@ -293,6 +293,20 @@ public class NetworkStressTest {
directCount, (System.currentTimeMillis() - sendStartMillis)/1000.0, directCount, (System.currentTimeMillis() - sendStartMillis)/1000.0,
mma.first, mma.second, mma.third); mma.first, mma.second, mma.third);
org.junit.Assert.assertFalse("some peer(s) failed to send a direct message", sentDirectFailed.get()); org.junit.Assert.assertFalse("some peer(s) failed to send a direct message", sentDirectFailed.get());
// Test sending and receiving mailbox messages.
// We start by putting the first half of peers online and the second one offline.
// Then the first online peer sends a number of messages to random peers (regardless of their state),
// so that some messages are delivered directly and others into a mailbox.
// Then the first online peer is put offline and the last offline peer is put online
// (so it can get its mailbox messages),
// and the new first online node sends messages.
// This is repeated until all nodes have been online and offline.
for (int firstOnline = 0, firstOffline = (int)Math.ceil(nPeers/2.0);
firstOnline < nPeers;
firstOnline++, firstOffline = ++firstOffline%nPeers) {
System.out.println("firstOnline "+firstOnline+" firstOffline "+firstOffline);
}
} }
private void print(String message, Object... args) { private void print(String message, Object... args) {