class ReadCounters(object):
def __init__(self, sw_name):
self.topo = Topology(db="topology.db")
self.sw_name = sw_name
self.thrift_port = self.topo.get_thrift_port(sw_name)
self.controller = SimpleSwitchAPI(self.thrift_port)
def direct(self):
entries = self.controller.table_num_entries("count_table")
for i in range(int(entries)):
self.controller.counter_read("direct_port_counter", i)
def indirect(self):
for i in range(5):
self.controller.counter_read("port_counter", i)
class NCacheController(object):
def __init__(self, sw_name, vtables_num=8):
self.topo = Topology(db="../p4/topology.db")
self.sw_name = sw_name
self.thrift_port = self.topo.get_thrift_port(self.sw_name)
self.cpu_port = self.topo.get_cpu_port_index(self.sw_name)
self.controller = SimpleSwitchAPI(self.thrift_port)
self.custom_calcs = self.controller.get_custom_crc_calcs()
self.sketch_register_num = len(self.custom_calcs)
self.vtables = []
self.vtables_num = vtables_num
# create a pool of ids (as much as the total amount of keys)
# this pool will be used to assign index to keys which will be
# used to index the cached key counter and the validity register
self.ids_pool = range(0, VTABLE_ENTRIES * VTABLE_SLOT_SIZE)
# array of bitmap, which marks available slots per cache line
# as 0 bits and occupied slots as 1 bits
self.mem_pool = [0] * VTABLE_ENTRIES
# number of memory slots used (useful for lfu eviction policy)
self.used_mem_slots = 0
# dictionary storing the value table index, bitmap and counter/validity
# register index in the P4 switch that corresponds to each key
self.key_map = {}
self.setup()
#self.out_of_band_test()
def inform_server(self):
sock = socket.socket(socket.AF_UNIX, socket.SOCK_STREAM)
try:
sock.connect(UNIX_CHANNEL)
except socket.error as msg:
#print('Error: Unable to contact server for cache operation completion')
return
sock.sendall(CACHE_INSERT_COMPLETE)
# reports the value of counters for each cached key
# (used only for debugging purposes)
def report_counters(self):
for key, val in self.key_map.items():
vt_idx, bitmap, key_idx = val
res = self.controller.counter_read(CACHED_KEYS_COUNTER, key_idx)
if res != 0:
print("[COUNTER] key = " + key + " [ " + str(res.packets) +
" ]")
# periodically reset registers pertaining to query statistics module of the
# P4 switch (count-min sketch registers, bloom filters and counters)
def periodic_registers_reset(self):
t = threading.Timer(STATISTICS_REFRESH_INTERVAL,
self.periodic_registers_reset)
t.daemon = True
t.start()
# before reseting registers check if the cache is utilized above a
# threshold (e.g 80%) and evict keys using lfu policy if needed
self.cache_lfu_eviction(threshold=0.8, sampling=0.2, to_remove=0.5)
# reset bloom filter related registers
for i in range(BLOOMF_REGISTERS_NUM):
self.controller.register_reset(BLOOMF_REG_PREFIX + str(i + 1))
# reset count min sketch related registers
for i in range(SKETCH_REGISTERS_NUM):
self.controller.register_reset(SKETCH_REG_PREFIX + str(i + 1))
# reset counter register storing the query frequency of each cached item
self.controller.counter_reset(CACHED_KEYS_COUNTER)
print("[INFO]: Reset query statistics registers.")
# the controller periodically checks if the memory used has exceeded a given threshold
# (e.g 80 %) and if that is the case then it evicts keys according to an approximated
# LFU policy inspired by REDIS (https://redis.io/topics/lru-cache))
def cache_lfu_eviction(self, threshold=0.8, sampling=0.2, to_remove=0.5):
# if the threshold has not been surpassed then nothing to do
if self.used_mem_slots <= (threshold * len(self.mem_pool) *
VTABLE_SLOT_SIZE):
return
n_samples = int(sampling * len(self.key_map.items()))
samples = random.sample(self.key_map.items(), n_samples)
# read the counter for each sample and store them in an array
evict_list = []
for key, val in samples:
x, y, cnt_idx = self.key_map[key]
counter = self.controller.counter_read(CACHED_KEYS_COUNTER,
cnt_idx).packets
evict_list.append((key, counter))
# sort the array and pick the smallest K-th counters and evict their keys
# (this could be achieved more optimally by using quickselect)
import operator
evict_list.sort(key=operator.itemgetter(1))
for i in range(int(to_remove * n_samples)):
curr = evict_list[i]
self.evict(curr[0])
def setup(self):
if self.cpu_port:
self.controller.mirroring_add(CONTROLLER_MIRROR_SESSION,
self.cpu_port)
# create custom hash functions for count min sketch and bloom filters
self.set_crc_custom_hashes()
self.create_hashes()
# set a daemon to periodically reset registers
self.periodic_registers_reset()
# spawn new thread to serve incoming udp connections
# (i.e hot reports from the switch)
#udp_t = threading.Thread(target=self.hot_reports_loop)
#udp_t.start()
def set_crc_custom_hashes(self):
i = 0
for custom_crc32, width in sorted(self.custom_calcs.items()):
self.controller.set_crc32_parameters(custom_crc32,
crc32_polinomials[i],
0xffffffff, 0xffffffff, True,
True)
i += 1
def create_hashes(self):
self.hashes = []
for i in range(self.sketch_register_num):
self.hashes.append(
Crc(32, crc32_polinomials[i], True, 0xffffffff, True,
0xffffffff))
# set a static allocation scheme for l2 forwarding where the mac address of
# each host is associated with the port connecting this host to the switch
def set_forwarding_table(self):
for host in self.topo.get_hosts_connected_to(self.sw_name):
port = self.topo.node_to_node_port_num(self.sw_name, host)
host_mac = self.topo.get_host_mac(host)
self.controller.table_add("l2_forward", "set_egress_port",
[str(host_mac)], [str(port)])
def set_value_tables(self):
for i in range(self.vtables_num):
self.controller.table_add("vtable_" + str(i),
"process_array_" + str(i), ['1'], [])
# this function manages the mapping between between slots in register arrays
# and the cached items by implementing the First Fit algorithm described in
# Memory Management section of 4.4.2 (netcache paper)
def first_fit(self, key, value_size):
n_slots = (value_size / (VTABLE_SLOT_SIZE + 1)) + 1
if value_size <= 0:
return None
if key in self.key_map:
return None
for idx in range(len(self.mem_pool)):
old_bitmap = self.mem_pool[idx]
n_zeros = 8 - bin(old_bitmap).count("1")
if n_zeros >= n_slots:
cnt = 0
bitmap = 0
for i in reversed(range(8)):
if cnt >= n_slots:
break
if not self.bit_is_set(old_bitmap, i):
bitmap = bitmap | (1 << i)
cnt += 1
# mark last n_slots 0 bits as 1 bits because we assigned
# them to the new key and they are now allocated
self.mem_pool[idx] = old_bitmap | bitmap
self.used_mem_slots += bin(bitmap).count("1")
return (idx, bitmap)
return None
# converts a list of 1s and 0s represented as strings and converts it
# to a bitmap using bitwise operations (this intermediate representation
# of a list of 1s and 0s is used to avoid low level bitwise logic inside
# core implementation logic)
def convert_to_bitmap(self, strlist, bitmap_len):
bitmap = 0
# supports only bitmaps with multiple of 8 bits size
if bitmap_len % 8 != 0:
return bitmap
for i in strlist:
bitmap = bitmap << 1
bitmap = bitmap | int(i)
return bitmap
# this function checks whether the k-th bit of a given number is set
def bit_is_set(self, n, k):
if n & (1 << k):
return True
else:
return False
# given a key and its associated value, we update the lookup table on
# the switch and we also update the value registers with the value
# given as argument (stored in multiple slots)
def insert(self, key, value, cont=True):
# find where to put the value for given key
mem_info = self.first_fit(key, len(value))
# if key already exists or not space available then stop
if mem_info == None:
return
vt_index, bitmap = mem_info
# keep track of number of bytes of the value written so far
cnt = 0
# store the value of the key in the vtables of the switch while
# incrementally storing a part of the value at each value table
# if the correspoding bit of the bitmap is set
for i in range(self.vtables_num):
if self.bit_is_set(bitmap, self.vtables_num - i - 1):
partial_val = value[cnt:cnt + VTABLE_SLOT_SIZE]
self.controller.register_write(VTABLE_NAME_PREFIX + str(i),
vt_index,
self.str_to_int(partial_val))
cnt += VTABLE_SLOT_SIZE
# allocate an id from the pool to index the counter and validity register
# (we take the last element of list because in python list is implemented
# to optimize for inserting and removing elements from the end of the list)
key_index = self.ids_pool.pop()
# add the new key to the cache lookup table of the p4 switch
self.controller.table_add(
NETCACHE_LOOKUP_TABLE, "set_lookup_metadata",
[str(self.str_to_int(key))],
[str(bitmap), str(vt_index),
str(key_index)])
# mark cache entry for this key as valid
self.controller.register_write("cache_status", key_index, 1)
self.key_map[key] = vt_index, bitmap, key_index
# inform the server about the successful cache insertion
if cont:
self.inform_server()
print("Inserted key-value pair to cache: (" + key + "," + value + ")")
# converts a string to a bytes representation and afterwards returns
# its integer representation of width specified by argument int_width
# (seems hacky due to restriction to use python2.7)
def str_to_int(self, x, int_width=VTABLE_SLOT_SIZE):
if len(x) > int_width:
print "Error: Overflow while converting string to int"
# add padding with 0x00 if input string size less than int_width
bytearr = bytearray(int_width - len(x))
bytearr.extend(x.encode('utf-8'))
return struct.unpack(">Q", bytearr)[0]
# given an arbitrary sized integer, the max width (in bits) of the integer
# it returns the string representation of the number (also stripping it of
# any '0x00' characters) (network byte order is assumed)
def int_to_packed(self, int_val, max_width=128, word_size=32):
num_words = max_width / word_size
words = self.int_to_words(int_val, num_words, word_size)
fmt = '>%dI' % (num_words)
return struct.pack(fmt, *words).strip('\x00')
# split up an arbitrary sized integer to words (needed to hack
# around struct.pack limitation to convert to byte any integer
# greater than 8 bytes)
def int_to_words(self, int_val, num_words, word_size):
max_int = 2**(word_size * num_words) - 1
max_word_size = 2**word_size - 1
words = []
for _ in range(num_words):
word = int_val & max_word_size
words.append(int(word))
int_val >>= word_size
words.reverse()
return words
# update the value of the given key with the new value given as argument
# (by allowing updates also to be done by the controller, the client is
# also able to update keys with values bigger than the previous one)
# in netcache paper this restriction is not resolved
def update(self, key, value):
# if key is not in cache then nothing to do
if key not in self.key_map:
return
# update key-value pair by removing old pair and inserting new one
self.evict(key)
self.insert(key, value)
# evict given key from the cache by deleting its associated entries in
# action tables of the switch, by deallocating its memory space and by
# marking the cache entry as valid once the deletion is completed
def evict(self, key):
if key not in self.key_map:
return
# delete entry from the lookup_table
entry_handle = self.controller.get_handle_from_match(
NETCACHE_LOOKUP_TABLE, [
str(self.str_to_int(key)),
])
if entry_handle is not None:
self.controller.table_delete(NETCACHE_LOOKUP_TABLE, entry_handle)
# delete mapping of key from controller's dictionary
vt_idx, bitmap, key_idx = self.key_map[key]
del self.key_map[key]
# deallocate space from memory pool
self.mem_pool[vt_idx] = self.mem_pool[vt_idx] ^ bitmap
self.used_mem_slots = self.used_mem_slots - bin(bitmap).count("1")
# free the id used to index the validity/counter register and append
# it back to the id pool of the controller
self.ids_pool.append(key_idx)
# mark cache entry as valid again (should be the last thing to do)
self.controller.register_write("cache_status", key_idx, 1)
# used for testing purposes and static population of cache
def dummy_populate_vtables(self):
test_values_l = [
"alpha", "beta", "gamma", "delta", "epsilon", "zeta", "hita",
"theta", "yiota", "kappa", "lambda", "meta"
]
test_keys_l = [
"one", "two", "three", "four", "five", "six", "seven", "eight",
"nine", "ten", "eleven", "twelve"
]
cnt = 0
for i in range(11):
self.insert(test_keys_l[i], test_values_l[i], False)
# handling reports from the switch corresponding to hot keys, updates to
# key-value pairs or deletions - this function receives a packet, extracts
# its netcache header and manipulates cache based on the operation field
# of the netcache header (callback function)
def recv_switch_updates(self, pkt):
print("Received message from switch")
# extract netcache header information
if pkt.haslayer(UDP):
ncache_header = NetcacheHeader(pkt[UDP].payload)
elif pkt.haslayer(TCP):
ncache_header = NetcacheHeader(pkt[TCP].payload)
key = self.int_to_packed(ncache_header.key, max_width=128)
value = self.int_to_packed(ncache_header.value, max_width=1024)
op = ncache_header.op
if op == NETCACHE_HOT_READ_QUERY:
print("Received hot report for key = " + key)
# if the netcache header has null value or if the "hot key"
# reported doesn't exist then do not update cache
if ncache_header.op == NETCACHE_KEY_NOT_FOUND:
return
self.insert(key, value)
elif op == NETCACHE_DELETE_COMPLETE:
print("Received query to delete key = " + key)
self.evict(key)
elif op == NETCACHE_UPDATE_COMPLETE:
print("Received query to update key = " + key)
self.update(key, value)
else:
print("Error: unrecognized operation field of netcache header")
# sniff infinitely the interface connected to the P4 switch and when a valid netcache
# packet is captured, handle the packet via a callback to recv_switch_updates function
def hot_reports_loop(self):
cpu_port_intf = str(self.topo.get_cpu_port_intf(self.sw_name))
sniff(iface=cpu_port_intf,
prn=self.recv_switch_updates,
filter="port 50000")
def main(self):
self.set_forwarding_table()
self.set_value_tables()
self.dummy_populate_vtables()
self.hot_reports_loop()