selecting a protocol parameter P for determining a tradeoff between memory utilization and required execution time wherein P is an integer greater than zero; defining a minimum number of entries and a maximum number of entries in each vertex of the sorted binary tree as a function of the protocol parameter P; if inserting an entry into a bottom vertex of the sorted binary tree exceeds the maximum