An Efficient Method for Detecting Supernodes Using Reversible Summary Data Structures in the Distributed Monitoring Systems

<table class="table-group" id="tab1"><tr><td><table class="table"><tr><td class="thead-hr" colspan="5"><hr/></td></tr><tr class="thead"><td class="align_left">Dataset</td><td class="align_center"><svg height="7.82449pt" id="M88" style="vertical-align:-0.04980993pt" version="1.1" viewbox="-0.0498162 -7.77468 6.36303 7.82449" width="6.36303pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M448 453H361L394 608H355L322 453H214L248 608H210L176 453H79L70 395H163L134 259H35L24 201H120L82 27H120L158 201H266L229 27H267L305 201H395L404 259H318L348 395H439L448 453ZM310 395L280 259H173L202 395H310Z"></path></g></svg>packet</td><td class="align_center">|SIP|</td><td class="align_center">|DIP|</td><td class="align_center">|(SIP, DIP)|</td></tr><tr><td class="thead-hr" colspan="5"><hr/></td></tr><tr><td class="align_left">data1</td><td class="align_center">2.4<i>M</i></td><td class="align_center">39<i>K</i></td><td class="align_center">212<i>K</i></td><td class="align_center">658<i>K</i></td></tr><tr><td class="align_left">data2</td><td class="align_center">2.4<i>M</i></td><td class="align_center">39<i>K</i></td><td class="align_center">212<i>K</i></td><td class="align_center">660<i>K</i></td></tr><tr><td class="align_left">data3</td><td class="align_center">2.3<i>M</i></td><td class="align_center">39<i>K</i></td><td class="align_center">215<i>K</i></td><td class="align_center">711<i>K</i></td></tr><tr class="table-tr"><td colspan="5"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Security and Communication Networks

tab1

Table 1

Table 1: An Efficient Method for Detecting Supernodes Using Reversible Summary Data Structures in the Distributed Monitoring Systems 