id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_xihaospkm5g7xoaeabghvmripi	Navid Khezrian	Comparison of the performance of skip lists and splay trees in classification of internet packets	2019	16	.pdf	application/pdf	7384	637	69	Comparison of the performance of skip lists and splay trees in classification of internet packets. The main aim of the paper is to compare the performance of the skip list and splay tree data With both skip lists and splay trees, packet classification is as following. fields in the packet, a skip list or a splay tree is created and searched simultaneously to find Figure 3B evaluates both the skip list and splay tree for 32k packets. The difference in packet classification time between skip list and splay rules in which the splay tree accesses memory 1496966 times more than the skip list. different numbers of rules, the skip list has less memory access than does the splay tree. reduction in the number of memory accesses and packet classification time in skip lists. of rules, packet classification time and memory access increase less in a skip list than in a	./cache/work_xihaospkm5g7xoaeabghvmripi.pdf	./txt/work_xihaospkm5g7xoaeabghvmripi.txt