• Title/Summary/Keyword: blocking probabilities

Search Result 56, Processing Time 0.024 seconds

A New Approach to Performance Evaluation of Cellular Systems Considering Mixed Platforms Environment (이질적인 이동성 모델링을 통한 셀룰러 이동통신 시스템의 새로운 성능평가)

  • Yeo, Kun-Min;Ryu, Ji-Hyun;Jun, Chi-Hyuck
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.3
    • /
    • pp.351-359
    • /
    • 1999
  • We present a new approach to the analysis of mobile cellular communication systems under the environment of mixed platforms adopting a guard channel scheme. We assume general cell residence time distributions according to platform-types. Our system model is based on a heterogeneous M/G/c loss system with customer-dependent guard channels, where heterogeneous customers with different service time distributions have different numbers of their own guard channels. We develop the general formula of steady state probabilities for the heterogeneous M/G/c loss system with customer-dependent guard channels. The mean channel occupancy times of new and handoff calls are rigorously derived under a general setting. Finally, our numerical results show that the blocking probability and the forced termination probability are sensitive to the cell residence time distributions.

  • PDF

Recirculating Shuffle-Exchange Interconnection ATM Switching Network Based on a Priority Control Algorithm (우선순위 제어기법을 기반으로 한 재순환 Shuffle-Exchage 상호연결 ATM 스위치)

  • Park, Byeong-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.6
    • /
    • pp.1949-1955
    • /
    • 2000
  • This paper proposes a multistage interconnection ATM switching network without internal blocking. The first is recirculating shuffle-exchange network improved on hardware complexity. The next is connected to Rank network with tree structure. In this network, after the packets transferred to the same output ports are given each priority, only a packet with highest priority is sent to the next, an the others are recirculated to the first. Rearrangeability through decomposition and composition algorithm is applied for the transferred packets in hanyan network and all they arrive at a final destinations. To analyze throughput, waiting time and packet loss ratio according tothe size of buffer, the probabilities are modeled by a binomial distribution of packet arrival.

  • PDF

SMDP-Based Optimization Model for Call Admission Control in an OFDMA Wireless Communication Systems (OFDMA 무선통신시스템의 호접속 제어를 위한 SMDP 기반 최적화모형)

  • Paik, Chunhyun;Chung, Yongjoo
    • IE interfaces
    • /
    • v.25 no.4
    • /
    • pp.450-457
    • /
    • 2012
  • This study addresses the call admission control(CAC) problem for OFDMA wireless communication systems in which both subcarriers and power should be considered together as the system resources. To lessen the exccessive allocation of radio resources for protecting handoff calls, the proposed CAC allows the less data rate than their requirements to handoff calls. The CAC problem is formulated as a semi-Markov decision process(SMDP) with constraints on the blocking probabilities of handoff calls. Some extensive experiments are conducted to show the usefulness of the proposed CAC model.

A Queueing Model for Performance Analysis of SPAX Inter-Node Communication System (고속병렬컴퓨터1)(SPAX) 노드간 통신시스템의 성능분석을 위한 대기행렬모형)

  • Cho, Il-Yeon;Lee, Jae-Kyung;Kim, Hae-Jin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.1
    • /
    • pp.33-39
    • /
    • 1998
  • A queueing model for performance evaluation of finite buffered inter-node communication system is proposed in this paper. Each components are modeled as M/M/I/B queues to obtain the steady state probabilities and ar-rival rate and to analyze finite buffer behavior, The overall sysrem is integrated as series queues with blocking. Average delay and throughput are the performance measures studied in this analysis. The analytical results are first validated through simulation. Next, the effect of buffer length is discussed using the proposed model.

  • PDF

A Study on the Traffic Characterizations of a Integrated Type Concentrator Accommodating ISDN Basic Access Traffic (ISDN 기본 액서스 트래픽을 수용하는 통합형 집선장치의 트래픽 특성 고찰에 관한 연구)

  • 양해권;성단근;김동용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.5
    • /
    • pp.426-433
    • /
    • 1990
  • In this study, we propose a integrated type concentrator and compare with the separated type concentrating method, to accommodate 2B+D ISDN basic access traffic. This system's blocking probabilities are analyzed in terms of each class of bit rate, number of output channels, number of subscriber lines, and offered traffic. The result shows that the proposed method can significantly increase the maximum number of subscriber lines connecting to the system via a T1 carrier, compared with that of the "CCITT proposed" multiplexing scheme or the separated type concentrating method.ng method.

  • PDF

