• Title/Summary/Keyword: Call admission control

Search Result 154, Processing Time 0.023 seconds

Improvement and Performance Evaluation of the Traffic Channel Management of the Radio Network Controller in IMT-2000 Network (IMT-2000 망에서 제어국의 트래픽 채널 관리 방식의 개선 및 성능 평가)

  • Ryu, Byung-Han;Ahn, Jee-Hwan;Baek, Jang-Hyun
    • IE interfaces
    • /
    • v.16 no.3
    • /
    • pp.311-321
    • /
    • 2003
  • We propose the improved channel assignment and management methods for an efficient use of traffic channel resource for supporting 12.2 Kbps, 64 Kbps, and 384 Kbps traffic with the different quality of service(QoS) in the radio network controller(RNC) in asynchronous IMT-2000 system. We consider two types of traffic channel block assignments for utilizing the traffic channel efficiently; the Completely Shared(CS) channel assignment and the Partially Dedicated and Partially Shared(PDPS) channel assignment. The former is that all traffic channel blocks are completely shared with all traffic types. The latter is that some traffic channel block is independently assigned to each traffic type and the other blocks are completely shared with some traffic type. We also propose the traffic channel management method which consists of the block and task management step, for efficiently assigning, releasing, and managing the channel resource. Finally, we evaluate the performance through various numerical examples when applying our proposed channel block assignment and resource management methods.

Novel Home Network QoS Mechanism for the High-Definition IPTV Service based on Multicast Traffic (멀티캐스트기반 고화질 IPTV 서비스를 위한 홈네트워크 품질보장 기법)

  • Park, Minho;Jeong, Yeonjoon;Paik, Euihyoun;Park, Kwangroh
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.2 no.1
    • /
    • pp.17-23
    • /
    • 2007
  • The home network has been revitalized due to the emergence of the high-speed broadband network and explosive increases of the home network services. Especially multicast based high-definition (HD) IPTV service is on high demand from both Internet service provider (ISP) and users. In order to provide high quality HD IPTV service without packet loss and delay, the ISP utilizes various network QoS mechanisms. Due to the misleading fact, that the home gateway is considered as an end terminal in terms of the ISP's viewpoint, the ISPs can not guarantee the end-to-end QoS within the scope of the current home network architecture. Therefore, an independent QoS guaranteed mechanism should be considered within the home network domain. As the home gateway manages both private home and public access network within the home network, we propose and implement a novel QoS mechanism for the multicast based HD IPTV service over the home gateway. In order to provide QoS guaranteed HD IPTV service, the proposed mechanism classifies the packets, manages home network bandwidth resources, and executes call admission control using the channel join message. Also, we utilize layer 2 multicast packet forwarding scheme to improve the overall performance of the home network services. Through the experiments of implementing the multicast based HD IPTV services, we will verify the efficiency of the proposed mechanism.

  • PDF

Asymptotic Analyses of a Statistical Multiplexor with Heterogeneous ATM Sources

  • Lee, Hyong-Woo;Mark, Jon-Wei
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.3
    • /
    • pp.29-40
    • /
    • 1997
  • Two asymptotic analyses of the queue length distribution at a statistical multiplexor supporting heterogeneous exponential on-off sources are considered. The first analysis is performed by approximating the cell generation rates as a multi-dimensional Ornstein-Uhlenbeck process and then applying the Benes queueing formula. In the second analysis, w state with a system of linear equations derived from the exact expressions of the dominant eigenvalue of the matrix governing the queue length distribution. Assuming that there are a large number of sources, we obtain asymptotic approximations to the dominant eigenvalue. Based on the analyses, we define a traffic descriptor to include the mean and the variance of the cell generation rate and a burstiness measure. A simple expression for the quality of service (QoS) in cell loss rate is derived in terms of the traffic descriptor parameters and the multiplexor parameters (output link capacity and buffer size). The result is then used to quantify the factors determining the required capacity of a call taking the statistical multiplexing gain into consideration. As an application of the analyses, we can use the required capacity calculation for simple yet effective connection admission control(CAC) algorithms.

  • PDF

