메뉴 건너뛰기




Volumn 3619, Issue , 2005, Pages 1181-1187

On the placement of active monitor in IP network

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER NETWORKS; CONCURRENCY CONTROL; OPTIMIZATION; PROBLEM SOLVING;

EID: 26444528434     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534310_123     Document Type: Conference Paper
Times cited : (1)

References (15)
  • 5
    • 0035009495 scopus 로고    scopus 로고
    • Efficiently monitoring bandwidth and latency in IP networks
    • IEEE, New York
    • Y. Breitbart, C. Chan, and et al.: Efficiently monitoring bandwidth and latency in IP networks. In: Proceeding of. IEEE INFOCOM 2001, IEEE, New York, (2001)
    • (2001) Proceeding of IEEE INFOCOM 2001
    • Breitbart, Y.1    Chan, C.2
  • 6
    • 0042475214 scopus 로고    scopus 로고
    • Robust monitoring of link delays and faults in IP networks
    • IEEE, New York
    • Y. Bejerano and R. Rastogi.: Robust monitoring of link delays and faults in IP networks. In: Proceeding IEEE INFOCOM 2003, IEEE, New York, (2003)
    • (2003) Proceeding IEEE INFOCOM 2003
    • Bejerano, Y.1    Rastogi, R.2
  • 9
    • 25844518102 scopus 로고    scopus 로고
    • INMON Corp.: sFlow accuracy and billing. http://www.inmon.com/pdf/sFlow Billing. pdf, (2001)
    • (2001) sFlow Accuracy and Billing
  • 11
    • 3042530373 scopus 로고    scopus 로고
    • Analysis of efficient monitoring method for the network flow
    • Liu XH, Yin JP, Tang LL, Zhao JM.: Analysis of efficient monitoring method for the network flow. In: Journal of Software, Volume14, No2, (2003), 300-304.
    • (2003) Journal of Software , vol.14 , Issue.2 , pp. 300-304
    • Liu, X.H.1    Yin, J.P.2    Tang, L.L.3    Zhao, J.M.4
  • 12
    • 0000301097 scopus 로고
    • A greedy heuristic for the set covering problem
    • Chvátal, V.: A greedy heuristic for the set covering problem. In: Journal of Math. Operation Research, Vol4, (1979), 233-235.
    • (1979) Journal of Math. Operation Research , vol.4 , pp. 233-235
    • Chvátal, V.1
  • 13
    • 1842511654 scopus 로고    scopus 로고
    • Improved approximation algorithms for the unpacacitated facility location problem
    • F. Chudak and D. Shmoys.: Improved approximation algorithms for the unpacacitated facility location problem. In: ACM SIAM Journal on computing, No1, (2003).
    • (2003) ACM SIAM Journal on Computing , Issue.1
    • Chudak, F.1    Shmoys, D.2
  • 15
    • 0000682161 scopus 로고    scopus 로고
    • Approximation algorithms for metric facility location and K-median problems using the primal-dual schema and lagrange relaxation
    • K. Jain and V. Vazirani.: Approximation Algorithms for Metric Facility Location and k-Median Problems Using the Primal-Dual Schema and Lagrange Relaxation. In: Journal of ACM, Vol. 48 (2001) 274-296.
    • (2001) Journal of ACM , vol.48 , pp. 274-296
    • Jain, K.1    Vazirani, V.2


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