A Study on the Traffic Characterizations of a Seperated Type Concentrator Accommodating ISDN Basic Access Traffic (ISDN 기본 액세스 트래픽을 수용하는 분리형 집선장치의 트래픽 특성 고찰에 관한 연구)

  • 양해권;성단근;김동용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.5
    • /
    • pp.413-425
    • /
    • 1990
  • In this study, we propose a separated type concentrator to accommodate 2B+D ISDN basic access traffic. This system's blocking probabilities are analyzed in terms of each class of bit rate, number of output channels, number of subscriber lines, and offered traffic. The result shows that the proposed method can significantly increase the maximum number of subscriber lines connecting to the system via a T1 crrier, compared with that of the "CCITT proposed" multiplexing scheme.ng scheme.

  • PDF

A Distributed Dynamic Channel Assignment Algorithm in Highway Microcells

  • Lee, Chae-Young;Park, Hyun-Jeong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.21 no.2
    • /
    • pp.187-201
    • /
    • 1996
  • A distributed dynamic channel assignment is proposed and its performance is examined in a highway microcellular radio environment. In the two step ordered local packing (TOLP) scheme, channels are assigned on an ordered basis under cochannel utilization in congested microcell region. A selection criterion is employed to decide the cell from which a free channel is borrowed. Simulation results show that the proposed scheme outperforms existing methods is channel utilization and call blocking probabilities, especially under asymmetric call arrivals with a lower call switching requirement.

  • PDF

An Improved Channel Management Technique in the Hierarchical Cellular Radio Systems (중첩구조 셀룰라 시스템에서의 채널관리 개선 방안)

  • 김덕년;이청희
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.18-26
    • /
    • 2000
  • Yeung suggested[10] efficient channel management technique suitable for the mobility model in the hierachical cellular system. It improved the existing channel allocation techniques by additionally considering the user’s mobility, allocating the channel of microcell to low-speed mobiles, and the channels of macrocell to high-speed mobiles. In this paper, we have suggested new channel management technique, which is directly compared with those of Yeung’s system and existing model. Blocking probabilities for each model are found through the queuing analysis and we have shown that our proposed system outperforms the both.

  • PDF

Performance Analysis of random access channels in multi-service multi-user OFDMA systems (다중 서비스 다중 사용자 OFDMA 시스템에서의 임의접근 채널 성능 분석)

  • Koo, In-Soo;Pham, Thi Hong Chau
    • Journal of Internet Computing and Services
    • /
    • v.9 no.5
    • /
    • pp.141-151
    • /
    • 2008
  • In the paper, we analyze the performance of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems are available sub-channels and PN-codes. For given available sub-channels and PN-codes,' we analyze the performance of the random access channels of OFDMA systems in terms of the access success probability, the blocking probability, the access delay and the throughput per each service class. Further, we find the feasible region of the access probability of each service class in which the allowable minimum access success probability, the allowable maximum blocking probability and the allowable maximum access delay are satisfied. The results also can be used to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations in multi-service multi-user OFDMA systems.

  • PDF

Implement of Call blocking Probabilities in Mobile Communication Networks (이동통신 네트워크에서 호 블록킹 확률의 개선 방안)

  • Park, Sang-Hyun;Oh, Youn-Chil;Lee, Young-Seok;Yang, Hae-Kwon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.1
    • /
    • pp.67-74
    • /
    • 2009
  • This paper presents a method of improving the service availability by distributing the traffic of voice/data calls over the multi-layer cells in a mobile communication network. The traffic model is described and the call handling performance is analyzed. In our method, a fast moving call is moved to and serviced in the upper layer cell. A call is also moved upward when an overflow occurs. But unlike other methods, the call that is moved upward in the overflow case is the one which has the longest sojourn time in the cell. Moreover, when the call that was moved upward due to overflow condition stays longer than a certain period of time in the upper layer cell, the system moves the call back to the lower layer in order to save the more expensive resources of the upper layer cell. Call handling performance of this method evaluated from M/M/C/K models shows clear improvement with respect to call blocking probability and forced termination probability.