Mobile QoS Guarantee by Region-based Call Admission Control (지역 기반 호 수락 제어를 이용한 이동 QoS 보장)

  • Lee, Jun-Hwa;Chung, Byung-Ho;Lee, Kwang-Il;Kim, Sang-Ha
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.10b
    • /
    • pp.1113-1116
    • /
    • 2000
  • 기존의 연구에서는 셀룰러 망에서 호 수락 제어 시에 다음 두 가지 요소를 고려하지 않는다. 첫 번째 요소는 각각의 셀, 특히 micro/pio 셀에서 서비스 제공이다. micro/pico 셀과 같이 심한 트래픽 변동이 있는 셀에서는 호 단절률이 수렴할 수 없기 때문에 이동 QoS와 서비스 제공이 불가능하다. 두 번째 요소는 망에서 호를 수용할 수 있는 능력과 관련 있는 GOS 이다. 일반적으로 여러 비율의 서비스는 서비스의 집합으로 특정지을 수 있고, 각각의 것들은 다른 양의 대여폭을 요구한다. 이질적인 멀티미디어 서비스 클래스를 가진 망에서는 소수의 광대역호가 망 자원의 대부분을 점유해서, 신규호에 대한 봉쇄로 망 성능을 떨어뜨릴 수 있다 그래서, GoS는 광대역호 제어에 의해서 향상될 수 있다. 본 논문에서는 이동 트래픽 조건에서 서비스 제공이 가능한 셀들의 최소 집합이면서 논리적인 단위인 지역이라고 불리는 새로운 개념을 소개한다. 그리고 서비스 제공 단위가 셀보다는 지역단위로 한 경우에 성능이 더 좋고 GoS 를 향상시킬 수 있는 방법인 지역기반 CAC 를 제한한다. 마지막으로 시뮬레이션에서는 QoS와 GoS 관점에서 RCAC가 현재까지 제안된 다른 방법보다 더 좋은 성능을 제공한다는 것을 보여준다.

  • PDF

Bandwidth Reservation scheme Using Mobile Tracking (이동체 추적을 이용한 대역폭 예약 기법)

  • 정혜명
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10A
    • /
    • pp.1512-1520
    • /
    • 2000
  • The wireless communication network is evolving toward IMT-2000 for providing various multimedia services. In order to accomplish this ultimate goal the effective schemes are required which can dynamically utilize the limited wireless resources based on different traffic characteristics of various services. This paper proposes a novel bandwidth allocation and call admission control scheme to transmit multimedia traffic based on the bandwidth reservation procedure using direction estimation in the IMT-2000 This scheme estimates the position of mobiles based on the mliticriteria decision making in which uncertain parameters such as RSS(Received Signal Strength), the distance between mobile and base station the moving direction and the previous location are participated in the decision process using aggregation function in fuzzy set theory. Its effectiveness is investigated by simulation.

  • PDF

Characteristics and Methods of Bandwidth Allocation According to Flow Features for QoS Control on Flow-Aware Network (Flow-Aware Network에서 QoS제어를 위해 Flow 특성에 따른 대역할당 방법과 특성)

  • Kim, Jae-Hong;Han, Chi-Moon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.9
    • /
    • pp.39-48
    • /
    • 2008
  • Recently, many multimedia services have emerged in Internet such as real-time and non- real time services. However, in this Internet environment, we have some limitations to satisfy each service feature. To guarantee the service features in Measurement-Based Admission Control(MBAC) based system on the flow-aware network, there is the method applying Dynamic Priority Scheduling(DPS) algorithm that gives a higher priority to an earlier incoming flow in all of the link bandwidth. This paper classifies all flows under several groups according to flow characteristics on per-flow MBAC algorithm based system. In each flow group, DPS algorithm is applied. This paper proposes two methods that are a DPS based bandwidth borrowing method and a bandwidth dynamic allocation method. The former is that if low priority class has available bandwidths, the flow of high priority class borrows the bandwidth of low priority class when high priority flow has insufficient bandwidth to connect a flow call. The later is that the each group has a minimum bandwidth and is allocated the bandwidth dynamically according to the excess rate for available bandwidth. We compare and analyze the characteristics of the two proposed methods through the simulation experiments. As the results of the experiment, the proposed methods are more effective than existing DPS based method on the packet loss and delay characteristics. Consequently the proposed two methods are very useful in various multimedia network environments.

