The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Chang-Hoon LIE(3hit)

1-3hit
  • A Dynamic Anchor-Area Scheme Using a Timer Value and a Movement List for PCS Networks

    In-Kap CHANG  Jung-Sik HONG  Ji-Pyo KIM  Chang-Hoon LIE  

     
    LETTER-Terrestrial Radio Communications

      Vol:
    E91-B No:9
      Page(s):
    3030-3032

    A dynamic anchor-area (DAA) scheme is proposed to reduce the location management cost for PCS networks. Based on an Intra-LA location update (LU) scheme, the proposed DAA scheme utilizes a given timer value and a movement list. The DAA scheme considers a wider variety of mobile terminal's movement pattern than the previous intra-LA LU scheme. Simulations confirm that the proposed scheme offers a significant reduction in the location management cost.

  • Quality of Service Management Scheme for Adaptive Service in Wireless/Mobile Multimedia Cellular Networks

    Sung-Hwan JUNG  Jung-Wan HONG  Chang-Hoon LIE  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E88-B No:11
      Page(s):
    4317-4327

    An adaptive service framework is expected to support real-time multimedia services in wirless/mobile cellular networks with various classes of traffic and diverse bandwidth requirements. Quality of service (QoS) provisioning in an adaptive framework is another challenging consideration, such as quantifying the level of bandwidth degradation of an ongoing calls and guaranteeing stable QoS levels. Considering both the period and the depth of degradation, the degradation area ratio (DAR) represents the average ratio of a call's degradation and is one of the meaningful measures for adaptive service in call level analysis. In this paper, analytical models for estimating the DAR and finding the optimal control parameters are presented in multi-class traffic call management situations. In complete partitioning capacity based threshold-type call admission control (CAC), a one-dimensional Markov chain with an absorbing state is proposed for estimating the DAR in each traffic class. We formulate a two-leveled optimization problem minimizing the total blocking probabilities subject to QoS requirements and present the procedures required in finding the optimal capacities and threshold values by using modified dynamic programming. In complete sharing capacity based threshold-type CAC, the multidimensional Markov model is approximately reduced to a one-dimensional model in order to reduce complexity and hence calculation time. The reduced model is compared with multidimensional Markov model in numerical examples. The optimization problem is formulated minimizing the total blocking probabilities subject to QoS requirements and the optimal threshold parameters are found by using a genetic algorithm. Performance of two adopted admission policies in adaptive framework situations is illustrated by numerical results.

  • Bandwidth Allocation of Heterogeneous Regulated Traffics in an ATM Node under the Constraint of Maximum Delay

    Young-Ha YOON  Jung-Sik HONG  Chang-Hoon LIE  

     
    PAPER-Network

      Vol:
    E84-B No:1
      Page(s):
    46-54

    A new approach for bandwidth allocation of heterogeneous regulated traffics is proposed for cases of lossless multiplexing and statistical multiplexing under the constraint of maximum delay. Minimum bandwidth required for lossless multiplexing can be expressed as 1-dimensional unconstrained-optimization problem. The corresponding optimality condition gives an optimal bandwidth and buffer requirements. This optimality condition is extended to the case of statistical multiplexing. In case of statistical multiplexing with independent, periodic on-off fluid sources, two random variables representing stochastic worst cases for the amount of traffics generated in an arbitrary time interval are introduced and these are combined optimally. This combined model guarantees the worst case bound for the regulated traffics. Using the proposed approach, bandwidth and buffer requirements of each virtual circuit are obtained simultaneously. As these values are sensitive to multiplexing environments, an effective bandwidth considering trade-off between bandwidth and buffer requirements is introduced. The proposed effective bandwidth can be matched directly with the boundary of the acceptance region, which is less sensitive to mutiplexing environments.