• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.2
• /
• pp.97-104
• /
• 2000

Effective call admission control is desirable to control an ATM traffics. It should provide high fairness and utilization for different kinds of services during call admission. Complete bandwidth sharing method is efficient for utilization of bandwidth but not efficient for fairness of call admission. Complete bandwidth partitioning method is efficient for fairness but not efficient for utilization. We propose a new CST(Complete Sharing with Threshold) algorithm using threshold on a total link to improve fairness and utilization.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1685-1690
• /
• 2006

The future mobile communication system should be operated with hierarchical cellular system for providing high quality multimedia services within limited wireless resources. In this paper, we have studied a call admission control scheme applied in hierarchical CDMA cellular system nested with macro, macro, and pico cells. When the proposed call admission control algorithm was applied we got 20% more system capacity than no admission control was applied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3A
• /
• pp.129-139
• /
• 2003

CAC is a very important issue in CDMA system in order to protect the required QoS(quality of service) and increase the system's capacity. In this paper, we proposed and analyzed a call admission control scheme using multiple thresholds, which can provide quick processing time and better performance. There are two effective thresholds used to decide call admission. One is the number of active users, and the other is the signal to interference ratio(SIR). If the threshold of active users are lower than the low number of users threshold, we accept the new call without any other conditions. Otherwise, we check the current SIR to guarantee the quality of our service. System then accepts the new call when the SIR satisfies system requirement. Otherwise, the call will be rejected. Multiple threshold schemes are investigated and their performance is compared with the number of user and power based CAC's. simulation results are provided to evaluate the performance.

• Journal of Advanced Navigation Technology
• /
• v.12 no.1
• /
• pp.22-27
• /
• 2008

This paper presents adaptive-MMOSPRED method for prediction of resource demands requested by multimedia calls, and shows the performance of the call admission control based on proposed resource prediction method in multimedia wireless networks. The proposed method determines (I-CDP) random variables of the standard normal distribution by using LMS algorithm that minimize errors of prediction in resource demands, while parameters in an existing method are constant all through the prediction time. Our simulation results show that prediction error in adaptive-MMOSPRED method is much smaller than in fixed-MMOSPRED method. Also we can see via simulation the CAC performance based on the proposed method improves the new call blocking performance compared with the existing method under the desired handoff dropping probability.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.391-400
• /
• 2005

최근 몇 년 사이 컴퓨터와 초고속 통신망의 대중적인 보급으로 인하여 인터넷 사용 인구가 급격하게 증가하였고 인터넷 사용량 또한 폭발적으로 증가하였다. 이와 같이 막대한 양으로 늘어난 트래픽은 서버에 과도한 양의 부하를 발생시켜 서비스 전반에 걸친 성능 저하를 가져왔다. 따라서 서버에 많은 양의 트래픽이 발생하더라도 정상적인 서비스를 제공할 수 있도록 하는 것이 필요하다. 본 논문에서는 이러한 서버의 트래픽 폭주로 인한 서버 과부하 문제를 해결하기 위해 수락 제어 알고리즘을 이용한다. 수락 제어 기법은 컨텐츠 변환이나 로드 밸런싱과 같이 수동적으로 부하를 덜어주거나 분산시키는 방식이 아닌 트래픽에 제한을 가하여 능동적으로 서버의 부하를 조절하는 방식이다. 클라이언트에 의한 연결 요청이 이루어질 때 서버의 부하 상태를 평가한 후 서버가 수용 가능한 수준이면 클라이언트 새로운 연결 요청을 수락하여 이를 서비스할 수 있도록 한다. <중략> 또한 서비스 요청에 제한적인 정책을 따를 경우 서버의 부하 변화에 빠르게 반응하지만 QoS(Quality of Service)의 향상을 얻을 수 있는 반면 더 많은 서비스 요청을 수용하는 정책을 취할 경우 서버의 부하 변화에 대한 반응이 느리지만 throughput이 증가하는 이득을 얻을 수 있게 된다. QoS와 throughput가 서로 tradeoff 관계에 있다는 것을 알 수 있다. 또한 요구되는 서비스의 성격에 따라 즉 더 높은 수준의 QoS 보장이 중요한 서비스인가 아니면 더 높은 수준의 throughput 보장이 요구되는 서비스인가에 따라 다른 수락 제어 정책을 적용하는 것이 가능하게 된다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.2
• /
• pp.45-53
• /
• 2000

