• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.123-132
• /
• 2005

By complementary integration of WLAN and UMTS, a Beyond third Generation(B3G) mobile network can be constructed to establish the fastest global roaming environments, There are 2 types of B3G networks: loosely-coupled and tightly-coupled, A tightly-coupled network demands lots of investment and considerable amount of time to construct. On the other hand a loosely-coupled network is more scalable and easier to implement than a tightly-coupled one, But it has critical drawbacks of packet loss and blocking of services due to handover delay, To alleviate these drawbacks this thesis proposes a vertical handover procedure between WLAN and UMTS, which is based on MAP of HMIPv6, Performance of the proposal is evaluated in terms of blocking probabilities, The proposed procedure based on HMIPv6 shows better performance than those based on MIP.

• 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.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.147-155
• /
• 2005

In this paper, communication channels for the transmission of multimedia packets are modeled and evaluated. The multimedia packet traffic characterized by on-off and MMPP process for voice and data, respectively, dynamic channel allocation, queueing of data packets due to unavailability of channels and dropping of queued data packets over timeout, and guard channel for voice packets are modeled. The performance indices adopted in the evaluation of SRN model includes blocking and dropping probabilities. The SRN uses rewards concepts instead of the complicate numerical analysis required for the Markov chain. It is shown that our SRN modeling techniques provide an easier way to carry out performance analysis.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.171-176
• /
• 2006

Bandwidth is an extremely valuable and scarce resource in a wireless network. Therefore, efficient bandwidth management is necessary in order to provide high qualify service to users with different requirements in a multimedia wireless/mobile network. In this paper, we propose an on-line bandwidth reservation algorithm that adjusts bandwidth reservations adaptively based on existing network conditions. The most important contribution of our work is an adaptive algorithm that is able to resolve conflicting performance criteria - bandwidth utilization, call dropping and call blocking probabilities. Our algorithm is quite flexible, is responsive to current traffic conditions in cellular networks, and tries to strike the appropriate performance balance between contradictory requirements for QoS sensitive multimedia services.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.247-251
• /
• 2003

In this paper, we propose an approximation of the M/G/1 system with finite workload capacity, where customers whose admission to the system would increase the workload beyond a prespecified finite capacity limit are not accepted. Our approximation method is based on the idea that the service time of a customer in the M/G/1 system can be approximated as the sum of service times of a batch of customers in the $M^{X}/d/1$ system where the service time is deterministic and very small. That is, the original service time is discretized and approximated by the batch size. We exemplified our method by obtaining the average workload of the M/M/1 system by means of the $M^{X}/d/1$ system, where the batch size is geometric. In addition, the approximate blocking probabilities of the M/M/1 and $M/E_{k}/1$ system with finite workload capacities are sought. The proposed method turns out to give a good approximation, which is compared with a simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8B
• /
• pp.752-759
• /
• 2002

The capacity of the cell varies with the load of the home and neighboring cells. But most call admission control (CAC) algorithms do not consider the cell loading. In this paper a dynamic call admission control is proposed in a WCDMA system with traffic asymmetry. The proposed algorithm changes the CAC thresholds of new call and handoff call based on channel condition. The blocking and dropping probabilities can be controlled by adjusting these thresholds. The proposed algorithm guarantees the Qos of call class and priority between new call and handoff call. In addition, it can minimize the grade of service (GOS) value with the system throughput maintained.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.130-139
• /
• 2014

Due to the unpredictable nature of channel availability, carrying delay-sensitive traffic in cognitive radio networks (CRNs) is very challenging. Spectrum leasing of radio resources has been proposed in the so called coordinated CRNs to improve the quality of service (QoS) experienced by secondary users (SUs). In this paper, the performance of coordinated CRNs under fixed-rate with hard-delay-constraints traffic is analyzed. For the adequate and fair performance comparison, call admission control strategies with fractional channel reservation to prioritize ongoing secondary calls over new ones are considered. Maximum Erlang capacity is obtained by optimizing the number of reserved channels. Numerical results reveal that system performance strongly depends on the value of the mean secondary service time relative to the mean primary service time. Additionally, numerical results show that, in CRNs without spectrum leasing, there exists a critical utilization factor of the primary resources from which it is not longer possible to guarantee the required QoS of SUs and, therefore, services with hard delay constraints cannot be even supported in CRNs. Thus, spectrum leasing can be essential for CRN operators to provide the QoS demanded by fixed-rate applications with hard delay constraints. Finally, the cost per capacity Erlang as function of both the utilization factor of the primary resources and the maximum allowed number of simultaneously rented channels is evaluated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.

• The Journal of the Korea Contents Association
• /
• v.6 no.6
• /
• pp.9-15
• /
• 2006

To obtain realistic composite performance and availability measures, one should consider performance changes that are associated with failure recovery behavior. In this paper we address two modeling approaches, exact composite and approximate, and develop SRN models for these approaches. The former approach is to combine the performance and availability models and yields accurate results but generally faces largeness problem. To avoid the problem, the two level hierarchical model is developed. The upper level model describes the failure and repair behavior of the system and the lower level captures the pure performance aspect of the system, channel allocation and service. It models guard channel and preemptive handoff scheme. As numerical results, blocking and dropping probabilities are given for new call and handoff call, respectively.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.3
• /
• pp.22-32
• /
• 2021

To meet rapidly changing market demands, manufacturers strive to increase both of productivity and diversity at the same time. As a part of those effort, they are applying flexible manufacturing systems that produce multiple types and/or options of products at a single production line. This paper studies such flexible manufacturing system with multiple types of products, multiple Bernoulli reliability machines and dedicated buffers between them for each of product types. As one of the prevalent control policies, priority based policy is applied at each machines to select the product to be processed. To analyze such system and its performance measures exactly, Markov chain models are applied. Because it is too complex to define all relative transient and its probabilities for each state, an algorithm to update transient state probability are introduced. Based on the steady state probability, some performance measures such as production rate, WIP-based measures, blocking probability and starvation probability are derived. Some system properties are also addressed. There is a property of non-conservation of flow, which means the product ratio at the input flow is not conserved at the succeeding flows. In addition, it is also found that increased buffer capacity does not guarantee improved production rate in this system.