A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks

<table><tr><td><table class="algorithm" id="alg3"><tr><td colspan="2">// count the number of significant bits in <i>n  </i></td></tr><tr><td colspan="2">ONES(<i>n</i>)</td></tr><tr><td colspan="2">(1) <i>d </i><i>←</i> 0</td></tr><tr><td colspan="2">(2) while <i>n</i> not 0</td></tr><tr><td colspan="2">(3)  do <i>d </i><i>←</i><i>d</i> + 1</td></tr><tr><td colspan="2">(4)   <svg height="7.9499998" id="M252" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 42.849998 7.9499998" width="42.849998" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M495 86q-46 -47 -87 -72.5t-63 -25.5q-43 0 -16 107l49 210q7 34 8 50.5t-3 21t-13 4.5q-35 0 -109.5 -72.5t-115.5 -140.5q-21 -75 -38 -159q-50 -10 -76 -21l-6 8l84 340q8 35 -4 35q-17 0 -67 -46l-15 26q44 44 85.5 70.5t64.5 26.5q35 0 10 -103l-24 -98h2
q42 56 97 103.5t96 71.5q46 26 74 26q9 0 16 -2.5t14 -11.5t9.5 -24.5t-1 -44t-13.5 -68.5q-30 -117 -47 -200q-4 -19 -3.5 -25t6.5 -6q21 0 70 48z" id="x1D45B"></path></g><g transform="matrix(.017,-0,0,-.017,13.305,7.675)"><path d="M885 230h-727l102 -147l-22 -15q-114 125 -185 187q71 62 185 187l22 -15l-102 -147h727v-50z" id="x2190"></path></g><g transform="matrix(.017,-0,0,-.017,34.247,7.675)"><path d="M495 86q-46 -47 -87 -72.5t-63 -25.5q-43 0 -16 107l49 210q7 34 8 50.5t-3 21t-13 4.5q-35 0 -109.5 -72.5t-115.5 -140.5q-21 -75 -38 -159q-50 -10 -76 -21l-6 8l84 340q8 35 -4 35q-17 0 -67 -46l-15 26q44 44 85.5 70.5t64.5 26.5q35 0 10 -103l-24 -98h2
q42 56 97 103.5t96 71.5q46 26 74 26q9 0 16 -2.5t14 -11.5t9.5 -24.5t-1 -44t-13.5 -68.5q-30 -117 -47 -200q-4 -19 -3.5 -25t6.5 -6q21 0 70 48z" id="x1D45B"></path></g>
</svg> &amp; (<svg height="11.125" id="M253" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 34.349998 11.125" width="34.349998" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.862)"><path d="M495 86q-46 -47 -87 -72.5t-63 -25.5q-43 0 -16 107l49 210q7 34 8 50.5t-3 21t-13 4.5q-35 0 -109.5 -72.5t-115.5 -140.5q-21 -75 -38 -159q-50 -10 -76 -21l-6 8l84 340q8 35 -4 35q-17 0 -67 -46l-15 26q44 44 85.5 70.5t64.5 26.5q35 0 10 -103l-24 -98h2
q42 56 97 103.5t96 71.5q46 26 74 26q9 0 16 -2.5t14 -11.5t9.5 -24.5t-1 -44t-13.5 -68.5q-30 -117 -47 -200q-4 -19 -3.5 -25t6.5 -6q21 0 70 48z" id="x1D45B"></path></g><g transform="matrix(.017,-0,0,-.017,12.37,10.862)"><path d="M535 230h-483v50h483v-50z" id="x2212"></path></g><g transform="matrix(.017,-0,0,-.017,26.122,10.862)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g>
</svg>)</td></tr><tr><td colspan="2">(5) return <i>d  </i></td></tr></table></td></tr></table>

The Scientific World Journal

alg3

Algorithm 3

Algorithm 3: A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks 