• Title/Summary/Keyword: call blocking probability

Search Result 119, Processing Time 0.021 seconds

Performance Analysis of Request Handling Schemes for Intelligent Peripherals (IP용 서비스 요청 처리방식의 성능 분석)

  • 최고봉;윤종호;권기호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.7
    • /
    • pp.1321-1334
    • /
    • 1994
  • This paper presents the service handling schemes of an intelligent peripheral(IP) which provides the service function as a physical entity in the intelligent network. Four service request handling scheme are compared for and IP which can handle both ordinary requests and prioritized requests on the blocked-call-delayed basis. Delayed requests are assumed to be stored in a finite storage buffer. Scheme-I exclusively allows prioritized requests be stored and to use a fixed number of reserved servers. The other three schemes without reserved servers(Scheme-II.III,and IV) allow both types of requests to be stored and prioritized requests pushout ordinary requests if the buffer is full. For these four schemes, the blocking probabilities and delay distributions of both types of requests are numerically obtained. From the numericall results, the schemes without reserved servers reduce the blocking probability of ordinary requists without a severe penalty on proritized requests. For three schemes without reserved servers, it is noted that prioritized requests should br served on the first-in, first-out basis, and ordinary requests should be served on the last-in, first-out basis.

  • PDF

Analysis on the Cell Capacity and Coverage of 3GPP systems (3GPP 시스템의 용량과 셀 커버리지 분석)

  • 양하영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10A
    • /
    • pp.1461-1472
    • /
    • 2000
  • Recently, the mobile users seem to be rapidly increasing and then the capacity limit will be reached at close hand. In these situations, to provide them with good quality of service in the coming future, newly planned cell design is needed. In the next generation mobile communication systems, namely IMT-2000, good quality services will be possible only by designing the cell structure hierarchically with the help of appropriate cell planning. In the research process, the standardization reports on the future mobile cellular IMT-2000 system (3GPP) are investigated and the parameters, that are essential to cell planning, are also researched. Modeling of IMT-2000 radio link and the numerical analysis on that make it possible to calculate the forward/reverse link budget, system capacity call blocking probability Erlang capacity and cell coverage. In planning the cell of IMT-2000 system, various parameters are considered, such as hierarchical cell structure, number of users, data service forms and propagation area environments. From the results, efficient cell planning methods are proposed. Through this thesis efficient cell planning and maximum capacity will be achieved in the beginning of commercial IMT-2000 service.

  • PDF

A Wireless Traffic Load-Balancing Algorithm based on Adaptive Bandwidth Reservation Scheme in Mobile Cellular Networks (셀룰러 망에서 적응적 대역폭 예약 기법을 이용한 무선 트래픽 부하 균형 알고리즘)

  • 정영석;우매리;김종근
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2001.06a
    • /
    • pp.21-24
    • /
    • 2001
  • For very large multimedia traffic to be supported successfully in wireless network environment, it is necessary to provide Quality-of-Service(QoS) guarantees between mobile hosts(clients). In order to guarantee the Qos, we have to keep the call blocking probability below target value during handoff session. However, the QoS negotiated between the client and the network may not be guaranteed due to lack of available channels for traffic in the new cell, since mobile clients should be able to continue their on-going sessions. In this paper we propose a efficient load-balancing algorithm based on the adaptive bandwidth reservation scheme for enlarging available channels in a cell. We design a new method to predict the mobility of clients using MPT(mobility profile table). This method is then used to reserve a part of bandwidths for handoff calls to its adjacent cells and this reserved bandwidth can be used for handoff call prior to new connection requests. If the number of free channels is also under a low threshold value, our scheme use a load-balancing algorithm with a adaptive bandwidth reservation. In order to evaluate the performance of our algorithm, we measure the metrics such as the blocking probability of new calls and dropping probability of handoff calls, and compare with other existing schemes.

  • PDF

An Efficient Load-Balancing Algorithm based on Bandwidth Reservation Scheme in Wireless Multimedia Networks (무선 멀티미디어 망에서 대역폭 예약을 이용한 효율적인 부하 균형 알고리즘)

  • 정영석;우매리;김종근
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.4
    • /
    • pp.441-449
    • /
    • 2002
  • For multimedia traffics to be supported successfully in wireless network environment, it is necessary to provide Qualify-of-Service(QoS) guarantees among mobile hosts(clients). In order to guarantee the QoS, we have to keep the call blocking probability below a target value during hand-off session. However, the QoS negotiated between the client and the network may not be guaranteed due to lack of available channels for traffic of a new cell, since on service mobile clients should be able to continue their sessions. In this paper, we propose an efficient load-balancing algorithm based on the adaptive bandwidth reservation scheme for enlarging available channels in a cell. Proposed algorithm predicts the direction of clients in a cell and adjusts the amount of the channel to be reserved according to the load status of the cell. This method is used to reserve a part of bandwidths of a cell for hand-off calls to its adjacent cells and this reserved bandwidth can be used for hand-off call prior to new connection requests. If the number of free channels is also under a low threshold value, our scheme use a load-balancing algorithm with an adaptive bandwidth reservation. In order to evaluate the performance of our algorithm, we measure metrics such as the blocking probability of new calls and dropping probability of hand-off calls, and compare with those of existing schemes.

  • PDF

