• Title/Summary/Keyword: Admission control algorithm

Search Result 97, Processing Time 0.03 seconds

A Study on a neural-Net Based Call admission Control Using Fuzzy Pattern Estimator for ATM Networks (ATM망에서 퍼지 패턴 추정기를 이용한 신경망 호 수락제어에 관한 연구)

  • 이진이;이종찬;이종석
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.10a
    • /
    • pp.173-179
    • /
    • 1998
  • This paper proposes a new call admission control scheme utilizing an inverse fuzzy vector quantizer(IFVQ) and neural net, which combines benefits of IFVQ and flexibilities of FCM(Fuzzy-C-Menas) arithmatics, to decide whether a requested call that is not trained in learning phase to be connected or not. The system generates the estimated traffic pattern of the cell stream of a new call, using feasible/infeasible patterns in codebook, fuzzy membership values that represent the degree to which each pattern of codebook matches input pattern, and FCM arithmatics. The input to the NN is the vector consisted of traffic parameters which is the means and variances of the number of cells arriving inthe interval. After training(using error back propagation algorithm), when the NN is used for decision making, the decision as to whether to accept or reject a new call depends on whether the output is greater or less then decision threshold(+0.5). This method is a new technique for call admi sion control using the membership values as traffic parameter which declared to CAC at the call set up stage, and is valid for a very general traffic model in which the calls of a stream can belong to an unlimited number of traffic classes. Through the simmulation. it is founded the performance of the suggested method outforms compared to the conventional NN method.

  • PDF

A Connection Admission Control with Recursive Formula in ATM Networks (ATM 망에서 재귀 연산에 의한 연결 수락 제어)

  • Nam, Jae-Hyun;Park, Chan-Jung;Lee, Kee-Hyun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1788-1796
    • /
    • 1997
  • In this paper, we propose a new connection admission control(CAC) algorithm for traffic control in ATM network in which traffic estimation is performed based on user-specified parameters at every moment of connection request or connection release by recursive formula which makes real-time calculation possible. And traffic estimation using cell flow measurement is carried out when the number of connectioned calls does not change during a measurement reflection period. Performance analysis of the proposed method is carried out using several aspects for homogeneous and heterogeneous bursty traffic. The results showed that the proposed CAC method revealed better performance, than conventional CAC method for burst model in both utilization and QoS point of view.

  • PDF

Adaptive Call Admission Control Based on Resource Prediction by Neural Network in Mobile Wireless Environments (모바일 무선환경에서 신경망 자원예측에 의한 적응 호 수락제어)

  • Lee, Jin-Yi
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.2
    • /
    • pp.208-213
    • /
    • 2009
  • This paper presents an adaptive call admission control(CAC) algorithm based on a target handoff call dropping probability in mobile wireless environments. This method uses a neural network for predicting and reserving the bandwidth demands for handoff calls and new calls. The amount of bandwidth to be reserved is adaptively adjusted by a target value of handoff call dropping probability(CDP). That is, if the handoff CDP exceeds the a target CDP value, the bandwidth to be reserved should be increased to reduce the handoff dropping probability below a target value. The proposed method is intended to prevent from increasing handoff call dropping probability when bandwidth to be reserved is not enough for handoff calls due to an uncertain prediction. Our simulations compare the handoff CDP in proposed CAC with that of an existing CAC. Results show that the proposed method sustains handoff call dropping probability below our target value.

  • PDF

A Study on the Call Admission Control with Overflow and Preemption at Adaptive Moving Boundary in Cellular Mobile Communications (셀룰러 이동통신망의 적응성 가변경계에서 Overflow와 Preemption을 갖는 호 접속제어 방안 연구)

  • 노희정
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.18 no.4
    • /
    • pp.171-180
    • /
    • 2004
  • CDP(handoff Call Dropping Probability) and CBP(new Call Blocking Probability) have been used as two important call level QoS parameters in cellular mobile communications. But, many methods to reduce CDP without considering CBP have been studied, and hand-off call priority scheme has been introduced. But the use of hand-off call priority scheme increases CBP and decreases channel utilization rate depending on the number of reserved channel for priority. In this paper, we propose a CAC(Call Admission Control) algorithm with overflow and preemption to solve the problem caused by considering CDP and CBP in calculation of the number of channel reserved. The problem is the increase of CDP as the traffic load increases. In our CAC algorithm, hand-off call is permitted to use(overflow) unreserved and unused channel if there is no reserved and unused channel, and new call is permitted to use(preemption) the channel overflowed by hand-off call if there is no unreserved and unused channel. This mechanism of calculation of the number of reserved channel and CAC algorithm is expected to increase channel utilization rate, and can be applied to media-based QoS provision in cellular mobile communications.

