Name
Abstract | ||
|---|---|---|
We present a new virtual indexing method for estimating host connection degrees for high speed links. It is based on the virtual connection degree sketch where a compact sketch of network traffic is built by generating the associated virtual bitmaps for each host. Each virtual bitmap consists of a fixed number of bits selected randomly from a shared bit array by a new method for recording the traffic flows of the corresponding host. The shared bit array is efficiently utilized by all hosts since its every bit is shared by the virtual bitmaps of multiple hosts. To reduce the “noise” contaminated in a host's virtual bitmaps due to sharing, we propose a new method to generate the “filtered” bitmap used to estimate host connection degree. Furthermore, it can be easily implemented in parallel and distributed processing environments. The experimental and testing results based on the actual network traffic show that the new method is accurate and efficient. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/INFCOM.2011.5934948 | INFOCOM |
Keywords | Field | DocType |
parallel processing,radio links,high speed link,compact sketch,data streaming,network traffic,virtual indexing,noise,host connection degree,bitmap,traffic flow,media streaming,filtered bitmap,virtual connection degree sketch,telecommunication traffic,virtual bitmap,distributed processing,indexing,accuracy,indexation,bismuth | Computer science,Parallel processing,Computer network,Search engine indexing,Virtual circuit,Bitmap,Bit array,Sketch | Conference |
Volume | Issue | ISSN |
null | null | 0743-166X |
ISBN | Citations | PageRank |
978-1-4244-9919-9 | 4 | 0.38 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ping-Hui Wang | 1 | 236 | 33.39 |
| X. Guan | 2 | 1169 | 137.97 |
| Weibo Gong | 3 | 3225 | 250.70 |
| Don Towsley | 4 | 18693 | 1951.05 |