http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
ATM 망에서 우선순위 제어 및 실시간 처리가 가능한 호 수락 제어
이혁진,오민웅,박광채 조선대학교 동력자원연구소 1996 動力資源硏究所誌 Vol.18 No.1
When a new call requests a call set-up, call admission control determines whether to accept a call set-up or not, in order to maintain the QOS of existing and new calls. In this paper, the VP bandwidth is separated to eliminate interference between traffics. We can class CBR and VBR traffic and fulfill call admission control applied to each traffic. The call admission control method of CBR traffic is peak bandwidth allocation and that of VBR traffic is performed to guarantee QOS. Proposed method is suitable for real time processing because the amount of calculation is reduced remarkably by using recursive equations in estimating cell loss probability. Also, proposed method can be applied to prioity control.
박광채,이혁진,서순석 조선대학교 동력자원연구소 1995 動力資源硏究所誌 Vol.17 No.2
One of the challenges in the interconnection of LAN and MAN to ATM is the support of connectionless traffic in the ATM network. A commonly proposed strategy consists of maintaining a low bandwidth VP(virtual path) between each pair of gateway and of requesting more bandwidth whenever a burst comes in from the LAN or MAN. Unfortunately this stratege places a heavy burden on the ATM control processor. Therefore we proposed BA(Bandwidth Advertising) scheme, which know available bandwidth and On-the-fly transmission, which transfer bursts without prior bandwidth reservation. The BA scheme and On-the-fly transmission for connectionless traffic is described and is compared with a bandwidth renegotiation strategy.
축출 우선순위 트래픽 제어 메카니즘의 성능 분석에 관한 연구
이수영,이혁진,오민웅,박광채 조선대학교 동력자원연구소 1994 動力資源硏究所誌 Vol.16 No.2
본 논문에서는 다중의 우선순위를 지원하는 통신망에 확장시켜 적용할 수 있는 Markov chain을 이용한 축출 우선순위 트래픽 제어 메카니즘의 해석방법을 제안하였다. 제안한 해석방법을 전체 버퍼의 크기, 트래픽 세기, 우선순위 트래픽의 혼합비 등을 가변하면서 두개의 우선순위를 지원하는 ATM 망에 적용한 결과 트래픽 세기가 0.5∼0.8일 때 전체 버퍼의 크기가 25정도이면 서비스 품질을 만족하였다. 그러나 다중 우선순위 제어에서는 할당된 우선순위의 수와 우선순위 트래픽의 혼합비 등이 손실에 많은 영향을 미친다는 것을 알 수 있었다. 또한 기존의 해석방법에 비하여 간단하면서도, 비교적 정확한 결과를 얻었으며 임의의 우선순위를 지원하는 통신망에 신축성있게 적용할 수 있음을 알았다. 제안한 해석방법은 시뮬레이션 전용언어인 SIMSCRIPT II.5로 시뮬레이션을 수행하여 결과의 타당성을 강조하였다. In this paper, we propose the analysis method of extended push-out priority traffic control mechanism which can be applied to the network supporting multiple priorities, using Markov chain. When proposed analysis methods are applied to ATM networks with two priorities as varying buffer size, traffic intensity and mixing ratio of priority traffics, as a result, it satifies the quality of service when the buffer size is 25 in traffic intensity 0.5∼0.8. But, in the case of multiple priority control mechanism, the number of assigned priorities and the mixing ratio of traffic affect the loss probability. Also we get very simple and more exact results compared with conventional analysis method and know that the proposed analysis method is flexibly applied to the network with multiple priorities. To verify the proposed analysis method, we perform the simulation using the SIMSCRIPT II.5 simulation package.