Improved Degree Search Algorithms in Unstructured P2P Networks

<table>Search success ratio (<svg height="11.325" id="M42" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 12.45 11.325" width="12.45" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.262)"><path d="M699 659l10 -27q-31 -17 -42 -39t-21 -74l-14 -69q-10 -53 -26 -82t-47 -53q-58 -45 -156 -48v-145q0 -58 14.5 -74t71.5 -20v-28h-256v28q57 4 71 20t14 74v145q-104 3 -163 49q-29 23 -45 54t-25 82l-12 72q-11 62 -20 77q-11 19 -38 31l10 27q74 -11 106 -50
q20 -24 30 -78l11 -60q16 -92 48.5 -128t97.5 -41v227q0 57 -13.5 73t-66.5 20v28h245v-28q-53 -4 -66.5 -20t-13.5 -73v-227q75 4 103.5 37.5t45.5 132.5l10 58q8 51 33 80q35 38 104 49z" id="x3A8"></path></g>
</svg>) of the various algorithms in different topology networks.</table>

Mathematical Problems in Engineering

Improved Degree Search Algorithms in Unstructured P2P Networks

Figure 7