• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.701-708
• /
• 2005

The mobility prediction algorithm and the channel reservation scheme have been reported as an effective means to provide QoS guarantees and the efficient resource reservation in wireless networks. Among these prediction algorithms, the recently proposed Detailed-ZMHB algorithm makes use of the history of the user's positions within the current cell to predict the next cell, which provides the better prediction accuracy than the others. The handoff prioritizing schemes are proposed to provide improved performance at the expense of an increase in the blocking probability of new calls. In the soft handoff of the CDMA systems, a mobile can communicate via two adjacent cells simultaneously for a while before the actual handoff takes place. In this paper, we propose a new channel reservation scheme making use of the user mobility pattern information in order to reduce the call dropping probability. Our results show that the proposed scheme gives about 67.5-71.1$\%$ lower call dropping probability, compared to the existing scheme.

• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.127-137
• /
• 1993

The blocking probabilities of nx64Kb/s multi-slot calls are generally much higher than that of single slot calls. In order to improve these blocking probabilities of multi-slot calls, we propose a scheme which searches the different numbers of time slots for different types of calls. We analyze the performance of our scheme in a double-buffered time-space-time switching network which accommodates multi-slot calls as well as single-slot calls. The proposed method yields the reduced blocking probabilities, the increased traffic handling capacity and teh reduced CPU processing load, compared with those of the conventional methods.

• KSCI Review
• /
• v.1 no.2
• /
• pp.95-107
• /
• 1995

The concurrency control can be critical to the performance of transaction processing systems. Conventional locking takes the blocking phenomenon, where waiting transactions continue to hold locks and block other transactions from progressing. The proposed scheme reduces the blocking probability by deferring the blocking behavior of transactions to the later stages of their execution. The transaction execution can be divided into a nonblocking phase where transactions wait for locks but do not block other transactions and a blocking phase as in conventional locking. However data accessed during the nonblocking phase can lead to transaction abort. By properly balancing the blocking and abort effects, the proposed scheme can lead to better performance than either the conventional locking or the optimistic concurrency control(OCC) scheme at all data and resource contention levels.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.37-40
• /
• 2000

As the number of CDMA subscribers increases, CDMA systems utilize more than one CDMA carrier In order to accommodate Increasing capacity requirement. In this paper, we present a new analytical method for evaluating the Erlang capacity of CDMA systems with multiple CDMA carriers. in the case of the algorithm proposed in 〔5〕, the calculation complexity for evaluating the call blocking probability Is increased proportionally to the sixth power of the number of used CDMA carriers when the CDMA system supports voice and data services. Consequently, It is Impractical to calculate Erlang capacity with the algorithm of 〔5〕especially when the number of used CDMA carriers is larger than 3. To resolve this problem, we propose a new analytical method for evaluating the Erlang capacity. The calculation complexity of the proposed method for evaluating call blocking probability is increased just proportionally to the second power of the number of used CDMA carriers when the CDMA systems support voice and data services.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.119-122
• /
• 2006

VoD(Video on Demand) 시스템은 일반적으로 VoD 서버 및 파일 저장장소 등의 제한된 자원 하에서 운용된다. 따라서 VoD 시스템의 QoS(Quality of Service)는 VoD 서버 및 파일 저장장소가 제한된 운용 자원 하에서 클라이언트들에게 안정된 스트림 서비스를 제공함으로써 보장할 수 있다. 즉, VoD 시스템의 QoS를 보장하기 위해서는 클라이언트들의 스트림 서비스 요청이 제한된 운용자원 때문에 VoD 서버로부터 수신이 거부되거나 또는 파일 저장장소로부터 필요한 데이터 서비스를 받는 도중에 연결이 끊어져 손실되는 장애확률(blocking probability)을 최소화해야 한다. 본 연구에서는 VoD 시스템의 QoS 보장에 활용하기 위하여 VoD 시스템의 장애확률을 추정하는 모델을 개발한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1250-1256
• /
• 2001

A resource management scheme for ad hoc wireless local area networks (AWLAN's) is presented. This scheme combines distributed resource management scheme and orthogonal frequency division multiplexing-code division multiple access(OFDM-CDMA) technique to support multimedia services with QoS guarantees. The performance evaluation has done in terms of blocking rates and QoS loss probability.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.1-7
• /
• 1996

In this paper, we analyzed the packet blocking probability of a finite buffer in a network interface unit. In general, a network interface unit which provides a means of interface between the network and computer has a microprocessor and a protocol processor for the network access protocols. It also has a receive buffer for the arriving packets from the network which is served by the microprocessor with service interruption by the protocol processor. In this paper, we modeled the receive buffer as a discrete time server with service interruption, and obtained the packet blocking probability using the mini-slot approximation.

• IE interfaces
• /
• v.11 no.1
• /
• pp.155-163
• /
• 1998

In multiparty multimedia communication, each participant not only receives information from other participants but also generates real-time data streams to distribute to others and therefore the difference between source and destination is not clear in terms of data transmission. During a teleconference session, many sub-multicast trees may be generated to exchange information to specific members within the multicast group and if those sub-multicast trees use the same fixed multicast tree, the blocking probability will be high and it is hard to provide QoS for each sub-multicast group. Also, even though there exits some shortcuts between each sub-multicast group, fixed multicast tree does not allow to use those shortcuts. Thus to overcome these problems. We propose a network resource reservation protocol and show that its effectiveness in terms of blocking probability and network resources usage.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.469-470
• /
• 2007

We used the non-reversible hierarchical scheme and the fixed channel assignment scheme for the strategy of call processing at hierarchical cellular system. We analyzed the performance of system according to the number of channel assigned at macrocell out of the usable channel at global system. Microcell is assigned the channel excepted the channel assigned at macrocell. The more the channel was aigned at macrocell, the more decreased the blocking probability became. The blocking probability of microcell had similar trend.

• Journal of Communications and Networks
• /
• v.15 no.6
• /
• pp.614-634
• /
• 2013

The proliferation of real-time multimedia services requires huge amounts of data transactions demanding strict quality-of-service (QoS) guarantees. Multicast transmission is a promising technique because of its efficient network resource utilization. However, high head-of-line (HOL) blocking probability and lack of service-specific QoS control should be addressed for practical implementations of multicast networks. In this paper, a topology aware fanout set division (TAFD) scheme is proposed to resolve these problems. The proposed scheme is composed of two techniques that reduce HOL blocking probability and expedite packet delivery for large-delay branches regarding multicast tree topology. Since management of global topology information is not necessary, scalability of the proposed scheme is guaranteed. Mathematical analysis investigates effects of the proposed scheme and derives optimal operational parameters. The evaluation results show that the TAFD scheme achieves significant delay reduction and satisfies required delay bounds on various multicast networks.