원문정보
The Study on the Dynamic Bandwidth Allocation Algorithm using Cell Delay Variation
초록
영어
Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories: static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks.. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.
목차
1. 서론
2. CDV 의 특성
2.1 리키버킷 (LB : Leaky Bucket) 에 의한 CDV 측정
2.2 리키 버킷에 의한 worst 트래픽 특성
2.3 G/G/1/N 최대 엔트로피 방법
3. 제안된 동적 대역폭 알고리즘
3.1 부분예약 공유기법의 등가용량
4. 시뮬레이션 결과
5. 결론
참고문헌
