• Journal of Advanced Navigation Technology
• /
• v.18 no.4
• /
• pp.347-352
• /
• 2014

In this paper, we propose a Markovian queueing model(M/M/1)-based call admission control to reduce forced terminating rate of non-real secondary user's call for Multi-services Cognitive Radio Networks. A existing control has a problem that the forced terminating rate increases because of adopting a policy of spectrum priority allocation to real calls. In our scheme the rate can be reduced as the call that has no useful spectrum waits in a queue until getting an available spectrum. Our scheme use a neural-net based prediction of primary user's reappearance. Through the simulation, we analysis the call forced terminating rate, access delay and spectrum utilization efficiency, and then show that our scheme can more reduce the forced terminating rate of the call, compared to that of the existing algorithm.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.179-182
• /
• 1991

In this paper, we survey traffic control issues for the B-ISDN based on the ATM. We first investigate traffic descriptors to represent the characteristics of various ATM traffics in a standardized form. Also, we examine key issues related to the connection admission control, usage parameter control, network parameter control, priority control, and congestion control.

• ETRI Journal
• /
• v.24 no.1
• /
• pp.43-55
• /
• 2002

This paper proposes a flow-based admission control algorithm through an Asynchronous Transfer Mode (ATM) based Multi-Protocol Label Switching (MPLS) network for multiple service class environments of Integrated Service (IntServ) and Differentiated Service (DiffServ). We propose the Integrated Packet Scheduler to accommodate IntServ and Best Effort traffic through the DiffServ-aware MPLS core network. The numerical results of the proposed algorithm achieve reliable delay-bounded Quality of Service (QoS) performance and reduce the blocking probability of high priority service in the DiffServ model. We show the performance behaviors of IntServ traffic negotiated by end users when their packets are delivered through the DiffServ-aware MPLS core network. We also show that ATM shortcut connections are well tuned with guaranteed QoS service. We validate the proposed method by numerical analysis of its performance in such areas as throughput, end-to-end delay and path utilization.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.28-37
• /
• 2006

State-dependent call admission control (SDCAC) is proposed to make efficient use of scarce wireless resource in a hierarchical wireless network with heterogeneous traffic. With SDCAC, new calls are accepted according to an acceptance probability taking account of not only cell dwell time but also call holding time and system state (i.e., occupied bandwidth). An analytical method is developed to calculate performance measures of interest, e.g., new call blocking probability, forced termination probability, over. all weighted blocking probability. Numerical results with not only stationary but nonstationary traffic loads are presented to show the robustness of SDCAC. It is shown that SDCAC performs much better than the other considered schemes under nonstationary traffic load.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.976-998
• /
• 2011

This paper attempts to maximize the operator's revenue while simultaneously providing a multi-constraint, multi-hop and deterministic QoS provisioning for real time traffic in IEEE 802.16m based 4G networks. The optimal solution to such a problem is NP-complete and therefore not feasible to be solved in a tolerable polynomial time. For this reason, we also provide a simple price based greedy heuristic to be used along with the admission control. Simulation results for different QoS schemes show that the heuristic produces a revenue that is very close to the optimal revenue, and is far more aggressive than the size based and other common algorithms that are computationally feasible to be implemented in IEEE 802.16m.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1509-1512
• /
• 2005

차별화된 고품질의 서비스를 제공하기 위해서, 사용자와 서비스 제공자 간의 SLA(Service Level Agreement)를 만족시켜 줄 수 있는 웹 서버 클러스터의 성능 분리(Performance Isolation) 기능을 고려하였다. 본 논문에서는 서로 다른 기능적 도메인으로 구성된 이질 웹 서비스 환경에서 SLA 를 만족시켜주는 승인 제어(Admission Control) 기법을 연구하였으며, 시뮬레이션 결과를 통해 제안된 기법의 응답시간(Response Time) 및 승인 제어 성능을 분석하였다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.85-92
• /
• 2000

Channel management is critical in designing a cellular mobile system that offers high capacity and high quality. In this paper, an integrated channel management scheme is proposed, which consists of a dynamic channel allocation scheme and an admission control scheme. The dynamic channel allocation scheme allocates a call request the channel which minimizes the impact on its interfering cell, and consists of two types of channel allocation strategies : nominal channel allocation strategy and non-nominal channel allocation strategy. The admission control scheme named the variable cutoff priority scheme reserves some frequency channels for handoff cells in each cell the number of which varies according to the blocking probability of handoff class in that cell. Computationl tests are performed to evaluate the performance of the proposed scheme in terms of overall blocking probability, defined by the weighted value of the blocking probabilities of new calls and handoff calls. The results show that the proposed scheme yields better performance than other compared schemes.

• ETRI Journal
• /
• v.29 no.1
• /
• pp.113-115
• /
• 2007

A dynamic tri-threshold call admission control scheme has been developed. This scheme supports voice, data, and multimedia services and it complies with the universal mobile telecommunications system. The performance of the proposed scheme is evaluated under varying handover rates. The QoS performance-including channel utilization, call dropping probability, and blocking probability-is investigated. The performance of the developed scheme is found to be encouraging.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.638-646
• /
• 2003

In this paper, we propose a group communication approach which can provide quality of service for soft real-time applications. This proposed scheme combining the explicit multicast, end-point measure-based admission control scheme(EMBAC), and diffserv, removes the need of maintaining state information in the network, so that it would be easily deployable in real networks. We propose the scheme of node configuration to measure the quality of the diffserv network, and that of managing EMBAC over group communication environment. By simulation, we validate the QoS of the proposed multicast service network.

• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.311-318
• /
• 2001

본 논문에서는 연결수락 제어시 사용자가 전송하는 트래픽 파라메타(샐 개수의 분산값과 평균값)를 압축하여 망에 신고하는 방법을 제안하고, 압축방법에 의한 연결수락제어의 성능을 분석 비교한다. 트래픽 파라메타 압축방법은 K-means, CL(Competitive Learning), Fuzzy ISODATA,FNC(Fuzzy Neural Clustering)를 사용한다. 제안한 트래픽 파라메타의 압축에 의한 연결수락제어는 퍼지 매핑함수(Fuzzy Mapping Funciton)fp 의해 신고한 트래픽 패턴을 추정하고, 전방향 구조의 신경망을 사용하여 연결의 수락/거절을 결정한다. ON-OFF 트래픽 모델 환경에서 컴퓨터 실험을 통하여 여러 가지 압축방법들을 사용한 연결수락제어의 성능을 Fuzziness 값에 따라 비교하였고, 그 결과 FNC 방법이 우수함을 알 수 있었다. EH한 연결수락제어의 성능을 높히기 위해서 관측 프레임의 셀 분산값이 크면 Fuzziness 값을 작게 선정하고, 작으면 상대적으로 크게 선정해야 함을 알 수 있었다.