메뉴 건너뛰기




Volumn 33, Issue 1, 2005, Pages 350-361

Data streaming algorithms for accurate and efficient measurement of traffic and flow matrices

Author keywords

Data Streaming; Network Measurement; Sampling; Statistical Inference; Traffic Matrix

Indexed keywords

ALGORITHMS; DATA TRANSFER; PROBLEM SOLVING; SAMPLING; STATISTICAL METHODS; TELECOMMUNICATION TRAFFIC;

EID: 33244459866     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/1071690.1064258     Document Type: Conference Paper
Times cited : (21)

References (28)
  • 5
    • 8344233039 scopus 로고    scopus 로고
    • Properties and prediction of flow statistics from sampled packet streams
    • August
    • N. Duffield, C. Lund, and M. Thorup. Properties and prediction of flow statistics from sampled packet streams. In Proc. of ACM/SIGCOMM IMW, August 2002.
    • (2002) Proc. of ACM/SIGCOMM IMW
    • Duffield, N.1    Lund, C.2    Thorup, M.3
  • 6
    • 8344290018 scopus 로고    scopus 로고
    • Estimating flow distribution from sampled flow statistics
    • August
    • N. Duffield, C. Lund, and M. Thorup. Estimating flow distribution from sampled flow statistics. In Proc. of ACM SIGCOMM, August 2003.
    • (2003) Proc. of ACM SIGCOMM
    • Duffield, N.1    Lund, C.2    Thorup, M.3
  • 7
    • 0141440878 scopus 로고    scopus 로고
    • New directions in traffic measurement and a ccounting
    • August
    • C. Estan and G. Varghese. New directions in traffic measurement and a ccounting. In Proc. of ACM SIGCOMM, August 2002.
    • (2002) Proc. of ACM SIGCOMM
    • Estan, C.1    Varghese, G.2
  • 8
    • 19544394713 scopus 로고    scopus 로고
    • Bitmap algorithms for counting active flows on high speed links
    • October
    • C. Estan and G. Varghese. Bitmap algorithms for counting active flows on high speed links. In Proc. of ACM/SIGCOMM IMC, October 2003.
    • (2003) Proc. of ACM/SIGCOMM IMC
    • Estan, C.1    Varghese, G.2
  • 10
    • 84938015047 scopus 로고
    • A method for the construction of minimum-redundancy codes
    • D.A. Huffman. A method for the construction of minimum-redundancy codes. Proc. of I.R.E, pages 1098-1102, 1952.
    • (1952) Proc. of I.R.E , pp. 1098-1102
    • Huffman, D.A.1
  • 12
    • 17644366974 scopus 로고    scopus 로고
    • Data streaming algorithms for efficient and accurate estimation of flow size distribution
    • A. Kumar, M. Sung, J. Xu, and J. Wang. Data streaming algorithms for efficient and accurate estimation of flow size distribution. In Proc. of ACM SIGMETRICS, 2004.
    • (2004) Proc. of ACM SIGMETRICS
    • Kumar, A.1    Sung, M.2    Xu, J.3    Wang, J.4
  • 13
  • 15
    • 84858532155 scopus 로고    scopus 로고
    • http://pma.nlanr.net.
  • 16
    • 8344276672 scopus 로고    scopus 로고
    • Design of IGP link weight changes for estimation of traffic matrices
    • March
    • A. Nucci, R. Cruz, N. Taft, and C. Diot. Design of IGP link weight changes for estimation of traffic matrices. In Proc. of IEEE INFOCOM, March 2004.
    • (2004) Proc. of IEEE INFOCOM
    • Nucci, A.1    Cruz, R.2    Taft, N.3    Diot, C.4
  • 18
    • 24144488819 scopus 로고    scopus 로고
    • Efficient implementation of a statistics counter architecture
    • June
    • S. Ramabhadran and G. Varghese. Efficient implementation of a statistics counter architecture. In Proc. of ACM SIGMETRICS, June 2003.
    • (2003) Proc. of ACM SIGMETRICS
    • Ramabhadran, S.1    Varghese, G.2
  • 19
    • 0031366315 scopus 로고    scopus 로고
    • Efficient hardware hashing functions for high performance computers
    • M. Ramakrishna, E. Fu, and E. Bahcekapili. Efficient hardware hashing functions for high performance computers. IEEE Transactions on Computers, pages 1378-1381, 1997.
    • (1997) IEEE Transactions on Computers , pp. 1378-1381
    • Ramakrishna, M.1    Fu, E.2    Bahcekapili, E.3
  • 20
    • 84858540927 scopus 로고    scopus 로고
    • http://www.ripe.net.
  • 22
    • 8344266958 scopus 로고    scopus 로고
    • How to identify and estimate the largest traffic matrix elements in a dynamic environment
    • June
    • A. Soule, A. Nucci, R. Cruz, E. Leonardi, and N. Taft. How to identify and estimate the largest traffic matrix elements in a dynamic environment. In Proc. of ACM SIGMETRICS, June 2004.
    • (2004) Proc. of ACM SIGMETRICS
    • Soule, A.1    Nucci, A.2    Cruz, R.3    Leonardi, E.4    Taft, N.5
  • 24
    • 0001073106 scopus 로고    scopus 로고
    • Internet tomography: Estimating source-destination traffic intensities from link data
    • Y. Vardi. Internet tomography: estimating source-destination traffic intensities from link data. Journal of American Statistics Association, pages 365-377, 1996.
    • (1996) Journal of American Statistics Association , pp. 365-377
    • Vardi, Y.1
  • 26
    • 0033884565 scopus 로고    scopus 로고
    • A novel cache architecture to support layer-four packet classification at memory access speeds
    • March
    • J. Xu, M. Singhal, and Joanne Degroat. A novel cache architecture to support layer-four packet classification at memory access speeds. In Proc. of IEEE INFOCOM, March 2000.
    • (2000) Proc. of IEEE INFOCOM
    • Xu, J.1    Singhal, M.2    Degroat, J.3
  • 27
  • 28
    • 8344277151 scopus 로고    scopus 로고
    • An information-theoretic approach to traffic matrix estimation
    • August
    • Y. Zhang, M. Roughan, C. Lund, and D. Donoho. An information-theoretic approach to traffic matrix estimation. In Proc. of ACM SIGCOMM, August 2003.
    • (2003) Proc. of ACM SIGCOMM
    • Zhang, Y.1    Roughan, M.2    Lund, C.3    Donoho, D.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.