Separated Control Signaling Protocol for WDM Optical Networks (파장 분할 다중화 방식을 사용하는 광 전송망을 위한 분리 제어 신호 방식)

  • No, Seon-Sik;Kim, Su-Hyeon;So, Won-Ho;Kim, Yeong-Cheon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.6
    • /
    • pp.1-11
    • /
    • 2000
  • In this paper, we propose a novel control signaling protocol that efficiently controls connection setup and increases the utilization of network resources. The proposed protocol, Separated Control Signaling Protocol(SCSP), separates bearer control from call control lot WDM optical networks. The main function of call control is to check the availability of network resources such as wavelengths and receivers at destination node. Bearer control is to reserve and assign wavelengths. The signaling architecture of this protocol consists of call controller and hearer controller The call controller handles call setup and release, activates the beater controller, and manages the status of call and bearer. The bearer controller reserves wavelengths, sets up bearer, tears down bearer. and notifies the status of beater to call controller. The state transition diagrams of each controller are designed. Using control messages and related primitives, the information flows for call setup and bearer setup, hearer teardown and call release, and reaction for setup failures are described to evaluate the performance. The simulation results show that the separated control signaling protocol is superior to conventional one in terms of call blocking probability and resource utilization.

  • PDF

Flood Search Algorithm with MFDL Path in Circuit-Switched Networks (회선 교환망에서 MFDL 경로를 이용한 Flood Search 알고리즘)

  • 박영철;이상철;은종관
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.3
    • /
    • pp.360-371
    • /
    • 1993
  • Flood search algorithm is known to be an effective routing mechanism for tactical application, since it provides high degree of survivability and robustness. But it is known that it has significant drawbacks with respect to the network efficiency [1]. We consider a tactical circuit-switched grid network with a maximum of four links and two priority classes of voice traffic, Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of the circuit-switched network without increasing the call set-up time and processor loading of the algorithm.

  • PDF

A handover scheme in next generation mobile networks

  • Park, Sang-Joon;Lee, Jong-Chan;Han, Jung-Ahn;Cho, In-Sook;Kim, Byung-Gi
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1098-1100
    • /
    • 2002
  • Inter-RNC(radio network controller) and inter-BSC(base station center) hard handovers involve rerouting. Thus additional delay time for the new bearer setup and reroute determination should be considered. For theses kinds of handovers we propose a new scheme and coined it as ICHP(Inter-Cluster Handover Prediction). When a call approaches a boundary cell of a cluster, ICHP prepares for the handover by performing resource reservations and reroute computation in advance. Performance analysis shows that ICHP provides faster handover and that it lowers the blocking probability.

  • PDF

Network Selection Algorithm Based on Spectral Bandwidth Mapping and an Economic Model in WLAN

  • Pan, Su;Zhou, Weiwei;Gu, Qingqing;Ye, Qiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.68-86
    • /
    • 2015
  • Future wireless network aims to integrate different radio access networks (RANs) to provide a seamless access and service continuity. In this paper, a new resource denotation method is proposed in the WLAN and LTE heterogeneous networks based on a concept of spectral bandwidth mapping. This method simplifies the denotation of system resources and makes it possible to calculate system residual capacity, upon which an economic model-based network selection algorithm is designed in both under-loaded and over-loaded scenarios in the heterogeneous networks. The simulation results show that this algorithm achieves better performance than the utility function-based access selection (UFAS) method proposed in [12] in increasing system capacity and system revenue, achieving load balancing and reducing the new call blocking probability in the heterogeneous networks.

Performance Analysis of a Cellular Networks Using Power Control Based Frequency Reuse Partitioning

  • Mohsini, Mustafa Habibu;Kim, Seung-Yeon;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.3
    • /
    • pp.559-567
    • /
    • 2015
  • This paper focuses on evaluating the performance of a cellular network using power control based frequency reuse partitioning (FRP) in downlink (DL). In our work, in order to have the realistic environment, the spectral efficiency of the system is evaluated through traffic analysis, which most of the previous works did not consider. To further decrease the cell edge user's outage, the concept of power ratio is introduced and applied to the DL FRP based cellular network. In considering network topology, we first divide the cell coverage area into two regions, the inner and outer regions. We then allocate different sub-bands in the inner and outer regions of each cell. In the analysis, for each zone ratio, the performance of FRP system is evaluated for the given number of power ratios. We consider performance metrics such as call blocking probability, channel utilization, outage probability and effective throughput. The simulation results show that there is a significant improvement in the outage experienced by outer UEs with power control scheme compared to that with no power control scheme and an increase in overall system throughput.

A Group Search-based Distributed Dynamic Channel Allocation Algorithm in Uplink Cellular System (상향링크 셀룰러 시스템에서 그룹 탐색 기반의 분산동적채널할당 방법)

  • Yoo, Doh-Kyoung;Kim, Dong-Hoi
    • Journal of Broadcast Engineering
    • /
    • v.15 no.3
    • /
    • pp.407-413
    • /
    • 2010
  • In DCA (Dynamic Channel Allocation) scheme of uplink cellular system appling a frequency reuse factor of one, when a new call requests a channel, the new call will be blocked if its SINR (Carrier to Noise and Interference Ratio) is less than the required SINR or there is no available channel. The additional channel allocation for the blocked new call can be performed with channel borrowing in the adjacent cells. The channel borrowing causes the CCI (Co-Channel Interference), thus the SINR of the existing calls is deteriorated and the channel reallocation for the existing calls is required. As a result, the channel borrowing leads to a complex calculation so that it is a NP-hard problem. Therefore, to overcome the problem, we propose a novel Group Search-based DCA scheme which decreases the number of the blocked new calls and then reduces the number of the channel reallocation by the channel borrowing for the blocked new calls. The proposed scheme searches the all channels in a group of the adjacent cells and home cell at the same time in order to minimizes the number of the blocked new calls. The simulation results show that proposed Group Search-based DCA scheme provides better new call blocking probability and system throughput than the existing Single Search-based DCA scheme which searches only the channels in home cell.