research/waku_scalability/waku_scaling.py

583 lines
26 KiB
Python
Raw Normal View History

# !!! THIS IS WIP (analyze the code structure at your own risk ^.^')
# the scope of this is still undefined; we want to avoid premature generalization
# - todo: separate the part on latency
# based on ../whisper_scalability/whisper.py
import matplotlib.pyplot as plt
import numpy as np
import math
from pathlib import Path
2023-07-19 07:12:41 +00:00
import sys
2023-07-19 16:57:08 +00:00
import json
2023-07-18 16:48:04 +00:00
import typer
2023-07-19 13:07:51 +00:00
import logging as log
2023-07-18 16:50:35 +00:00
from enum import Enum, EnumMeta
2023-07-19 13:07:51 +00:00
2023-07-20 09:59:35 +00:00
# we currently support the following two network types
2023-07-18 16:50:35 +00:00
class networkType(Enum):
NEWMANWATTSSTROGATZ = "newmanwattsstrogatz" # mesh, smallworld
2023-07-19 13:07:51 +00:00
REGULAR = "regular" # d_lazy
2023-07-20 07:15:07 +00:00
#JSON/YAML keys: for consistency and avoid stupid bugs
2023-07-19 13:07:51 +00:00
class Keys:
2023-07-20 07:15:07 +00:00
GENNET = "gennet"
GENLOAD = "wls"
JSON = "json"
YAML = "yaml"
BATCH = "batch"
RUNS = "runs"
2023-07-18 16:50:35 +00:00
2023-07-19 06:44:16 +00:00
2023-07-20 07:33:03 +00:00
# Util and format functions
#-----------------------------------------------------------
class IOFormats:
def __init__(self):
self.HEADER = '\033[95m'
self.OKBLUE = '\033[94m'
self.OKGREEN = '\033[92m'
self.WARNING = '\033[93m'
self.FAIL = '\033[91m'
self.ENDC = '\033[0m'
self.BOLD = '\033[1m'
self.UNDERLINE = '\033[4m'
def sizeof_fmt(self, num):
return "%.1f%s" % (num, "MB")
def sizeof_fmt_kb(self, num):
return "%.2f%s" % (num*1024, "KB")
def magnitude_fmt(self, num):
for x in ['','k','m']:
if num < 1000:
return "%2d%s" % (num, x)
num /= 1000
# Color format based on daily bandwidth usage
# <10mb/d = good, <30mb/d ok, <100mb/d bad, 100mb/d+ fail.
def load_color_prefix(self, load):
if load < (10):
color_level = self.OKBLUE
elif load < (30):
color_level = self.OKGREEN
elif load < (100):
color_level = self.WARNING
else:
color_level = self.FAIL
return color_level
def load_color_fmt(self, load, string):
return self.load_color_prefix(load) + string + self.ENDC
def print_header(self, string):
print(self.HEADER + string + self.ENDC + "\n")
# Print goals
def print_goal(self):
print("")
print(self.HEADER + "Waku relay theoretical model results (single shard and multi shard scenarios)." + self.ENDC)
2023-07-20 07:15:07 +00:00
# Config holds the data for the individual runs. Every analysis instance is a Config instance
2023-07-19 07:00:34 +00:00
class Config:
2023-07-23 15:10:17 +00:00
# We need 12 params to fully instantiate Config. Set the defaults for the missing
2023-07-20 06:30:46 +00:00
def __init__(self,
num_nodes=4, fanout=6,
2023-07-19 13:07:51 +00:00
network_type=networkType.REGULAR.value,
2023-07-20 07:15:07 +00:00
msg_size=0.002, msgpsec=0.00139, per_hop_delay=100,
2023-07-19 16:57:08 +00:00
gossip_msg_size=0.002, gossip_window_size=3, gossip2reply_ratio=0.01,
2023-07-20 07:33:03 +00:00
nodes_per_shard=10000, shards_per_node=3, pretty_print=IOFormats()):
2023-07-20 07:15:07 +00:00
# set the current Config values
2023-07-23 15:10:17 +00:00
self.num_nodes = num_nodes # number of wakunodes
self.fanout = fanout # generative fanout
2023-07-20 07:15:07 +00:00
self.network_type = network_type # regular, small world etc
self.msg_size = msg_size # avg message size in MBytes
2023-07-23 15:10:17 +00:00
self.msgpsec = msgpsec # avg # of messages per user per sec
2023-07-20 07:15:07 +00:00
self.per_hop_delay = per_hop_delay # per-hop delay = 0.01 sec
self.gossip_msg_size = gossip_msg_size # avg gossip msg size in MBytes
self.gossip_window_size = gossip_window_size # max gossip history window size
self.gossip2reply_ratio = gossip2reply_ratio # fraction of replies/hits to a gossip msg
self.nodes_per_shard = nodes_per_shard # max number of nodes per shard
self.shards_per_node = shards_per_node # avg number of shards a node is part of
# secondary parameters, derived from primary
self.msgphr = msgpsec*60*60 # msgs per hour derived from msgpsec
2023-07-23 15:10:17 +00:00
self.d_lazy = self.fanout # avg degree
if network_type == networkType.NEWMANWATTSSTROGATZ.value:
self.d_lazy = self.fanout + 0.5 * self.fanout
2023-07-20 07:15:07 +00:00
self.base_assumptions = ["a1", "a2", "a3", "a4"]
2023-07-20 07:33:03 +00:00
self.pretty_print = pretty_print
2023-07-19 13:07:51 +00:00
# Assumption strings (general/topology)
self.Assumptions = {
2023-07-20 07:33:03 +00:00
"a1" : "- A01. Message size (static): " + self.pretty_print.sizeof_fmt_kb(self.msg_size),
2023-07-19 13:07:51 +00:00
"a2" : "- A02. Messages sent per node per hour (static) (assuming no spam; but also no rate limiting.): " + str(self.msgphr),
2023-07-23 15:10:17 +00:00
"a3" : "- A03. The network topology is a d-regular graph of degree (static): " + str(int(self.d_lazy)),
2023-07-19 13:07:51 +00:00
"a4" : "- A04. Messages outside of Waku Relay are not considered, e.g. store messages.",
"a5" : "- A05. Messages are only sent once along an edge. (requires delays before sending)",
"a6" : "- A06. Messages are sent to all d-1 neighbours as soon as receiving a message (current operation)", # Thanks @Mmenduist
"a7" : "- A07. Single shard (i.e. single pubsub mesh)",
"a8" : "- A08. Multiple shards; mapping of content topic (multicast group) to shard is 1 to 1",
"a9" : "- A09. Max number of nodes per shard (static) " + str(self.nodes_per_shard),
"a10" : "- A10. Number of shards a given node is part of (static) " + str(self.shards_per_node),
"a11" : "- A11. Number of nodes in the network is variable.\n\
These nodes are distributed evenly over " + str(self.shards_per_node) + " shards.\n\
Once all of these shards have " + str(self.nodes_per_shard) + " nodes, new shards are spawned.\n\
These new shards have no influcene on this model, because the nodes we look at are not part of these new shards.",
"a12" : "- A12. Including 1:1 chat. Messages sent to a given user are sent into a 1:1 shard associated with that user's node.\n\
Effectively, 1:1 chat adds a receive load corresponding to one additional shard a given node has to be part of.",
"a13" : "- A13. 1:1 chat messages sent per node per hour (static): " + str(self.msgphr), # could introduce a separate variable here
"a14" : "- A14. 1:1 chat shards are filled one by one (not evenly distributed over the shards).\n\
This acts as an upper bound and overestimates the 1:1 load for lower node counts.",
"a15" : "- A15. Naive light node. Requests all messages in shards that have (large) 1:1 mapped multicast groups the light node is interested in.",
# Assumption strings (store)
"a21" : "- A21. Store nodes do not store duplicate messages.",
# Assumption strings (gossip)
"a31" : "- A21. Gossip is not considered.",
2023-07-20 07:33:03 +00:00
"a32" : "- A32. Gossip message size (IHAVE/IWANT) (static):" + self.pretty_print.sizeof_fmt_kb(self.gossip_msg_size),
2023-07-19 13:07:51 +00:00
"a33" : "- A33. Ratio of IHAVEs followed-up by an IWANT (incl. the actual requested message):" + str(self.gossip2reply_ratio),
# Assumption strings (delay)
"a41" : "- A41. Delay is calculated based on an upper bound of the expected distance.",
"a42" : "- A42. Average delay per hop (static): " + str(self.per_hop_delay) + "s."
}
2023-07-19 16:57:08 +00:00
self.display()
2023-07-20 07:33:03 +00:00
self.pretty_print.print_goal()
2023-07-19 13:07:51 +00:00
2023-07-20 07:15:07 +00:00
# display the Config
2023-07-19 16:57:08 +00:00
def display(self):
2023-07-20 07:15:07 +00:00
print( "Config = ", self.num_nodes, self.fanout, self.network_type,
2023-07-19 16:57:08 +00:00
self.msg_size, self.msgpsec, self.msgphr,
self.gossip_msg_size, self.gossip_window_size, self.gossip2reply_ratio,
self.nodes_per_shard, self.shards_per_node, self.per_hop_delay, self.d_lazy)
2023-07-19 13:07:51 +00:00
2023-07-20 07:15:07 +00:00
# Print assumptions : with a base set
2023-07-19 13:07:51 +00:00
def print_assumptions1(self, xs):
print("Assumptions/Simplifications:")
2023-07-20 07:15:07 +00:00
alist = self.base_assumptions + xs
2023-07-19 13:07:51 +00:00
for a in alist:
if a in self.Assumptions:
print(self.Assumptions[a])
else:
log.error(f'Unknown assumption: ' + a)
sys.exit(0)
2023-07-20 07:15:07 +00:00
print("")
2023-07-19 07:28:57 +00:00
2023-07-20 07:15:07 +00:00
# Print assumptions: all
2023-07-19 13:07:51 +00:00
def print_assumptions(self, xs):
print("Assumptions/Simplifications:")
for a in xs:
if a in self.Assumptions:
print(self.Assumptions[a])
else:
log.error(f'Unknown assumption: ' + a)
sys.exit(0)
print("")
2023-07-19 07:28:57 +00:00
2023-07-20 07:15:07 +00:00
# Analysis performs the runs. It creates a Config object and runs the analysis on it
2023-07-19 13:07:51 +00:00
class Analysis(Config):
2023-07-20 07:15:07 +00:00
# accept variable number of parameters with missing values set to defaults
def __init__(self, **kwargs):
Config.__init__(self, **kwargs)
2023-07-19 13:07:51 +00:00
2023-07-23 12:27:41 +00:00
def pretty_print_usage(self, load_fn, num_nodes):
load = load_fn(num_nodes)
print (self.pretty_print.load_color_fmt(load, "For " + self.pretty_print.magnitude_fmt(num_nodes) + " users, receiving bandwidth is " + self.pretty_print.sizeof_fmt(load) + "/hour"))
def print_usage(self, load_fn, num_nodes, explore=True):
if explore:
self.pretty_print_usage(load_fn, 100)
self.pretty_print_usage(load_fn, 100 * 100)
self.pretty_print_usage(load_fn, 100 * 100 * 100)
else:
self.pretty_print_usage(load_fn, self.num_nodes)
def pretty_print_latency(self, latency_fn, num_nodes, degree):
latency = latency_fn(num_nodes, degree)
print(self.pretty_print.load_color_fmt(latency, "For " + self.pretty_print.magnitude_fmt(num_nodes) + " the average latency is " + ("%.3f" % latency) + " s"))
def print_latency(self, latency_fn, average_node_degree, explore=True):
if explore:
self.pretty_print_latency(latency_fn, 100, average_node_degree)
self.pretty_print_latency(latency_fn, 100 * 100, average_node_degree)
self.pretty_print_latency(latency_fn, 100 * 100 * 100, average_node_degree)
else:
self.pretty_print_latency(latency_fn, self.num_nodes, average_node_degree)
2023-07-19 13:07:51 +00:00
# Case 1 :: singe shard, unique messages, store
# sharding case 1: multi shard, n*(d-1) messages, gossip
def load_sharding_case1(self, n_users):
load_per_node_per_shard = self.load_case4(np.minimum(n_users/3, self.nodes_per_shard))
return self.shards_per_node * load_per_node_per_shard
def load_case1(self, n_users):
return self.msg_size * self.msgphr * n_users
def print_load_case1(self):
print("")
2023-07-20 07:33:03 +00:00
self.pretty_print.print_header("Load case 1 (store load; corresponds to received load per naive light node)")
2023-07-19 13:07:51 +00:00
self.print_assumptions1(["a7", "a21"])
2023-07-23 12:27:41 +00:00
self.print_usage(self.load_case1, self.num_nodes)
2023-07-19 13:07:51 +00:00
print("")
print("------------------------------------------------------------")
# Case 2 :: single shard, (n*d)/2 messages
def load_case2(self, n_users):
2023-07-23 15:10:17 +00:00
return self.msg_size * self.msgphr * self.num_edges_dregular()
2023-07-19 13:07:51 +00:00
2023-07-23 12:27:41 +00:00
def print_load_case2(self, explore=True):
2023-07-19 13:07:51 +00:00
print("")
2023-07-20 07:33:03 +00:00
self.pretty_print.print_header("Load case 2 (received load per node)")
2023-07-19 13:07:51 +00:00
self.print_assumptions1(["a5", "a7", "a31"])
2023-07-23 12:27:41 +00:00
self.print_usage(self.load_case2, self.num_nodes, explore)
2023-07-19 13:07:51 +00:00
print("")
print("------------------------------------------------------------")
# Case 3 :: single shard n*(d-1) messages
def load_case3(self, n_users):
2023-07-23 15:10:17 +00:00
return self.msg_size * self.msgphr * n_users * (self.d_lazy-1)
2023-07-19 13:07:51 +00:00
def print_load_case3(self):
print("")
2023-07-20 07:33:03 +00:00
self.pretty_print.print_header("Load case 3 (received load per node)")
2023-07-19 13:07:51 +00:00
self.print_assumptions1(["a6", "a7", "a31"])
2023-07-23 12:27:41 +00:00
self.print_usage(self.load_case3, self.num_nodes)
2023-07-19 13:07:51 +00:00
print("")
print("------------------------------------------------------------")
# Case 4:single shard n*(d-1) messages, gossip
def load_case4(self, n_users):
2023-07-23 15:10:17 +00:00
messages_received_per_hour = self.msgphr * n_users * (self.d_lazy-1) # see case 3
2023-07-19 13:07:51 +00:00
messages_load = self.msg_size * messages_received_per_hour
2023-07-19 16:57:08 +00:00
num_ihave = messages_received_per_hour * self.d_lazy * self.gossip_window_size
2023-07-19 13:07:51 +00:00
ihave_load = num_ihave * self.gossip_msg_size
gossip_response_load = (num_ihave * (self.gossip_msg_size + self.msg_size)) * self.gossip2reply_ratio # reply load contains both an IWANT (from requester to sender), and the actual wanted message (from sender to requester)
gossip_total = ihave_load + gossip_response_load
return messages_load + gossip_total
2023-07-23 12:27:41 +00:00
def print_load_case4(self, explore=True):
2023-07-19 13:07:51 +00:00
print("")
2023-07-20 07:33:03 +00:00
self.pretty_print.print_header("Load case 4 (received load per node incl. gossip)")
2023-07-19 13:07:51 +00:00
self.print_assumptions1(["a6", "a7", "a32", "a33"])
2023-07-23 12:27:41 +00:00
self.print_usage(self.load_case4, self.num_nodes, explore=explore)
2023-07-19 13:07:51 +00:00
print("")
print("------------------------------------------------------------")
# latency cases
def latency_case1(self, n_users, degree):
2023-07-23 15:10:17 +00:00
return self.avg_node_distance_upper_bound() * self.per_hop_delay
2023-07-19 13:07:51 +00:00
2023-07-23 12:27:41 +00:00
def print_latency_case1(self, explore=True):
2023-07-19 13:07:51 +00:00
print("")
2023-07-20 07:33:03 +00:00
self.pretty_print.print_header("Latency case 1 :: Topology: 6-regular graph. No gossip (note: gossip would help here)")
2023-07-19 13:07:51 +00:00
self.print_assumptions(["a3", "a41", "a42"])
2023-07-23 12:27:41 +00:00
self.print_latency(self.latency_case1, self.fanout, explore=explore)
2023-07-19 13:07:51 +00:00
print("")
print("------------------------------------------------------------")
def print_load_sharding_case1(self):
print("")
2023-07-20 07:33:03 +00:00
self.pretty_print.print_header("load sharding case 1 (received load per node incl. gossip)")
2023-07-19 13:07:51 +00:00
self.print_assumptions1(["a6", "a8", "a9", "a10", "a11", "a32", "a33"])
2023-07-23 12:27:41 +00:00
self.print_usage(self.load_sharding_case1, self.num_nodes)
2023-07-19 13:07:51 +00:00
print("")
print("------------------------------------------------------------")
# sharding case 2: multi shard, n*(d-1) messages, gossip, 1:1 chat
def load_sharding_case2(self, n_users):
load_per_node_per_shard = self.load_case4(np.minimum(n_users/3, self.nodes_per_shard))
load_per_node_1to1_shard = self.load_case4(np.minimum(n_users, self.nodes_per_shard))
return (self.shards_per_node * load_per_node_per_shard) + load_per_node_1to1_shard
def print_load_sharding_case2(self):
print("")
2023-07-20 07:33:03 +00:00
self.pretty_print.print_header("load sharding case 2 (received load per node incl. gossip and 1:1 chat)")
2023-07-19 13:07:51 +00:00
self.print_assumptions1(["a6", "a8", "a9", "a10", "a11", "a12", "a13", "a14", "a32", "a33"])
2023-07-23 12:27:41 +00:00
self.print_usage(self.load_sharding_case2, self.num_nodes)
2023-07-19 13:07:51 +00:00
print("")
print("------------------------------------------------------------")
# sharding case 3: multi shard, naive light node
def load_sharding_case3(self, n_users):
load_per_node_per_shard = self.load_case1(np.minimum(n_users/3, self.nodes_per_shard))
return self.shards_per_node * load_per_node_per_shard
def print_load_sharding_case3(self):
print("")
2023-07-20 07:33:03 +00:00
self.pretty_print.print_header("load sharding case 3 (received load naive light node.)")
2023-07-19 13:07:51 +00:00
self.print_assumptions1(["a6", "a8", "a9", "a10", "a15", "a32", "a33"])
2023-07-23 12:27:41 +00:00
self.print_usage(self.load_sharding_case3, self.num_nodes)
2023-07-19 13:07:51 +00:00
print("")
print("------------------------------------------------------------")
2023-07-23 12:27:41 +00:00
def run(self, explore=True):
if explore :
self.print_load_case1()
self.print_load_case2()
self.print_load_case3()
self.print_load_case4()
2023-07-19 13:07:51 +00:00
2023-07-23 12:27:41 +00:00
self.print_latency_case1()
2023-07-19 13:07:51 +00:00
2023-07-23 12:27:41 +00:00
self.print_load_sharding_case1()
self.print_load_sharding_case2()
self.print_load_sharding_case3()
else:
self.print_load_case4(explore=explore)
self.print_latency_case1(explore=explore)
2023-07-19 13:07:51 +00:00
def plot_load(self):
plt.clf() # clear current plot
n_users = np.logspace(2, 6, num=5)
print(n_users)
plt.xlim(100, 10**4)
plt.ylim(1, 10**4)
plt.plot(n_users, load_case1(n_users), label='case 1', linewidth=4, linestyle='dashed')
plt.plot(n_users, load_case2(n_users), label='case 2', linewidth=4, linestyle='dashed')
plt.plot(n_users, load_case3(n_users), label='case 3', linewidth=4, linestyle='dashed')
plt.plot(n_users, load_case4(n_users), label='case 4', linewidth=4, linestyle='dashed')
case1 = "Case 1. top: 6-regular; store load (also: naive light node)"
case2 = "Case 2. top: 6-regular; receive load per node, send delay to reduce duplicates"
case3 = "Case 3. top: 6-regular; receive load per node, current operation"
case4 = "Case 4. top: 6-regular; receive load per node, current operation, incl. gossip"
plt.xlabel('number of users (log)')
plt.ylabel('mb/hour (log)')
plt.legend([case1, case2, case3, case4], loc='upper left')
plt.xscale('log')
plt.yscale('log')
plt.axhspan(0, 10, facecolor='0.2', alpha=0.2, color='blue')
plt.axhspan(10, 100, facecolor='0.2', alpha=0.2, color='green')
plt.axhspan(100, 3000, facecolor='0.2', alpha=0.2, color='orange') # desktop nodes can handle this; load comparable to streaming (but both upload and download, and with spikes)
plt.axhspan(3000, 10**6, facecolor='0.2', alpha=0.2, color='red')
caption = "Plot 1: single shard."
plt.figtext(0.5, 0.01, caption, wrap=True, horizontalalignment='center', fontsize=12)
plt.show()
figure = plt.gcf() # get current figure
figure.set_size_inches(16, 9)
# plt.savefig("waku_scaling_plot.svg")
#plt.savefig("waku_scaling_single_shard_plot.png", dpi=300, orientation="landscape")
def plot_load_sharding(self):
plt.clf() # clear current plot
n_users = np.logspace(2, 6, num=5)
print(n_users)
plt.xlim(100, 10**6)
plt.ylim(1, 10**5)
2023-07-19 07:28:57 +00:00
2023-07-19 13:07:51 +00:00
plt.plot(n_users, load_case1(n_users), label='sharding store', linewidth=4, linestyle='dashed') # same as without shardinig, has to store *all* messages
plt.plot(n_users, load_sharding_case1(n_users), label='case 1', linewidth=4, linestyle='dashed')
plt.plot(n_users, load_sharding_case2(n_users), label='case 2', linewidth=4, linestyle='dashed')
plt.plot(n_users, load_sharding_case3(n_users), label='case 3', linewidth=4, linestyle='dashed')
case_store = "Sharding store load; participate in all shards; top: 6-regular"
case1 = "Sharding case 1. sharding: top: 6-regular; receive load per node, incl gossip"
case2 = "Sharding case 2. sharding: top: 6-regular; receive load per node, incl gossip and 1:1 chat"
case3 = "Sharding case 3. sharding: top: 6-regular; regular load for naive light node"
2023-07-19 07:28:57 +00:00
2023-07-19 13:07:51 +00:00
plt.xlabel('number of users (log)')
plt.ylabel('mb/hour (log)')
plt.legend([case_store, case1, case2, case3], loc='upper left')
plt.xscale('log')
plt.yscale('log')
2023-07-19 07:28:57 +00:00
2023-07-19 13:07:51 +00:00
plt.axhspan(0, 10, facecolor='0.2', alpha=0.2, color='blue')
plt.axhspan(10, 100, facecolor='0.2', alpha=0.2, color='green')
plt.axhspan(100, 3000, facecolor='0.2', alpha=0.2, color='orange') # desktop nodes can handle this; load comparable to streaming (but both upload and download, and with spikes)
plt.axhspan(3000, 10**6, facecolor='0.2', alpha=0.2, color='red')
caption = "Plot 2: multi shard."
plt.figtext(0.5, 0.01, caption, wrap=True, horizontalalignment='center', fontsize=12)
plt.show()
figure = plt.gcf() # get current figure
figure.set_size_inches(16, 9)
# plt.savefig("waku_scaling_plot.svg")
#plt.savefig("waku_scaling_multi_shard_plot.png", dpi=300, orientation="landscape")
def plot(self):
self.plot_load()
self.plot_load_sharding()
2023-07-19 07:28:57 +00:00
2023-07-23 15:10:17 +00:00
def num_edges_dregular(self):
2023-07-20 07:15:07 +00:00
# we assume and even d; d-regular graphs with both where both n and d are odd don't exist
2023-07-23 15:10:17 +00:00
num_edges = self.num_nodes * (self.fanout/2)
2023-07-20 09:59:35 +00:00
if self.network_type == networkType.REGULAR.value:
2023-07-23 15:10:17 +00:00
return num_edges
2023-07-20 09:59:35 +00:00
elif self.network_type == networkType.NEWMANWATTSSTROGATZ.value:
2023-07-21 12:22:06 +00:00
# NEWMANWATTSSTROGATZ starts as a regular graph
# 0. rewire random edged
2023-07-23 12:27:41 +00:00
# 1. add additional ~ \beta * num_nodes*degree/2 edges to shorten the paths
2023-07-21 12:22:06 +00:00
# # \beta used = 0.5
# this is a relatively tight estimate
2023-07-23 15:10:17 +00:00
return num_edges + 0.5 * self.num_nodes * (self.fanout/2)
2023-07-20 09:59:35 +00:00
else:
log.error(f'num_edges_dregular: Unknown network type {self.network_type}')
sys.exit(0)
2023-07-19 07:28:57 +00:00
2023-07-23 15:10:17 +00:00
def avg_node_distance_upper_bound(self):
2023-07-20 09:59:35 +00:00
if self.network_type == networkType.REGULAR.value:
2023-07-21 12:22:06 +00:00
# TODO: this needs checking.
2023-07-23 12:27:41 +00:00
# 1) these are RANDOM regular graphs, the actual bound might be higher!
2023-07-23 15:10:17 +00:00
return math.log(self.num_nodes, self.fanout)
2023-07-23 12:27:41 +00:00
elif self.network_type == networkType.NEWMANWATTSSTROGATZ.value:
# NEWMANWATTSSTROGATZ is small world and random
# a marginally tight estimate
2023-07-23 15:10:17 +00:00
return 2*math.log(self.num_nodes/self.fanout, self.fanout)
2023-07-20 09:59:35 +00:00
else:
log.error(f'Unknown network type {self.network_type}')
sys.exit(0)
2023-07-19 16:57:08 +00:00
def _sanity_check(fname, keys, ftype=Keys.JSON):
2023-07-19 06:44:16 +00:00
if not fname.exists():
log.error(f'The file "{fname}" does not exist')
sys.exit(0)
try:
2023-07-19 06:44:16 +00:00
with open(fname, 'r') as f: # Load config file
2023-07-20 06:30:46 +00:00
if ftype == Keys.JSON: # Both batch and kurtosis use json
2023-07-19 16:57:08 +00:00
json_conf = json.load(f)
2023-07-19 06:44:16 +00:00
for key in keys:
2023-07-19 16:57:08 +00:00
if key not in json_conf:
2023-07-20 07:15:07 +00:00
log.error(f'The json key "{key}" not found in {fname}')
2023-07-19 06:44:16 +00:00
sys.exit(0)
2023-07-19 16:57:08 +00:00
return json_conf
2023-07-19 06:44:16 +00:00
elif ftype == "yaml": # Shadow uses yaml
log.error(f'YAML is not yet supported : {fname}')
sys.exit(0)
2023-07-19 16:57:08 +00:00
#yaml_conf = json.load(f)
#return yaml_conf
except Exception as ex:
2023-07-19 06:46:26 +00:00
raise typer.BadParameter(str(ex))
2023-07-23 15:10:17 +00:00
log.debug(f'Sanity check: All Ok')
2023-07-19 06:44:16 +00:00
2023-07-19 06:49:26 +00:00
app = typer.Typer()
2023-07-19 06:44:16 +00:00
@app.command()
2023-07-23 12:27:41 +00:00
def wakurtosis(ctx: typer.Context, config_file: Path,
explore : bool = typer.Option(True,
help="Explore or not to explore")):
wakurtosis_json = _sanity_check(config_file, [Keys.GENNET, Keys.GENLOAD], Keys.JSON)
2023-07-23 15:10:17 +00:00
num_nodes = wakurtosis_json["gennet"]["num_nodes"]
network_type = wakurtosis_json["gennet"]["network_type"]
msg_size = (wakurtosis_json["wls"]["min_packet_size"] +
wakurtosis_json["wls"]["max_packet_size"])/(2*1024*1024)
msgpsec = wakurtosis_json["wls"]["message_rate"]/wakurtosis_json["gennet"]["num_nodes"]
fanout = wakurtosis_json["gennet"]["fanout"]
analysis = Analysis(**{ "num_nodes" : num_nodes,
"fanout" : fanout,
"network_type" : network_type,
"msg_size" :msg_size,
"msgpsec" : msgpsec,
"per_hop_delay" : 0.01 # TODO: pick from wakurtosis
})
2023-07-19 16:57:08 +00:00
2023-07-23 15:10:17 +00:00
analysis.run(explore=explore)
2023-07-19 16:57:08 +00:00
print(f'kurtosis: done')
@app.command()
2023-07-23 12:27:41 +00:00
def batch(ctx: typer.Context, batch_file: Path,
explore : bool = typer.Option(True,
help="Explore or not to explore")):
batch_json = _sanity_check(batch_file, [Keys.BATCH], Keys.JSON)
runs = batch_json[Keys.BATCH][Keys.RUNS]
2023-07-20 07:15:07 +00:00
for run in runs:
print(runs[run])
analysis = Analysis(**runs[run])
2023-07-23 12:27:41 +00:00
analysis.run(explore=explore)
2023-07-19 16:57:08 +00:00
print(f'batch: done')
2023-07-19 06:44:16 +00:00
@app.command()
2023-07-23 12:27:41 +00:00
def shadow(ctx: typer.Context, config_file: Path,
explore : bool = typer.Option(True,
help="Explore or not to explore")):
2023-07-19 16:57:08 +00:00
yaml = _sanity_check(config_file, [], Keys.YAML)
print("shadow: done {yaml}")
@app.command()
def cli(ctx: typer.Context,
num_nodes: int = typer.Option(4,
help="Set the number of nodes"),
2023-07-23 15:10:17 +00:00
fanout: float = typer.Option(6.0,
help="Set the arity"),
network_type: networkType = typer.Option(networkType.REGULAR.value,
help="Set the network type"),
msg_size: float = typer.Option(2,
help="Set message size in KBytes"),
msgpsec: float = typer.Option(0.083,
help="Set message rate per second on a shard/topic"),
gossip_msg_size: float = typer.Option(0.05,
help="Set gossip message size in KBytes"),
2023-07-19 16:57:08 +00:00
gossip_window_size: int = typer.Option(3,
2023-07-19 13:07:51 +00:00
help="Set gossip history window size"),
gossip2reply_ratio: float = typer.Option(0.01,
help="Set the Gossip to reply ratio"),
nodes_per_shard: int = typer.Option(10000,
help="Set the number of nodes per shard/topic"),
shards_per_node: int = typer.Option(3,
help="Set the number of shards a node is part of"),
per_hop_delay: float = typer.Option(0.1,
2023-07-23 12:27:41 +00:00
help="Set the delay per hop"),
explore : bool = typer.Option(True,
help="Explore or not to explore")):
2023-07-19 07:12:41 +00:00
2023-07-19 16:57:08 +00:00
analysis = Analysis(num_nodes, fanout, network_type,
2023-07-20 06:30:46 +00:00
msg_size, msgpsec, per_hop_delay,
**{"gossip_msg_size" : gossip_msg_size,
"gossip_window_size":gossip_window_size,
"gossip2reply_ratio":gossip2reply_ratio,
"nodes_per_shard":nodes_per_shard,
"shards_per_node":shards_per_node})
2023-07-23 12:27:41 +00:00
analysis.run(explore=explore)
2023-07-19 07:12:41 +00:00
print("cli: done")
if __name__ == "__main__":
app()
"""
# general / topology
average_node_degree = 6 # has to be even
message_size = 0.002 # in MB (Mega Bytes)
2023-07-19 13:07:51 +00:00
self.msgphr = 5 # ona a single pubsub topic / shard
# gossip
2023-07-19 13:07:51 +00:00
self.gossip_msg_size = 0.00005 # 50Bytes in MB (see https://github.com/libp2p/specs/pull/413#discussion_r1018821589 )
d_lazy = 6 # gossip out degree
mcache_gossip = 3 # Number of history windows to use when emitting gossip (see https://github.com/libp2p/specs/blob/master/pubsub/gossipsub/gossipsub-v1.0.md)
avg_ratio_gossip_replys = 0.01 # -> this is a wild guess! (todo: investigate)
# multi shard
avg_nodes_per_shard = 10000 # average number of nodes that a part of a single shard
avg_shards_per_node = 3 # average number of shards a given node is part of
# latency
average_delay_per_hop = 0.1 #s
"""