Incremental tracking of multiple quantiles for network monitoring in cellular networks

Proceedings of the 1st ACM Workshop on Mobile Internet Through Cellular Networks, MICNET'09, Co-located with the Mobile Computing and Networking Conference, MobiCom'09

Volumn , Issue , 2009, Pages 7-12

  Jin, Cao ^a   Li, Erran Li ^a   Aiyou, Chen ^a   Tian, Bu ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Cellular networks; Incremental quantile estimation; Stochastic approximation

Indexed keywords

CELLULAR NETWORK; DATA DISTRIBUTION; DATA SETS; EMPIRICAL DATA; EVOLVING NETWORKS; GLOBAL APPROXIMATION; INCREMENTAL TRACKING; LOCAL APPROXIMATION; MONOTONE PROPERTIES; NETWORK MONITORING; QUANTILE ESTIMATION; RANDOM DISTRIBUTION; REPRESENTATIVE SAMPLE; STOCHASTIC APPROXIMATION ALGORITHMS; STOCHASTIC APPROXIMATIONS;

APPROXIMATION THEORY; CELLULAR NEURAL NETWORKS; CELLULAR TELEPHONE SYSTEMS; COMPUTER SCIENCE; ESTIMATION; INTERNET; MAXIMUM LIKELIHOOD ESTIMATION; MOBILE COMPUTING; MOBILE DEVICES; MONITORING; STOCHASTIC SYSTEMS; WIRELESS NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 70449633090     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1614255.1614258     Document Type: Conference Paper

References (8)

1. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In PODS '04: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 286-296, New York, NY, USA, 2004. ACM.
2. F. Chen, D. Lambert, and J. C. Pinheiro. Incremental quantile estimation for massive tracking. In KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, 2000.
3. A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. Fast, small-space algorithms for approximate histogram maintenance. In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 389-398, 2002.
4. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. How to summarize the universe: dynamic maintenance of quantiles. In VLDB '02: Proceedings of the 28th international conference on Very Large Data Bases, pages 454-465. VLDB Endowment, 2002.
5. H. J. Kushner and G. G. Yin. Stochastic Approximation Algorithms and Applications. Springer-Verlag, 1997.
6. X. Lin, H. Lu, J. Xu, and J. X. Yu. Continuously maintaining quantile summaries of the most recent n elements over a data stream. In ICDE '04: Proceedings of the 20th International Conference on Data Engineering, page 362, Washington, DC, USA, 2004. IEEE Computer Society.
7. H. Robbins and S. Monro. A stochastic approximation method. The Annals of Mathematical Statistics, 22(3):400-407, 1951.
8. L. Tierney. A space-efficient recursive procedure for estimating a quantile of an unknown distribution. SIAM Jounal of Scientific and Statistical Computing, 4(4), 1983.