• 한국정보과학회논문지:정보통신
• /
• 제29권2호
• /
• pp.181-187
• /
• 2002

Connection admission control(CAC), which decides whether or not to accept a new call request, is one of the most Important preventive congestion control techniques in asynchronous transfer mode(ATM) networks. To develop a practical CAC scheme, first we propose a "Modified Cell Loss Probability MP${\nu}"$, which is based on "Virtual Cell Loss Probability P${\nu}"$, taking into account mean burst duration of input traffic source and buffer size in ATM networks. MP${\nu}"$ computes more accurate cell loss probability than P${\nu}"$ without increasing computational complexity, since P${\nu}"$ is formulated simply form the maximum and the average cell rate of input traffic. P${\nu}"$ is overestimated as compared to the real cell loss probability when the mean burst duration is relatively small to the buffer capacity. Then, we Propose a CAC scheme, based on "Modified Virtual Bandwidth(MVB)" method, which may individualize the cell loss probabilities in heterogeneous traffic environments. For the proposed approach, we define the interference intensity to identify interferences between heterogeneous traffic sources and use it as well as MP${\nu}"$ to compute MVB. Our approach is well suitable for ATM networks since it provides high bandwidth utilization and guarantees simple and real time CAC computation for heterogeneous traffic environments.heterogeneous traffic environments.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1999년도 춘계학술대회 논문집
• /
• pp.1-5
• /
• 1999

An ATM switch is the basic component of an ATM network, and its functioning is to switch incoming cells arriving at an input port to the output port associated with an appropriate virtual path. In case of an ATM switch with buffer sharing scheme, the performance analysis is very difficult due to the interactions between the address queues. In this paper, the influences of the degree of traffic burstiness and some traffic routing properties are investigated by using the simulation. Also, some cell access strategies including priority access and cell dropping are compared in terms of cell loss probability.

• 전자공학회논문지A
• /
• 제33A권2호
• /
• pp.23-31
• /
• 1996

This paper proposes a new UPC(usage parameter control) mechanism that varies the token generation rate of leaky bucket by observing virtual buffer, thus achieving an improvement of performance. An acceptance of a call in B-ISDN is determined by call admission control. A UPC that polices the agreed traffic parameters of a call and takes appropriate actions to prevent congestion in networks. The cell loss probability of conventional UPC is far from that of ideal UPC. The proposed mechanism has a better policing ability and response time for nonconforming call. The proposed mechanism uses ON-OFF model as input traffic. The results of simulation show the efficiency of the proposed mechanism.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.387-390
• /
• 2001

In this paper, we propose methods for designing the Virtual Private Network (VPN) which guarantees a strict Quality of Service (QoS) over A TM networks. The required Quality of Service is a very strict Cell Loss Probability, and it is guaranteed by pro riding equivalent bandwidth which is computed so that the provided bandwidth is sufficient to guarantee that requirement. We consider two network architectures for constructing VPM, the customer pipe scheme and the Hose scheme, and we propose a method to compute the amount of the required bandwidth for the two schemes. Finally, we investigate the implication of the scheme via numerical experiments.

• 한국정보처리학회논문지
• /
• 제4권6호
• /
• pp.1433-1442
• /
• 1997

멀티미디어 서비스를 위한 ATM 망에서 다양한 트래픽 클래스의 Qos 요구를 만족하기 위한 최적화된 대역폭의 알고리즘 설계가 필요하다. ATM망은 다양한 트래픽 성질 즉, 버스트 비트율과 버스트 길이로 분류되는 트래픽의 Qos 요구를 보장하여야 한다. QoS는 셀손실 가능성과 최대 셀 대기에 의하여 측정되는데, 본 논문에서는 가상경로에서 MMDP 방법을 적용하여 On-Off 자원의 다중 클래스가 하나의 가상경로 망에서 다중 송신할 때 모든 QoS 필요성을 만족하게 요구하는 최소 용량을 계산한다. 위 결과를 이용해서 개별적인 QoS를 요구하는 총 용량에서 가장 최적에 이르는 가상경로를 결정하는 알고리즘을 제안한다. 동일하게 다중 전송되는 트래픽 클래스가 최대 대역폭 효율에 따라 요구되는 최적의 용량과 비교하여 제안된 알고리즘 성능이 우수함을 증명한다.