▁. ▁Finally , ▁let ▁ ▁be ▁the ▁weight ▁of ▁. ▁ ▁Object ive : ▁Find ▁an ▁estimate ▁ ▁of ▁ ▁using ▁only ▁ ▁storage ▁units , ▁where ▁. ▁ ▁An ▁example ▁of ▁an ▁instance ▁for ▁the ▁weight ed ▁problem ▁is : ▁. ▁For ▁this ▁instance , ▁, ▁the ▁weights ▁are ▁ ▁and ▁. ▁ ▁As ▁an ▁application ▁example , ▁ ▁could ▁be ▁IP ▁packets ▁received ▁by ▁a ▁server . ▁Each ▁packet ▁belongs ▁to ▁one ▁of ▁ ▁IP ▁flows ▁. ▁The ▁weight ▁ ▁can ▁be ▁the ▁load ▁im posed ▁by ▁flow ▁ ▁on ▁the ▁server . ▁Thus , ▁ ▁represents ▁the ▁total ▁load ▁im posed ▁on ▁the ▁server ▁by ▁all ▁the ▁flows ▁to ▁which ▁packets ▁ ▁belong . ▁ ▁Sol ving ▁the ▁weight ed ▁count - dist inct ▁problem ▁ ▁Any ▁extreme ▁order ▁statistics ▁estim ator ▁( min / max ▁sketch es ) ▁for ▁the ▁un weight ed ▁problem ▁can ▁be ▁generalized ▁to ▁an ▁estim ator ▁for ▁the ▁weight ed ▁problem ▁. ▁For ▁example , ▁the ▁weight ed ▁estim ator ▁proposed ▁by ▁C ohen ▁et ▁al . ▁can ▁be ▁obtained ▁when ▁the ▁continuous ▁max ▁sketch es ▁estim ator ▁is ▁extended ▁to ▁solve ▁the ▁weight ed ▁problem . ▁ ▁In ▁particular , ▁the ▁Hyper Log Log ▁algorithm ▁ ▁can ▁be ▁extended ▁to ▁solve ▁the ▁weight ed ▁problem . ▁The ▁extended ▁Hyper Log Log ▁algorithm ▁offers ▁the ▁best ▁performance , ▁in ▁terms ▁of ▁statistical ▁accuracy ▁and ▁memory ▁usage , ▁among ▁all ▁the ▁other ▁known ▁algorithms ▁for ▁the ▁weight ed ▁problem . ▁ ▁See ▁also ▁ ▁Count