• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.69-75
• /
• 2012

In this paper, to provide various services of QoS, and moreover applying traffic ratio to CAC(Call Admission Control) algorithm tested how long average data rate and the average packet delay time. When CAC algorithm is not applied, traffic mixture ratio is 1:1:4:4, the FTP Service 0.4, web services 0.6, streaming service 0.7, the packet delay requirements are not satisfied. On the other hand CAC Algorithm is applied, all the service of packet delay are satisfied with arrival rate. Therefore, we can make sure that applying of CAC of traffic control WWW, FTP, Video, VoIP can guarantee the various services of QoS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1298-1308
• /
• 2004

CAC (Call Admission Control) schemes for different service class are studied in many Papers. A novel priority CAC algorithm, which gives priority to a same class call according to the total resource requirements is proposed and analyzed in this paper. The proposed algorithm provides a priority according to the total resource requirements other than only in a base station. If there are efficient residual resources in the system, it will accept all new calls. Otherwise, it will selectively accept these new calls according to the total resource requirements. The results show that the proposed algorithm provides better call blocking probability, outage probability and throughput than the conventional algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.41
• /
• pp.51-60
• /
• 1997

In this paper, A Connection Admission Control(CAC) algorithm by Dynamic Bandwidth Allocation is proposed. The B-ISDN will be required to carry traffic generated by a various traffic sources. These source will have all traffic flow characteristics and quality of services requirements. When a connectionless message with burstiness arrives at a node during a renewal period, CAC will be dynamically determined connection request by using the predetermined connection admission bounds in estimating the number of input arriving cells. The proposed algorithm estimates the available bandwidth by observing cell streams of the aggregate traffic. A connection request is accepted if the available bandwidth is larger than declared peak rate, and otherwise rejected. The proposed CAC scheme is shown to be promising and practically feasible in obtaining efficient transmission of burst traffic with guaranteed quality of services.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.417-425
• /
• 2005

KOINONIA is high-rate Wireless Personal Area Network (WPAN) technology, and is developed for multimedia traffic transmission in personal area. A KOINONIA piconet is a collection of one or more associated slaves under a single master. Efficient scheduling of a master for the traffic of slaves is essential to use channel effectively and to guarantee QoS of multimedia traffic. We propose a new scheduling algorithm to allocate channel time at desired intervals regardless of superframe length, and a Connection Admission Control(CAC) algorithm to regulate the number of traffics in a piconet. Our proposed algorithms have been shown to save channel time and to meet QoS requirements compared to the conventional weighted round-robin algorithm.

• ETRI Journal
• /
• v.28 no.5
• /
• pp.593-606
• /
• 2006

Thanks to the great possibilities of providing different types of telecommunication traffic to a large geographical area, satellite networks are expected to be an essential component of the next-generation internet. As a result, issues concerning the designing and testing of efficient connection-admission-control (CAC) strategies in order to increase the quality of service (QoS) for multimedia traffic sources, are attractive and at the cutting edge of research. This paper investigates the potential strengths of a generic digital-video-broadcasting return-channel-via-satellite (DVB-RCS) system architecture, proposing a new CAC algorithm with the aim of efficiently managing real-time multimedia video sources, both with constant and high variable data rate transmission; moreover, the proposed admission strategy is compared with a well-known iterative CAC mainly designed for the managing of real-time bursty traffic sources in order to demonstrate that the new algorithm is also well suited for those traffic sources. Performance analysis shows that, both algorithms guarantee the agreed QoS to real-time bursty connections that are more sensitive to delay jitter; however, our proposed algorithm can also manage interactive real-time multimedia traffic sources in high load and mixed traffic conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.675-683
• /
• 1996

CAC, UPC, NPC, cell level QoS and congestion control is required to assign efficiently channels's BW and to prevent networks from congestion. In the CAC algorithm, each user defines characteristics of input traffic when channels are set up and network based on this parameters determines the acception or rejection of the required BW. The CAC control mechanism is classified into the centralized BW allocation mechanism and the distributed BW Allocation mechanism according to the function and position of CAC processor allocating BW. In this paper, in contrast with esisted the distributed BW allocation mechanism which assumes the required BW of input traffic as constant, we assume input traffic & serices as bulk probability distribution in order to analyze performance more precisely.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.458-467
• /
• 2009

