• Title/Summary/Keyword: 호 수락제어

Search Result 112, Processing Time 0.023 seconds

Distributed Call Admission Control for Multimedia Service in Micro-Cell Environment (마이크로 셀 환경에서 멀티미디어 서비스를 위한 분산 호 수락 제어 기법)

  • Jeong, Il-Koo;Hwang, Eui-Seok;Lee, Hyong-Woo;Cho, Choong-Ho
    • The KIPS Transactions:PartC
    • /
    • v.9C no.6
    • /
    • pp.927-934
    • /
    • 2002
  • In order to provide various multimedia services in a wireless network, the call admission control for wireless channels should be resolved at the time of call setup and handoff by moving mobile terminal. In this paper. we propose a reliable DCAC( Distributed Call Admission Control)scheme using virtual cluster concept. The proposed DCAC scheme considers the state of $1^{st}$ and $2^{nd}$ adjacent cells to provide a reliable call handling. The proposed scheme is analyzed by simulations and mathematical methods.

Call Admission Control Using Adaptive-MMOSPRED for Resource Prediction in Wireless Networks (무선망의 자원예측을 위한 Adaptive-MMOSPRED 기법을 사용한 호 수락제어)

  • Lee, Jin-Yi
    • 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.

  • PDF

Admission Control Policy Heuristic Algorithm for fairness of Call Blocking Probability in Differentiated Service Networks (차별화된 서비스를 갖는 인터넷 망에서 호 블로킹 확률의 공평성을 위한 수락 제어 정책 Heuristic 알고리즘 연구)

  • Min, Jun-Ki;Rhea, Woo-Seop;Chung, Jong-Soo
    • Journal of Internet Computing and Services
    • /
    • v.6 no.3
    • /
    • pp.121-128
    • /
    • 2005
  • Recently, as the research of effective resource management for supporting of various next generation internet service, the admission control mechanisms using the dynamic provisioning methods in differentiated service networks are studied. However, even though admission control mechanism is applied to the network, there exits the unfairness of call blocking probability among the different bandwidth requested services. In this paper, we propose the new admission control policy heuristic algorithm that provides fairness of call blocking probability between the large bandwidth requested service and the small bandwidth requested service. The simulation results show that the proposed algorithm provides not only blocking probability fairness but also high bandwidth utilization.

  • PDF

QoS and Multi-Class Service Provisioning with Distributed Call Admission Control in Wireless ATM Networks (무선 ATM망에서 QoS와 다중 서비스를 지원하는 분산된 호 수락 제어 알고리즘과 성능 분석)

  • Jeong, Da-Ip;Jo, Yeong-Jong
    • 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

  • PDF

Adaptive Distributed Call Admission Control for Multimedia Serviced in Multi-Cell Environment (멀티 셀 환경에서 멀티미디어 서비스 지원을 위한 적응적인 분산 호 수락 제어 기법)

  • 원정재;김대익;이형우;조충호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.237-239
    • /
    • 1998
  • ATM 망에서 이루어지는 다양한 멀티미디어 서비스를 무선 ATM망에서 지우너하기 위해서는, 단말의 이동에 위해 핸드오프가 일어날 때, 주위 셀의 상태와 다양한 클래스의 트래픽 특성을 고려한 무선 호 수락 제어 문제가 해결되어야 한다. 본 논문에서는 셀수준(cell-level)에서 인접 셀의 상태 정보를 이용한 분산 호 수락제어기법(DCA)과 현재 무선 셀에서 발생하는 클래스별 호들에 대한 할당을 위한 자원공유 알고리즘인 Ra방식을 조합하여 멀티 셀 환경에서 멀티 클래스 서비스별 QoS를 고려한 적응적인 무선화 수락제어 기법인 RA-DCA기법을 제안한다. 또한 제안된 호 수락 제어 기법의 성능분석을 위한 모델과 시뮬레이션 결과를 분석하였다.

  • PDF

