• Communications of the Korean Mathematical Society
• /
• v.14 no.4
• /
• pp.805-814
• /
• 1999

We consider an MMPP/G/1/K finite queue with two-level threshold overload control. This model has frequently arisen in the design of the integrated communication systems which support a wide range applications having various Quality of Service(QoS) requirements. Through the supplementary variable method, se derive the queue length distribution.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.4 no.1
• /
• pp.41-51
• /
• 1979

The Classical multi-server heterogeneous queuing system can be more generalized by using the concept of the switching rules. The descriptions of these systems, the relations among the state probebilities at the various points of interest, and comparisons with the single-server system will be presented. Instead of using the imbedded markov chain we set up the simultaneous equations for the state probabilites by the supplementary variable method.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.109-118
• /
• 2010

Proxy mobile IPv6 (PMIPv6) protocol is a network-based mobility management protocol to support mobility for IPv6 nodes without host involvement. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. This increases network overhead on the LMA, wastes network resources, and lengthens the delay time. Therefore, we propose a new mobility management scheme for minimizing signaling cost using the pointer forwarding. Our proposal can reduce signaling costs by registration with the neighbor MAG instead of the remote LMA using the pointer forwarding. The cost analysis using imbedded Markov chain presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.1
• /
• pp.1-8
• /
• 1994

In this paper, we have analyzed the performance of a BRAM (The Broadcasting Recognizing Access Method) protocol, as a CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) scheme, which is widely used in wireles LAN systems. We have selected a Fair BRAM protocol among CSMA/CA schemes, considering the fairness of channel usage and the simplicity of the protocol. We have compared the performance of BRAM protocol to that of CSMA/CD. to research the characteristics of BRAM in wireless LAN system. In order to analyze the performance of this system, we have set up an imbedded Markov chain and calculated state transition probabilities. Then we have calculated steady state probabilities and finally derived the throughput of a Fair BRAM moder. To verify our analysis, we have simulated practical models. Then, we have found that analytic results are very close to simulation ones. Our analysis of the BRAM protocol will be expected to be very helpful to design and evaluate a MAC (Media Access Control) protocol in wireless LAN systems.