An Early Spectrum Sensing for Efficient Radio Access in Cloud-Conceptual Base Station Systems (클라우드 기지국 시스템에서 효율적 무선 접속을 위한 이른 스펙트럼 감지 기법)

  • Jo, Gahee;Lee, Jae Won;Na, Jee-Hyeon;Cho, Ho-Shin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.1
    • /
    • pp.68-78
    • /
    • 2013
  • In this paper, we propose an early spectrum sensing(ESS) as an advance preparation for radio-access trial, which enables multi-mode terminals to access the most appropriate radio-access system in a cloud-conceptual base station system where multiple radio access technologies(RATs) coexist. Prior to a random access to one of RATs, a multi-mode terminal conducts a spectrum sensing over entire frequency bands of whole RATs, then select the RAT with the lowest sensing power, that is likely to have the most available spectrum. Thus, an access failure caused by that the selected RAT has no available radio spectrum could be avoidable in advance. In computer simulation, we consider as various RATs as possible. First, circuit and packet systems are taken into consideration. In addition, the packet systems are classified according to the feasibility of carrier aggregation(CA). In case of terminal, three modes are considered with circuit-only, packet-only, and multi-mode. Subsequently, packet traffic is classified into real-time and non-real-time traffic with three different tolerable delay levels. The simulation includes a call process starting with a call generation and ending up with a resource allocation reflecting individual user's QoS requirements and evaluates the proposed scheme in terms of the successful access probability, system access time, system balancing factor and packet loss probability.

Guaranteeing delay bounds based on the Bandwidth Allocation Scheme (패킷 지연 한계 보장을 위한 공평 큐잉 기반 대역할당 알고리즘)

  • 정대인
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.8A
    • /
    • pp.1134-1143
    • /
    • 2000
  • We propose a scheduling algorithm, Bandwidth Allocation Scheme (BAS), that guarantees bounded delay in a switching node. It is based on the notion of the GPS (Generalized Processor Sharing) mechanism, which has clarified the concept of fair queueing with a fluid-flow hypothesis of traffic modeling. The main objective of this paper is to determine the session-level weights that define the GPS sewer. The way of introducing and derivation of the so-called system equation' implies the approach we take. With multiple classes of traffic, we define a set of service curves:one for each class. Constrained to the required profiles of individual service curves for delay satisfaction, the sets of weights are determined as a function of both the delay requirements and the traffic parameters. The schedulability test conditions, which are necessary to implement the call admission control, are also derived to ensure the proposed bandwidth allocation scheme' be able to support delay guarantees for all accepted classes of traffic. It is noticeable that the values of weights are tunable rather than fixed in accordance with the varying system status. This feature of adaptability is beneficial towards the enhanced efficiency of bandwidth sharing.

  • PDF

A Multimedia Traffic Allocation Algorithm using the Modified Guard Channel Method in Wireless Networks (무선망에서 수정된 Guard 채널 방식을 이용한 멀티미디어 트래픽 할당 알고리즘)

  • Yang, Seung-Je;Park, Seong-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.2
    • /
    • pp.24-31
    • /
    • 2000
  • The channel allocation strategy is very important in wireless multimedia networks since the mobility of users needs to be considered in addition to diversity of QoS requirements of multimedia traffic. A existing strategy to decrease the probability of handoff failure is guard channel method, which reserves channels at each base station for handoff calls. In this paper, we propose an efficient channel allocation strategy based on the prioritization of handoff calls used in the guard channel method. In the Proposed strategy guard channels are shared between non-real time and real time handoff calls. To decrease the probability of handoff failure, (when resources become scarce), the Call Admission Control takes some resources away from the active calls. The simulation results demonstrate that the Proposed strategy Provides higher channel utilization and lower probability of handoff failure than those of existing strategies.

  • PDF

Implementation of On-demand QoS management System for Bandwidth Resource Allocation (대역폭 자원 할당을 위한 주문형 Qos 관리 시스템 구현)

  • Lee, Dongwook;Yi, Dong-Hoon;Kim, Jongwon;Sanggil Jung;Okhwan Byun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.4B
    • /
    • pp.444-454
    • /
    • 2004
  • To support diverse transmission requirements of multimedia applications, Quality of Service (QoS) should be provided in the Internet, where only the best-effort service is available. In this paper, we describe our recent effort on the implementation and verification of an extendable and flexible QoS allocation and resource management system based on the bandwidth broker model for realizing the IETF differentiated service (DiffServ). Focusing on the bandwidth issue over single administrative domain, the implemented system provides real-time resource reservation and allocation, delayed call admission control, simple QoS negotiation between sewer and users, and simple resource monitoring. The implemented system is verified by evaluating the performance of a resource-intensive application over the real-world testbed network.