An Effective Threshold based Call Admission Control in ATM Networks (ATM망에서 효율적인 문턱 값 기반 호 수락 제어)

  • 김상철;고성택
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.08a
    • /
    • pp.33-36
    • /
    • 2000
  • ATM 트래픽 제어를 위해서 효과적인 호 수락 제어 방법이 필요하다. 이것은 호 수락 과정에서 서로 다른 종류의 서비스들에 대해서 높은 이용률과 공정성을 제공하여야 한다. 본 논문에서는 호 수락의 공정성과 대역폭 이용률을 높이기 위하여 링크에 문턱 값을 적용한 새로운 CST(Complete Sharing with Threshold)알고리즘을 제안하였으며 부하와 문턱 값의 변화에 따른 성능을 분석하였다.

  • PDF

A Novel Priority Call Admission Coneol Algorithm Based on Total Resource Requirements for CDMA Systems (CDMA시스템에서 전체 자원요구량에 근거한 새로운 우선권기반의 호 수락제어 알고리즘)

  • Park Shi quan;Park Yong wan
    • 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.

A Two-Step Call Admission Control Scheme using Priority Queue in Cellular Networks (셀룰러 이동망에서의 우선순위 큐 기반의 2단계 호 수락 제어 기법)

  • 김명일;김성조
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.461-473
    • /
    • 2003
  • Multimedia applications are much more sensitive to QoS(Quality of Service) than text based ones due to their data continuity. In order to provide a fast moving MH(Mobil Host) using multimedia application with a consistent QoS,an efficient call admission mechanism is in need. This paper proposes the 2SCA(2-Step Call Admission) scheme based on cal admission scheme using pripority to guarantee the consistent QoS for mobile multimedia applications. A calls of MH are classified new calls, hand-off calls, and QoS upgrading calls. The 2SCA is composed of the basic call admission and advanced call admission; the former determines the call admission based on bandwidth available in each cell and the latter determines the call admission by applying DTT(Delay Tolerance Time), PQeueu(Priority Queue), and UpQueue(Upgrade Queue) algorithm according to the type of each call blocked at the basic call admission stage. In order to evaluate the performance of our mechanism, we measure the metrics such as the dropping probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The result shows that the performance of our mechanism is superior to that of existing mechanisms such as CSP(Complete Sharing Policy), GCP(Guard Channel Policy) and AGCP(Adaptive Guard Channel Policy).

Performance Analysis of Joint Call Admission Control(JCAC) According to Resource Reservation Rate Changes in LTE-WLAN Heterogeneous Network Environment (LTE-WLAN 이종 네트워크 환경에서 자원예약률 변화에 따른 통합 호 수락 제어의 성능분석)

  • Kim, Yi-Kang;Kim, Seung-Yeon;Ryu, Seung-Wan;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.5A
    • /
    • pp.473-484
    • /
    • 2011
  • In this paper, we analyze and propose the Joint Call Admission Control(JCAC) scheme to combine network selection scheme and radio resource reservation based Call Admission Control(CAC) in LTE-WLAN heterogeneous networks. First, We propose the JCAC system that uses network decision rate to select a network for terminal and radio resource reservation scheme in overlaying LTE-WLAN network environment. And we analyze the performance of a proposed system using markov chain model. The performance is presented in terms of the new call blocking probability, handoff call dropping probability, and channel utilization of each network. As a performance result of the our research, the system using JCAC is better than the system using non-JCAC. We found a suitable resource reservation rate that is 10% in the system using JCAC. Our work may be useful as a guideline of resource reservation rate to introduce JCAC system using resource reservation scheme in overlaying LTE-WLAN network environment.

An Efficient Admission Control and Resource Allocation Methods in DiffServ Networks (인터넷 차별화 서비스 네트워크에서의 효율적인 호 수락 제어 및 자원 이용 방안에 관한 연구)

  • 조병일;유상조
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.5
    • /
    • pp.698-712
    • /
    • 2004
  • DiffServ network architecture does not define a call admission control procedure explicitly. In this paper, a new DiffServ QoS control mechanism is suggested which, after the call admission control, can execute packet process according to the class while, at the same time, executing on the flow based call admission control in the DiffServ network. Routers on the path from the source to the destination estimate the aggregated class traffic of the existing flows and the new incoming flow and then, perform a call admission control in accordance with the type of classes efficiently based on the required bandwidth per each class that can meet the user's QoS requirements. In order to facilitate the packet process according to the class after the flow based call admission control, a mechanism is suggested that can adjust the network resources to classes dynamically. The performance analysis on this mechanism is carried out through a simulation.

  • PDF