메뉴 건너뛰기




Volumn 25, Issue 3, 2011, Pages 29-34

Dynamic measurement-aware routing in practice

Author keywords

[No Author keywords available]

Indexed keywords

BALANCED LOADS; DEGREE OF FREEDOM; ENTERPRISE NETWORKS; MONITOR LOCATION; NETWORK OPERATIONS; ON THE FLIES; ROUTING TABLE; SUB-POPULATIONS; TRAFFIC CHARACTERISTICS; TRAFFIC ENGINEERING; TRAFFIC FLOW; TRAFFIC MONITORING; TRAFFIC ROUTING; TROUBLESHOOTING;

EID: 79957592669     PISSN: 08908044     EISSN: None     Source Type: Journal    
DOI: 10.1109/MNET.2011.5772058     Document Type: Article
Times cited : (17)

References (12)
  • 1
    • 24144497584 scopus 로고    scopus 로고
    • Building a better netflow
    • Portland, OR Sept.
    • C. Estan, et al. Building a Better NetFlow, Proc. ACM Sigcomm, Portland, OR Sept. 2004.
    • (2004) Proc. ACM Sigcomm
    • Estan, C.1
  • 2
    • 2442583610 scopus 로고    scopus 로고
    • New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
    • Aug.
    • C. Estan and G. Varghese, "New Directions in Traffic Measurement and Accounting: Focusing on the Elephants, Ignoring the Mice," ACM Trans. Comp. Sys., vol. 21, no. 3, Aug. 2003, pp. 270-313.
    • (2003) ACM Trans. Comp. Sys. , vol.21 , Issue.3 , pp. 270-313
    • Estan, C.1    Varghese, G.2
  • 3
    • 34547488856 scopus 로고    scopus 로고
    • Is sampled data sufficient for anomaly detection?
    • Brazil Oct.
    • J. Mai et al., "Is Sampled Data Sufficient for Anomaly Detection?," Proc. ACM SIGCOMM IMC, Rio de Janeiro, Brazil, Oct. 2006.
    • (2006) Proc. ACM SIGCOMM IMC, Rio de Janeiro
    • Mai, J.1
  • 4
    • 36949004950 scopus 로고    scopus 로고
    • ProgME: Towards programmable network measurement
    • Kyoto, Japan Aug.
    • L. Yuan, C.-N. Chuah, and P. Mohapatra, "ProgME: Towards Programmable Network Measurement," Proc. ACM SIGCOMM, Kyoto, Japan, Aug. 2007.
    • (2007) Proc. ACM SIGCOMM
    • Yuan, L.1    Chuah, C.-N.2    Mohapatra, P.3
  • 5
    • 25844461901 scopus 로고    scopus 로고
    • Locating network monitors: Complexity, heuristics and coverage
    • Miami, FL, Mar.
    • K. Suh et al., "Locating Network Monitors: Complexity, Heuristics and Coverage," Proc. IEEE INFOCOM, Miami, FL, Mar. 2005.
    • (2005) Proc. IEEE INFOCOM
    • Suh, K.1
  • 6
    • 77953319788 scopus 로고    scopus 로고
    • Measurouting: A framework for routing assisted traffic monitoring
    • San Diego, CA, June
    • S. Raza et al., "Measurouting: A Framework for Routing Assisted Traffic Monitoring," Proc. IEEE INFOCOM, San Diego, CA, June 2010.
    • (2010) Proc. IEEE INFOCOM
    • Raza, S.1
  • 9
    • 17644366974 scopus 로고    scopus 로고
    • Data streaming algorithms for efficient and accurate estimation of flow size distribution
    • New York, NY June
    • A. Kumar et al., "Data Streaming Algorithms for Efficient and Accurate Estimation of Flow Size Distribution," ACM Sigmetrics, New York, NY, June 2004.
    • (2004) ACM Sigmetrics
    • Kumar, A.1
  • 10
    • 77956605732 scopus 로고    scopus 로고
    • Portland: A scalable fault- tolerant layer 2 data center network fabric
    • New York, NY June
    • R. N. Mysore et al., "Portland: A Scalable Fault- Tolerant Layer 2 Data Center Network Fabric," Proc. ACM SIGCOMM, New York, NY, June 2009.
    • (2009) Proc. ACM SIGCOMM
    • Mysore, R.N.1
  • 11
    • 49249108478 scopus 로고    scopus 로고
    • An evaluation of in-advance bandwidth scheduling algo rithms for connection-oriented networks
    • May
    • E.-S. Jung et al., "An Evaluation of In-Advance Bandwidth Scheduling Algo rithms for Connection-Oriented Networks," Proc. Int'l. Symp. Parallel Archi tectures, Algorithms, and Networks, 0:133-138, May 2008.
    • (2008) Proc. int'L. Symp. Parallel Archi Tectures, Algorithms, and Networks , pp. 133-138
    • Jung, E.-S.1


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