Long Tenn Evolution (LTE) is the next generation mobile phone technology which has being standardized by the Third Generation Partnership Project (3GPP). In the existing mobile communication networks, voice traffic is delivered through circuit switched networks. In LTE, however, all kinds of traffic are transferred through IP based packet switched networks which has best-effort characteristic. Therefore, providing QoS in LTE system is difficult. In order to provide QoS in LTE, RRM is very important. Especially, in part of RRM, call admission control (CAC) performs an important function to reduce network congestion and guarantee a certain level of QoS for on-going calls. In this paper, we propose a CAC algorithm in order to provide QoS for various kinds of services in LTE system. The performance of the proposed algorithm is evaluated with various simulation environments. The results show that the proposed algorithm provides QoS through rejections of requested calls. Especially, the proposed CAC algorithm can be satisfied with packet delay requirement defined in LTE specification.

• ETRI Journal
• /
• v.22 no.4
• /
• pp.40-50
• /
• 2000

We apply a "sliding-window" Maximum Likelihood(ML) estimator to estimate traffic parameters On-Off source and develop a method for estimating stochastic predicted individual cell arrival rates. Based on these results, we propose a simple Connection Admission Control(CAC)scheme for delay sensitive services in broadband onboard packet switching satellite systems. The algorithms are motivated by the limited onboard satellite buffer, the large propagation delay, and low computational capabilities inherent in satellite communication systems. We develop an algorithm using the predicted individual cell loss ratio instead of using steady state cell loss ratios. We demonstrate the CAC benefits of this approach over using steady state cell loss ratios as well as predicted total cell loss ratios. We also derive the predictive saturation probability and the predictive cell loss ratio and use them to control the total number of connections. Predictive congestion control mechanisms allow a satellite network to operate in the optimum region of low delay and high throughput. This is different from the traditional reactive congestion control mechanism that allows the network to recover from the congested state. Numerical and simulation results obtained suggest that the proposed predictive scheme is a promising approach for real time CAC.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.442-444
• /
• 2001

최근 통신환경의 급속한 발전과 함께 점점 복잡 다양해지는 사회적 요구에 의해 유선망을 무선환경으로 옮겨 가기 위한 많은 연구들이 진행되고 있다. 본 논문에서는 Frame Relay 망과 WATM 백본 망라의 연동 환경을 제안하였고, 이 망에서 Frame Relay 망의 이동으로 인하여 발생하는 망의 이동성 지원 방안과 QoS를 보장하는 단말들의 멀티 핸드오버를 효율적으로 지원하기 위한 G-CAC알고리즘을 제안한다. 본 논문에서 제안한 G-CAC알고리즘은 망 단위의 이동환경에서 Frame Relay의 트래픽 특성, DE/CLP 맵핑 , 트래픽 파라미터 변환 방식을 이용하여 핸드오버 블락킹 율과 손실 율을 감소시킨다. 또한 여러 Frame Relay 망과 통신하고 있는 백본의 WATM에서는 다른 Frame Relay망들의 할당된 자원 중에 CLP비트가 세트된 셀들을 드롭하여 그 자원을 새로운 핸드오버를 요청하는 Frame Relay망에 접합된 WATM에 제공하는 QoS를 고려한 핸드오버 CAC(connection admission control)알고리즘을 제안한다.

• Journal of Advanced Navigation Technology
• /
• v.13 no.6
• /
• pp.901-906
• /
• 2009

This paper proposes a call admission control(CAC) method for wireless networks, which is based on the upper bound of a possibility distribution of handoff calls dropping rates. The possibility distribution is estimated in a fuzzy inference and a learning algorithm in neural network. The learning algorithm is considered for tuning the membership functions(then parts)of fuzzy rules for the inference. The fuzzy inference method is based on a weighted average of fuzzy sets. The proposed method can avoid estimating excessively large handoff calls dropping rates, and makes possibile self-compensation in real time for the case where the estimated values are smaller than real values. So this method makes secure CAC, thereby guaranteeing the allowed CDR. From simulation studies we show that the estimation performance for the upper bound of call dropping rate is good, and then handoff call dropping rates in CAC are able to be sustained below user's desired value.