GMPLS based Functional Models and Connection Admission Control Algorithms for Optical Burst Switched Networks (광 버스트 교환 망을 위한 GMPLS 기반 기능 모델과 연결 수락 제어 알고리즘)

  • 소원호;노선식;김영천
    • 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.

GMPLS based Functional Models and Connection Admission Control Algorithms for Optical Burst Switched Networks (광 버스트 교환 망을 위한 GMPLS 기반 기능 모델과 연결 수락 제어 알고리즘)

  • So, Won-Ho;Roh, Sun-Sik;Kim, Young-Chon
    • 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.

An Energy Efficient MAC Protocol Providing Guaranteed Service for Wireless Sensor Network

  • Kim, Dong-Won;Park, Tae-Geon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.1
    • /
    • pp.123-140
    • /
    • 2011
  • In this paper, we propose an Energy Efficient Media Access Control (EE-MAC) protocol for wireless sensor networks. The proposed scheme is designed to save power consumption and guarantee quality-of-service for real-time traffic. EE-MAC uses the superframe structure which is bounded by the transmission of a beacon frame and can have an active and an inactive portion. The active period is divided into the contention free period (CFP) for real-time traffic transmission and the contention access period (CAP) for non-real-time traffic transmission. We propose the exclusively allocated backoff scheme which assigns a unique backoff time value to each real-time node based on bandwidth allocation and admission control. This scheme can avoid collision between real-time nodes by controlling distributed fashion and take effect a statistical time division multiple access. We also propose the algorithm to change the duty cycle adaptively according to channel utilization of media depending on network traffic load. This algorithm can prolong network lifetime by reducing the amount of energy wasted on idle listening.

A Resource reserved-base Admission Control Algorithm using access frequency on CM server (연속 미디어 서버의 접속 빈도 수를 이용한 자원 예약 승인 제어 알고리즘)

  • 홍재인;최홍묵;박병수;최명렬
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2002.11b
    • /
    • pp.400-403
    • /
    • 2002
  • 최근 컴퓨터와 통신망 기술의 급속한 발달에 따라 오디오 및 비디오 등의 연속미디어를 통한 정보 응용에 대한 연구와 연속 미디어를 다루는 연속 미디어 저장 서버에 관한 연구가 활발히 이루어지고 있다. 본 논문에서는 연속 미디어 서버의 설계와 관련한 승인 제어에 대하여, 기존의 결정적 승인 제어, 통계적 승인 제어, 자원 예약 승인 제어 알고리즘을 이용하여 새로운 방법으로 실제 서버의 자원 이용도와 접속 빈도 수에 따라 자원 양을 할당하고 자원의 할당 및 예약을 행하고 QoS를 조정하는 승인 제어 알고리즘을 제안하였다. 제안된 알고리즘은 향후 구체적 통계모델을 통한 시뮬레이션 검증을 필요로 한다.

  • PDF

Client Information based Admission Control Algorithm (고객 정보기반 접속 중인 알고리즘)

  • Park, Hea-Sook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05a
    • /
    • pp.55-58
    • /
    • 2003
  • 인터넷상에서 원격강의와 같은 스트림 서비스를 제공하고자 하는 경우 사용자의 접속 품질을 일정 수준 이상으로 보장하기 위한 기능이 필요하다. 이를 위해 서버의 자원을 효율적으로 사용하는 것뿐만 아니라 일정 수 이상의 접속 요청이 있는 경우에는 사용자 등급에 따라 접속 허용을 제어함으로써 한정된 서버자원을 효과적으로 사용자에게 할당할 수 잇도록 하는 것이 필요하다. 본 연구에서를 이를 위해 사용자 정보에 기반한 어플리케이션 레벨에서의 서버 접속 승인 알고리즘을 제안한다.

  • PDF

Traffic Modeling and Call Admission Control GCRA-Controlled VBR Traffic in ATM Network (ATM 망에서 UPC 파라미터로 제어된 VBR 트래픽 모델링 및 호 수락 제어)

  • 정승욱;정수환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.7C
    • /
    • pp.670-676
    • /
    • 2002
  • The object of ATM network is to the guarantee quality of service(QoS). Therefore, various of traffic management schemes have been proposed. Among these schemes, call admission control(CAC) is very important to provide real-time services and ON-OFF model, which is single source traffic model, has been used. But ON-OFF model differ from GCRA(Generic Cell Rate Algorithm) controlled traffic in ATM network. In this paper, we analyze the traffic, which is controlled as dual GCRA, and propose TWM(Three-state Worst-case Model), which is new single source traffic model. We also proposed CAC to guarantee peak-to-peak CDV(Cell Delay Variation) based on the TWM. In experiments, ON-OFF model and TWM are compared to show that TWM is superior to ON-Off model in terms of QoS guaranteeing.