상세정보
학술지
Technique for Estimating the Number of Active Flows in High-Speed Networks
- 저자
- 이성원, Xidong Deng, George Kesidis, Chita R. Das
- 발행일
- 200804
- 출처
- ETRI Journal, v.30 no.2, pp.194-204
- ISSN
- 1225-6463
- 출판사
- 한국전자통신연구원 (ETRI)
- 초록
- The online collection of coarse-grained traffic information, such as the total number of flows, is gaining in importance due to a wide range of applications, such as congestion control and network security. In this paper, we focus on an active queue management scheme called SRED since it estimates the number of active flows and uses the quantity to indicate the level of congestion. However, SRED has several limitations, such as instability in estimating the number of active flows and underestimation of active flows in the presence of non-responsive traffic We present a Markov model to examine the capability of SRED in estimating the number of flows. We show how the SRED cache hit rate can be used to quantify the number of active flows. We then propose a modified SRED scheme, called hash-based two-level caching (HaTCh), which uses hashing and a two-level caching mechanism to accurately estimate the number of active flows under various workloads. Simulation results indicate that the proposed scheme provides a more accurate estimation of the number of active flows than SRED, stabilizes the estimation with respect to workload fluctuations, and prevents performance degradation by efficiently isolating non-responsive flows.
- KSP 제안 키워드
- Cache hit rate, Caching Mechanism, Congestion control, High speed network, Markov model, Non-responsive traffic, Two-level, Wide range, accurate estimation, active queue management, coarse-grained