In wireless environment, due to the limited capacity of radio channels it is not easy to guarantee QoS provisioning to mobile users. Therefore, one of the key problems to support broadband multimedia multi-services in wireless ATM networks is to study an effective call admission control(CAC). The purpose of this paper is to propose a distributed CAC scheme that guarantees multi QoS and multi-class service. Control parameters of the proposed scheme are QoS threshold and channel overload probability. With these parameter control, we show that the scheme can guarantee the requested QoS to both new and handover calls. In the scheme, channels are allocated dynamically, and QoS measurements are made in a distributed manner. We show that by providing variable data rate to calls it can effectively prohibit the QoS degradation even if there are severe fluctuations of network traffic. We compare the proposed CAC scheme to the well-known schemes such as guard band call admission control scheme. Through numerical examples and simulations, the proposed scheme is shown to improve the performance by lowering the probability of handover call dropping

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.585-597
• /
• 2004

In this paper, we propose the functional models of optical burst switching (OBS) routers to apply GMPLS (Generalized Multiprotocol Label Switching) to optical networks based on OBS. In addition, we introduce a connection admission control (CAC) algorithms which are operated in this models and can accommodate the required QoS. Firstly, the characteristics of current GMPLS and OBS for the optical Internet are basically considered. With this consideration, the models are proposed to accept OBS features which include the recognition of data boundary with control information and the statistical multiplexing in terms of bursts. Secondly, we use an offset time decision (OTD) algorithm on behalf of controlling the connection admission with taking QoS parameters such as burst loss rate(BLR) and service-differentiation ratio(SDR) into consideration. The proposed CAC algorithms use the offered load of LSP (Label Switched Path), wavelength information, and QoS parameters as inputs of OTD algorithm. A call setup request will be accepted when the offset time decided by OTD algorithm is reasonable for guaranteeing its requested QoS. Simulation is used for performance evaluation. Results show the proposed schemes can guarantee the required QoS and those are better than the previous one in terms of channel utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9B
• /
• pp.778-790
• /
• 2004

In this paper, we propose the functional models of optical burst switching (OBS) routers to apply GMPLS (Generalized Multiprotocol Label Switching) to optical networks based on OBS. In addition, we introduce a connection admission control (CAC) algorithms which are operated in this models and can accommodate the required QoS. Firstly, the characteristics of current GMPLS and OBS for the optical Internet are basically considered. With this consideration, the models are proposed to accept OBS features which include the recognition of data bounda η with control information and the statistical multiplexing in terms of bursts. Secondly, we use an offset time decision (OTD) algorithm on behalf of controlling the connection admission with taking QoS parameters such as burst loss rate(BLR) and service-differentiation ratio(SDR) into consideration. The proposed CAC algorithms use the offered load of LSP (Label Switched Path), wavelength information, and QoS parame ‘ ers as inputs of OTD algorithm. A call setup request will be accepted when the offset time decided by OTD algorithm is reasonable for guaranteeing its requested QoS. Simulation is used for performance evaluation Results show the proposed schemes can guarantee the required QoS and those are better than the previous one in terms of channel utilization.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2070-2079
• /
• 1997

In this paper, we proposed the FNCAC (fuzzy neural call admission control) scheme of the ATM networks which used the benefits of fuzzy logic controller and the learning abilities of the neural network to solve the call admission control problems. The new call in ATM networks is connected if QoS(quality of service) of the current calls is not affected due to the connection of a new call. The neural network CAC(call admission control) system is predictable system because the neural network is able to learn by the input/output pattern. We applied the fuzzy inference on the learning rate and momentum constant for improving the learning speed of the fuzzy neural network. The excellence of the proposed algorithm was verified using measurement of learning numbers in the traditional neural network method and fuzzy neural network method by simulation. We found that the learning speed of the FNCAC based on the fuzzy learning rules is 5 times faster than that of the CAC method based on the traditional neural network theory.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.1-8
• /
• 2005

In this paper, we study a call admission control algorithm for supporting multicast service under the BcN environment where broadcasting, communication and Internet are converging to be one. It is necessary to control service requests with a certain criteria in order to guarantee QoS because the system capacity is limited. As a possible solution, we divide one multicast service into 3 classes and set up a threshold per each class to control service request. Especially, for the purpose of system benefit, we define system pay-off rate 'GAIN' with the term 'Reward' and 'Penalty' according to admit and reject service request. And we confine the range of threshold which makes GAIN to be maximized. For the performance analysis, we model the system as M/M/m/m queueing system, investigate GAIN under various conditions and show the effectiveness of the proposed algorithm.