Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Estimating flow distributions from sampled flow statistics
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Data streaming algorithms for efficient and accurate estimation of flow size distribution
Proceedings of the joint international conference on Measurement and modeling of computer systems
Profiling internet backbone traffic: behavior models and applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Bitmap algorithms for counting active flows on high-speed links
IEEE/ACM Transactions on Networking (TON)
A simple and efficient estimation method for stream expression cardinalities
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
| Hi-index | 0.00 |
Information on network host connectivity patterns are important for network monitoring and traffic engineering. In this paper, an efficient streaming algorithm is proposed to estimate cardinality distributions including connectivity distributions, e.g. percent of hosts with any given number of distinct communicating peers or flows.